Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
