Skeleton location and evaluation based on local digital width in ribbon-like images

被引:5
作者
Marchand-Maillet, S [1 ]
Sharaiha, YM [1 ]
机构
[1] Univ London Imperial Coll Sci Technol & Med, Sch Management, London SW7 2PG, England
基金
英国工程与自然科学研究理事会;
关键词
binary image; line image; image feature; skeletonisation; graph theory;
D O I
10.1016/S0031-3203(97)00008-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we present a model for characterising the skeleton of line images. For comparative purposes, we base our theoretical model formulation on the ideal ribbon-like non-branching image. The model developed is first contrasted with Blum's model and the wave propagation model. The aim of the proposed model is to avoid spurious branches of the skeleton and to refine the definition of centrality at sharp angles of the input image. The underlying concept of this model is based on a new definition for local width, derived from the idea of minimum base segment. This is first introduced in the real space, and then discretised for characterising a discrete skeleton. A graph theoretic approach, which is model-independent, is introduced for locating skeletons of non-branching images. By applying the graph-theoretic algorithm, performance evaluation of the proposed model is contrasted with Blum's original model by investigating reconstruction performance of the output skeletons. (C) 1997 Pattern Recognition Society. Published by Elsevier Science Ltd.
引用
收藏
页码:1855 / 1865
页数:11
相关论文
共 28 条
[1]   EUCLIDEAN SKELETON VIA CENTER-OF-MAXIMAL-DISC EXTRACTION [J].
ARCELLI, C ;
DIBAJA, GS .
IMAGE AND VISION COMPUTING, 1993, 11 (03) :163-173
[2]  
ARCELLI C, 1992, VISUAL FORM, P21
[3]   FROM LOCAL MAXIMA TO CONNECTED SKELETONS [J].
ARCELLI, C ;
CORDELLA, LP ;
LEVIALDI, S .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1981, 3 (02) :134-143
[4]   FINDING LOCAL MAXIMA IN A PSEUDO-EUCLIDEAN DISTANCE TRANSFORM [J].
ARCELLI, C ;
DIBAJA, GS .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1988, 43 (03) :361-367
[5]  
Blum H., 1967, MODELS PERCEPTION SP, P362, DOI DOI 10.1142/S0218654308001154
[6]   DISTANCE TRANSFORMATIONS IN DIGITAL IMAGES [J].
BORGEFORS, G .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 34 (03) :344-371
[7]  
CHASSERY JM, 1991, GEOMETRIE DSCRETE AN
[8]   THINNING ALGORITHMS - A CRITIQUE AND A NEW METHODOLOGY [J].
DAVIES, ER ;
PLUMMER, APN .
PATTERN RECOGNITION, 1981, 14 (1-6) :53-63
[9]   SHORTEST-PATH FOREST WITH TOPOLOGICAL ORDERING [J].
DIAL, RB .
COMMUNICATIONS OF THE ACM, 1969, 12 (11) :632-&
[10]  
DIBAJA GS, 1994, PATTERN RECOGN, V27, P1039, DOI 10.1016/0031-3203(94)90143-0