DocumentCode
2825291
Title
Automatic knot adjustment by an improved genetic algorithm
Author
Pingping, Li ; Xiuyang, Zhao ; Bo, Yang
Author_Institution
Sch. of Inf. Sci. & Eng., Univ. of Jinan, Jinan, China
Volume
3
fYear
2010
fDate
21-24 May 2010
Abstract
In order to obtain a good B-spline contour model from scattered data, the knots can be respected as variables. A curve is then modeled as a continuous, nonlinear and multivariate optimization problem with many local optima. To overcome the defects of traditional genetic algorithm in adjusting knots, an improved genetic algorithm is designed in this paper. In order to improve its searching space and convergence performance, the improved genetic algorithm adopts float-coding and introduces a dynamic adaptive strategy to adjust the crossover rate (Pc) and mutation rate (Pm). Results show that the improved genetic algorithm maintains the population diversity and alleviates the problem of premature convergence more effectively, and determines a more appropriate location of knots.
Keywords
convergence; genetic algorithms; splines (mathematics); B-spline contour model; automatic knot adjustment; continuous optimization problem; convergence performance; dynamic adaptive strategy; float-coding; genetic algorithm; multivariate optimization problem; nonlinear optimization problem; scattered data; searching space; Automatic control; Computer science; Convergence; Genetic algorithms; Genetic engineering; Genetic mutations; Information science; Sampling methods; Shape measurement; Spline; B-spline; genetic algorithm; knot adjustment; premature convergence;
fLanguage
English
Publisher
ieee
Conference_Titel
Future Computer and Communication (ICFCC), 2010 2nd International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-5821-9
Type
conf
DOI
10.1109/ICFCC.2010.5497410
Filename
5497410
Link To Document