Geometry of neighbourhood sequences

Authors:
András Hajdu
Affiliations:
Institute of Mathematics and Informatics, University of Debrecen, P.O. Box 12, H-4010 Debrecen, Hungary
Venue:
Pattern Recognition Letters
Year:
2003

Citing 5
Cited 6

Distance functions in digital geometry

Information Sciences: an International Journal
Octagonal distances for digital pictures

Information Sciences: an International Journal
Hyperspheres in digital geometry

Information Sciences: an International Journal
On approximating Euclidean metrics by digital distances in 2D and 3D

Pattern Recognition Letters
On the rectangular grid representation of general CNN networks: Research Articles

International Journal of Circuit Theory and Applications - CNN Technology

Metrical neighborhood sequences in Zn

Pattern Recognition Letters
Distances based on neighbourhood sequences in non-standard three-dimensional grids

Discrete Applied Mathematics
General neighborhood sequences in Zn

Discrete Applied Mathematics
Approximating non-metrical Minkowski distances in 2D

Pattern Recognition Letters
Distance with generalized neighbourhood sequences in nD and ∞D

Discrete Applied Mathematics
Neighborhood sequences and their applications in the digital image processing

CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns

Quantified Score

Hi-index	0.10

Visualization

Abstract

In this paper we generalize some former results of Das and Chatterji [Inform. Sci. 50 (1990) 123] about geometric properties of two-dimensional periodic neighbourhood sequences. We use a more general definition of neighbourhood sequences, which does not require periodicity. As an extension of the former 2D results, we study the geometric behavior of general neighbourhood sequences in arbitrary finite dimension. Since 2D and 3D digital spaces are the most important in digital geometry and in digital image processing, we study these spaces in detail.