The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Distance Regularized Level Set Evolution and Its Application to Image Segmentation
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Partial Differential Equations
(1988) · Lecture Notes in Mathematics · doi:10.1007/bfb0082920 · Cited by 23,383
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
Chan, T. F., & Vese, L. A. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.902291 · Cited by 10,304
Caselles, V., Kimmel, R., & Sapiro, G. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007979827043 · Cited by 5,244
Level Set Methods and Dynamic Implicit Surfaces
Osher, S., & Fedkiw, R. (2003) · Applied Mathematical Sciences · doi:10.1007/b98879 · Cited by 4,951
Snakes, shapes, and gradient vector flow
Xu, C., & Prince, J. L. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.661186 · Cited by 4,001
Self-citationLevel Set Methods and Fast Marching Methods
Sethian, J. A. (1999) · Medical Entomology and Zoology · Cited by 3,616
Shape modeling with front propagation: a level set approach
Malladi, R., Sethian, J. A., & Vemuri, B. C. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.368173 · Cited by 3,158
Region competition: unifying snakes, region growing, and Bayes/MDL for multiband image segmentation
Zhu, S. C., & Yuille, A. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.537343 · Cited by 1,913
Level Set Evolution without Re-Initialization: A New Variational Formulation
Li, C., Xu, C., Gui, C., & Fox, M. D. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.213 · Cited by 1,783
Self-citationA geometric model for active contours in image processing
Caselles, V., Catt�, F., Coll, T., & Dibos, F. (1993) · Numerische Mathematik · doi:10.1007/bf01385685 · Cited by 1,743
Minimization of Region-Scalable Fitting Energy for Image Segmentation
Li, C., Kao, C.-Y., Gore, J. C., & Ding, Z. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2002304 · Cited by 1,721
Self-citationPartial Differential Equations
Abbott, S., & Evans, L. C. (1999) · The Mathematical Gazette · doi:10.2307/3618751 · Cited by 1,414
A Fast Level Set Method for Propagating Interfaces
Adalsteinsson, D., & Sethian, J. A. (1995) · Journal of Computational Physics · doi:10.1006/jcph.1995.1098 · Cited by 1,326
A PDE-Based Fast Local Level Set Method
Peng, D., Merriman, B., Osher, S., Zhao, H., & Kang, M. (1999) · Journal of Computational Physics · doi:10.1006/jcph.1999.6345 · Cited by 1,255
A Variational Level Set Approach to Multiphase Motion
Zhao, H.-K., Chan, T., Merriman, B., & Osher, S. (1996) · Journal of Computational Physics · doi:10.1006/jcph.1996.0167 · Cited by 1,060
Geodesic active contours and level sets for the detection and tracking of moving objects
Paragios, N., & Deriche, R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.841758 · Cited by 999
Aubert, G., & Kornprobst, P. (2002) · Applied Mathematical Sciences · doi:10.1007/b97428 · Cited by 983
Gradient flows and geometric active contour models
Kichenassamy, S., Kumar, A., Olver, P., Tannenbaum, A., & Yezzi, A. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466855 · Cited by 660
Forward-and-backward diffusion processes for adaptive image enhancement and denoising
Gilboa, G., Sochen, N., & Zeevi, Y. Y. (2002) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.800883 · Cited by 346
On the relationship between parametric and geometric active contours
Xu, C., Yezzi, A., & Prince, J. L. (2002) · Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) · doi:10.1109/acssc.2000.911003 · Cited by 252
Self-citationFinding shortest paths on surfaces using level sets propagation
Kimmel, R., Amir, A., & Bruckstein, A. M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.387512 · Cited by 231
A variational model for image classification and restoration
Samson, C., Blanc-Feraud, L., Aubert, G., & Zerubia, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.857003 · Cited by 205
A finite element method for the simulation of a Rayleigh-Taylor instability
Dervieux, A., & Thomasset, F. (1980) · Lecture Notes in Mathematics · doi:10.1007/bfb0086904 · Cited by 163
Multi-View Stereo Reconstruction of Dense Shape and Complex Appearance
Jin, H., Soatto, S., & Yezzi, A. J. (2005) · International Journal of Computer Vision · doi:10.1007/s11263-005-6876-7 · Cited by 137
Multifluid incompressible flows by a finite element method
Dervieux, A., & Thomasset, F. (2008) · Springer eBooks · doi:10.1007/3-540-10694-4_22 · Cited by 71
Cited by
Li, C., Huang, R., Ding, Z., Gatenby, J. C., Metaxas, D. N., & Gore, J. C. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2146190 · Cited by 1,285
Self-citationCheng, J.-Z., Ni, D., Chou, Y.-H., Qin, J., Tiu, C.-M., Chang, Y.-C., Huang, C.-S., Shen, D., & Chen, C.-M. (2016) · Scientific Reports · doi:10.1038/srep24454 · Cited by 755
“The MORPH features are computed from either experts’ drawings or the computer-generated boundaries by level set 43 (DRLSE) and grow-cut 44 (GC) methods.”
MethodRemote Heart Rate Measurement from Face Videos under Realistic Situations
Li, X., Chen, J., Zhao, G., & Pietikainen, M. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.543 · Cited by 550
Xing, F., & Yang, L. (2016) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2016.2515127 · Cited by 519
A Level Set Approach to Image Segmentation With Intensity Inhomogeneity
Zhang, K., Zhang, L., Lam, K.-M., & Zhang, D. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2409119 · Cited by 408
Metadata
- Authors
- Li, C., Xu, C., Gui, C., & Fox, M. D.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2010-12
- Volume
- 19
- Issue
- 12
- Pages
- 3243-3254
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W1979393293
- Cited by
- 2,106
- References
- 27
- FWCI
- 85.87
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.