Fast template matching using Brick Partitioning and initial threshold

Template matching is a technique for finding a part of reference image which matches a template image. This paper presents a new fast template matching algorithm which can detect the most similar position. In the proposed method, first, an effective initial threshold is calculated using Winner Update Algorithm. Next, very fast template matching is achieved by using this initial threshold in Multilevel Successive Elimination Algorithm. Furthermore, Brick Partitioning which is a new partitioning method is used to reduce the computational cost of comparing a template with each position within reference image. Experimental results indicate that the proposed method can search faster than previous methods.