The efficient algorithms for achieving Euclidean distance transformation

Euclidean distance transformation (EDT) is used to convert a digital binary image consisting of object (foreground) and nonobject (background) pixels into another image where each pixel has a value of the minimum Euclidean distance from nonobject pixels. In this paper, the improved iterative erosion algorithm is proposed to avoid the redundant calculations in the iterative erosion algorithm. Furthermore, to avoid the iterative operations, the two-scan-based algorithm by a deriving approach is developed for achieving EDT correctly and efficiently in a constant time. Besides, we discover when obstacles appear in the image, many algorithms cannot achieve the correct EDT except our two-scan-based algorithm. Moreover, the two-scan-based algorithm does not require the additional cost of preprocessing or relative-coordinates recording.

[1]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[2]  H. Yamada.  Complete Euclidean Distance Transformation by Parallel Poeration , 1984 .

[3]  Stanley R Sternberg,et al.  Grayscale morphology , 1986 .

[4]  Luc Vincent,et al.  Exact Euclidean distance function by chain propagations , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[5]  Frank Y. Shih,et al.  Threshold Decomposition of Gray-Scale Morphology into Binary Morphology , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Frank Y. Shih,et al.  Pipeline architectures for recursive morphological operations , 1995, IEEE Trans. Image Process..

[7]  G. Borgefors.  Distance transformations in arbitrary dimensions , 1984 .

[8]  Frank Y. Shih,et al.  Optimization on euclidean distance transformation using grayscale morphology , 1992, J. Vis. Commun. Image Represent..

[9]  E. Dubois,et al.  Digital picture processing , 1985, Proceedings of the IEEE.

[10]  Hinnik Eggers,et al.  Two Fast Euclidean Distance Transformations in Z2Based on Sufficient Propagation , 1998, Comput. Vis. Image Underst..

[11]  Benoit M. Macq,et al.  Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods , 1999, Comput. Vis. Image Underst..

[12]  Soo-Chang Pei,et al.  A morphological approach to shortest path planning for rotating objects , 1998, Pattern Recognit..

[13]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[14]  Amitava Datta,et al.  Constant-Time Algorithm for the Euclidean Distance Transform on Reconfigurable Meshes , 2001, J. Parallel Distributed Comput..

[15]  Edward R. Dougherty,et al.  Morphological methods in image and signal processing , 1988 .

[16]  Frank Y. Shih,et al.  Decomposition of gray-scale morphological structuring elements , 1991, Pattern Recognit..

[17]  P. Danielsson.  Euclidean distance mapping , 1980 .

[18]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[19]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[20]  Albert M. Vossepoel,et al.  A note on "distance transformations in digital images" , 1988, Comput. Vis. Graph. Image Process..

[21]  Xinhua Zhuang,et al.  Image Analysis Using Mathematical Morphology , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.