摘要

The Adaptive Window Skipping method (AWS) is known as a fast template matching algorithm. This method can reduce the computational burden by using similarity between subtemplates. AWS guarantees the same accuracy as an exhaustive search with template matching. In AWS preprocessing, a reference subtemplate is selected from the set of subtemplates. The position of the reference subtemplate affects the computational burden. But this position has not been taken into account in AWS. In this paper we propose a new method that takes into account the position of the reference subtemplate. Experimental results show that the proposed method is faster than AWS.

  • 出版日期2011-12

全文