TR-IIS-01-015    pdffile

Fast Method for Robust Template Matching

Jiun-Hung Chen, Chu-Song Chen, and Yong-Sheng Chen

Institute of Information Science 20, Academia Sinica

Nankang, Taipei 115, Taiwan, R.O.C.

¡@

In this paper, we propose a fast algorithm for speeding up the process of template matching that uses M-estimators for dealing with outliers. We propose a particular image hierarchy called the p-pyramid that can be exploited to generate a list of ascending lower bounds of the minimal 
matching errors when a non-decreasing robust error measure is adopted. Then, the set of lower bounds can be used to prune the search of the p-pyramid, and a fast algorithm is thereby developed in this paper. This fast algorithm ensures finding the global minimum of the robust template matching problem in which a non-decreasing M-estimator serves as an error measure. Experimental results demonstrate the effectiveness of our method.

Keywords: Template matching, robust template matching, M-estimator, fast algorithm.
¡@