A fast template matching method based on context prediction

Lie Kang; Sheng Zhong; Zuoqian Du; Zhangfa Ren

doi:10.1117/12.901571

2 December 2011 A fast template matching method based on context prediction

Lie Kang, Sheng Zhong, Zuoqian Du, Zhangfa Ren

Proceedings Volume 8004, MIPPR 2011: Pattern Recognition and Computer Vision; 80040C (2011) https://doi.org/10.1117/12.901571
Event: Seventh International Symposium on Multispectral Image Processing and Pattern Recognition (MIPPR2011), 2011, Guilin, China

Abstract

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.

Citation Download Citation

Lie Kang, Sheng Zhong, Zuoqian Du, and Zhangfa Ren "A fast template matching method based on context prediction", Proc. SPIE 8004, MIPPR 2011: Pattern Recognition and Computer Vision, 80040C (2 December 2011); https://doi.org/10.1117/12.901571

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available