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.
CITATION STYLE
Cuisenaire, O. (1997). Region growing Euclidean distance transforms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1310, pp. 263–270). Springer Verlag. https://doi.org/10.1007/3-540-63507-6_210
Mendeley helps you to discover research relevant for your work.