A Fast Template Matching Method based on Context Prediction
This paper presents a novel fast template matching algorithm based on context prediction. The predicted regions are those windows that contain the current entire sub-window. Comparison skipping or comparison terminating is executed when a low bound of distance which has been calculated between the template and the window exceeds the threshold. Experimental results and theory analyses prove the proposed method is faster than the conventional fast template matching method, strictly guaranteeing the same accuracy and up to maximal twenty times faster than the SSDA.
template matching fast algorithm context prediction SSDA
Lie Kang Sheng Zhong Zuoqian Du Zhangfa Ren
State Key Lab. of Multi-spectral Information Processing Technology, Inst. for Pattern Recognition & State Key Lab. of Multi-spectral Information Processing Technology,Inst. for Pattern Recognition & A
国际会议
桂林
英文
1-7
2011-11-01(万方平台首次上网日期,不代表论文的发表时间)