Polygonal Approximation Based on Multi-Objective Optimization

In order to solve multiple constraints in the existing polygonal approximation algorithms of digital curves, a new algorithm is proposed in this article. Each control constraint is taken as the optimization objective respectively and the idea of multi-objective optimization is also applied. Vertex positions of the intermediate approximation polygon are represented by a binary sequence, and Hamming distance that often used in communication encoding and vertex position average of each polygonal are introduced to get the position average of the intermediate approximation polygon. Those make the selection of the intermediate global and local optimum more reasonable when updating particles. Experimental show that the proposed algorithm can get better effective results.