Shortest routes on varying height surfaces using gray-level distance transforms

Authors:
Leena Ikonen;Pekka Toivanen
Affiliations:
Department of Information Technology, Lappeenranta University of Technology, P.O. Box 20, Lappeenranta FIN-53851, Finland;Department of Information Technology, Lappeenranta University of Technology, P.O. Box 20, Lappeenranta FIN-53851, Finland
Venue:
Image and Vision Computing
Year:
2005

Citing 12
Cited 8

Grayscale morphology

Computer Vision, Graphics, and Image Processing
Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
Computing distance transformations in convex and non-convex domains

Pattern Recognition
Image compression by selecting control points using distance function on curved space

Pattern Recognition Letters
Generalized geodesy via geodesic time

Pattern Recognition Letters
New geodesic distance transforms for gray-scale images

Pattern Recognition Letters
On digital distance transforms in three dimensions

Computer Vision and Image Understanding
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
Finding Shortest Paths on Surfaces Using Level Sets Propagation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fuzzy distance transform: theory, algorithms, and applications

Computer Vision and Image Understanding
Shortest route on gray-level map using distance transform on curved space

SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
Shortest path planning on topographical maps

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Distance and nearest neighbor transforms on gray-level surfaces

Pattern Recognition Letters
Priority pixel queue algorithm for geodesic distance transforms

Image and Vision Computing
A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance

Journal of Intelligent and Robotic Systems
Morphological Amoebas Are Self-snakes

Journal of Mathematical Imaging and Vision
Distance and nearest neighbor transforms of gray-level surfaces using priority pixel queue algorithm

ACIVS'05 Proceedings of the 7th international conference on Advanced Concepts for Intelligent Vision Systems
Distance transforms on anisotropic surfaces for surface roughness measurement

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Pixel queue algorithm for geodesic distance transforms

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Amoeba active contours

SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

The distance transform on curved space (DTOCS) and its locally Euclidean modification weighted DTOCS (WDTOCS) calculate distances along gray-level surfaces. This article presents the Route DTOCS algorithm for finding and visualizing the shortest route between two points on a gray-level height map, and also introduces new distance definitions producing more accurate global distances. The algorithm is very simple to implement, and finds all optimal paths between the two points at once. The Route DTOCS is an efficient 2D approach to finding routes on a 3D surface. It also provides a more flexible solution to obstacle avoidance problems than the constrained distance transform.