关键词: 多边形逼近, 遗传算法, 质心, Sigmoid函数

Abstract: An improved approach to polygonal approximation of regular digital curves based on GA algorithm is presented. In this paper, each chromosome corresponds to a candidate solution to the polygonal approximation problem which is represented as a binary vector. The position 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 functon to evaluate the feasibility degree of the candidate solutions. The sigmoid function of iteration times is used as the mutation probability instead of the constant ones to improve the global and local searching characteristics. Experimental results show that the proposed approach can get suitable approximation results for preserving the features of original curves.

Key words: polygonal approximation, generic algorithm, centroid, sigmoid function