Fast raster scan distance propagation on the discrete rectangular lattice

Abstract The main result of this paper is that simple (raster scan) sequential algorithms for computing Euclidean Distance Transforms can be implemented in an optimized manner from the point of view of numerical computations. We will show that these fast implementations have computational complexities comparable to the city block, chessboard, and other simple chamfer Distance Transforms.

[1]  Gabriella Sanniti di Baja,et al.  Finding local maxima in a pseudo-Euclidian distance transform , 1988, Comput. Vis. Graph. Image Process..

[2]  S. Tanimoto,et al.  Time Complexity For Serial And Parallel Propagation In Images. , 1984, Optics & Photonics.

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

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

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

[6]  Frederic Fol Leymarie,et al.  New Method For Shape Description Based On An Active Contour Model , 1990, Other Conferences.

[7]  Frederic Fol Leymarie,et al.  Simulating the Grassfire Transform Using an Active Contour Model , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  H. Blum.  Biological shape and visual science. I. , 1973, Journal of theoretical biology.

[9]  Q. Ye.  The signed Euclidean distance transform and its applications , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[10]  F. Leymarie.  Tracking and Describing Deformable Objects Using Active Contour Models , 1990 .

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

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

[13]  Gabriella Sanniti di Baja,et al.  Computing Voronoi diagrams in digital pictures , 1986, Pattern Recognit. Lett..

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

[15]  Frederic Fol Leymarie,et al.  Skeletons from Snakes , 1990 .

[16]  Ugo Montanari,et al.  A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance , 1968, J. ACM.

[17]  Jim Piper,et al.  Computing distance transformations in convex and non-convex domains , 1987, Pattern Recognit..

[18]  H. Blum.  Biological shape and visual science (part I) , 1973 .

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