Approximation of the Euclidean Distance by

Chamfer distances play an important role in the theory of distance transforms. Though the determination of the exact Euclidean distance transform is also a well investigated area, the classical chamfering method based upon "small" neighborhoods still outperforms it e.g. in terms of computation time. In this paper we determine the best possible maximum relative error of chamfer distances under various boundary conditions. In each case some best approximating sequences are explicitly given. Further, because of possible practical interest, we give all best approximating sequences in case of small (i.e. 5 5 and 7 7) neighborhoods.

[1]  Frank Y. Shih,et al.  Fast Euclidean distance transformation in two scans using a 3 × 3 neighborhood , 2004, Comput. Vis. Image Underst..

[2]  András Hajdu,et al.  General neighborhood sequences in Zn , 2007, Discret. Appl. Math..

[3]  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..

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

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

[6]  Donald G. Bailey,et al.  An Efficient Euclidean Distance Transform , 2004, IWCIA.

[7]  B. Nagy,et al.  Neighborhood sequences in the diamond grid: Algorithms with two and three neighbors , 2009 .

[8]  Ben J. H. Verwer,et al.  Local distances for distance transformations in two and three dimensions , 1991, Pattern Recognit. Lett..

[9]  Partha Pratim Das,et al.  Distance functions in digital geometry , 1987, Inf. Sci..

[10]  Toshihide Ibaraki,et al.  Distances defined by neighborhood sequences , 1986, Pattern Recognit..

[11]  Gunilla Borgefors,et al.  Hierarchical Chamfer Matching: A Parametric Edge Matching Algorithm , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Céline Fouard,et al.  Weighted distance transforms generalized to modules and their computation on point lattices , 2007, Pattern Recognit..

[13]  Benedek Nagy.  Distance with generalized neighbourhood sequences in n D and infinity D , 2008, Discret. Appl. Math..

[14]  Philippe Bolon,et al.  Discrete distance operator on rectangular grids , 1995, Pattern Recognit. Lett..

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

[16]  Céline Fouard,et al.  Generating Distance Maps with Neighbourhood Sequences , 2006, DGCI.

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

[18]  L. Hajdu,et al.  Lattice of generalized neighbourhood sequences in nD , 2003, 3rd International Symposium on Image and Signal Processing and Analysis, 2003. ISPA 2003. Proceedings of the.

[19]  Petros Maragos,et al.  Optimum design of chamfer distance transforms , 1998, IEEE Trans. Image Process..