Weighted Distances Based on Neighborhood Sequences for Point-Lattices
2009 (English)In: Discrete Applied Mathematics, ISSN 0166-218X, Vol. 157, no 4, 641-652 p.Article in journal (Refereed) Published
A path-based distance is defined as the minimal cost-path between two points. One such distance function is the weighted distance based on a neighborhood sequence. It can be defined using any number of neighborhood relations and weights in conjunction with a neighborhood sequence. The neighborhood sequence restricts some steps in the path to a smaller neighborhood. We give formulas for computing the point-to-point distance and conditions for metricity for weighted distances based on neighborhood sequences with two neighborhood relations for the general case of point-lattices.
Place, publisher, year, edition, pages
Elsevier , 2009. Vol. 157, no 4, 641-652 p.
Digital geometry, Distance functions, Image processing, Neighborhood sequences
Computer and Information Science
Research subject Computerized Image Analysis
IdentifiersURN: urn:nbn:se:uu:diva-109541DOI: 10.1016/j.dam.2008.08.019ISI: 000264226600006ISBN: 978-3-540-89645-6OAI: oai:DiVA.org:uu-109541DiVA: diva2:272762