Using local correction and mutation with memory to improve convergence of evolutionary algorithm in image registration
Izidor C. Gertner, Igor V. Maslov · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2002
The modified versions of the basic genetic operations - reproduction, crossover and mutation - in evolutionary algorithm are proposed in relation to 2D grayscale image registration problem. Two modifications of the reproduction phase include deletion of clones and genes with the same or similar parameter values, and local correction of the reproduction pool. Local correction is implemented as two consecutive stages - random search and local refinement. The RC-crossover is introduced that takes advantage of the best genes of the population while avoiding a direct replacement of the worse parameter values with their better counterparts. Mutation with memory aims to explore all poorly represented areas of the search space in order to eliminate the possibility of overlooking a better (or the best) solution. Computational experiments show that proposed modifications can improve convergence of evolutionary procedure when they are applied to 2D grayscale image registration problem.