Pruning algorithm for Voronoi skeletons

Access Full Text

Pruning algorithm for Voronoi skeletons

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

A robust and efficient binary image shape skeleton computation procedure in 2D, including a pruning procedure, is presented. The procedure is as follows: first the shape contour is subsampled along its arclength, then the Voronoi skeleton is computed from the resulting reduced contour set of points, and finally a novel two-stage pruning procedure is applied to obtain a simplified skeleton. Besides the information reduction, this pruning makes the skeleton more robust to noise. Pruning can be done in real time thanks to some useful properties of Voronoi skeletons. Here it is proved that if the two end points of a Voronoi segment are inside the shape, then the entire segment is contained in the shape. A prototype implementation performs in real-time (60 frames per second) on an off-the-shelf computer. Testing it on an in-house but publicly available image database shows the stability and robustness of the approach.

Inspec keywords: computational geometry; shape recognition

Other keywords: pruning algorithm; Voronoi skeleton; binary image shape skeleton computation

Subjects: Image recognition; Computer vision and image processing techniques; Graphics techniques

References

    1. 1)
      • K. Siddiqi , S. Pizer . Medial representations. Mathematics, algorithms and applications.
    2. 2)
      • http://www.cis.temple.edu/~latecki/Programs/skeletonPruning07.htm.
    3. 3)
      • W.H. Hesselink , J.B.T.M. Roerdink . Euclidean skeletons of digital image and volume data in linear time by the integer medial axis transform. IEEE Trans. Pattern Anal. Mach. Intell. , 12 , 2204 - 2217
    4. 4)
      • X. Bai , L.J. Latecki , W. Liu . Skeleton pruning by contour partitioning with discrete curve evolution. IEEE Trans. Pattern Anal. Mach. Intell. , 3 , 449 - 462
    5. 5)
      • B. Aronov . A lower bound on Voronoi diagram complexity. Inf. Process. Lett. , 4 , 183 - 185
    6. 6)
      • Ogniewicz, R., Ilg, M.: `Voronoi skeletons: theory and applications', Proc. IEEE Computer Society Conf. on Computer Vision and Pattern Recognition, June 1992, Champaign, IL, USA, p. 63–69.
    7. 7)
      • http://www.ehu.es/ccwintco/index.php/Synthetic_hand_gesture_images_for_tabletop_interaction.
    8. 8)
      • L.J. Latecki , R. Lakämper . Convexity rule for shape decomposition based on discrete contour evolution. Comput. Vis. Image Underst. , 441 - 454
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2010.2249
Loading

Related content

content/journals/10.1049/el.2010.2249
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading