Fast and Precise Template Matching Based on Oriented Gradients
Abstract
In this paper we propose a fast template matching method which can handle various types of objects. In our method the discretized orientations of image gradients which are robust to illumination changes and clutterd backgrounds are used as features. The features are binary represented and they can be matched very fast using bitwise operations. Furthermore, the rotated and resized templates those have similar feature vectors are clustered to one template and the total number of templates are greatly reduced, which boosts the detection speed. The experimental results show that our method can detect target objects (the search space includes translation, ±180 deg rotation, and ±50% scale change) with sub-pixel accracy in real-time.
Cite
Text
Konishi et al. "Fast and Precise Template Matching Based on Oriented Gradients." European Conference on Computer Vision, 2012. doi:10.1007/978-3-642-33885-4_63Markdown
[Konishi et al. "Fast and Precise Template Matching Based on Oriented Gradients." European Conference on Computer Vision, 2012.](https://mlanthology.org/eccv/2012/konishi2012eccv-fast/) doi:10.1007/978-3-642-33885-4_63BibTeX
@inproceedings{konishi2012eccv-fast,
title = {{Fast and Precise Template Matching Based on Oriented Gradients}},
author = {Konishi, Yoshinori and Kotake, Yasuyo and Ijiri, Yoshihisa and Kawade, Masato},
booktitle = {European Conference on Computer Vision},
year = {2012},
pages = {607-610},
doi = {10.1007/978-3-642-33885-4_63},
url = {https://mlanthology.org/eccv/2012/konishi2012eccv-fast/}
}