Abstract
By propagating a vector for each pixel, we show that nearly Euclidean distance maps can be produced quickly by a region growing algorithm using hierarchical queues. Properties of the propagation scheme are used to detect potentially erroneous pixels and correct them by using larger neighbourhoods, without significantly affecting the computation time. Thus, Euclidean distance maps are produced in a time comparable to its commonly used chamfer approximations.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P.E. Danielsson, Euclidean Distance Mapping, CGIP 14, 1980, 227–248.
Borgerfors, Distance Transformations in Arbitrary Dimensions, CVGIP 27, 1984, 321–345
G. Borgerfors, Distance Transformations in Digital Images, CVGIP 34, 1986, 344–371
H. Embrechts and D. Roose, A parallel Euclidean Distance Transformation Algorithm, CVIU 63, 1996, 15–26
J. Mullikin, The vector distance transform in two and three dimensions, CVGIP 54(6), 1992, 526–535
O. Cuisenaire, J.Ph. Thiran, B.Macq, Ch. Michel, A. De Volder and F. Marques, Automatic Registration of 3D MR Images with a Computerised Brain Atlas, SPIE Medical Imaging 1996, SPIE vol. 1710, 438–449.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cuisenaire, O. (1997). Region growing Euclidean distance transforms. In: Del Bimbo, A. (eds) Image Analysis and Processing. ICIAP 1997. Lecture Notes in Computer Science, vol 1310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63507-6_210
Download citation
DOI: https://doi.org/10.1007/3-540-63507-6_210
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63507-9
Online ISBN: 978-3-540-69585-1
eBook Packages: Springer Book Archive