Article

A Review of Statistical Approaches to Level Set Segmentation: Integrating Color, Texture, Motion and Shape.

International Journal of Computer Vision (Impact Factor: 3.62). 01/2007; 72:195-215. DOI: 10.1007/s11263-006-8711-1
Source: DBLP

ABSTRACT Since their introduction as a means of front propagation and their first application to edge-based segmentation in the early 90's, level set methods have become increasingly popular as a general framework for image segmentation. In this paper, we present a survey of a specific class of region-based level set segmentation methods and clarify how they can all be derived from a common statistical framework. Region-based segmentation schemes aim at partitioning the image domain by progressively fitting statistical models to the intensity, color, texture or motion in each of a set of regions. In contrast to edge-based schemes such as the classical Snakes, region-based methods tend to be less sensitive to noise. For typical images, the respective cost functionals tend to have less local minima which makes them particularly well-suited for local optimization methods such as the level set method. We detail a general statistical formulation for level set segmentation. Subsequently, we clarify how the integration of various low level criteria leads to a set of cost functionals. We point out relations between the different segmentation schemes. In experimental results, we demonstrate how the level set function is driven to partition the image plane into domains of coherent color, texture, dynamic texture or motion. Moreover, the Bayesian formulation allows to introduce prior shape knowledge into the level set method. We briefly review a number of advances in this domain.

0 Bookmarks
 · 
130 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose to formulate point distribution model in terms of centripetal-parameterized Catmull–Rom spline, so that the model-based segmentation is augmented to permit quick edit, and the consequent shape is independent of scale. We train the model in a fashion similar to active shape model, but with fewer salient/landmark points. We use gradient vector flow field as the external force field to drive the segmentation, but we did not adopt the procedures panned out by Cootes et al. to update a shape. Instead, we transform the shape back and forth between model scale and image scale to get the shape converged to the object of interest. To test the method, we turned the solution into an automated algorithm to segment lung on chest radiographs, and achieved an average overlap of 0.879. With edit, the average overlap increased to 0.945, with a minimum of 0.925. The method can be applied on a variety of images, as illustrated in Appendix C. The source code of the algorithm and the demo video can be located at http://jenh.co/2014/01/09/active-spline-models/.
    Digital Signal Processing 09/2014; · 1.92 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a novel graph cut algorithm that can take into account multi-shape constraints with neighbor prior constraints, and reports on a lung segmentation process from a three-dimensional computed tomography (CT) image based on this algorithm. The major contribution of this paper is the proposal of a novel segmentation algorithm that improves lung segmentation for cases in which the lung has a unique shape and pathologies such as pleural effusion by incorporating multiple shapes and prior information on neighbor structures in a graph cut framework. We demonstrate the efficacy of the proposed algorithm by comparing it to conventional one using a synthetic image and clinical thoracic CT volumes.
    Medical image analysis 09/2012; · 3.09 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This publication is a contribution to basic research in image comparison using eigenvalue spectra as features. The differential-geometric approach of eigenvalue spectrum-based descriptors is naturally applicable to shape data, but so far little work has been done to transfer it to the setting of image data painted on a rectangle or general curved surface. We present a new semi-global feature descriptor that also contains information about geometry of shapes visible in the image. This may not only improve the performance of the resulting distance measures, but may even enable us to approach the partial matching problem using eigenvalue spectra, which were previously only considered as global feature descriptors. We introduce some concepts that are useful in designing and understanding the behaviour of similar fingerprinting algorithms for images (and surfaces) and discuss some preliminary results. Link: http://link.springer.com/article/10.1007/s00371-014-1038-y/fulltext.html
    The Visual Computer 11/2014; · 0.91 Impact Factor

Full-text (2 Sources)

View
61 Downloads
Available from
Jun 3, 2014