The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Using Dynamic Programming For Minimizing The Energy Of Active Contours In The Presence Of Hard Constraints
Abstract
Energy-Minimizing Active Contour Models (snakes) have recently been proposed by Kass et al. [8] as a top-down mechanism for locating features of interest in images. The Kass et al.’s algorithm involves four steps: setting up a variational integral on the continuous plane, deriving a pair of Euler equations, discretizing them, and solving the discrete equations iteratively until convergence. This algorithm suffers from a number of problems. We discuss these problems and present an algoIithm for active contours based on dynamic programming. The optimization problem is set up as a discrete multi-stage decision process and is solved by a “time-delayed” discrete dynamic programming algorithm. This formulation leads to a stable behavior for the active contours over iterations, in addition to allowing for hard constraints to be enforced on the behavior of the solution. Results of the application of the proposed algorithm to real images is presented.
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
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
Horn, B. K. P., & Schunck, B. G. (1981) · Artificial Intelligence · doi:10.1016/0004-3702(81)90024-2 · Cited by 10,312
Cited by
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
A Fast algorithm for active contours and curvature estimation
Williams, D. J., & Shah, M. (1992) · CVGIP: Image Understanding · doi:10.1016/1049-9660(92)90003-l · Cited by 1,101
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
Self-citationA contour-based approach to multisensor image registration
Li, H., Manjunath, B. S., & Mitra, S. K. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.366480 · Cited by 485
Metadata
- Authors
- Amini, A. A., Tehrani, S., & Weymouth, T. E.
- Venue
- [1988 Proceedings] Second International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2005-08-24
- OpenAlex
- W2145193861
- Cited by
- 204
- References
- 2
- FWCI
- 10.68
- Type
- conference paper
- 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: Using Dynamic Programming For Minimizing The Energy Of Active Contours In The Presence Of Hard Constraints. https://app.cochat.ai/papers/10.1109/ccv.1988.589976
- The paper
- Amini, A. A., Tehrani, S., & Weymouth, T. E. (2005). Using Dynamic Programming For Minimizing The Energy Of Active Contours In The Presence Of Hard Constraints. [1988 Proceedings] Second International Conference on Computer Vision. https://doi.org/10.1109/ccv.1988.589976
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.