An Efficient Method For Near-optimalpolygonal Approximation Based On differential Evolution

摘要

Polygonal approximation of digitized curves is an important step in shape representation and analysis. One of the approaches to obtain a good polygonal approximation is that of formulating the approximation task as an optimization problem and then solving it using the available tools. Adopting this strategy, in this article, we present a differential evolution-based method for polygonal approximation. We show that our method not only yields near-optimal results, but also does so very efficiently. The proposed method is also a demonstration of the successful application of differential evolution for solving a combinatorial optimization problem.