Abstract
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and body-centered cubic grids is presented. Conditions for the algorithm to produce correct results are derived using a path-based approach. Previous sequential algorithms for this task have been based on algorithms that compute the digital Euclidean distance transform. It is shown that the latter approach is not well-suited for distances based on neighbourhood sequences.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. Journal of the ACM 13(4), 471–494 (1966)
Rosenfeld, A., Pfaltz, J.L.: Distance functions in digital pictures. Pattern Recognition 1(1), 33–61 (1968)
Borgefors, G.: Distance transformations in arbitrary dimensions. Computer Vision, Graphics, and Image Processing 27, 321–345 (1984)
Fouard, C., Strand, R., Borgefors, G.: Weighted distance transforms generalized to modules and their computation on point lattices. Technical report, Centre for Image Analysis, Uppsala University, Uppsala, Sweden (Internal report 38) (2006)
Yamashita, M., Honda, N.: Distance functions defined by variable neighbourhood sequences. Pattern Recognition 17(5), 509–513 (1984)
Das, P.P., Chakrabarti, P.P., Chatterji, B.N.: Distance functions in digital geometry. Information Sciences 42, 113–136 (1987)
Kumar, M.A., Chatterji, B.N., Mukherjee, J., Das, P.P.: Representation of 2D and 3D binary images using medial circles and spheres. International Journal of Pattern Recognition and Artificial Intelligence 10(4), 365–387 (1996)
Mukherjee, J., Kumar, M.A., Chatterji, B.N., Das, P.P.: Discrete shading of three-dimensional objects from medial axis transform. Pattern Recognition Letters 20(14), 1533–1544 (1999)
Danielsson, P.E.: Euclidean distance mapping. Computer Graphics and Image Processing 14, 227–248 (1980)
Danielsson, P.E.: Minimal error octagonal metric in two and three dimensions. Internal report LiTH-ISY-1-1382, Linköping University, Linköping, Sweden (1992)
Ragnemalm, I.: The Euclidean distance transform in arbitrary dimensions. Pattern Recognition Letters 14(11), 883–888 (1993)
Matej, S., Lewitt, R.M.: Efficient 3D grids for image reconstruction using spherically-symmetric volume elements. IEEE Transactions on Nuclear Science 42(4), 1361–1370 (1995)
Garduno, E., Herman, G.T.: Optimization of basis functions for both reconstruction and visualization. Electronic Notes in Theoretical Computer Science 46, 1–17 (2001)
Strand, R., Borgefors, G.: Distance transforms for three-dimensional grids with non-cubic voxels. Computer Vision and Image Understanding 100(3), 294–311 (2005)
Strand, R.: The euclidean distance transform applied to the FCC and BCC grids. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol. 3522, pp. 243–250. Springer, Heidelberg (2005)
Carvalho, B.M., Garduño, E., Herman, G.T.: Multiseeded fuzzy segmentation on the face centered cubic grid. In: Singh, S., Murshed, N., Kropatsch, W.G. (eds.) ICAPR 2001. LNCS, vol. 2013, p. 339. Springer, Heidelberg (2001)
Theussl, T., Möller, T., Gröller, M.E.: Optimal regular volume sampling. In: VIS 2001: Proceedings of the conference on Visualization 2001, pp. 91–98. IEEE Computer Society, Washington (2001)
Nagy, B.: Distance functions based on neighbourhood sequences. Publicationes Mathematicae Debrecen 63(3), 483–493 (2003)
Strand, R., Nagy, B.: Some properties for distances based on neighbourhood sequences in the face-centered cubic grid and the body-centered cubic grid. Technical report, Centre for Image Analysis, Uppsala University, Uppsala, Sweden (Internal Report 39) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Strand, R., Nagy, B., Fouard, C., Borgefors, G. (2006). Generating Distance Maps with Neighbourhood Sequences. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds) Discrete Geometry for Computer Imagery. DGCI 2006. Lecture Notes in Computer Science, vol 4245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11907350_25
Download citation
DOI: https://doi.org/10.1007/11907350_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47651-1
Online ISBN: 978-3-540-47652-8
eBook Packages: Computer ScienceComputer Science (R0)