Scinovex
articleTop 1% cited

Distance Regularized Level Set Evolution and Its Application to Image Segmentation

IEEE Transactions on Image Processing · 2010 · Vol. 19(12) · pp. 3243–3254
Chunming LiChenyang XuChangfeng GuiMartin Fox

Abstract

Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities during its evolution, which may cause numerical errors and eventually destroy the stability of the evolution. Therefore, a numerical remedy, called reinitialization, is typically applied to periodically replace the degraded level set function with a signed distance function. However, the practice of reinitialization not only raises serious problems as when and how it should be performed, but also affects numerical accuracy in an undesirable way. This paper proposes a new variational level set formulation in which the regularity of the level set function is intrinsically maintained during the level set evolution. The level set evolution is derived as the gradient flow that minimizes an energy functional with a distance regularization term and an external energy that drives the motion of the zero level set toward desired locations. The distance regularization term is defined with a potential function such that the derived level set evolution has a unique forward-and-backward (FAB) diffusion effect, which is able to maintain a desired shape of the level set function, particularly a signed distance profile near the zero level set. This yields a new type of level set evolution called distance regularized level set evolution (DRLSE). The distance regularization effect eliminates the need for reinitialization and thereby avoids its induced numerical errors. In contrast to complicated implementations of conventional level set formulations, a simpler and more efficient finite difference scheme can be used to implement the DRLSE formulation. DRLSE also allows the use of more general and efficient initialization of the level set function. In its numerical implementation, relatively large time steps can be used in the finite difference scheme to reduce the number of iterations, while ensuring sufficient numerical accuracy. To demonstrate the effectiveness of the DRLSE formulation, we apply it to an edge-based active contour model for image segmentation, and provide a simple narrowband implementation to greatly reduce computational cost.

Medical Image Segmentation TechniquesReservoir Engineering and Simulation MethodsAdvanced Numerical Methods in Computational MathematicsLevel set (data structures)Signed distance functionLevel set methodRegularization (linguistics)Set functionAlgorithmMathematicsImage segmentationMathematical optimizationSet (abstract data type)

MeSH terms

Image EnhancementImage Processing, Computer-AssistedPattern Recognition, AutomatedImaging, Three-Dimensional
Citations
2,095
FWCI
75.67
field-weighted impact
References
39
Percentile
100%
vs. same field & year
Citations per year
References
A Fast Level Set Method for Propagating Interfaces
Journal of Computational Physics · 1995 · 1,315 citations
A Level Set Approach for Computing Solutions to Incompressible Two-Phase Flow
Journal of Computational Physics · 1994 · 4,682 citations
Snakes: Active contour models
International Journal of Computer Vision · 1988 · 16,976 citations
Active contours without edges
IEEE Transactions on Image Processing · 2001 · 10,250 citations
Minimization of Region-Scalable Fitting Energy for Image Segmentation
IEEE Transactions on Image Processing · 2008 · 1,700 citations
Snakes, shapes, and gradient vector flow
IEEE Transactions on Image Processing · 1998 · 3,987 citations
Shape modeling with front propagation: a level set approach
IEEE Transactions on Pattern Analysis and Machine Intelligence · 1995 · 3,139 citations
Related articles
Distance Regularized Level Set Evolution and Its Application to Image Segmentation
IEEE Transactions on Image Processing · 2010 · 2,095 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.