By Topic

Piecewise Approximation of Contours Through Scale-Space Selection of Dominant Points

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)
António M. G. Pinheiro ; Remote Sensing Unit , Universidade da Beira Interior, Covilhã, Portugal ; Mohammed Ghanbari

This paper describes a method of approximating a shape contour with a polygon. The polygon vertices are extracted from the curvature extremes, through a scale-space description of the contour, via linear diffusion. These vertices are located on the contour points where the sharper changes of the contour directions occur. Using a proper strategy, a set of extremes that result in a given approximation level is chosen. By adding new vertices, the approximation level can be improved, and a scalable representation of the contour is identified. This method results in an approximation that discriminates local from global geometric features and provides a good visual representation of the original contour. This polygonal approximation method is used for scalable encoding of the shape contours. In this regard, an encoding technique suitable for scalable polygonal approximation has been developed. We show that encoding the approximated polygons result in a good relation between the distortion and the bitrate. Finally, we show that in addition to coding this method can be efficiently used for shape comparison and shape retrieval.

Published in:

IEEE Transactions on Image Processing  (Volume:19 ,  Issue: 6 )