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

Pattern Recognition Letters

Volumn 24, Issue 15, 2003, Pages 2585-2595

  Sarkar, Biswajit ^a   Singh, Lokendra K ^a   Sarkar, Debranjan ^a  

^a VARIABLE ENERGY CYCLOTRON CENTRE   (India)

Author keywords

Breakpoint; Circular arc; Curve fitting; Genetic algorithm with chromosome differentiation; Integral square error

Indexed keywords

APPROXIMATION THEORY; ERROR ANALYSIS; GENETIC ALGORITHMS;

DIGITAL CURVES;

PATTERN RECOGNITION;

ALGORITHM; IMAGE ANALYSIS; PATTERN RECOGNITION;

EID: 0042329794     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(03)00103-X     Document Type: Article

References (25)

1. Bandyopadhyay S. Pal S.K. Pattern classification with genetic algorithms: Incorporation of chromosome differentiation Pattern Recognition Lett. 18 1997 119-131
2. Bandyopadhyay S. Pal S.K. Maulik U. Incorporating chromosome differentiation in genetic algorithms Inform. Sci. 104 1998 293-319
3. Davis T.J. Fast decomposition of digital curves into polygons using the Haar transform IEEE Trans. Pattern Anal. Machine Intell. 21 1999 786-790
4. Dunham J.G. Optimum uniform piecewise linear approximation of planar curves IEEE Trans. Pattern Anal. Machine Intell. 8 1986 67-75
5. Goldberg D.E. Genetic algorithms in search, optimization and machine learning 1989 Addison-Weseley Reading, MA
6. Horng J.-H. Li J.T. A dynamic programming approach for fitting digital planar curves with line segments and circular arcs Pattern Recognition Lett. 22 2001 183-197
7. Huang S.-C. Sun Y.-N. Polygonal approximation using genetic algorithms Pattern Recognition 32 1999 1409-1420
8. Ichoku C. Deffontaines B. Chorowicz J. Segmentation of digital plane curves: A dynamic focusing approach Pattern Recognition Lett. 17 1996 741-750
9. Kanatani K. Comments on Nonparametric segmentation of curves into various representations IEEE Trans. Pattern Anal. Machine Intell. 19 1997 1391-1392
10. Lowe D.G. Three-dimensional object recognition from single two-dimensional images Artificial Intell. 31 1987 355-395
11. Pei S.-C. Horng J.-H. Fitting digital curves using circular arcs Pattern Recognition 28 1995 107-116
12. Pei S.-C. Horng J.-H. Optimum approximation of digital planar curves using circular arcs Pattern Recognition 29 1996 383-388
13. Perez J.C. Vidal E. Optimum polygonal approximation of digitized curves Pattern Recognition Lett. 15 1994 743-750
14. Ray B.K. Ray K.S. Detection of significant points and polygonal approximation of digitized curves Pattern Recognition Lett. 13 1992 443-452
15. Rosin P.L. Techniques for assessing polygonal approximations of curves IEEE Trans. Pattern Anal. Machine Intell. 19 1997 659-666
16. Rosin P.L. West G.A.W. Segmentation of edges into lines and arcs Image Vision Comput. 7 1989 109-114
17. Rosin P.L. West G.A.W. Nonparametric segmentation of curves into various representations IEEE Trans. Pattern Anal. Machine Intell. 17 1995 1140-1153
18. Rosin P.L. West G.A.W. Response to Kanatani IEEE Trans. Pattern Anal. Machine Intell. 19 1997 1393-1394
19. Salotti M. An efficient algorithm for the optimal polygonal approximation of digitized curve Pattern Recognition Lett. 22 2001 215-221
20. Salotti M. Optimal polygonal approximation of digitized curves using the sum of square deviations criterion Pattern Recognition 35 2002 435-443
21. Sarkar D. A simple algorithm for detection of significant vertices for polygonal approximation of chain coded curves Pattern Recognition Lett. 14 1993 959-964
22. Singh M. Chatterjee A. Chaudhury S. Matching structural shape descriptions using genetic algorithms Pattern Recognition 30 1997 1451-1462
23. Teh C.H. Chin R.T. On the detection of dominant points on digital curves IEEE Trans. Pattern Anal. Machine Intell. 11 1989 859-872
24. Yin P.Y. A new method for polygonal approximation using genetic algorithms Pattern Recognition Lett. 19 1998 1017-1026
25. Yin P.Y. Genetic algorithms for polygonal approximation of digital curves Internat. J. Pattern Recognition Artificial Intell. 13 1999 1061-1082