By Topic

Fast algorithm for ISE-bounded polygonal approximation

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

1 Author(s)
Alexander Kolesnikov ; Department of Computer Science and Statistics, University of Joensuu, Box 111, FIN-80101, FINLAND

In this paper we consider a problem of optimal polygonal approximation with a minimum number of the line segments for a given constraint on the total distortion with L2 measure. A fast suboptimal algorithm for the problem is proposed. In order to improve the solution obtained, this algorithm can be used in combination with a Reduced-Search Dynamic Programming algorithm. The experiments with the large size vector data have demonstrated both high efficiency and high time performance of the proposed algorithms for the following practical applications: image vectorization and segmentation, vector maps simplification, vector data compression, digital shapes encoding, etc.

Published in:

2008 15th IEEE International Conference on Image Processing

Date of Conference:

12-15 Oct. 2008