Proceedings Paper
A fast template matching method based on context prediction| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper 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.
Paper Details
Date Published: 2 December 2011
PDF: 7 pages
Proc. SPIE 8004, MIPPR 2011: Pattern Recognition and Computer Vision, 80040C (2 December 2011); doi: 10.1117/12.901571
Published in SPIE Proceedings Vol. 8004:
MIPPR 2011: Pattern Recognition and Computer Vision
Jonathan Roberts; Jie Ma, Editor(s)
PDF: 7 pages
Proc. SPIE 8004, MIPPR 2011: Pattern Recognition and Computer Vision, 80040C (2 December 2011); doi: 10.1117/12.901571
Show Author Affiliations
Lie Kang, Huazhong Univ. of Science and Technology (China)
Sheng Zhong, Huazhong Univ. of Science and Technology (China)
Sheng Zhong, Huazhong Univ. of Science and Technology (China)
Zuoqian Du, Huazhong Univ. of Science and Technology (China)
Zhangfa Ren, Huazhong Univ. of Science and Technology (China)
Zhangfa Ren, Huazhong Univ. of Science and Technology (China)
Published in SPIE Proceedings Vol. 8004:
MIPPR 2011: Pattern Recognition and Computer Vision
Jonathan Roberts; Jie Ma, Editor(s)
© SPIE. Terms of Use
