WANG Bin, SHI Chao-jian. Using Hybrid Genetic Algorithms to Solve Two Types of Polygonal Approximation Problems[J]. Acta Electronica Sinica, 2007, 35(8): 1527-1532.
DOI:
WANG Bin, SHI Chao-jian. Using Hybrid Genetic Algorithms to Solve Two Types of Polygonal Approximation Problems[J]. Acta Electronica Sinica, 2007, 35(8): 1527-1532.DOI:
Using Hybrid Genetic Algorithms to Solve Two Types of Polygonal Approximation Problems
Polygonal approximation of digital curve is an important curve representation method.The main problems existing in genetic algorithm based methods are the difficulty of coping with the infeasible solutions and the poor local search ability.In this paper
we propose a hybrid genetic algorithm combined with split and merge technique (SMGA) for polygonal approximation.Its main idea is that two classical methodssplit and merge techniques are used to repair the infeasible solutions.In this method
an infeasible solution can not only be repaired rapidly
but also be pushed to a local optimal location in the solution space.Another advantage of SMGA is that it can solve two types of polygonal approximation problems.The experimental results demonstrate that SMGA is robust and outperforms the other genetic algorithm based methods.