Fast and accurate geodesic distance transform by ordered propagation

Authors:
Rubén Cárdenes;Carlos Alberola-López;Juan Ruiz-Alzola
Affiliations:
Laboratory of Image Processing, University of Valladolid, Spain;Laboratory of Image Processing, University of Valladolid, Spain;University of Las Palmas de Gran Canaria, Spain and Canary Islands Institute of Technology, Spain
Venue:
Image and Vision Computing
Year:
2010

Citing 10
Cited 1

Distance transformations in digital images

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

Pattern Recognition
An Efficient Uniform Cost Algorithm Applied to Distance Transforms

IEEE Transactions on Pattern Analysis and Machine Intelligence
The Euclidean distance transform in arbitrary dimensions

Pattern Recognition Letters
Fast k-NN classification for multichannel image data

Pattern Recognition Letters
Sub-pixel distance maps and weighted distance transforms

Journal of Mathematical Imaging and Vision - Special issue on topology and geometry in computer vision
Global Minimum for Active Contour Models: A Minimal Path Approach

CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
Watersheds on the Cortical Surface for Automated Sulcal Segmentation

MMBIA '00 Proceedings of the IEEE Workshop on Mathematical Methods in Biomedical Image Analysis
2D and 3D visibility in discrete geometry: an application to discrete geodesic paths

Pattern Recognition Letters - Special issue: Discrete geometry for computer imagery (DGCI'2002)
Memory efficient propagation-based watershed and influence zone algorithms for large images

IEEE Transactions on Image Processing

Shape description by bending invariant moments

CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new geodesic distance transform that uses a non-Euclidean metric suitable for non-convex discrete 2D domains. The geodesic metric used is defined as the shortest path length through a set of pixels called Locally Nearest Hidden Pixels, and manages visibility zones using bounding angles. The algorithm is designed using ordered propagation, which makes it extremely efficient and linear in the number of pixels in the domain. We have compared our algorithm with the four most similar geodesic distance transform techniques, and we show that our approach has higher accuracy and lower computational complexity.