Polygonal approximation using genetic algorithm

Polygonal approximation is an important issue in pattern recognition and image processing. A new polygonal approximation method using a 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 and Chin (1989) and Ansari and Huang (1991). Some experimental results depict the superiority of the proposed approach.

[1]  Kumar S. Ray,et al.  A new approach to polygonal approximation , 1991, Pattern Recognit. Lett..

[2]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3]  Jia-Guu Leu,et al.  Polygonal approximation of 2-D shapes through boundary merging , 1988, Pattern Recognit. Lett..

[4]  Pau-Choo Chung,et al.  Polygonal approximation using a competitive Hopfield neural network , 1994, Pattern Recognit..

[5]  Jin-Jang Leou,et al.  New polygonal approximation schemes for object shape representation , 1993, Pattern Recognit..

[6]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[7]  Hiroshi Imai,et al.  Computational-geometric methods for polygonal approximations of a curve , 1986, Comput. Vis. Graph. Image Process..

[8]  Roland T. Chin,et al.  On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Kumar S. Ray,et al.  An algorithm for polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..

[10]  Karin Wall,et al.  A fast sequential method for polygonal approximation of digitized curves , 1984, Comput. Vis. Graph. Image Process..

[11]  Wen-Yen Wu,et al.  Detecting the Dominant Points by the Curvature-Based Polygonal Approximation , 1993, CVGIP Graph. Model. Image Process..

[12]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[13]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[14]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  Theodosios Pavlidis,et al.  Polygonal Approximations by Newton's Method , 1977, IEEE Transactions on Computers.

[16]  Nirwan Ansari,et al.  Non-parametric dominant point detection , 1991, Pattern Recognition.

[17]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.