<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T03:59:43Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/22323" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/22323</identifier><datestamp>2026-09-24T22:38:59Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Wu, Xiaolin</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Liu, Bolin</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-10-30T15:22:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-10-30T15:22:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/22323</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/16006</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This paper presents a generic pre-processor for expediting &#xd;
conventional template matching techniques. Instead of locating the &#xd;
best matched patch in the reference image to a query template via &#xd;
exhaustive search, the proposed algorithm rules out regions with no &#xd;
possible matches with minimum computational efforts. While working &#xd;
on simple patch features, such as mean, variance and gradient, the &#xd;
fast pre-screening is highly discriminative. Its computational &#xd;
efficiency is gained by using a novel octagonal-star-shaped template &#xd;
and the inclusion-exclusion principle to extract and compare patch &#xd;
features. Moreover, it can handle arbitrary rotation and scaling of &#xd;
reference images effectively, and also be robust to uniform &#xd;
illumination changes. GPU-aided implementation shows great efficiency &#xd;
of parallel computing in the algorithm design, and extensive &#xd;
experiments demonstrate that the proposed algorithm greatly reduces &#xd;
the search space while never missing the best match.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Applied Science (MASc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">computer vision</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">image processing</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Fast Screening Algorithm for Template Matching</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>