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 条

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

BORGEFORS, G .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 34 (03) :344-371

[2] DISTANCE TRANSFORMATIONS IN ARBITRARY DIMENSIONS [J].

BORGEFORS, G .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1984, 27 (03) :321-345

[3] EUCLIDEAN DISTANCE MAPPING [J].

DANIELSSON, PE .

COMPUTER GRAPHICS AND IMAGE PROCESSING, 1980, 14 (03) :227-248

[4] COMPUTATIONAL ANALYSIS OF ALTERNATIVE ALGORITHMS AND LABELING TECHNIQUES FOR FINDING SHORTEST PATH TREES [J].

DIAL, R ;

GLOVER, F ;

KARNEY, D ;

KLINGMAN, D .

NETWORKS, 1979, 9 (03) :215-248

[5]

DIAL R, 1969, COMM ASS COMPUT MACH, V1, P632

[6]

FORCHHAMMER S, 1989, 6TH P SCAND C IM AN, P393

[7]

Gallo G., 1988, Annals of Operations Research, V13, P3

[8] A METHOD FOR OBTAINING SKELETONS USING A QUASI-EUCLIDEAN DISTANCE [J].

MONTANARI, U .

JOURNAL OF THE ACM, 1968, 15 (04) :600-+

[9]

Moore E.F., 1957, P INT S THEOR SWITCH, P285

[10]

RAGNEMALM I, 1990, THESIS LINKOPING U L

← 1 2 →