Given an m/spl times/m image I and a smaller n/spl times/n image P, the computation of an
(m-n+ 1)/spl times/(m-n+ 1) matrix C where C (i, j) is of the form C (i, j)=/spl Sigma//sub k …

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 …

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 …

Template matching is widely used for many applications in image and signal processing.
This paper proposes a novel template matching algorithm, called algebraic template …

Template matching by normalized correlations is a common technique for determine the
existence and compute the location of a shape within an image. In many cases the run time …

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

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 …

An accurate template matching algorithm of low computational complexity that facilitates low-
cost hardware design and VLSI implementation is highly desired by many image-processing …

Rete: a fast match algorithm | AI Expert skip to main content ACM Digital Library home ACM
corporate logo Google, Inc. (search) Advanced Search Browse About Sign in Register …

A new and useful template technique | C++ gems skip to main content ACM Digital Library
home ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register …