On weighted distances on the Khalimsky grid
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag service@springer.de
Access Rights
info:eu-repo/semantics/closedAccess
Abstract
In this paper we introduce the weighted distances on the Khalimsky grid. There are two types of natural neighborhood relations and one semi-neighborhood is also defined. Based on them two types of weighted distances are defined. We give formulae for computing the weighted distance of any point-pair on the Khalimsky grid in both cases. © Springer International Publishing Switzerland 2016.
Description
19th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2016 -- 2016-04-18 through 2016-04-20 -- Nantes -- 173609
Keywords
Artificial intelligence, Computer science, Computers, Neighborhood relation, Weighted distance, Geometry
Journal or Series
Lecture Notes in Computer Science
WoS Q Value
Scopus Q Value
Volume
9647
