Sammanfattning
By combining weighted distances and distances based on neighbourhood sequences, a new family of distance functions with potentially low rotational dependency is obtained. The basic theory for these distance functions, including functional form of the distance between two points, is presented. By minimizing an error function, the weights and neighbourhood sequence that give the distance function with the lowest rotational dependency are derived. To verify that the low rotational dependency of the proposed distance function is valid also in applications, the constrained distance transform on a binary image is computed and compared with some traditionally used distance functions. (C) 2007 Elsevier B.V. All rights reserved.
Nyckelord
digital geometry; distance functions; neighbourhood sequences; weighted distance; discrete geometry
Publicerad i
Pattern Recognition Letters
2007, volym: 28, nummer: 15, sidor: 2029-2036
Utgivare: Elsevier
UKÄ forskningsämne
Datorgrafik och datorseende
Publikationens identifierare
- DOI: https://doi.org/10.1016/j.patrec.2007.05.016
Permanent länk till denna sida (URI)
https://res.slu.se/id/publ/17133