DocumentCode
2222408
Title
Fixed topology skeletons
Author
Golland, Polina ; Eric, W. ; Grimson, L.
Author_Institution
Artificial Intelligence Lab., MIT, Cambridge, MA
Volume
1
fYear
2000
fDate
2000
Firstpage
10
Abstract
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchanged throughout the skeleton computation, which greatly reduces sensitivity of the skeleton to noise in the shape outline. Furthermore, this representation naturally defines an ordering of the points along the skeleton. The process of skeleton extraction can be formulated as energy minimization in this framework. We provide an iterative, snake-like algorithm for the skeleton estimation using distance transform. Fixed topology skeletons are useful if the global shape of the object is known ahead of time, such as for people silhouettes, hand outlines, medical structures, images of letters and digits. Small changes in the object outline should be either ignored, or detected and analyzed, but they do not change the general structure of the underlying skeleton. Example applications include tracking, object recognition and shape analysis
Keywords
computer vision; minimisation; object recognition; connectivity; distance transform; energy minimization; fixed topology skeletons; graph topology; object recognition; robust skeleton extraction; shape analysis; shape outline; skeleton estimation; snake-like algorithm; undirected graphs; Biomedical imaging; Iterative algorithms; Noise reduction; Noise robustness; Noise shaping; Object detection; Object recognition; Shape; Skeleton; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 2000. Proceedings. IEEE Conference on
Conference_Location
Hilton Head Island, SC
ISSN
1063-6919
Print_ISBN
0-7695-0662-3
Type
conf
DOI
10.1109/CVPR.2000.855792
Filename
855792
Link To Document