Abstract
This article presents an algorithm for finding and visualizing the shortest route between two points on a gray-level height map. The route is computed using gray-level distance transforms, which are variations of the Distance Transform on Curved Space (DTOCS). The basic Route DTOCS uses the chessboard kernel for calculating the distances between neighboring pixels, but variations, which take into account the larger distance between diagonal pixels, produce more accurate results, particularly for smooth and simple image surfaces. The route opimization algorithm is implemented using the Weighted Distance Transform on Curved Space (WDTOCS), which computes the piecewise Euclidean distance along the image surface, and the results are compared to the original Route DTOCS. The implementation of the algorithm is very simple, regardless of which distance definition is used.
Chapter PDF
Similar content being viewed by others
References
Borgefors, G.: Distance Transformations in Digital Images. Computer vision, Graphics, and Image Processing 34, 344–371 (1986)
Ikonen, L., Toivanen, P., Tuominen, J.: Shortest Route on Gray-Level Map using Distance Transform on Curved Space. In: Proc. of Scandinavian Conference on Image Analysis, pp. 305–310 (2003)
Kimmel, R., Amir, A., Bruckstein, A.: Finding Shortest Paths on Surfaces Using Level Sets Propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence 17(6), 635–640 (1995)
Kimmel, R., Kiryati, N.: Finding Shortest Paths on Surfaces by Fast Global Approximation and Precise Local Refinement. International Journal of Pattern Recognition and Artificial Intelligence 10, 643–656 (1996)
Lin, P., Chang, S.: A Shortest Path Algorithm for a Nonrotating Object Among Obstacles of Arbitrary Shapes. IEEE Transactions on Systems, Man, and Cybernetics 23(3), 825–833 (1993)
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)
Rosin, P., West, G.: Salience Distance Transforms. Graphical Models and Image Processing 56(6), 483–521 (1995)
Saha, P.K., Wehrli, F.W., Gomberg, B.R.: Fuzzy Distance Transform: Theory, Algorithms and Applications. Computer Vision and Image Understanding 86, 171–190 (2002)
Saab, Y., VanPutte, M.: Shortest Path Planning on Topographical Maps. IEEE Transactions on Systems, Man, and Cybernetics–Part A: Systems and Humans 29(1), 139–150 (1999)
Toivanen, P.J.: Convergence properties of the Distance Transform on Curved Space (DTOCS). In: Proc. of Finnish Signal Processing Symposium, pp. 75–79 (1995)
Toivanen, P.J.: Image Compression by Selecting Control Points Using Distance Function on Curved Space. Pattern Recognition Letters 14, 475–482 (1993)
Toivanen, P.: New geodesic distance transforms for gray-scale images. Pattern Recognition Letters 17, 437–450 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ikonen, L., Toivanen, P. (2003). Shortest Route on Height Map Using Gray-Level Distance Transforms. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2003. Lecture Notes in Computer Science, vol 2886. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39966-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-39966-7_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20499-2
Online ISBN: 978-3-540-39966-7
eBook Packages: Springer Book Archive