抄録
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
- ソフトウェア
- 信号処理
- コンピュータ ビジョンおよびパターン認識
- 人工知能