ML Anthology

A Fast Algorithm for Active Contours

Donna J. Williams, Mubarak Shah
ICCV 1990 pp. 592-595
doi:10.1109/ICCV.1990.139602 /iccv/1990/williams1990iccv-fast/

Abstract

A method of controlling snakes that combines speed, flexibility, and simplicity is presented. It is compared to the original variational calculus method of M. Kass et al. (1987) and the dynamic programming method developed by A.A. Amini et al. (1988) and found to be comparable in final results, while being faster than dynamic programming and more stable and flexible for including hard constraints than the variational calculus approach. The introduction of the concept of curvature highlights the problem of how to approximate curvature when a curve is represented by a set of discrete points. The advantages and disadvantages of a number of different approximations of curvature are pointed out.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

ICCV Semantic Scholar

Cite

Text

Williams and Shah. "A Fast Algorithm for Active Contours." IEEE/CVF International Conference on Computer Vision, 1990. doi:10.1109/ICCV.1990.139602

Markdown

[Williams and Shah. "A Fast Algorithm for Active Contours." IEEE/CVF International Conference on Computer Vision, 1990.](https://mlanthology.org/iccv/1990/williams1990iccv-fast/) doi:10.1109/ICCV.1990.139602

BibTeX

@inproceedings{williams1990iccv-fast,
  title     = {{A Fast Algorithm for Active Contours}},
  author    = {Williams, Donna J. and Shah, Mubarak},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {1990},
  pages     = {592-595},
  doi       = {10.1109/ICCV.1990.139602},
  url       = {https://mlanthology.org/iccv/1990/williams1990iccv-fast/}
}