An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
Fangmin Dong (Huazhong University of Science and Technology, China)
Renbin Xiao (Huazhong University of Science and Technology, China)
Yifang Zhong (Huazhong University of Science and Technology, China)
Yong Liu (Three Gorges University, China)
Abstract: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the polygonal approximation problem, which is represented as a binary vector. The offset error of centroid between the original curve and the approximation polygon, and the variance of distance error for each approximation segment are adopted in the fitness function to evaluate the feasibility degree of the candidate solution. The sigmoid function of iteration times is used as the acceleration factors instead of the constant factors to improve the global searching characteristics. Experimental results show that the proposed approach can get suitable approximation results for preserving the features of original curves.
Keywords: PSO, centroid, polygonal approximation, sigmoid function
Categories: I.2.8, I.3.5