Distances defined by neighborhood sequences
Pattern Recognition
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
Classification with Nonmetric Distances: Image Retrieval and Class Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometry of neighbourhood sequences
Pattern Recognition Letters
Fast Euclidean distance transformation in two scans using a 3 × 3 neighborhood
Computer Vision and Image Understanding
Fast Exact Euclidean Distance (FEED) Transformation
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Distances with neighbourhood sequences in cubic and triangular grids
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
Distance with generalized neighbourhood sequences in nD and ∞D
Discrete Applied Mathematics
General neighborhood sequences in Zn
Discrete Applied Mathematics
| Hi-index | 0.10 |
In this paper, we discuss a possible discrete approximation of non-metrical Minkowski distances. The existing approaches for Minkowski metrics considering distance functions based on local neighborhoods are not suitable for this task in their present form. We can overcome this difficulty with considering the minimum of such distance functions. In this way, we can take full advantage of the former theoretical and applied results. We consider several possibilities to measure the error of approximation and propose corresponding distance functions for optimal approximation. A fast chamfering algorithm is also provided to generate the approximate distance values for applications in digital domains.