Fast and precise template matching based on oriented gradients

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Konishi, Y., Kotake, Y., Ijiri, Y., & Kawade, M. (2012). Fast and precise template matching based on oriented gradients. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7585 LNCS, pp. 607–610). Springer Verlag. https://doi.org/10.1007/978-3-642-33885-4_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free