Abstract
This article presents a nearest neighbor transform for gray-level surfaces. It is based on the Distance Transform on Curved Space (DTOCS) calculated using an efficient priority pixel queue algorithm. A simple extension of the algorithm produces the nearest neighbor transform simultaneously with the distance map. The transformations can be applied for example to estimate surface roughness.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Borgefors, G.: Distance Transformations in Digital Images. Computer Vision, Graphics, and Image Processing 34, 344–371 (1986)
Breu, H., Gil, J., Kirkpatrick, D., Werman, M.: Linear time Euclidean distance transform algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(5), 529–533 (1995)
Cuisenaire, O., Macq, B.: Fast Euclidean distance transformation by propagation using multiple neighborhoods. Computer Vision and Image Understanding 76(2), 163–172 (1999)
Ikonen, L.: Pixel queue algorithm for geodesic distance transforms. In: Discrete Geometry for Computer Imagery (DGCI), Poitiers, France, April 2005, pp. 228–239 (2005)
Ikonen, L., Toivanen, P.: Shortest routes on varying height surfaces using gray-level distance transforms. Image and Vision Computing 23(2), 133–141 (2005)
Kapoutsis, C.A., Vavoulidis, C.P., Pitas, I.: Morphological iterative closest point algorithm. IEEE Transactions on Image Processing 8(11), 1644–1646 (1999)
Maurer, C.R., Qi, R., Raghavan, V.: A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(2), 265–270 (2003)
Paglieroni, D.W.: Distance Transforms: Properties and Machine Vision Applications. CVGIP: Graphical Models and Image Processing 54(1), 56–74 (1992)
Piper, J., Granum, E.: Computing Distance Transformations in Convex and Non-convex Domains. Pattern Recognition 20(6), 599–615 (1987)
Rosenfeld, A., Pfaltz, J.L.: Sequential Operations in Digital Picture Processing. Journal of the Association for Computing Machinery 13(4), 471–494 (1966)
Silvela, J., Portillo, J.: Breadth-first search and its application to image processing problems. IEEE Transactions on Image Processing 10(8), 1194–1199 (2001)
Soille, P.: Morphological Image Processing: Principles and Applications, 2nd edn. Springer, Heidelberg (2003)
Toivanen, P.J.: New geodesic distance transforms for gray-scale images. Pattern Recognition Letters 17, 437–450 (1996)
Toivanen, P.J., Vepsäläinen, A.M., Parkkinen, J.P.S.: Image compression using distance transform on curved space (DTOCS) and Delaunay triangulation. Pattern Recognition Letters 20, 1015–1026 (1999)
Verwer, B.J.H., Verbeek, P.W., Dekker, S.T.: An efficient uniform cost algorithm applied to distance transforms. IEEE Trans. on Pattern Analysis and Machine Intelligence 11(4), 425–429 (1989)
Vincent, L.: New trends in morphological algorithms. In: Proc. SPIE/SPSE, vol. 1451, pp. 158–170 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ikonen, L., Toivanen, P. (2005). Distance and Nearest Neighbor Transforms of Gray-Level Surfaces Using Priority Pixel Queue Algorithm. In: Blanc-Talon, J., Philips, W., Popescu, D., Scheunders, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2005. Lecture Notes in Computer Science, vol 3708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558484_39
Download citation
DOI: https://doi.org/10.1007/11558484_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29032-2
Online ISBN: 978-3-540-32046-3
eBook Packages: Computer ScienceComputer Science (R0)