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

• Published in: IEEE transactions on image processing Vol. 10; no. 4; pp. 526 - 533
• Main Author: Gharavi-Alkhansari, M.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.04.2001; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Applied sciences; Artificial intelligence; Computer science; control theory; systems; Exact sciences and technology; Filtering; Image processing; Information, signal and communications theory; Motion estimation; Optimization; Pattern matching; Pattern recognition; Pattern recognition. Digital image processing. Computational geometry; Pixel; Pruning; Searching; Signal processing; Signal processing algorithms; Telecommunications and information theory; Template matching; Uninterruptible power systems; UPS; Video compression; Video signal processing; Experimental result; Motion estimation; Image processing; Multiscale method; Pruning(tree); Low resolution; Pattern recognition; Fast algorithm; Block matching
• ISSN: 1057-7149; 1941-0042
• DOI: 10.1109/83.913587

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.