DocumentCode :
226651
Title :
An algorithm of polygonal approximation constrained by the offset direction
Author :
Xiaojing Xuan ; Fangmin Dong ; Shuifa Sun ; Bangjun Lei
Author_Institution :
Coll. of Comput. & Inf. Technol., China Three Gorges Univ., Yichang, China
fYear :
2014
fDate :
9-12 Dec. 2014
Firstpage :
1
Lastpage :
5
Abstract :
In view of the existing polygonal approximation algorithm of digital curves can´t effectively solve the problem of polygonal approximation constrained by the offset direction, this paper proposes an algorithm of polygonal approximation constrained by the offset direction. First, the offset polygon of the original digital curve is calculated under the control of offset direction and distance. Second, the summation of the squared Euclidean distances between the vertices on the offset polygon and its corresponding segment in the approximated polygon is selected as the fitness function. Finally, under the control of the offset distance and fitness function, this paper implements a PSO-based polygonal approximation algorithm to approximate the offset polygon. Experiments show that the proposed method can not only satisfy the polygonal approximation with directional requirements, but also can greatly improve the operating efficiency.
Keywords :
approximation theory; particle swarm optimisation; PSO; digital curves; offset direction; particle swarm optimisation; polygonal approximation; squared Euclidean distances; Algorithm design and analysis; Approximation algorithms; Educational institutions; Heuristic algorithms; Linear approximation; Piecewise linear approximation; PSO algorithm; offset polygon; polygonal approximation; single direction constraint;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Swarm Intelligence (SIS), 2014 IEEE Symposium on
Conference_Location :
Orlando, FL
Type :
conf
DOI :
10.1109/SIS.2014.7011798
Filename :
7011798
Link To Document :
بازگشت