Fast Template Matching Based on the Numerical Genetic Algorithm

Many template matching approaches in current image processing literatures are not practical because of their time consuming and complicated computation. A fast search mechanism by using genetic algorithm is proposed. As an image is an intrinsically discrete model, we apply the bilinear interpolation algorithm to transform the searched space into a plane with a continuous domain so as to process the numerical optimization. The objective function is inter correlative between template and subimage. We use the numerical genetic algorithm, and obtain recursive solutions by crossover on a convex set. An experiment is given to analyze the properties of the objective function, and an example is shown to explain the performance of the algorithm.