Generating distance maps with neighbourhood sequences

Authors:
Robin Strand;Benedek Nagy;Céline Fouard;Gunilla Borgefors
Affiliations:
Centre for Image Analysis, Uppsala University, Uppsala, Sweden;Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary;Centre for Image Analysis, Uppsala University, Uppsala, Sweden;Centre for Image Analysis, Swedish University of Agricultural Sciences, Uppsala, Sweden
Venue:
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Year:
2006

Citing 8
Cited 6

Distance functions in digital geometry

Information Sciences: an International Journal
The Euclidean distance transform in arbitrary dimensions

Pattern Recognition Letters
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
Optimal regular volume sampling

Proceedings of the conference on Visualization '01
Multiseeded Fuzzy Segmentation on the Face Centered Cubic Grid

ICAPR '01 Proceedings of the Second International Conference on Advances in Pattern Recognition
Optimization of basis functions for both reconstruction and visualization

Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Distance transforms for three-dimensional grids with non-cubic voxels

Computer Vision and Image Understanding
The euclidean distance transform applied to the FCC and BCC grids

IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part I

Distance with generalized neighbourhood sequences in nD and ∞D

Discrete Applied Mathematics
On approximating Euclidean metrics by weighted t-cost distances in arbitrary dimension

Pattern Recognition Letters
Path-based distance with varying weights and neighborhood sequences

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Distance transform computation for digital distance functions

Theoretical Computer Science
Minimal-delay distance transform for neighborhood-sequence distances in 2D and 3D

Computer Vision and Image Understanding
Approximation of the euclidean distance by Chamfer distances

Acta Cybernetica

Quantified Score

Hi-index	0.00

Visualization

Abstract

A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and body-centered cubic grids is presented Conditions for the algorithm to produce correct results are derived using a path-based approach Previous sequential algorithms for this task have been based on algorithms that compute the digital Euclidean distance transform It is shown that the latter approach is not well-suited for distances based on neighbourhood sequences.