Genetic particle swarm optimization for polygonal approximation of digital curves

摘要

Polygonal approximation is an important technique in image representation which directly impacts on the accuracy and efficacy of the subsequent image analysis tasks. This paper presents a new polygonal approximation approach based on particle swarm optimization (PSO). The original PSO is customized to continuous function value optimization. To facilitate the applicability of PSO to combinatorial optimization involving the problem in question, genetic reproduction mechanisms, namely crossover and mutation, are incorporated into PSO. We also propose a hybrid strategy embedding a segment-adjusting-and-merging optimizer into the genetic PSO evolutionary iterations to enhance its performance. The experimental results show that the proposed genetic PSO significantly improves the search efficacy of PSO for the polygonal approximation problem, and the hybrid strategy can accelerate the convergence speed but still with good-quality results. The performance of the proposed method is compared to existing approaches on both synthesized and real image curves. It is shown that the proposed hybrid genetic PSO outperforms the polygonal approximation approaches based on genetic algorithms and ant colony algorithms.