A fast template matching algorithm based on principal orientation difference

10Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In the case that the background scene is dense map regularization complex and the detected objects are low texture, the method of matching according to the feature points is not applicable. Usually, the template matching method is used. When training samples are insufficient, the template matching method gets a worse detection result. In order to resolve the problem stably in real time, we propose a fast template matching algorithm based on the principal orientation difference feature. The algorithm firstly obtains the edge direction information by comparing the images that are binary. Then, the template area is divided where the different features are extracted. Finally, the matching positions are searched around the template. Experiments on the videos whose speed is 30 frames/s show that our algorithm detects the low-texture objects in real time with a matching rate of 95%. Compared with other state-of-art methods, our proposed method reduces the training samples significantly and is more robust to the illumination changes.

Cite

CITATION STYLE

APA

Jiao, J., Wang, X., Deng, Z., Cao, J., & Tang, W. (2018). A fast template matching algorithm based on principal orientation difference. International Journal of Advanced Robotic Systems, 15(3). https://doi.org/10.1177/1729881418778223

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