EUCLIDEAN SKELETON VIA CENTER-OF-MAXIMAL-DISC EXTRACTION

被引:61
作者
ARCELLI, C
DIBAJA, GS
机构
[1] Istituto di Cibernctica, CNR, Naples, Via Toiano 6
关键词
EUCLIDEAN DISTANCE MAP; CENTER-OF-MAXIMAL-DISC; SKELETONIZATION;
D O I
10.1016/0262-8856(93)90055-L
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A skeletonization algorithm is presented, characterized by two main features: invariance under isometric transformations of the pattern, and recoverability. The algorithm is driven by the Euclidean distance map of the pattern. Invariance under isometric transformations is guaranteed due to the use of the Euclidean distance to compute the distance map; recoverability is guaranteed by the inclusion in the set of the skeletal pixels of the centres Of the maximal discs. The skeletonization algorithm includes a beautifying step and a pruning step, which favour the use of the skeleton for shape analysis tasks.
引用
收藏
页码:163 / 173
页数:11
相关论文
共 14 条
[11]   ARCS AND CURVES IN DIGITAL PICTURES [J].
ROSENFELD, A .
JOURNAL OF THE ACM, 1973, 20 (01) :81-87
[12]  
Rosenfeld A., 1982, DIGITAL PICTURE PROC, V2nd
[13]   PATTERN RECOGNITION [J].
RUTOVITZ, D .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES A-GENERAL, 1966, 129 :504-530
[14]  
YOKOI S, 1975, COMPUT GRAPHICS IMAG, V4, P63