By Topic

Multiresolution skeletonization in binary pyramids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. Borgefors ; Centre for Image Anal., Swedish Univ. of Agric. Sci., Uppsala, Sweden ; G. Sanniti diBaja

A multiresolution skeletonization algorithm is presented. The underlying data structure is a binary AND-pyramid. Notwithstanding the fact that the AND-pyramid is likely to break pattern connectedness at lower resolution levels, the algorithm generates connected skeletons at all resolution levels. It can most conveniently be implemented on a parallel SIMD architecture, but efficient MIMD and sequential implementations are also possible. A hierarchy among skeleton branches at various resolutions levels is also introduced

Published in:

Pattern Recognition, 1996., Proceedings of the 13th International Conference on  (Volume:4 )

Date of Conference:

25-29 Aug 1996