DocumentCode
2618429
Title
Computing a stable, connected skeleton from discrete data
Author
Brandt, Jonathan W. ; Algazi, V. Ralph
Author_Institution
California Univ., Davis, CA, USA
fYear
1991
fDate
3-6 Jun 1991
Firstpage
666
Lastpage
667
Abstract
The relationship between the skeleton and the Voronoi diagram for the case of morphologically regular sets is described. Using the discrete-point Voronoi diagram, a practical algorithm is developed to compute an approximate skeleton of a continuous shape from sampled data. The analysis also yields a sampling criterion under which the approximation is stable. The algorithm is applied to a simple test image
Keywords
computational geometry; data analysis; pattern recognition; picture processing; Voronoi diagram; connected skeleton; discrete data; image data analysis; morphologically regular sets; sampling criterion; Approximation error; Computer vision; Data analysis; Image sampling; Sampling methods; Shape; Skeleton; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition, 1991. Proceedings CVPR '91., IEEE Computer Society Conference on
Conference_Location
Maui, HI
ISSN
1063-6919
Print_ISBN
0-8186-2148-6
Type
conf
DOI
10.1109/CVPR.1991.139773
Filename
139773
Link To Document