A linear-time algorithm for Euclidean feature transform sets

Authors:
Wim H. Hesselink
Affiliations:
Department of Mathematics and Computing Science, University of Groningen, P.O. Box 800, 9700 AV Groningen, The Netherlands
Venue:
Information Processing Letters
Year:
2007

Citing 7
Cited 1

A unified distance transform algorithm and architecture

Machine Vision and Applications
A fast algorithm for Euclidean distance maps of a 2-D binary image

Information Processing Letters
A unified linear-time algorithm for computing distance maps

Information Processing Letters
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
Linear Time Euclidean Distance Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions

IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete bisector function and euclidean skeleton

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery

What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications

SIAM Review

Quantified Score

Hi-index	0.89

Visualization

Abstract

The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the function that assigns to every pixel the set of background pixels with this distance. We present an algorithm to compute the exact Euclidean feature transform sets in linear time. The algorithm is applicable in arbitrary dimensions.