Neighborhood sequences in the diamond grid: Algorithms with two and three neighbors

Authors:
Benedek Nagy;Robin Strand
Affiliations:
Department of Computer Science, University of Debrecen, Hungary;Centre for Image Analysis, Uppsala University, Uppsala, Sweden
Venue:
International Journal of Imaging Systems and Technology - Contemporary Challenges in Combinatorial Image Analysis
Year:
2009

Citing 0
Cited 3

Neighborhood Sequences in the Diamond Grid --- Algorithms with Four Neighbors

IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Digital distance functions on three-dimensional grids

Theoretical Computer Science
Approximation of the euclidean distance by Chamfer distances

Acta Cybernetica

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the digital image processing, digital distances are useful; distances based on neighborhood sequences are widely used. In this article, the diamond grid is considered, that is, the three-dimensional grid of carbon atoms in the diamond crystal. An algorithm to compute a shortest path defined by a neighborhood sequence between any two points in the diamond grid is presented. A formula to compute the distance based on neighborhood sequences with two neighborhood relations is given. The metric and nonmetric properties of some distances based on neighborhood sequences are also discussed. Finally, the constrained distance transformation is shown. © 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 146–157, 2009.