The hybrid evolutionary algorithm is used for image registration formulated as an optimization problem of finding a vector of parameters minimizing the difference between images. The reproduction phase of the algorithm is enhanced with a two-level operation of local correction performed on the best genes in the reproduction pool. Random search is performed in the neighborhood of a gene until the time interval reaches a pre-set threshold. If the gene still retains its position in the pool, a refined multi-step search is performed using the Downhill simplex method. In order to improve the computational performance of the local search, local response analysis is used in the following way. All domains of the given reference image are classified according to their local response to a unit variation of the parameter vector. The classification scheme is based on a self-organizing neural network. During the local correction of the reproduction pool, the step size in the Downhill simplex search is modified according to the class of the image domain.
[1]
John B. Shoven,et al.
I
,
Edinburgh Medical and Surgical Journal.
[2]
William E. Hart,et al.
Optimization with genetic algorithm hybrids that use local searches
,
1996
.
[3]
Aaas News,et al.
Book Reviews
,
1893,
Buffalo Medical and Surgical Journal.
[4]
Margaret H. Wright,et al.
Direct search methods: Once scorned, now respectable
,
1996
.
[5]
S. Welstead.
Fractal and Wavelet Image Compression Techniques
,
1999
.
[6]
David B. Fogel.
Evolutionary Computation: Principles and Practice for Signal Processing
,
2004
.
[7]
Izidor Gertner,et al.
Using local correction and mutation with memory to improve convergence of evolutionary algorithm in image registration
,
2002,
SPIE Defense + Commercial Sensing.