### 抜粋

This paper investigates general properties of distance functions defined over digitized space. We assume that a distance between two points is defined as the length of a shortest path connecting them in the underlying graph which is defined by a given neighborhood sequence. Many typical distance functions can be described in this form, but there are cases in which given neighborhood sequence do not define distance functions. We first derive a necessary and sufficient condition for a neighborhood sequence to define a distance function. We then discuss another important problem of estimating how tight such distances can approximate the Euclid distance from the view point of relative error and absolute error.

元の言語 | 英語 |
---|---|

ページ（範囲） | 237-246 |

ページ数 | 10 |

ジャーナル | Pattern Recognition |

巻 | 19 |

発行部数 | 3 |

DOI | |

出版物ステータス | 出版済み - 1986 |

### All Science Journal Classification (ASJC) codes

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

### これを引用

*Pattern Recognition*,

*19*(3), 237-246. https://doi.org/10.1016/0031-3203(86)90014-2