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

Author

Gharavi-Alkhansari, Mohammad

Author_Institution

Dept of Electr. Eng., Tarbiat Modarres Univ., Tehran, Iran

Volume

10

Issue

4

fYear

2001

fDate

4/1/2001 12:00:00 AM

Firstpage

526

Lastpage

533

Abstract

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

image matching; image resolution; noise; optimisation; search problems; 2D template matching; coarse-to-fine template matching algorithm; exact best match; fast globally optimal algorithm; full search; image processing; low-noise; low-resolution pruning; pattern recognition; signal processing; video compression; Filtering; Image processing; Motion estimation; Pattern matching; Pattern recognition; Pixel; Signal processing algorithms; Uninterruptible power systems; Video compression; Video signal processing;

fLanguage

English

Journal_Title

Image Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7149

Type

jour

DOI

10.1109/83.913587

Filename

913587