Digital distance functions on three-dimensional grids

R Strand, B Nagy, G Borgefors - Theoretical Computer Science, 2011 - Elsevier
In this paper, we examine five different three-dimensional grids suited for image processing.
Digital distance functions are defined on the cubic, face-centered cubic, body-centered …

Fast exact Euclidean distance (FEED): A new class of adaptable distance transforms

TE Schouten, EL Van den Broek - IEEE transactions on pattern …, 2014 - ieeexplore.ieee.org
A new unique class of foldable distance transforms of digital images (DT) is introduced,
baptized: Fast exact euclidean distance (FEED) transforms. FEED class algorithms calculate …

[HTML][HTML] Distances based on neighbourhood sequences in non-standard three-dimensional grids

R Strand, B Nagy - Discrete Applied Mathematics, 2007 - Elsevier
Properties for distances based on neighbourhood sequences on the face-centred cubic (fcc)
and the body-centred cubic (bcc) grids are presented. Formulas to both compute the …

Distance Functions and Image Processing on Point-Lattices: with focus on the 3D face-and body-centered cubic grids

R Strand - 2008 - diva-portal.org
ACTA UNIVERSITATIS UPSALIENSIS Uppsala Dissertations from the Faculty of Science and
Technology 79 Page 1 ACTA UNIVERSITATIS UPSALIENSIS Uppsala Dissertations from the …

Weighted distances based on neighbourhood sequences

R Strand - Pattern Recognition Letters, 2007 - Elsevier
By combining weighted distances and distances based on neighbourhood sequences, a
new family of distance functions with potentially low rotational dependency is obtained. The …

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

B Nagy, R Strand - International Workshop on Combinatorial Image …, 2006 - Springer
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 …

[PDF][PDF] Choosing appropriate distance measurement in digital image segmentation

A Hajdu, J Kormos, B Nagy, Z Zörgo - Annales Univ. Sci. Budapest …, 2004 - academia.edu
In this paper we show how we can take advantage of using different distance functions in
image processing applications. The proposed methods are based on well-known algorithms …

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

N Normand, R Strand, P Evenou, A Arlicot - Computer Vision and Image …, 2013 - Elsevier
This paper presents a path-based distance, where local displacement costs vary both
according to the displacement vector and with the travelled distance. The corresponding …

[HTML][HTML] General neighborhood sequences in Zn

A Hajdu, L Hajdu, R Tijdeman - Discrete Applied Mathematics, 2007 - Elsevier
Neighborhoods and neighborhood sequences play important roles in several branches of
pattern analysis. In earlier papers in Zn only certain special (eg periodic or octagonal) …

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

J Mukherjee - Pattern recognition letters, 2011 - Elsevier
In this work, we propose a new class of distance functions called weighted t-cost distances.
This function maximizes the weighted contribution of different t-cost norms in n-dimensional …