A fast globally optimal algorithm for template matching using low-resolution pruning

doi:10.1109/83.913587

Return

A fast globally optimal algorithm for template matching using low-resolution pruning

2001-04-01

PRE

Gharavi-Alkhansari, M *

DOI：10.1109/83.913587

Original

Original request for help

Save

Abstract

En 中文

Template matching has many applications in signal processing, image processing, pattern recognition, and video compression, This paper proposes a fast coarse-to-fine template matching algorithm for finding the exact best match, i.e., the match. that may be found by a full search. This is obtained by pruning the number of candidates in the full search using the results of a coarse search. Experimental results show that speed ups of a couple of orders of magnitude can easily be achieved using this method for typical low-noise cases of two-dimensional (2-D) template matching.

Keywords:

block matching

exhaustive search

fast algorithms

full search

image search

motion estimation

template matching

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.