Back to search

McMaster University

Fast Screening Algorithm for Template Matching

Abstract

dc:description.abstract

This paper presents a generic pre-processor for expediting conventional template matching techniques. Instead of locating the best matched patch in the reference image to a query template via exhaustive search, the proposed algorithm rules out regions with no possible matches with minimum computational efforts. While working on simple patch features, such as mean, variance and gradient, the fast pre-screening is highly discriminative. Its computational efficiency is gained by using a novel octagonal-star-shaped template and the inclusion-exclusion principle to extract and compare patch features. Moreover, it can handle arbitrary rotation and scaling of reference images effectively, and also be robust to uniform illumination changes. GPU-aided implementation shows great efficiency of parallel computing in the algorithm design, and extensive experiments demonstrate that the proposed algorithm greatly reduces the search space while never missing the best match.

Degree

thesis:*
Department dc:contributor.department
Electrical and Computer Engineering
Year dc:date.issued
2017

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Liu, Bolin
Advisor dc:contributor.advisor
  • Wu, Xiaolin

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Liu, Bolin. Fast Screening Algorithm for Template Matching. 2017. http://hdl.handle.net/11375/22323