Fast Screening Algorithm for Rotation Invariant Template Matching

Abstract

This paper presents a generic screening algorithm for expediting conventional template matching techniques. The algorithm can rule out regions with no possible matches with minimum computational efforts; moreover, the match is robust against rotation changes. The computational efficiency and robustness against rotation are gained by using a novel octagonal star shaped query template and the inclusion-exclusion principle to extract and compare patch features. Extensive experiments demonstrate that the proposed algorithm greatly reduces the search space without adversely affecting the matching accuracy.