Distance transform computation for digital distance functions

Authors:
Robin Strand;Nicolas Normand
Affiliations:
Centre for Image Analysis, Uppsala University, Box 337, SE-75105 Uppsala, Sweden;LUNAM Université, Université de Nantes, IRCCyN UMR CNRS 6597, Polytech Nantes, La Chantrerie, 44306 Nantes Cedex 3, France
Venue:
Theoretical Computer Science
Year:
2012

Citing 15
Cited 0

Distances defined by neighborhood sequences

Pattern Recognition
Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
Hierarchical Chamfer Matching: A Parametric Edge Matching Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
On digital distance transforms in three dimensions

Computer Vision and Image Understanding
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance

Journal of the ACM (JACM)
A background based adaptive page segmentation algorithm

ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 1) - Volume 1
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)
Distances with neighbourhood sequences in cubic and triangular grids

Pattern Recognition Letters
Weighted distance transforms generalized to modules and their computation on point lattices

Pattern Recognition
Weighted distances based on neighbourhood sequences

Pattern Recognition Letters
General neighborhood sequences in Zn

Discrete Applied Mathematics
Real-time traffic sign recognition from video by class-specific discriminative features

Pattern Recognition
Digital distance functions on three-dimensional grids

Theoretical Computer Science
Generating distance maps with neighbourhood sequences

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery

Quantified Score

Hi-index	5.23

Visualization

Abstract

In image processing, the distance transform (DT), in which each object grid point is assigned the distance to the closest background grid point, is a powerful and often used tool. In this paper, distance functions defined as minimal cost-paths are used and a number of algorithms that can be used to compute the DT are presented. We give proofs of the correctness of the algorithms.