Comparison of Two Evolutionary Approaches for the Polygonal Approximation of Digital Curves

In this paper, we address the approximation of digital curves using straight-line segments. Our objective is to compare the performance of two population-based evolutionary algorithms: an evolutionary programming approach and a variable length chromosome genetic algorithm to solve the polygonal approximation problem.We describe the main elements of the methods under comparison and we show the results of the tests executed on a dataset comprising curves that exhibit a range of conditions with respect to two main features: openness and straightness. Our experiments show that the evolutionary programming based technique is faster and more accurate than the genetic algorithm based approach.

[1]  Yong Liu,et al.  An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm , 2007, J. Univers. Comput. Sci..

[2]  P. Yin.  Genetic particle swarm optimization for polygonal approximation of digital curves , 2006, Pattern Recognition and Image Analysis.

[3]  Lawrence J. Fogel,et al.  Intelligence Through Simulated Evolution: Forty Years of Evolutionary Programming , 1999 .

[4]  José Manuel Iñesta Quereda,et al.  Exploring the performance of genetic algorithms as polygonal approximators , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[5]  Raul E. Sanchez-Yanez,et al.  Polygonal Approximation of Digital Curves Using Evolutionary Programming , 2012 .

[6]  Peng-Yeng Yin.  Polygonal Approximation of Digital Curves Using the State-of-the-art Metaheuristics , 2007 .

[7]  Peng-Yeng Yin,et al.  Ant colony search algorithms for optimal polygonal approximation of plane curves , 2003, Pattern Recognit..

[8]  Yao-Hong Tsai.  Fast Polygonal Approximation Based on Genetic Algorithms , 2006, 5th IEEE/ACIS International Conference on Computer and Information Science and 1st IEEE/ACIS International Workshop on Component-Based Software Engineering,Software Architecture and Reuse (ICIS-COMSAR'06).

[9]  Liu Guanghui,et al.  A New Approach for Polygonal Approximation of Shape Contours using Genetic Algorithm , 2007, 2007 2nd IEEE Conference on Industrial Electronics and Applications.

[10]  Alexander Kolesnikov.  Fast algorithm for error-bounded compression of digital curves , 2010, 2010 IEEE International Conference on Image Processing.

[11]  P. A. Mlsna,et al.  Image Database Query Using Shape-Based Boundary Descriptors , 2003 .

[12]  Juan Carlos Pérez-Cortes,et al.  Optimum polygonal approximation of digitized curves , 1994, Pattern Recognit. Lett..

[13]  Huiying Li,et al.  User-Controlled Geometric Feature Preserving Simplification , 2010, 2010 Fifth International Conference on Frontier of Computer Science and Technology.