JUCS - Journal of Universal Computer Science 13(10): 1449-1461, doi: 10.3217/jucs-013-10-1449
An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm
expand article infoFangmin Dong‡, Renbin Xiao‡, Yifang Zhong‡, Yong Liu§
‡ Huazhong University of Science and Technology, China§ Three Gorges University, China

Corresponding author: Fangmin Dong ( fmdong@ctgu.edu.cn )

© Fangmin Dong, Renbin Xiao, Yifang Zhong, Yong Liu.
This article is freely available under the J.UCS Open Content License.
Citation: Dong F, Xiao R, Zhong Y, Liu Y (2007) An Approach to Polygonal Approximation of Digital Curves Based on Discrete Particle Swarm Algorithm. JUCS - Journal of Universal Computer Science 13(10): 1449-1461. https://doi.org/10.3217/jucs-013-10-1449
Open Access
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
polygonal approximation, PSO, centroid, sigmoid function