Exact Euclidean Distance Function by Chain Propagations

Vincent, Luc

doi:10.1109/CVPR.1991.139746

Exact Euclidean Distance Function by Chain Propagations

Luc Vincent

CVPR 1991 pp. 520-525

doi:10.1109/CVPR.1991.139746 /cvpr/1991/vincent1991cvpr-exact/

Abstract

Up to now, all the known Euclidean distance function algorithms are either excessively slow or inaccurate, and even Danielsson's method (1980) produces errors in some configurations. The author shows that these problems are due to the local way distances are propagated in images by this algorithm. To remedy these drawbacks, an algorithm which encodes the objects boundaries as chains and propagates these structures in the image using rewriting rules is introduced. The chains convey Euclidean distances and can be written above one another, thus yielding exact results. In addition, the proposed algorithm is particularly efficient. Some of its applications to skeletons and neighborhood graphs are described.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

CVPR Semantic Scholar

Cite

Text

Vincent. "Exact Euclidean Distance Function by Chain Propagations." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139746

Markdown

[Vincent. "Exact Euclidean Distance Function by Chain Propagations." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/vincent1991cvpr-exact/) doi:10.1109/CVPR.1991.139746

BibTeX

@inproceedings{vincent1991cvpr-exact,
  title     = {{Exact Euclidean Distance Function by Chain Propagations}},
  author    = {Vincent, Luc},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1991},
  pages     = {520-525},
  doi       = {10.1109/CVPR.1991.139746},
  url       = {https://mlanthology.org/cvpr/1991/vincent1991cvpr-exact/}
}