The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Dynamic programming for detecting, tracking, and matching deformable contours
Abstract
The problem of segmenting an image into separate regions and tracking them over time is one of the most significant problems in vision. Terzopoulos et al. (1987) proposed an approach to detect the contour regions of complex shapes, assuming a user selected initial contour not very far from the desired solution. We propose to further explore the information provided by the user's selected points and apply an optimal method to detect contours which allows a segmentation of the image. The method is based on dynamic programming (DP), and applies to a wide variety of shapes. It is exact and not iterative. We also consider a multiscale approach capable of speeding up the algorithm by a factor of 20, although at the expense of losing the guaranteed optimality characteristic. The problem of tracking and matching these contours is addressed. For tracking, the final contour obtained at one frame is sampled and used as initial points for the next frame. Then, the same DP process is applied. For matching, a novel strategy is proposed where the solution is a smooth displacement field in which unmatched regions are allowed while cross vectors are not. The algorithm is again based on DP and the optimal solution is guaranteed. We have demonstrated the algorithms on natural objects in a large spectrum of applications, including interactive segmentation and automatic tracking of the regions of interest in 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
Kass, M., Witkin, A., & Terzopoulos, D. (1988) · International Journal of Computer Vision · doi:10.1007/bf00133570 · Cited by 17,070
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
Ballard, D. H., & Brown, C. M. (1982) · Cited by 5,303
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
Bellman, R. E., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 1,971
Using 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
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
Good vibrations: modal dynamics for graphics and animation
Pentland, A., & Williams, J. (1989) · Proceedings of the 16th annual conference on Computer graphics and interactive techniques · doi:10.1145/74333.74355 · Cited by 389
Recovery of nonrigid motion and structure
Pentland, A., & Horowitz, B. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.85661 · Cited by 358
On the optimal detection of curves in noisy pictures
Montanari, U. (1971) · Communications of the ACM · doi:10.1145/362588.362594 · Cited by 295
Symmetry-seeking models and 3D object reconstruction
Terzopoulos, D., Witkin, A., & Kass, M. (1988) · International Journal of Computer Vision · doi:10.1007/bf00127821 · Cited by 284
Occlusions and binocular stereo
Geiger, D., Ladendorf, B., & Yuille, A. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55426-2_48 · Cited by 243
Self-citationUsing deformable surfaces to segment 3-D images and infer differential structures
Cohen, I., Cohen, L. D., & Ayache, N. (1992) · CVGIP: Image Understanding · doi:10.1016/1049-9660(92)90041-z · Cited by 215
Adaptive boundary detection using 'live-wire' two-dimensional dynamic programming
Mortensen, E. N., Morse, B., Barrett, W. A., & Udupa, J. K. (2003) · Computers in cardiology · doi:10.1109/cic.1992.269378 · Cited by 120
The dynamic analysis of apparent contours
Cipolla, R., & Blake, A. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1990.139606 · Cited by 119
Yuille, A., & Hallinan, P. (1993) · Cited by 87
Ayache, N., Cohen, I., & Herlin, I. (1993) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 50
Cited by
Caselles, V., Kimmel, R., & Sapiro, G. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007979827043 · Cited by 5,244
Deformable models in medical image analysis: a survey
McInerney, T., & Terzopoulos, D. (1996) · Medical Image Analysis · doi:10.1016/s1361-8415(96)80007-7 · Cited by 1,913
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
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
A 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
Metadata
- Authors
- Geiger, D., Gupta, A., Costa, L. A., & Vlontzos, J.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1995-03
- Volume
- 17
- Issue
- 3
- Pages
- 294-302
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2136706845
- Cited by
- 429
- References
- 17
- FWCI
- 24.52
- 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.