Polygonal Approximation of Digital Curves Using a Multi-objective Genetic Algorithm

In this paper, a polygonal approximation approach based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates breakpoints on the digital curve by minimizing simultaneously the number of breakpoints and the approximation error. Using such an approach, the algorithm proposes a set of solutions at its end. This set which is called the Pareto Front in the multi objective optimization field contains solutions that represent trade-offs between the two classical quality criteria of polygonal approximation : the Integral Square Error (ISE) and the number of vertices. The user may choose his own solution according to its objective. The proposed approach is evaluated on curves issued from the literature and compared with many classical approaches.

[1]  Theodosios Pavlidis,et al.  Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.

[2]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

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

[4]  Urs Ramer,et al.  An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..

[5]  Yung-Nien Sun,et al.  Polygonal approximation using genetic algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[6]  Pepe Siy,et al.  A new algorithm for dominant points detection and polygonization of digital curves , 2003, Pattern Recognit..

[7]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[8]  J. David Schaffer,et al.  Multi-Objective Learning via Genetic Algorithms , 1985, IJCAI.

[9]  Biswajit Sarkar,et al.  Approximation of digital curves with line segments and circular arcs using genetic algorithms , 2003, Pattern Recognit. Lett..

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

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

[12]  Khaled Rasheed,et al.  Constrained Multi-objective Optimization Using Steady State Genetic Algorithms , 2003, GECCO.

[13]  Yung-Nien Sun,et al.  Polygonal approximation using genetic algorithms , 1999, Pattern Recognit..

[14]  Santanu Chaudhury,et al.  A new approach for aggregating edge points into line segments , 1993, Pattern Recognit..

[15]  Hong Yan,et al.  Polygonal approximation of digital curves based on the principles of perceptual organization , 1997, Pattern Recognit..

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

[17]  Edward J. Delp,et al.  On detecting dominant points , 1991, Pattern Recognit..

[18]  Ji-Hwei Horng,et al.  An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves , 2002, Pattern Recognit. Lett..

[19]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[20]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[21]  Bimal Kumar Ray,et al.  An algorithm for detection of dominant points and polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..

[22]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[23]  Marc Salotti.  An efficient algorithm for the optimal polygonal approximation of digitized curves , 2001, Pattern Recognit. Lett..

[24]  C. Fonseca,et al.  GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION , 1993 .

[25]  Philippe Cornic,et al.  Another look at the dominant point detection of digital curves , 1997, Pattern Recognit. Lett..

[26]  Carlos A. Coello Coello,et al.  A Short Tutorial on Evolutionary Multiobjective Optimization , 2001, EMO.

[27]  P. Yin,et al.  A new method for polygonal approximation using genetic algorithms , 1998, Pattern Recognit. Lett..

[28]  Kumar S. Ray,et al.  Detection of significant points and polygonal approximation of digitized curves , 1992, Pattern Recognit. Lett..

[29]  Peng-Yeng Yin,et al.  A new circle/ellipse detector using genetic algorithms , 1999, Pattern Recognit. Lett..