Two fast euclidean distance transformations in z2based on sufficient propagation
H Eggers - Computer Vision and Image Understanding, 1998 - Elsevier
Two new error-free sequential Euclidean distance transformations (EDT) for binary images
in Z2are introduced: sufficientd1-propagation and sufficientd∞-propagation. Both methods
use ordered propagation, ie iterative propagation via contour pixels. However, we restrict the
propagation to unique shortest Euclidean paths, the sufficient propagation paths. Moreover,
we ensure error-free direct pixel update by adding a distance suggestion to each
propagation pixel. Using these ideas, we avoid many unneccesary calculations. The …
in Z2are introduced: sufficientd1-propagation and sufficientd∞-propagation. Both methods
use ordered propagation, ie iterative propagation via contour pixels. However, we restrict the
propagation to unique shortest Euclidean paths, the sufficient propagation paths. Moreover,
we ensure error-free direct pixel update by adding a distance suggestion to each
propagation pixel. Using these ideas, we avoid many unneccesary calculations. The …