Fast algorithm for robust template matching with M-estimators

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

84 Scopus citations


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 nondecreasing 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 nondecreasing M-estimator serves as an error measure. Experimental results demonstrate the effectiveness of our method.

Original languageEnglish
Pages (from-to)230-243
Number of pages14
JournalIEEE Transactions on Signal Processing
Issue number1
StatePublished - 1 Jan 2003


  • Fast algorithm
  • M-estimator
  • Robust template matching
  • Template matching


Dive into the research topics of 'Fast algorithm for robust template matching with M-estimators'. Together they form a unique fingerprint.

Cite this