A dual-bound algorithm for very fast and exact template matching.
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.
Schweitzer
Haim
H
Department of Computer Science, The University of Texas at Dallas, Richardson, 75080-3021, USA. hschweitzer@utdallas.edu
Deng
Rui April
RA
Anderson
Robert Finis
RF
D000465:Algorithms; D001185:Artificial Intelligence; D003199:Computer Systems; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods*; D016555:Matched-Pair Analysis; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D012815:Signal Processing, Computer-Assisted; D013382:Subtraction Technique / Q000295:instrumentation