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.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We introduce new results connecting differential and morphological operators that provide a formal and theoretically grounded approach for stable and fast contour evolution. Contour evolution algorithms have been extensively used for boundary detection and tracking in computer vision. The standard solution based on partial differential equations and level-sets requires the use of numerical methods of integration that are costly computationally and may have stability issues. We present a morphological approach to contour evolution based on a new curvature morphological operator valid for surfaces of any dimension. We approximate the numerical solution of the curve evolution PDE by the successive application of a set of morphological operators defined on a binary level-set and with equivalent infinitesimal behavior. These operators are very fast, do not suffer numerical stability issues, and do not degrade the level set function, so there is no need to reinitialize it. Moreover, their implementation is much easier since they do not require the use of sophisticated numerical algorithms. We validate the approach providing a morphological implementation of the geodesic active contours, the active contours without borders, and turbopixels. In the experiments conducted, the morphological implementations converge to solutions equivalent to those achieved by traditional numerical solutions, but with significant gains in simplicity, speed, and stability.
    IEEE Transactions on Software Engineering 01/2014; 36(1):2-17. · 2.59 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose a new splitting approach for the Potts model (also called piecewise constant Mumford-Shah model) for inverse imaging problems. The Potts model is an optimization problem of a cost function which forces a sparse gradient. Since the cost function is highly non-convex its minimization is a challenging problem. We here propose a discrete domain splitting based on the alternating direction method of multipliers (ADMM). Our scheme allows for arbitrarily close approximations to an isotropic discretization and thus avoids anisotropy effects like geometric staircasing. We show the capability of our method for the reconstruction of Radon data and spherical Radon data, which are the models for classical computed tomography and photo acoustic tomography, respectively. Our approach is particularly suitable for limited data setups such as sparse angle tomography. For example, our method is able to reconstruct the Shepp-Logan phantom from only 7 projections of Radon data as well as from 7 projections of spherical Radon data. We demonstrate the practical applicability of our approach in an experiment with real PET data.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Image segmentation is known to be an ambiguous problem whose solution needs an integration of image and shape cues of various levels; using low-level information alone is often not sufficient for a segmentation algorithm to match human capability. Two recent trends are popular in this area: (1) low-level and mid-level cues are combined to-gether in learning-based approaches to localize segmentation boundaries; (2) high-level vision tasks such as image labeling and object recognition are directly performed to ob-tain object boundaries. In this paper, we present an interesting observation that performs image segmentation in a reverse way, i.e., using a high-level semantic labeling approach to address a low-level segmentation problem, could be a proper solution. We perform semantic labeling on input images and derive segmentations from the labeling results. We adopt graph coloring theory to connect these two tasks and provide theoretical in-sights to our solution. This seemingly unusual way of doing image segmentation leads to surprisingly encouraging results, superior or comparable to those of the state-of-the-art image segmentation algorithms on multiple publicly available datasets.
    British Machine Vision Conference (BMVC), 2014; 01/2014

Full-text (2 Sources)

Available from
Jun 3, 2014