loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th International Conference on Pattern Recognition (ICPR'00) - Volume 3
Exploring the Performance of Genetic Algorithms as Polygonal Approximators
Barcelona, Spain
September 03-September 08
ISBN: 0-7695-0750-6
ASCII Text
x 
 
V. Javier Traver, Gabriel Recatalá, José Manuel Iñesta, "Exploring the Performance of Genetic Algorithms as Polygonal Approximators," Pattern Recognition, International Conference on, vol. 3, pp. 3774, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 3, 2000.
 
 
BibTex
x
 
@article{ 10.1109/ICPR.2000.903657,
author = {V. Javier Traver and Gabriel Recatalá and José Manuel Iñesta},
title = {Exploring the Performance of Genetic Algorithms as Polygonal Approximators},
journal ={Pattern Recognition, International Conference on},
volume = {3},
year = {2000},
isbn = {0-7695-0750-6},
pages = {3774},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPR.2000.903657},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Pattern Recognition, International Conference on
TI - Exploring the Performance of Genetic Algorithms as Polygonal Approximators
SN - 0-7695-0750-6
SP
EP
A1 - V. Javier Traver,
A1 - Gabriel Recatalá,
A1 - José Manuel Iñesta,
PY - 2000
VL - 3
JA - Pattern Recognition, International Conference on
ER -
 
V. Javier Traver, Universitat Jaume I
Gabriel Recatalá, Universitat Jaume I
José Manuel Iñesta, Universidad de Alicante
The construction of polygonal approximations for digital curves is a well-known technique to obtain a compact representation of them. Over the last years, a number of methods have been proposed to optimize this process, based on different criteria. In this paper, polygonal approximation making is viewed as an optimization problem, and the use of a genetic algorithm is proposed as a method to find a solution that best meets a given set of requirements. This paper analyses the capability and the performance of the genetic algorithm to select the vertices of the polygons, and some advantages and drawbacks are discussed.
Citation:
V. Javier Traver, Gabriel Recatalá, José Manuel Iñesta, "Exploring the Performance of Genetic Algorithms as Polygonal Approximators," icpr, vol. 3, pp.3774, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 3, 2000
Usage of this product signifies your acceptance of the Terms of Use.