On the generation and pruning of skeletons using generalized Voronoi diagrams

被引:20
作者
Liu, Hongzhi [1 ,4 ,5 ]
Wu, Zhonghai [1 ,2 ]
Hsu, D. Frank [3 ]
Peterson, Bradley S. [4 ,5 ]
Xu, Dongrong [4 ,5 ]
机构
[1] Peking Univ, Sch Elect Engn & Comp Sci, Beijing 100871, Peoples R China
[2] Peking Univ, Sch Software & Microelect, Beijing 102600, Peoples R China
[3] Fordham Univ, Dept Comp & Informat Sci, New York, NY 10023 USA
[4] Columbia Univ, MRI Unit, Dept Psychiat, New York, NY 10032 USA
[5] New York State Psychiat Inst & Hosp, New York, NY 10032 USA
关键词
Skeletonization; Generalized Voronoi diagram; Skeleton pruning; Reconstruction contribution; Visual contribution; Generalized Voronoi skeleton (GVS); DISTANCE MAPS; POLYGONAL-APPROXIMATION; ALGORITHM; CURVES; SHAPE; EXTRACTION; EVOLUTION; IMAGES; BINARY;
D O I
10.1016/j.patrec.2012.07.014
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Skeletonization is a necessary process in a variety of applications in image processing and object recognition. However, the concept of a skeleton, defined using either the union of centers of maximal discs or the union of points with more than one generating points, was originally formulated in continuous space. When they are applied to situation in discrete space, the resulting skeletons may become disconnected and further works are needed to link them. In this paper, we propose a novel skeletonization method which extends the concept of a skeleton to include both continuous and discrete space using generalized Voronoi diagrams. We also present a skeleton pruning method which is able to remove noisy branches by evaluating their significance. Three experimental results demonstrate that: (1) our method is stable across a wide range of shapes, and (2) it performs better in accuracy and robustness than previous approaches for processing shapes whose boundaries contain substantial noise. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:2113 / 2119
页数:7
相关论文
共 37 条
[1]   NUCLEAR SPECTRAL-ANALYSIS VIA ARTIFICIAL NEURAL NETWORKS FOR WASTE HANDLING [J].
KELLER, PE ;
KANGAS, LJ ;
TROYER, GL ;
HASHEM, S ;
KOUZES, RT .
IEEE TRANSACTIONS ON NUCLEAR SCIENCE, 1995, 42 (04) :709-715
[2]   EUCLIDEAN SKELETON VIA CENTER-OF-MAXIMAL-DISC EXTRACTION [J].
ARCELLI, C ;
DIBAJA, GS .
IMAGE AND VISION COMPUTING, 1993, 11 (03) :163-173
[3]   A WIDTH-INDEPENDENT FAST THINNING ALGORITHM [J].
ARCELLI, C ;
DIBAJA, GS .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1985, 7 (04) :463-474
[4]   Skeleton pruning by contour partitioning with discrete curve evolution [J].
Bai, Xiang ;
Latecki, Longin Jan ;
Liu, Wen-Yu .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2007, 29 (03) :449-462
[5]   SHAPE DESCRIPTION USING WEIGHTED SYMMETRIC AXIS FEATURES [J].
BLUM, H ;
NAGEL, RN .
PATTERN RECOGNITION, 1978, 10 (03) :167-180
[6]  
Blum H., 1967, TRANSFORMATION EXTRA, P363
[7]   CONTINUOUS SKELETON COMPUTATION BY VORONOI DIAGRAM [J].
BRANDT, JW ;
ALGAZI, VR .
CVGIP-IMAGE UNDERSTANDING, 1992, 55 (03) :329-338
[8]   Polygonal approximation of digital planar curves through break point suppression [J].
Carmona-Poyato, A. ;
Madrid-Cuevas, F. J. ;
Medina-Carnicer, R. ;
Munoz-Salinas, R. .
PATTERN RECOGNITION, 2010, 43 (01) :14-25
[9]   Computer-vision-based extraction of neural dendrograms [J].
Cesar, RM ;
Costa, LD .
JOURNAL OF NEUROSCIENCE METHODS, 1999, 93 (02) :121-131
[10]  
CESAR RM, 1996, PATTERN RECOGN, V29, P1559