A new method for polygonal approximation using genetic algorithms

Pattern Recognition Letters

Volumn 19, Issue 11, 1998, Pages 1017-1026

  Yin, Peng Yeng ^a  

^a MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

Genetic algorithms; Polygonal approximation

Indexed keywords

GENETIC ALGORITHMS; IMAGE PROCESSING; OPTIMIZATION;

POLYGONAL APPROXIMATION;

APPROXIMATION THEORY;

EID: 0032156001     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(98)00082-8     Document Type: Article

References (20)

1. Ansari, N., Delp, E.J., 1991. On detection dominant points. Pattern Recognition 24, 441-450.
2. Gen, M., Cheng, R., 1997. Genetic Algorithms and Engineering Design. Wiley, New York.
3. Goldberg, D.E., 1989. Genetic Algorithms: Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA.
4. Kurozumi, Y., Davis W.A., 1982. Polygonal approximation by the minimax method. Computer Graphics and Image Processing 19, 248-264.
5. Leu, J.-G., Chen, L., 1988. Polygonal approximation of 2-D shapes through boundary merging. Pattern Recognition Letters 7, 231-238.
6. Loncaric, S., Dhawan, A.P., 1995. Near-optimal MST-based shape description using genetic algorithm. Pattern Recognition 28, 571-579.
7. Murthy, C.A., Chowdhury, N., 1996. In search of optimal clusters using genetic algorithms. Pattern Recognition Letters 17, 825-832.
8. Pal, N.R., Nandi, S., Kundu, M.K., 1998. Self crossover: a new genetic operator and its application to feature selection. Internat. J. Systems Sci. 29, 207-212.
9. Pal, S.K., Bhandari, D., Kundu, M.K., 1994. Genetic algorithms for optimal image enhancement. Pattern Recognition Letters 15, 261-271.
10. Phanendra Babu, G., Narashima Murty, M., 1993. A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm. Pattern Recognition Letters 14, 763-769.
11. Phillips, T.-Y., Rosenfeld, A., 1988. An ISODATA algorithm for straight line fitting. Pattern Recognition Letters 7, 291-297.
12. Ray, B.K., Ray, K.S., 1992. An algorithm for detection of dominant points and polygonal approximation of digitized curves. Pattern Recognition Letters 13, 849-856.
13. Ray, B.K., Ray, K.S., 1993. Determination of optimal polygon from digital curve using L1 norm. Pattern Recognition 26, 505-509.
14. Singh, M., Chatterjee, A., Chaudhury, S., 1997. Matching structural shape descriptions using genetic algorithms. Pattern Recognition 30, 1451-1462.
15. Sklansky, J., Gonzalez, V., 1980. Fast polygonal approximation of digitized curves. Pattern Recognition 12, 327-331.
16. Teh, C.H., Chin, R.T., 1989. On the detection of dominant points on digital curves. IEEE Trans. Pattern Anal. Machine Intell. 11, 859-872.
17. Wall, K., Danielsson, P.E., 1984. A fast sequential method for polygonal approximation of digitized curves. Computer Vision, Graphics, and Image Processing 28, 220-227.
18. Wu, J.S., Leou, J.J., 1993. New polygonal approximation schemes for object shape representation. Pattern Recognition 26, 471-484.
19. Wu, W.Y., Wang, M.J., 1993. Detecting the dominant points by the curvature-based polygonal approximation. CVGIP: Graphical Models and Image Processing 55, 79-88.
20. Yin, P.-Y., 1998. Algorithms for straight line fitting using K-means. Pattern Recognition Letters 19, 31-41.