Approximating euclidean distance using distances based on neighbourhood sequences in non-standard three-dimensional grids

Authors:
Benedek Nagy;Robin Strand
Affiliations:
Department of Computer Science, Faculty of Informatics, University of Debrecen, Debrecen, Hungary;Centre for Image Analysis, Uppsala University, Uppsala, Sweden
Venue:
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Year:
2006

Citing 11
Cited 8

Distances defined by neighborhood sequences

Pattern Recognition
Distance transformations in digital images

Computer Vision, Graphics, and Image Processing
Generalized distances in digital geometry

Information Sciences: an International Journal
Distance functions in digital geometry

Information Sciences: an International Journal
Octagonal distances for digital pictures

Information Sciences: an International Journal
Local distances for distance transformations in two and three dimensions

Pattern Recognition Letters
Best simple octagonal distances in digital geometry

Journal of Approximation Theory
Sequential Operations in Digital Picture Processing

Journal of the ACM (JACM)
On approximating Euclidean metrics by digital distances in 2D and 3D

Pattern Recognition Letters
Surface Skeletons in Grids with Non-Cubic Voxels

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Distance transforms for three-dimensional grids with non-cubic voxels

Computer Vision and Image Understanding

Weighted distances based on neighbourhood sequences

Pattern Recognition Letters
Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids

Discrete Applied Mathematics
Neighborhood Sequences on nD Hexagonal/Face-Centered-Cubic Grids

IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Weighted neighborhood sequences in non-standard three-dimensional grids: parameter optimization

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Digital distance functions on three-dimensional grids

Theoretical Computer Science
On approximating Euclidean metrics by weighted t-cost distances in arbitrary dimension

Pattern Recognition Letters
Hyperspheres of weighted distances in arbitrary dimension

Pattern Recognition Letters
Linear combination of weighted t-cost and chamfering weighted distances

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In image processing, it is often of great importance to have small rotational dependency for distance functions. We present an optimization for distances based on neighbourhood sequences for the face-centered cubic (fcc) and body-centered cubic (bcc) grids. In the optimization, several error functions are used measuring different geometrical properties of the balls obtained when using these distances.