Rapid Euclidean Distance Transform Using Grayscale Morphology Decomposition

Huang, C. Tony; Mitchell, Owen Robert

doi:10.1109/CVPR.1991.139786

Rapid Euclidean Distance Transform Using Grayscale Morphology Decomposition

C. Tony Huang, Owen Robert Mitchell

CVPR 1991 pp. 695-697

doi:10.1109/CVPR.1991.139786 /cvpr/1991/huang1991cvpr-rapid/

Abstract

A fast and exact Euclidean distance transformation using grayscale mathematical morphology is presented. The large structuring element required for this operation is decomposed into iterative applications of simple 3*3 windows. This is possible because the square of the Euclidean distance matrix is easily decomposable. Non-square pixels can also be used in this application.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

CVPR Semantic Scholar

Cite

Text

Huang and Mitchell. "Rapid Euclidean Distance Transform Using Grayscale Morphology Decomposition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139786

Markdown

[Huang and Mitchell. "Rapid Euclidean Distance Transform Using Grayscale Morphology Decomposition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/huang1991cvpr-rapid/) doi:10.1109/CVPR.1991.139786

BibTeX

@inproceedings{huang1991cvpr-rapid,
  title     = {{Rapid Euclidean Distance Transform Using Grayscale Morphology Decomposition}},
  author    = {Huang, C. Tony and Mitchell, Owen Robert},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1991},
  pages     = {695-697},
  doi       = {10.1109/CVPR.1991.139786},
  url       = {https://mlanthology.org/cvpr/1991/huang1991cvpr-rapid/}
}