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
Cited by
Cheng, 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.”
MethodZhao, Y., Rada, L., Chen, K., Harding, S. P., & Zheng, Y. (2015) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2015.2409024 · Cited by 391
Automatic breast ultrasound image segmentation: a survey
Xian, M., Zhang, Y., Cheng, H. D., Xu, F., Zhang, B., & Ding, J. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.02.012 · Cited by 284
“For more information about the reinitialization, please refer [45-47].”
BackgroundMethodUltrasound image-based thyroid nodule automatic segmentation using convolutional neural networks
Ma, J., Wu, F., Jiang, T., Zhao, Q., & Kong, D. (2017) · International Journal of Computer Assisted Radiology and Surgery · doi:10.1007/s11548-017-1649-7 · Cited by 187
A Likelihood and Local Constraint Level Set Model for Liver Tumor Segmentation from CT Volumes
Li, C., Wang, X., Eberl, S., Fulham, M., Yin, Y., Chen, J., & Feng, D. D. (2013) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2013.2267212 · Cited by 139
Self-citation
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Distance Regularized Level Set Evolution and Its Application to Image Segmentation. https://app.cochat.ai/papers/10.1109/tip.2010.2069690
- The paper
- Li, C., Xu, C., Gui, C., & Fox, M. D. (2010). Distance Regularized Level Set Evolution and Its Application to Image Segmentation. IEEE Transactions on Image Processing. https://doi.org/10.1109/tip.2010.2069690
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.