Approximation of digital curves with line segments and circular arcs using genetic algorithms

A method for approximation of digital planar curves with line segments and circular arcs using genetic algorithms is proposed. In this method, breakpoints on the digital curve are located in such a manner that when line segments and circular arcs are appropriately fitted between all pairs of adjacent breakpoints, the approximation error is minimized.

[1]  Sanghamitra Bandyopadhyay,et al.  Pattern classification with genetic algorithms: Incorporation of chromosome differentiation , 1997, Pattern Recognit. Lett..

[2]  Marc Salotti,et al.  Optimal polygonal approximation of digitized curves using the sum of square deviations criterion , 2002, Pattern Recognit..

[3]  David G. Lowe,et al.  Three-Dimensional Object Recognition from Single Two-Dimensional Images , 1987, Artif. Intell..

[4]  Geoff A. W. West,et al.  Nonparametric Segmentation of Curves into Various Representations , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

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

[6]  Debranjan Sarkar,et al.  A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves , 1993, Pattern Recognit. Lett..

[7]  Soo-Chang Pei,et al.  Optimum approximation of digital planar curves using circular arcs , 1996, Pattern Recognit..

[8]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

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

[12]  Soo-Chang Pei,et al.  Fitting digital curve using circular arcs , 1995, Pattern Recognit..

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

[14]  Santanu Chaudhury,et al.  Matching structural shape descriptions using genetic algorithms , 1997, Pattern Recognit..

[15]  Charles Ichoku,et al.  Segmentation of digital plane curves: A dynamic focusing approach , 1996, Pattern Recognit. Lett..

[16]  Trevor J. Davis.  Fast Decomposition of Digital Curves into Polygons Using the Haar Transform , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Paul L. Rosin.  Techniques for Assessing Polygonal Approximations of Curves , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  PENG-YENG YIN.  Genetic Algorithms for Polygonal Approximation of Digital Curves , 1999, Int. J. Pattern Recognit. Artif. Intell..

[19]  Kenichi Kanatani.  Comments on "Nonparametric Segmentation of Curves Into Various Representations" , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

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

[21]  Geoff A. W. West,et al.  Segmentation of edges into lines and arcs , 1989, Image Vis. Comput..

[22]  Geoff A. W. West,et al.  Response to Kanatani , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

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

[24]  Ji-Hwei Horng,et al.  A dynamic programming approach for fitting digital planar curves with line segments and circular arcs , 2001, Pattern Recognit. Lett..

[25]  Ujjwal Maulik,et al.  Incorporating Chromosome Differentaition in Genetic Algorithms , 1998, Inf. Sci..