Loading [MathJax]/extensions/MathMenu.js
Fast Polygonal Approximation Based on Genetic Algorithms | IEEE Conference Publication | IEEE Xplore

Fast Polygonal Approximation Based on Genetic Algorithms


Abstract:

A fast algorithm is proposed for polygonal approximation of a digitized curve based on genetic evolution. The polygon is represented by a set of dominant points. The domi...Show More

Abstract:

A fast algorithm is proposed for polygonal approximation of a digitized curve based on genetic evolution. The polygon is represented by a set of dominant points. The dominant points are identified as the points on the curve with local maximum curvatures. The optimization problem for the digitized curve with the approximating polygon is employing the genetic algorithm. Thus, a chromosome is used to represent a polygon. The break point detection on the chromosome is conducted to reduce the computations for optimization. Experimental results are included to show the effectiveness of this method.
Date of Conference: 10-12 July 2006
Date Added to IEEE Xplore: 24 July 2006
Print ISBN:0-7695-2613-6
Conference Location: Honolulu, HI, USA

Contact IEEE to Subscribe

References

References is not available for this document.