Distance functions defined by variable neighborhood sequences

Masafumi Yamashita, Namio Honda

研究成果: Contribution to journalArticle査読

32 被引用数 (Scopus)

抄録

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.

本文言語英語
ページ(範囲)509-513
ページ数5
ジャーナルPattern Recognition
17
5
DOI
出版ステータス出版済み - 1 1 1984

All Science Journal Classification (ASJC) codes

  • ソフトウェア
  • 信号処理
  • コンピュータ ビジョンおよびパターン認識
  • 人工知能

フィンガープリント

「Distance functions defined by variable neighborhood sequences」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル