DocumentCode :
1496510
Title :
A Dual-Bound Algorithm for Very Fast and Exact Template Matching
Author :
Schweitzer, Haim ; Deng, Rui April ; Anderson, Robert Finis
Author_Institution :
Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
Volume :
33
Issue :
3
fYear :
2011
fDate :
3/1/2011 12:00:00 AM
Firstpage :
459
Lastpage :
470
Abstract :
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 in addition to lower bounds, upper bounds on the match measure can be used to accelerate the search. An algorithm is proposed that utilizes both lower and upper bounds to detect the k best matches in an image. The performance of this dual-bound algorithm is guaranteed; it always detects the k best matches. Theoretical analysis and experimental results show that its runtime compares favorably with previously proposed real-time exact template-matching schemes.
Keywords :
Hadamard transforms; Walsh functions; image matching; Walsh transform; dual bound algorithm; template matching; Acceleration; Computer science; Euclidean distance; Image resolution; Image sampling; Loss measurement; Pattern matching; Pattern recognition; Pixel; Upper bound; Template matching; Walsh transform; pattern matching; priority queues.; real-time matching; Algorithms; Artificial Intelligence; Computer Systems; Image Enhancement; Image Interpretation, Computer-Assisted; Information Storage and Retrieval; Matched-Pair Analysis; Pattern Recognition, Automated; Reproducibility of Results; Sensitivity and Specificity; Signal Processing, Computer-Assisted; Subtraction Technique;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/TPAMI.2010.105
Filename :
5467087
Link To Document :
بازگشت