Polygonal approximation is an important issue in pattern recognition and image processing. A new polygonal approximation method using genetic algorithm is proposed. Genetic algorithms are search algorithms based on the mechanisms of natural selection and natural genetics. The chromosome is used to represent an approximated polygon and is represented by a binary string. Each bit, called gene, represents a curve point. A gene with value 1 indicates that the corresponding curve point is a breakpoint of the approximated polygon. The objective function is defined as the total arc-to-chord deviation between the curve and the polygon. The proposed method is compared to two existing methods proposed by Teh-Chin  and Ansari-Huang . Some experimental results depict the superiority of the proposed approach.
|Number of pages||6|
|Publication status||Published - 1996 Jan 1|
|Event||Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, ICEC'96 - Nagoya, Jpn|
Duration: 1996 May 20 → 1996 May 22
|Other||Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, ICEC'96|
|Period||96-05-20 → 96-05-22|
All Science Journal Classification (ASJC) codes