Biomedical subjects

Joachim Weickert

Publications and source records attributed to Joachim Weickert.

5 recordsLinked to original sources

PubMed2007

Fully automated segmentation and morphometrical analysis of muscle fiber images.

BACKGROUND: Measurement of muscle fiber size and determination of size distribution is important in the assessment of neuromuscular disease. Fiber size estimation by simple inspection is inaccurate and subjective. Manual segmentation and measurement are time-consuming and tedious. We therefore propose an automated image analysis method for objective, reproducible, and time-saving measurement of muscle fibers in routinely hematoxylin-eosin stained cryostat sections. METHODS: The proposed segmentation technique makes use of recent advances in level set based segmentation, where classical edge based active contours are extended by region based cues, such as color and texture. Segmentation and measurement are performed fully automatically. Multiple morphometric parameters, i.e., cross sectional area, lesser diameter, and perimeter are assessed in a single pass. The performance of the computed method was compared to results obtained by manual measurement by experts. RESULTS: The correct classification rate of the computed method was high (98%). Segmentation and measurement results obtained manually or automatically did not reveal any significant differences. CONCLUSIONS: The presented region based active contour approach has been proven to accurately segment and measure muscle fibers. Complete automation minimizes user interaction, thus, batch processing, as well as objective and reproducible muscle fiber morphometry are provided.

Algorithms↗

PubMed2006

Level set segmentation with multiple regions.

The popularity of level sets for segmentation is mainly based on the sound and convenient treatment of regions and their boundaries. Unfortunately, this convenience is so far not known from level set methods when applied to images with more than two regions. This communication introduces a comparatively simple way how to extend active contours to multiple regions keeping the familiar quality of the two-phase case. We further suggest a strategy to determine the optimum number of regions as well as initializations for the contours.

Algorithms↗

PubMed2005

Variational optical flow computation in real time.

This paper investigates the usefulness of bidirectional multigrid methods for variational optical flow computations. Although these numerical schemes are among the fastest methods for solving equation systems, they are rarely applied in the field of computer vision. We demonstrate how to employ those numerical methods for the treatment of variational optical flow formulations and show that the efficiency of this approach even allows for real-time performance on standard PCs. As a representative for variational optic flow methods, we consider the recently introduced combined local-global method. It can be considered as a noise-robust generalization of the Horn and Schunck technique. We present a decoupled, as well as a coupled, version of the classical Gauss-Seidel solver, and we develop several multgrid implementations based on a discretization coarse grid approximation. In contrast, with standard bidirectional multigrid algorithms, we take advantage of intergrid transfer operators that allow for nondyadic grid hierarchies. As a consequence, no restrictions concerning the image size or the number of traversed levels have to be imposed. In the experimental section, we juxtapose the developed multigrid schemes and demonstrate their superior performance when compared to unidirectional multgrid methods and nonhierachical solvers. For the well-known 316 x 252 Yosemite sequence, we succeeded in computing the complete set of dense flow fields in three quarters of a second on a 3.06-GHz Pentium4 PC. This corresponds to a frame rate of 18 flow fields per second which outperforms the widely-used Gauss-Seidel method by almost three orders of magnitude.

Algorithms↗

PubMed2005

Domain decomposition for variational optical-flow computation.

We present an approach to parallel variational optical-flow computation by using an arbitrary partition of the image plane and iteratively solving related local variational problems associated with each subdomain. The approach is particularly suited for implementations on PC clusters because interprocess communication is minimized by restricting the exchange of data to a lower dimensional interface. Our mathematical formulation supports various generalizations to linear/nonlinear convex variational approaches, three-dimensional image sequences, spatiotemporal regularization, and unstructured geometries and triangulations. Results concerning the effects of interface preconditioning, as well as runtime and communication volume measurements on a PC cluster, are presented. Our approach provides a major step toward real-time two-dimensional image processing using off-the-shelf PC hardware and facilitates the efficient application of variational approaches to large-scale image processing problems.

Algorithms↗

PubMed2002

Diffusion-enhanced visualization and quantification of vascular anomalies in three-dimensional rotational angiography: results of an in-vitro evaluation.

Three-dimensional rotational angiography (3DRA) is a new and promising technique for obtaining high-resolution isotropic 3D images of vascular structures. However, due to the relatively high noise level and the presence of other background structures in clinical 3DRA images, noise reduction is inevitable. In this paper, we evaluate a number of linear and nonlinear diffusion techniques for this purpose. Specifically, we analyze the effects of these techniques on the threshold-based visualization and quantification of vascular anomalies in 3DRA images. The results of in-vitro experiments indicate that edge-enhancing anisotropic diffusion filtering is most suitable: the increase in the user-dependency of visualizations and quantifications is considerably less with this technique compared to linear filtering techniques, and it is better at reducing noise near edges than isotropic nonlinear diffusion. However, in view of the memory and computation-time requirements of this technique, the latter scheme may be considered a useful alternative.

Algorithms↗