A systolic algorithm for Euclidean distance transform

The Euclidean distance transform is one of the fundamental operations in image processing. It has been widely used in computer vision, pattern recognition, morphological filtering, and robotics. This paper proposes a systolic algorithm that computes the Euclidean distance map of an N times N binary image in 3N clocks on 2N2 processing cells. The algorithm is designed so that the hardware resources are reduced; especially no multipliers are used and, thus, it facilitates VLSI implementation

[1]  David W. Paglieroni.  A unified distance transform algorithm and architecture , 1992, Machine Vision and Applications.

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

[3]  Frederic Fol Leymarie,et al.  Fast raster scan distance propagation on the discrete rectangular lattice , 1992, CVGIP Image Underst..

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

[5]  Ling Chen,et al.  An Efficient Algorithm for Complete Euclidean Distance Transform on Mesh-Connected SIMD , 1995, Parallel Comput..

[6]  Tomio Hirata,et al.  A Unified Linear-Time Algorithm for Computing Distance Maps , 1996, Inf. Process. Lett..

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

[8]  Ling Chen,et al.  A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image , 1994, Inf. Process. Lett..

[9]  Calvin R. Maurer,et al.  A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Ingemar Ragnemalm.  Neighborhoods for distance transformations using ordered propagation , 1992, CVGIP Image Underst..

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

[12]  Shi-Jinn Horng,et al.  Parallel Computation of the Euclidean Distance Transform on the Mesh of Trees and the Hypercube Computer , 1997, Comput. Vis. Image Underst..

[13]  Kiriakos N. Kutulakos,et al.  Fast Computation of the Euclidian Distance Maps for Binary Images , 1992, Inf. Process. Lett..

[14]  David G. Kirkpatrick,et al.  Linear Time Euclidean Distance Algorithms , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Wim H. Hesselink,et al.  A General Algorithm for Computing Distance Transforms in Linear Time , 2000, ISMM.

[16]  O. Cuisenaire.  Distance transformations: fast algorithms and applications to medical image processing , 1999 .

[17]  Toshimitsu Masuzawa,et al.  An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images , 1995, Inf. Process. Lett..

[18]  Henry Y. H. Chuang,et al.  Designing systolic architectures for complete Euclidean distance transform , 1995, J. VLSI Signal Process..