A GRAPH-THEORETIC APPROACH TO DISTANCE TRANSFORMATIONS

被引：7

作者：

SHARAIHA, YM

CHRISTOFIDES, N

机构：

[1] Operational Research and Systems, The Management School, Imperial College of Science, Technology and Medicine, London, SW7 2PG

来源：

PATTERN RECOGNITION LETTERS | 1994年 / 15卷 / 10期

关键词：

DISTANCE TRANSFORMATION; CHAMBER DISTANCE; EUCLIDEAN DISTANCE; SHORTEST PATH; SKELETONIZATION;

D O I：

10.1016/0167-8655(94)90036-1

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We present a novel graph-theoretic approach to the Distance Transformation (DT) problem. The binary digital image is considered as a graph and the DT problem reduces to a shortest path forest problem. An algorithm is presented which solves the chamfer DT, and the Euclidian DT for a given bound.

引用

页码：1035 / 1041

页数：7

共 17 条

[11]

ROSENFEL.A, 1966, J ACM, V13, P471

[12] DISTANCE FUNCTIONS ON DIGITAL PICTURES [J].

ROSENFELD, A ;

PFALTZ, JL .

PATTERN RECOGNITION, 1968, 1 (01) :33-+

[13] DIGITAL TOPOLOGY [J].

ROSENFELD, A .

AMERICAN MATHEMATICAL MONTHLY, 1979, 86 (08) :621-630

[14]

SHARAIHA YM, 1991, THESIS IMPERIAL COLL

[15]

THIEL E, 1992, 11TH P INT C PATT RE

[16] DISTANCE TRANSFORMATIONS IN DIGITAL IMAGES [J].

VOSSEPOEL, AM .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1988, 43 (01) :88-97

[17]

Yamada H., 1984, Seventh International Conference on Pattern Recognition (Cat. No. 84CH2046-1), P69

← 1 2 →