The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Global Minimum for Active Contour Models: A Minimal Path Approach
Abstract
A new boundary detection approach for shape modeling is presented. It detects the global minimum of an active contour model’s energy between two end points. Initialization is made easier and the curve is not trapped at a local minimum by spurious edges. We modify the “snake” energy by including the internal regularization term in the external potential term. Our method is based on finding a path of minimal length in a Riemannian metric. We then make use of a new efficient numerical method to find this shortest path.It is shown that the proposed energy, though based only on a potential integrated along the curve, imposes a regularization effect like snakes. We explore the relation between the maximum curvature along the resulting contour and the potential generated from the image.The method is capable to close contours, given only one point on the objects' boundary by using a topology-based saddle search routine.We show examples of our method applied to real aerial and medical images.
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
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
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
User’s guide to viscosity solutions of second order partial differential equations
Crandall, M. G., Ishii, H., & Lions, P.-L. (1992) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1992-00266-5 · Cited by 4,781
A fast marching level set method for monotonically advancing fronts.
Sethian, J. A. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.4.1591 · Cited by 3,221
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
On active contour models and balloons
Cohen, L. D. (1991) · CVGIP: Image Understanding · doi:10.1016/1049-9660(91)90028-n · Cited by 2,153
Self-citationDanielsson, P.-E. (1980) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(80)90054-4 · Cited by 1,998
A 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
Finite-element methods for active contour models and balloons for 2-D and 3-D images
Cohen, L. D., & Cohen, I. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.244675 · Cited by 1,378
Self-citationA 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
Caselles, V., Kimmel, R., & Sapiro, G. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466871 · Cited by 1,161
Self-citationUsing dynamic programming for solving variational problems in vision
Amini, A. A., Weymouth, T. E., & Jain, R. C. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.57681 · Cited by 1,008
Modern Geometry — Methods and Applications
Dubrovin, B. A., Fomenko, A. T., & Novikov, S. P. (1984) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-9946-9 · Cited by 966
Distance transformations in arbitrary dimensions
Borgefors, G. (1984) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(84)90035-5 · Cited by 779
Intelligent scissors for image composition
Mortensen, E. N., & Barrett, W. A. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218442 · Cited by 778
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
A Viscosity Solutions Approach to Shape-From-Shading
Rouy, E., & Tourin, A. (1992) · SIAM Journal on Numerical Analysis · doi:10.1137/0729053 · Cited by 657
Tracking deformable objects in the plane using an active contour model
Leymarie, F., & Levine, M. D. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.216733 · Cited by 554
Structural Saliency: The Detection Of Globally Salient Structures using A Locally Connected Network
Sha'asua, A., & Ullman, S. (2005) · [1988 Proceedings] Second International Conference on Computer Vision · doi:10.1109/ccv.1988.590008 · Cited by 539
Dynamic Programming and Modern Control Theory
Bellman, R., & Kalaba, R. E. (1966) · Cited by 519
An active testing model for tracking roads in satellite images
Geman, D., & Jedynak, B. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.476006 · Cited by 498
Dynamic programming for detecting, tracking, and matching deformable contours
Geiger, D., Gupta, A., Costa, L. A., & Vlontzos, J. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.368194 · Cited by 429
Fischler, M. A., Tenenbaum, J. M., & Wolf, H. C. (1981) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(81)90056-3 · Cited by 354
On the optimal detection of curves in noisy pictures
Montanari, U. (1971) · Communications of the ACM · doi:10.1145/362588.362594 · Cited by 295
Surface modeling with oriented particle systems
Szeliski, R., & Tonnesen, D. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134037 · Cited by 295
Numerical algorithms for propagating interfaces: Hamilton-Jacobi equations and conservation laws
Sethian, J. A. (1990) · Journal of Differential Geometry · doi:10.4310/jdg/1214444092 · Cited by 274
Finding 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
Self-citationFua, P., & Leclerc, Y. G. (1990) · Machine Vision and Applications · doi:10.1007/bf01211451 · Cited by 178
Bruckstein, A. M. (1988) · Computer Vision Graphics and Image Processing · doi:10.1016/s0734-189x(88)80002-1 · Cited by 119
Image segmentation by reaction-diffusion bubbles
Tek, H., & Kimia, B. B. (2002) · IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1995.466792 · Cited by 113
Planning and reasoning for autonomous vehicle control
Mitchell, J. S. B., Payton, D. W., & Keirsey, D. M. (1987) · International Journal of Intelligent Systems · doi:10.1002/int.4550020204 · Cited by 52
Matching Deformable Models to Images: Direct and Iterative Solutions
Terzopoulos, D. (1987) · doi:10.1364/mv.1987.fd2 · Cited by 46
Cited by
Graph Cuts and Efficient N-D Image Segmentation
Boykov, Y., & Funka-Lea, G. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7934-5 · Cited by 1,910
“Some versions of active contours (Cohen and Kimmel, 1997), shortest path algorithms (Mortensen and Barrett, 1998; Falcão et al., 1998), ratio regions (Cox et al., 1996), and some other segmentation methods (Jermyn and Ishikawa, 1999) compute a globally optimal solution in 2D applications when a…”
MethodA review of 3D vessel lumen segmentation techniques: Models, features and extraction schemes
Lesage, D., Angelini, E. D., Bloch, I., & Funka-Lea, G. (2009) · Medical Image Analysis · doi:10.1016/j.media.2009.07.011 · Cited by 920
Fast Global Minimization of the Active Contour/Snake Model
Bresson, X., Esedoḡlu, S., Vandergheynst, P., Thiran, J.-P., & Osher, S. (2007) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-007-0002-0 · Cited by 857
Blood vessel segmentation algorithms — Review of methods, datasets and evaluation metrics
Moccia, S., De Momi, E., El Hadji, S., & Mattos, L. S. (2018) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2018.02.001 · Cited by 567
Computing geodesics and minimal surfaces via graph cuts
Boykov, & Kolmogorov (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238310 · Cited by 555
Metadata
- Authors
- Cohen, L. D., & Kimmel, R.
- Venue
- International Journal of Computer Vision
- Published
- 1997-08
- Volume
- 24
- Issue
- 1
- Pages
- 57-78
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W1569930776
- Cited by
- 625
- References
- 34
- FWCI
- 7.28
- 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.