Elimination Algorithms are often used in template matching to provide a significant speed-up
by skipping portions of the computation while guaranteeing the same best-match location as …

Partial computation elimination techniques are often used for fast template matching. At a
particular search location, computations are prematurely terminated as soon as it is found …

We propose a novel algorithm, referred to as enhanced bounded correlation (EBC), that
significantly reduces the number of computations required to carry out template matching …

Recently proposed fast template matching techniques employ rejection schemes derived
from lower bounds on the match measure. This paper generalizes that idea and shows that …

Template matching has many applications in signal processing, image processing, pattern
recognition, and video compression. This paper proposes a fast coarse-to-fine template …

We have developed the Correlation‐based Adaptive Predictive Search (CAPS) as a fast
search strategy for multidimensional template matching. A 2D template is analyzed, and …

This paper describes a novel, fast template-matching technique, referred to as bounded
partial correlation (BPC), based on the normalised cross-correlation (NCC) function. The …

Template matching is a computationally intensive problem aimed at locating a template
within a image. When dealing with images having more than one channel, the …

Recognising and locating image patches or sets of image features is an important task
underlying much work in computer vision. Traditionally this has been accomplished using …

We present an efficient and noise robust template matching method based on asymmetric
correlation (ASC). The ASC similarity function is invariant to affine illumination changes and …