A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions

Authors:
Calvin R. Maurer, Jr.;Vijay Raghavan;Rensheng Qi
Affiliations:
-;-;-
Venue:
IPMI '01 Proceedings of the 17th International Conference on Information Processing in Medical Imaging
Year:
2001

Citing 1
Cited 1

Linear Time Euclidean Distance Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence

An approach to vision-based person detection in robotic applications

IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

A sequential algorithm is presented for computing the Euclidean distance transform of a k-dimensional binary image in time linear in the total number of voxels. The algorithm may be of practical value since it is relatively simple and easy to implement and it is relatively fast (not only does it run in linear time but the time constant is small).