A fast sequential method for polygonal approximation of digitized curves
Computer Vision, Graphics, and Image Processing
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new split-and-merge technique for polygonal approximation of chain coded curves
Pattern Recognition Letters
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A review of particle swarm optimization. Part I: background and development
Natural Computing: an international journal
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
Natural Computing: an international journal
Genetic particle swarm optimization based on estimation of distribution
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
IEEE Transactions on Evolutionary Computation
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Expert Systems with Applications: An International Journal
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Multi-basin particle swarm intelligence method for optimal calibration of parametric Lévy models
Expert Systems with Applications: An International Journal
ISE-bounded polygonal approximation of digital curves
Pattern Recognition Letters
Information Sciences: an International Journal
| Hi-index | 12.05 |
The polygonal approximation is an important topic in the area of pattern recognition, computer graphics and computer vision. This paper presents a novel discrete particle swarm optimization algorithm based on estimation of distribution (DPSO-EDA), for two types of polygonal approximation problems. Estimation of distribution algorithms sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from local best solution of all particles into the particle swarm optimization and therefore each particle has comprehensive learning and search ability. Further, constraint handling methods based on the split-and-merge local search is introduced to satisfy the constraints of the two types of problems. Simulation results on several benchmark problems show that the DPSO-EDA is better than previous methods such as genetic algorithm, tabu search, particle swarm optimization, and ant colony optimization.