CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2011 vol.33 Issue No.03 - March
Issue No.03 - March (2011 vol.33)
Haim Schweitzer , The University of Texas at Dallas, Richardson, TX
Rui (April) Deng , The University of Texas at Dallas, Richardson, TX
Robert Finis Anderson , The University of Texas at Dallas, Richardson, TX
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.
Template matching, Walsh transform, pattern matching, real-time matching, priority queues.
Haim Schweitzer, Rui (April) Deng, Robert Finis Anderson, "A Dual-Bound Algorithm for Very Fast and Exact Template Matching", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 3, pp. 459-470, March 2011, doi:10.1109/TPAMI.2010.105