Left-ventricle myocardium segmentation using a coupled level-set with a priori knowledge

This paper presents a coupled level-set segmentation of the myocardium of the left ventricle of the heart using a priori information. From a fast marching initialisation, two fronts representing the endocardium and epicardium boundaries of the left ventricle are evolved as the zero level-set of a higher dimension function. We introduce a novel and robust stopping term using both gradient and region-based information. The segmentation is supervised both with a coupling function and using a probabilistic model built from training instances. The robustness of the segmentation scheme is evaluated by performing a segmentation on four unseen data-sets containing high variation and the performance of the segmentation is quantitatively assessed

A Variational Framework for the Simultaneous Segmentation and Object Behavior Classification of Image Sequences

In this paper, we advance the state of the art in variational image segmentation through the fusion of bottom-up segmentation and top-down classification of object behavior over an image sequence. Such an approach is beneficial for both tasks and is carried out through a joint optimization, which enables the two tasks to cooperate, such that knowledge relevant to each can aid in the resolution of the other, thereby enhancing the final result. In particular, classification offers dynamic probabilistic priors to guide segmentation, while segmentation supplies its results to classification, ensuring that they are consistent with prior knowledge. The prior models are learned from training data and updated dynamically, based on segmentations of earlier images in the sequence. We demonstrate the potential of our approach in a hand gesture recognition application, where the combined use of segmentation and classification improves robustness in the presence of occlusion and background complexity

State of the Art of Level Set Methods in Segmentation and Registration of Medical Imaging Modalities

Segmentation of medical images is an important step in various applications such as visualization, quantitative analysis and image-guided surgery. Numerous segmentation methods have been developed in the past two decades for extraction of organ contours on medical images. Low-level segmentation methods, such as pixel-based clustering, region growing, and filter-based edge detection, require additional pre-processing and post-processing as well as considerable amounts of expert intervention or information of the objects of interest. Furthermore the subsequent analysis of segmented objects is hampered by the primitive, pixel or voxel level representations from those region-based segmentation. Deformable models, on the other hand, provide an explicit representation of the boundary and the shape of the object. They combine several desirable features such as inherent connectivity and smoothness, which counteract noise and boundary irregularities, as well as the ability to incorporate knowledge about the object of interest. However, parametric deformable models have two main limitations. First, in situations where the initial model and desired object boundary differ greatly in size and shape, the model must be re-parameterized dynamically to faithfully recover the object boundary. The second limitation is that it has difficulty dealing with topological adaptation such as splitting or merging model parts, a useful property for recovering either multiple objects or objects with unknown topology. This difficulty is caused by the fact that a new parameterization must be constructed whenever topology change occurs, which requires sophisticated schemes. Level set deformable models, also referred to as geometric deformable models, provide an elegant solution to address the primary limitations of parametric deformable models. These methods have drawn a great deal of attention since their introduction in 1988. Advantages of the contour implicit formulation of the deformable model over parametric formulation include: (1) no parameterization of the contour, (2) topological flexibility, (3) good numerical stability, (4) straightforward extension of the 2D formulation to n-D. Recent reviews on the subject include papers from Suri. In this chapter we give a general overview of the level set segmentation methods with emphasize on new frameworks recently introduced in the context of medical imaging problems. We then introduce novel approaches that aim at combining segmentation and registration in a level set formulation. Finally we review a selective set of clinical works with detailed validation of the level set methods for several clinical applications

Statistical Model of Shape Moments with Active Contour Evolution for Shape Detection and Segmentation

This paper describes a novel method for shape representation and robust image segmentation. The proposed method combines two well known methodologies, namely, statistical shape models and active contours implemented in level set framework. The shape detection is achieved by maximizing a posterior function that consists of a prior shape probability model and image likelihood function conditioned on shapes. The statistical shape model is built as a result of a learning process based on nonparametric probability estimation in a PCA reduced feature space formed by the Legendre moments of training silhouette images. A greedy strategy is applied to optimize the proposed cost function by iteratively evolving an implicit active contour in the image space and subsequent constrained optimization of the evolved shape in the reduced shape feature space. Experimental results presented in the paper demonstrate that the proposed method, contrary to many other active contour segmentation methods, is highly resilient to severe random and structural noise that could be present in the data

Geodesic tractography segmentation for directional medical image analysis

Acknowledgements page removed per author's request, 01/06/2014.Geodesic Tractography Segmentation is the two component approach presented in this thesis for the analysis of imagery in oriented domains, with emphasis on the application to diffusion-weighted magnetic resonance imagery (DW-MRI). The computeraided analysis of DW-MRI data presents a new set of problems and opportunities for the application of mathematical and computer vision techniques. The goal is to develop a set of tools that enable clinicians to better understand DW-MRI data and ultimately shed new light on biological processes. This thesis presents a few techniques and tools which may be used to automatically find and segment major neural fiber bundles from DW-MRI data. For each technique, we provide a brief overview of the advantages and limitations of our approach relative to other available approaches.Ph.D.Committee Chair: Tannenbaum, Allen; Committee Member: Barnes, Christopher F.; Committee Member: Niethammer, Marc; Committee Member: Shamma, Jeff; Committee Member: Vela, Patrici