Pruning algorithm for Voronoi skeletons

Electronics Letters

Volumn 46, Issue 1, 2010, Pages 39-41

  Beristain, A ^a   Grana M ^a  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARC LENGTH; END POINTS; FRAMES PER SECONDS; IMAGE DATABASE; INFORMATION REDUCTION; PROTOTYPE IMPLEMENTATIONS; PRUNING ALGORITHMS; REAL TIME; SHAPE CONTOURS; STABILITY AND ROBUSTNESS; TWO STAGE; USEFUL PROPERTIES; VORONOI;

IMAGE RETRIEVAL; SOFTWARE PROTOTYPING;

COMPUTATIONAL EFFICIENCY;

EID: 76049088061     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el.2010.2249     Document Type: Article

References (8)

1. Siddiqi, K., and Pizer, S.: ' Medial representations. Mathematics, algorithms and applications ',(Springer Verlag, Computational Imaging and Vision Series, 2008, Vol. 37)
2. Hesselink, W.H., and Roerdink, J.B.T.M.: ' Euclidean skeletons of digital image and volume data in linear time by the integer medial axis transform ', IEEE Trans. Pattern Anal. Mach. Intell., 2008, 30, (12), p. 2204-2217 0162-8828
3. Bai, X., Latecki, L.J., and Liu, W.: ' Skeleton pruning by contour partitioning with discrete curve evolution ', IEEE Trans. Pattern Anal. Mach. Intell., 2007, 29, (3), p. 449-462 0162-8828
4. Latecki, L.J., and Lakämper, R.: ' Convexity rule for shape decomposition based on discrete contour evolution ', Comput. Vis. Image Underst., 1999, 73, p. 441-454 1077-3142
5. Ogniewicz, R., and Ilg, M.: ' Voronoi skeletons: theory and applications ', Proc. IEEE Computer Society Conf. on Computer Vision and Pattern Recognition, Champaign, IL, USA, June, 1992, p. 63-69
6. Aronov, B.: ' A lower bound on Voronoi diagram complexity ', Inf. Process. Lett., 2002, 83, (4), p. 183-185 0020-0190
7. http://www.cis.temple.edu/~latecki/Programs/skeletonPruning07.htm
8. http://www.ehu.es/ccwintco/index.php/Synthetic-hand-gesture-images-for- tabletop-interaction