The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2011 vol.33)
pp: 459-470
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
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.
INDEX TERMS
Template matching, Walsh transform, pattern matching, real-time matching, priority queues.
CITATION
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
REFERENCES
[1] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. John Wiley & Sons, 1973.
[2] A. Goshtasby, S.H. Gage, and J.F. Bartholic, "A Two-Stage Cross Correlation Approach to Template Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 3, pp. 374-378, May 1984.
[3] A. Rosenfeld and G.J. Vanderburg, "Coarse-Fine Template Matching," IEEE Trans. Systems, Man, and Cybernetics, vol. 7, no. 2, pp. 104-107, Feb. 1977.
[4] O. Pele and M. Werman, "Robust Real-Time Pattern Matching Using Bayesian Sequential Hypothesis Testing," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 8, pp. 1427-1443, Aug. 2008.
[5] W. Li and E. Salari, "Successive Elimination Algorithm for Motion Estimation," IEEE Trans. Image Processing, vol. 4, no. 1, pp. 105-107, Jan. 1995.
[6] S. Mattoccia, F. Tombari, and L.D. Stefano, "Fast Full-Search Equivalent Template Matching by Enhanced Bounded Correlation," IEEE Trans. Image Processing, vol. 17, no. 4, pp. 528-538, Apr. 2008.
[7] M. Gharavi-Alkhansari, "A Fast Globally Optimal Algorithm for Template Matching Using Low-Resolution Pruning," IEEE Trans. Image Processing, vol. 10, no. 4, pp. 526-533, Apr. 2001.
[8] M. Gharavi-Alkhansari, "A Fast Full-Search Equivalent Algorithm Using Energy Compacting Transforms," Proc. Int'l Conf. Image Processing, vol. 2, pp. 713-716, 2001.
[9] Y. Hel-Or and H. Hel-Or, "Real-Time Pattern Matching Using Projection Kernels," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 9, pp. 1430-1445, Sept. 2005.
[10] G. Ben-Artzi, H. Hel-Or, and Y. Hel-Or, "The Gray-Code Filter Kernels," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 3, pp. 382-393, Mar. 2007.
[11] F. Tombari, S. Mattoccia, and L.D. Stefano, "Full Search-Equivalent Pattern Matching with Incremental Dissimilarity Approximations," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 31, no. 1, pp. 129-141, Jan. 2009.
[12] T. Kawanishi, T. Kurozumi, K. Kashino, and S. Tagagi, "A Fast Template Matching Algorithm with Adaptive Skipping Using Inner-Subtemplates' Distances," Proc. 17th IEEE Int'l Conf. Pattern Recognition, 2004.
[13] H. Schweitzer, J.W. Bell, and F. Wu, "Very Fast Template Matching," Proc. European Conf. Computer Vision, A. Heyden, G. Sparr, M. Nielsen, and P. Johansen, eds., pp. 358-372, 2002.
[14] G.W. Stewart and J. Sun, Matrix Perturbation Theory. Academic Press, 1990.
[15] K. Beauchamp, Applications of Walsh and Related Functions. Academic Press, 1984.
[16] W.L. Ouyang and W.K. Cham, "Fast Algorithm for Walsh Hadamard Transform on Sliding Windows," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 32, no. 1, pp. 165-171, Jan. 2010.
[17] P. Viola and M.J. Jones, "Robust Real-Time Face Detection," Int'l J. Computer Vision, vol. 57, no. 2, pp. 137-154, May 2004.
[18] R. Deng, R.F. Anderson, and H. Schweitzer, "A Corner-Based Method for Computing Walsh Transform at Multiple Locations in an Image," Technical Report UTDCS-17-09, Dept. of Computer Science, The Univ. of Texas at Dallas, July 2009.
[19] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press and McGraw-Hill Book Company, 2001.
[20] R. Ronngren and R. Ayani, "A Comparative Study of Parallel and Sequential Priority Queue Algorithms," ACM Trans. Modeling and Computer Simulation, vol. 7, pp. 157-209, 1997.
[21] J.M. de Graaf and W.A. Kosters, "Expected Heights in Heaps," BIT, vol. 32, no. 4, pp. 570-579, 1992.
[22] B. Russell, A. Torralba, K. Murphy, and W. Freeman, "Labelme: A Database and Web-Based Tool for Image Annotation," Technical Report AIM-2005-025, AI Lab, Massachusetts Inst. of Tech nology, Sept. 2005.
[23] J.O. Smith, Mathematics of the Discrete Fourier Transform (DFT), with Audio Applications. W3K Publishing, 2007.
[24] O. Pele and M. Werman, "Accelerated Pattern Matching or How Much Can You Slide?" Proc. Asian Conf. Computer Vision, pp. 435-446, 2007.
[25] F. Hoeg, N. Mellergaard, and J. Staunstrup, "The Priority Queue as an Example of Hardware/Software Codesign," Proc. IEEE Third Int'l Workshop Hardware/Software Co-Design, pp. 81-88, 1994.
[26] H. Schweitzer, R.F. Anderson, and R. Deng, "A Near Optimal Acceptance-Rejection Algorithm for Exact Cross-Correlation Search," Proc. IEEE Int'l Conf. Computer Vision, 2009.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool