Genetic algorithms for polygonal approximation of digital curves

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 13, Issue 7, 1999, Pages 1061-1082

  Yin, Peng Yeng ^a  

^a MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

Fitness function; Genetic algorithms; Learning strategy; Partially matched cross over (PMX); Polygonal approximation

Indexed keywords

EID: 0037751705     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001499000598     Document Type: Article

References (27)

1. N. Ansari and E. J. Delp, *On detection dominant points,* Patt. Recogn. 24 (1991) 441-450.
2. G. P. Babu and M. N. Murty, "A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm," Patt. Recogn. Lett. 14 (1993) 763-769.
3. J. G. Dunham, "Optimum uniform piecewise linear approximation of planar curves," IEEE Trans. Patt. Anal. Mach. Intell. 8 (1986) 67-75.
4. D. E. Goldberg, Genetic Algorithms: Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
5. A. Held, K. Abe and C. Arcelli, "Towards a hierarchical contour description via dominant point detection," IEEE Trans. Syst. Man Cybern. 24 (1994) 942-949.
6. Y. Kurozumi and W. A. Davis, "Polygonal approximation by the minimax method," Comput. Graph. Imag. Process. 19 (1982) 248-264.
7. J. G. Leu and L. Chen, "Polygonal approximation of 2-D shapes through boundary merging," Patt. Recogn. Lett. 7 (1988) 231-238.
8. S. Loncaric and A. P. Dhawan, "Near-optimal MST-based shape description using genetic algorithm," Patt. Recogn. 28 (1995) 571-579.
9. C. A. Murthy and N. Chowdhury, "In search of optimal clusters using genetic algorithms," Patt. Recogn. Lett. 17 (1996) 825-832.
10. S. K. Pal, D. Bhandari and M. K. Kundu, "Genetic algorithms for optimal image enhancement," Patt. Recogn. Lett. 15 (1994) 261-271.
11. T. Pavlidis and S. L. Horowitz, "Segmentation of plane curves," IEEE Trans. Comput. 23 (1974) 860-870.
12. T. Y. Phillips and A. Rosenfeld, "An ISODATA algorithm for straight line fitting," Patt. Recogn. Lett. 7 (1988) 291-297.
13. U. Ramer, "An iterative procedure for the polygonal approximation of plane curves," Comput. Graph. Imag. Process. 1 (1972) 244-256.
14. B. K. Ray and K. S. Ray, "An algorithm for detection of dominant points and polygonal approximation of digitized curves," Patt. Recogn. Lett. 13 (1992) 849-856.
15. 1 norm," Patt. Recogn. 26 (1993) 505-509.
16. B. K. Ray and K. S. Ray, "A new split-and-merge technique for polygonal approximation of chain coded curves," Patt. Recogn. Lett. 16 (1995) 161-169.
17. A. Rosenfeld and E. Johnston, "Angle detection on digital curves," IEEE Trans. Comput. 22 (1973) 875-878.
18. A. Rosenfeld and A. C. Kak, Digital Picture Processing, 2nd edition, Academic Press, New York, 1982.
19. Y. Sato, "Piecewise linear approximation of plane curves by perimeter optimization," Patt. Recogn. 25 (1992) 1535-1543.
20. M. Singh, A. Chatterjee and S. Chaudhury, "Matching structural shape descriptions using genetic algorithms," Patt. Recogn. 30 (1997) 1451-1462.
21. J. Sklansky, R. L. Chazin and B. J. Hansen, "Minimum perimeter polygons of digitized silhouettes," IEEE Trans. Comput. 23 (1972) 445-448.
22. J. Sklansky and V. Gonzalez, "Fast polygonal approximation of digitized curves," Patt. Recogn. 12 (1980) 327-331.
23. C. H. Teh and R. T. Chin, "On the detection of dominant points on digital curves," IEEE Trans. Patt. Anal. Mach. Intell. 11 (1989) 859-872.
24. K. Wall and P. E. Danielsson, "A fast sequential method for polygonal approximation of digitized curves," Comput. Vis. Graph. Imag. Process. 28 (1984) 220-227.
25. J. S. Wu and J. J. Leou, "New polygonal approximation schemes for object shape representation," Patt. Recogn. 26 (1993) 471-484.
26. W. Y. Wu and M. J. Wang, "Detecting the dominant points by the curvature-based polygonal approximation," CVGIP: Graph. Models Imag. Process. 55 (1993) 79-88.
27. P. Y. Yin, "Algorithms for straight line fitting using K-means," Patt. Recogn. Lett. 19 (1998) 31-41.