A discrete particle swarm algorithm for optimal polygonal approximation of digital curves

Journal of Visual Communication and Image Representation

Volumn 15, Issue 2, 2004, Pages 241-260

  Yin, Peng Yeng ^a  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Genetic algorithm; Global optimal solution; Local optimal solution; Particle swarm optimization; Polygonal approximation

Indexed keywords

APPROXIMATION THEORY; FEATURE EXTRACTION; GENETIC ALGORITHMS; IMAGE QUALITY; OBJECT RECOGNITION;

GLOBAL OPTIMAL SOLUTION; LOCAL OPTIMAL SOLUTION; PARTICLE SWARM OPTIMIZATION; POLYGONAL APPROXIMATION;

IMAGE ANALYSIS;

EID: 2442570106     PISSN: 10473203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jvcir.2003.12.001     Document Type: Article

References (31)

1. Ansari, N., Delp, E.J., 1991. On detection dominant points. Pattern Recognition 24, 441-450.
2. Clerc, M., Kennedy, J., 2002. The particle swarm explosion, stability, and convergence in a multidimensional complex space. IEEE Transaction on Evolutionary Computation 6, 58-73.
3. Dunham, J.G., 1986. Optimum uniform piecewise linear approximation of planar curves. IEEE Transaction on Pattern Analysis and Machine Intelligence 8, 67-75.
4. Eberhart, R.C., Shi, Y., 1998. Evolving artificial neural networks. In: Proceedings of the International Conference on Neural Networks and Brain, pp. PL5-PL13.
5. Eberhart, C.R., Shi, Y., 1998. Comparison between genetic algorithms and particle swarm optimization. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (Eds.), Evolutionary Programming VII: Proceedings of the 7th Annual Conference on Evolutionary Programming.
6. Goldberg, D.E., 1989. Genetic Algorithms in Search. Optimization and Machine Learning. AddisonWesley, Reading, MA.
7. Held, A., Abe, K., Arcelli, C, 1994. Towards a hierarchical contour description via dominant point detection. IEEE Transaction on System, Man, and Cybernetics 24, 942-949.
8. Ho, Y.S., Chen, Y.C., 2001. An efficient evolutionary algorithm for accurate polygonal approximation. Pattern Recognition 34, 2305-2317.
9. Huang, C.S., Sun, Y.N., 1999. Polygonal approximation using genetic algorithms. Pattern Recognition 32, 1409-1420.
10. Kennedy, J., Eberhart, R.C, 1995. Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. IV, pp. 1942-1948.
11. Kennedy, J., Eberhart, R.C, A discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 1997, pp. 4104-4108
12. Kurozumi, Y., Davis, W.A., 1982. Polygonal approximation by the minimax method. Computer Graphics and Image Processing 19, 248-264.
13. Leu, J.G., Chen, L., 1988. Polygonal approximation of 2-D shapes through boundary merging. Pattern Recognition Letters 7, 231-238.
14. Parsopoulos, E.K., Vrahatis, M.N., 2002. Recent approaches to global optimization problems through particle swarm optimization. Natural Computing 1, 235-306.
15. Ramer, U., 1972. An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing 1, 244-256.
16. 1 norm. Pattern Recognition 26, 505-509.
17. Ray, K.B., Ray, K.S., 1995. A new split-and-merge technique for polygonal approximation of chain coded curves. Pattern Recognition Letters 16, 161-169.
18. Rosin, P.L., 1997. Technique for accessing polygonal approximations of curves. IEEE Transaction on Pattern Analysis and Machine Intelligence 19, 659-666.
19. Salman, A., Ahmad, I., Al-Madani, S., 2002. Particle swarm optimization for task assignment problem. Microprocessors and Microsystems 26, 363-371.
20. Sato, Y., 1992. Piecewise linear approximation of plane curves by perimeter optimization. Pattern Recognition 25, 1535-1543.
21. Shigenori, N., Takamu, G., Toshiku, Y., Yoshikazu, F., 2003. A hybrid particle swarm optimization for distribution state estimation. IEEE Transaction on Power Systems 18, 60-68.
22. Sklansky, J., Gonzalez, V., 1980. Fast polygonal approximation of digitized curves. Pattern Recognition 12, 327-331.
23. Tandon, V., 2000. Closing the gap between CAD/CAM and optimized CNC end milling. Master thesis, Purdue School of Engineering and Technology, Indiana University Purdue University Indianapolis.
24. Teh, H.C., Chin, R.T., 1989. On the detection of dominant points on digital curves. IEEE Transaction on Pattern Analysis and Machine Intelligence 11, 859-872.
25. Trelea, I.C., 2003. The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters 85, 317-325.
26. 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.
27. Wu, Y.W., Wang, M.J., 1993. Detecting the dominant points by the curvature-based polygonal approximation. CVGIP: Graphical Models and Image Processing 55, 79-88.
28. Yin, P.Y., 1999. Genetic algorithms for polygonal approximation of digital curves. International Journal of Pattern Recognition and Artificial Intelligence 13, 1-22.
29. Yin, P.Y., 2003. Ant colony search algorithms for optimal polygonal approximation of plane curves. Pattern Recognition 36, 1783-1797.
30. Yoshida, H., Kawata, K., Fukuyama, Y., Nakanishi, Y., 1999. A particle swarm optimization for reactive power and voltage control considering voltage stability. In: Proceedings of the International Conference on Intelligent System Application to Power Systems, pp. 117-121.
31. Zhu, P., Chirlian, P.M., 1995. On critical point detection of digital shapes. IEEE Transaction on Pattern Analysis and Machine Intelligence 17, 737-748.