Fast algorithm for robust template matching with M-estimators

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

*此作品的通信作者

研究成果: Article同行評審

87 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)230-243
頁數14
期刊IEEE Transactions on Signal Processing
51
發行號1
DOIs
出版狀態Published - 1 1月 2003

指紋

深入研究「Fast algorithm for robust template matching with M-estimators」主題。共同形成了獨特的指紋。

引用此