Polygonal Approximation of Digital Curves Using a Multi-objective Genetic Algorithm - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Polygonal Approximation of Digital Curves Using a Multi-objective Genetic Algorithm

Résumé

In this paper, a polygonal approximation approach based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates breakpoints on the digital curve by minimizing simultaneously the number of breakpoints and the approximation error. Using such an approach, the algorithm proposes a set of solutions at its end. This set which is called the Pareto Front in the multi objective optimization field contains solutions that represent trade-offs between the two classical quality criteria of polygonal approximation : the Integral Square Error (ISE) and the number of vertices. The user may choose his own solution according to its objective. The proposed approach is evaluated on curves issued from the literature and compared with many classical approaches.
Fichier principal
Vignette du fichier
grec05_2.pdf (561.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00601529 , version 1 (18-06-2011)

Identifiants

Citer

Hervé Locteau, Romain Raveaux, Sébastien Adam, Yves Lecourtier, Pierre Héroux, et al.. Polygonal Approximation of Digital Curves Using a Multi-objective Genetic Algorithm. IAPR International Workshop on Graphics Recognition, 2005, Honk-Kong, Hong Kong SAR China. pp.300-311, ⟨10.1007/11767978_27⟩. ⟨hal-00601529⟩
54 Consultations
426 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More