Distance functions defined by variable neighborhood sequences

Masafumi Yamashita, Namio Honda

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

In the field of pattern recognition, many researchers adopt the definition that distance between two points x and y on digitized space is the length of the shortest path from x to y determined by a specific sequence of neighborhood forms. The diamond distance and various octagonal distances are typical examples of these kinds of distances. However, not necessarily every sequence of neighborhood forms does define a distance function. Thus, in this paper, we present a necessary and sufficient condition for a sequence of neighborhood forms to define a distance function. Two applications of this condition are also presented.

Original languageEnglish
Pages (from-to)509-513
Number of pages5
JournalPattern Recognition
Volume17
Issue number5
DOIs
Publication statusPublished - Jan 1 1984

Fingerprint

Pattern recognition
Diamonds

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this

Distance functions defined by variable neighborhood sequences. / Yamashita, Masafumi; Honda, Namio.

In: Pattern Recognition, Vol. 17, No. 5, 01.01.1984, p. 509-513.

Research output: Contribution to journalArticle

Yamashita, Masafumi ; Honda, Namio. / Distance functions defined by variable neighborhood sequences. In: Pattern Recognition. 1984 ; Vol. 17, No. 5. pp. 509-513.
@article{eeab8158470f415da687a67699efaa98,
title = "Distance functions defined by variable neighborhood sequences",
abstract = "In the field of pattern recognition, many researchers adopt the definition that distance between two points x and y on digitized space is the length of the shortest path from x to y determined by a specific sequence of neighborhood forms. The diamond distance and various octagonal distances are typical examples of these kinds of distances. However, not necessarily every sequence of neighborhood forms does define a distance function. Thus, in this paper, we present a necessary and sufficient condition for a sequence of neighborhood forms to define a distance function. Two applications of this condition are also presented.",
author = "Masafumi Yamashita and Namio Honda",
year = "1984",
month = "1",
day = "1",
doi = "10.1016/0031-3203(84)90048-7",
language = "English",
volume = "17",
pages = "509--513",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "5",

}

TY - JOUR

T1 - Distance functions defined by variable neighborhood sequences

AU - Yamashita, Masafumi

AU - Honda, Namio

PY - 1984/1/1

Y1 - 1984/1/1

N2 - In the field of pattern recognition, many researchers adopt the definition that distance between two points x and y on digitized space is the length of the shortest path from x to y determined by a specific sequence of neighborhood forms. The diamond distance and various octagonal distances are typical examples of these kinds of distances. However, not necessarily every sequence of neighborhood forms does define a distance function. Thus, in this paper, we present a necessary and sufficient condition for a sequence of neighborhood forms to define a distance function. Two applications of this condition are also presented.

AB - In the field of pattern recognition, many researchers adopt the definition that distance between two points x and y on digitized space is the length of the shortest path from x to y determined by a specific sequence of neighborhood forms. The diamond distance and various octagonal distances are typical examples of these kinds of distances. However, not necessarily every sequence of neighborhood forms does define a distance function. Thus, in this paper, we present a necessary and sufficient condition for a sequence of neighborhood forms to define a distance function. Two applications of this condition are also presented.

UR - http://www.scopus.com/inward/record.url?scp=0021644150&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021644150&partnerID=8YFLogxK

U2 - 10.1016/0031-3203(84)90048-7

DO - 10.1016/0031-3203(84)90048-7

M3 - Article

AN - SCOPUS:0021644150

VL - 17

SP - 509

EP - 513

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 5

ER -