The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Topology preserving level set method for geometric deformable models
Abstract
Active contour and surface models, also known as deformable models, are powerful image segmentation techniques. Geometric deformable models implemented using level set methods have advantages over parametric models due to their intrinsic behavior, parameterization independence, and ease of implementation. However, a long claimed advantage of geometric deformable models-the ability to automatically handle topology changes-turns out to be a liability in applications where the object to be segmented has a known topology that must be preserved. We present a new class of geometric deformable models designed using a novel topology-preserving level set method, which achieves topology preservation by applying the simple point concept from digital topology. These new models maintain the other advantages of standard geometric deformable models including subpixel accuracy and production of nonintersecting curves or surfaces. Moreover, since the topology-preserving constraint is enforced efficiently through local computations, the resulting algorithm incurs only nominal computational overhead over standard geometric deformable models. Several experiments on simulated and real data are provided to demonstrate the performance of this new deformable model algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37422 · Cited by 10,104
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · ACM SIGGRAPH Computer Graphics · doi:10.1145/37402.37422 · Cited by 8,647
Active Shape Models-Their Training and Application
Cootes, T. F., Taylor, C. J., Cooper, D. H., & Graham, J. (1995) · Computer Vision and Image Understanding · doi:10.1006/cviu.1995.1004 · Cited by 7,190
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Caselles, V., Kimmel, R., & Sapiro, G. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007979827043 · Cited by 5,244
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
Cited by
Fischl, B. (2012) · NeuroImage · doi:10.1016/j.neuroimage.2012.01.021 · Cited by 9,526
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-citationGeometrically Accurate Topology-Correction of Cortical Surfaces Using Nonseparating Loops
Segonne, F., Pacheco, J., & Fischl, B. (2007) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2006.887364 · Cited by 992
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Li, K., Wu, X., Chen, D. Z., & Sonka, M. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.19 · Cited by 664
associated_data_Investigating the Effectiveness of clDice Loss for Road Crack Segmentation
Pereira, V. (2025) · arXiv (Cornell University) · doi:10.5281/zenodo.15696262 · Cited by 548
Xing, F., & Yang, L. (2016) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2016.2515127 · Cited by 519
Silhouette and stereo fusion for 3D object modeling
Hernández Esteban, C., & Schmitt, F. (2004) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2004.03.016 · Cited by 435
Graph cut based image segmentation with connectivity priors
Vicente, S., Kolmogorov, V., & Rother, C. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587440 · Cited by 385
Edge and line oriented contour detection: State of the art
Papari, G., & Petkov, N. (2011) · Image and Vision Computing · doi:10.1016/j.imavis.2010.08.009 · Cited by 357
An Automatic Learning-Based Framework for Robust Nucleus Segmentation
Xing, F., Xie, Y., & Yang, L. (2016) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2015.2481436 · Cited by 351
Cell population tracking and lineage construction with spatiotemporal context
Li, K., Miller, E. D., Chen, M., Kanade, T., Weiss, L. E., & Campbell, P. G. (2008) · Medical Image Analysis · doi:10.1016/j.media.2008.06.001 · Cited by 346
Longitudinal changes in cortical thickness associated with normal aging
Thambisetty, M., Wan, J., Carass, A., An, Y., Prince, J. L., & Resnick, S. M. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2010.04.258 · Cited by 341
Self-citationAnatomically motivated modeling of cortical laminae
Waehnert, M. D., Dinse, J., Weiss, M., Streicher, M. N., Waehnert, P., Geyer, S., Turner, R., & Bazin, P.-L. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2013.03.078 · Cited by 318
Ma, Z., Tavares, J. M. R. S., Jorge, R. N., & Mascarenhas, T. (2010) · Computer Methods in Biomechanics and Biomedical Engineering · doi:10.1080/10255840903131878 · Cited by 316
Segmenting and tracking fluorescent cells in dynamic 3-D microscopy with coupled active surfaces
Dufour, A., Shinin, V., Tajbakhsh, S., Guillen-Aghion, N., Olivo-Marin, J.-C., & Zimmer, C. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.852790 · Cited by 309
Brain Functional Localization: A Survey of Image Registration Techniques
Gholipour, A., Kehtarnavaz, N., Briggs, R., Devous, M., & Gopinath, K. (2007) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2007.892508 · Cited by 274
clDice - a Novel Topology-Preserving Loss Function for Tubular Structure Segmentation
Shit, S., Paetzold, J. C., Sekuboyina, A., Ezhov, I., Unger, A., Zhylka, A., Pluim, J. P. W., Bauer, U., & Menze, B. H. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01629 · Cited by 60
“As a comparison, [17] needs O(c2mlog(m)) (see [15]) complexity to compute the 1d persistent homology where d is the number of points with zero gradients in the prediction and m is the number of simplices.”
Metadata
- Authors
- Han, X., Xu, C., & Prince, J. L.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2003-06
- Volume
- 25
- Issue
- 6
- Pages
- 755-768
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2139383790
- Cited by
- 492
- References
- 50
- FWCI
- 29.14
- 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.