Improvement of a Search Algorithm Using a Genetic Algorithm and Simulated Annealing for a Correspondence Problem

Abstract

This paper proposes a method which improves a search algorithm using a genetic algorithm and simulated annealing for a correspondence problem. The previous method may get caught in a local minimum. Due to an improvement in the search algorithm the proposed method detects good genes of each locus in search process of the previous method.