A Mutation-Particle Swarm Algorithm for Error-Bounded Polygonal Approximation of Digital Curves

Authors:
Bin Wang;Hua-Zhong Shu;Bao-Sheng Li;Zhi-Mei Niu
Affiliations:
School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China 210096;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China 210096;Department of Radiation Oncology, Shandong Cancer Hospital, Jinan, P.R. China 250117;College of Computer Science and Engineering, Wuhan Institue of Technology, Wuhan, P.R. China 430073
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Year:
2008

Citing 4
Cited 1

Optimum Uniform Piecewise Linear Approximation of Planar Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Detection of Dominant Points on Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
A new method for polygonal approximation using genetic algorithms

Pattern Recognition Letters

ISE-bounded polygonal approximation of digital curves

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a particle swarm optimization algorithm (PSO) to solve error-bounded polygonal approximation of digital curves. Different from the existing PSO-based methods for polygonal approximation problem, the mutation operators borrowed from genetic algorithms, are incorporated into the PSO, so we call it MPSO. This scheme can increase the diversity of the population and help the particles effectively escape from the local optimum. Experiments were performed on three commonly used benchmark curves to test the effectiveness of the proposed MPSO. The results manifest that the proposed MPSO has the higher performance than the existing GA-based methods and PSO methods.