Abstract
Several methods aimed at effectively speeding up the block matching and template matching tasks have been recently proposed. A class of these methods, referred to as exhaustive due to the fact that they optimally solve the minimization problem of the matching cost, often deploys a succession of bounding functions based on a partitioning of the template and subwindow to perform rapid and reliable detection of non-optimal candidates. In this paper we propose a study aimed at improving the efficiency of one of these methods, that is, a state-of-the-art template matching technique known as Incremental Dissimilarity Approximations (IDA). In particular, we outline a methodology to order the succession of bounding functions deployed by this technique based on the analysis of the template only. Experimental results prove that the proposed approach is able to achieve improved efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Li, W., Salari, E.: Successive elimination algorithm for motion estimation. IEEE Trans. on Image Processing 4(1), 105–107 (1995)
Tombari, F., Mattoccia, S., Di Stefano, L.: Full search-equivalent pattern matching with Incremental Dissimilarity Approximations. IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI) 31(1), 129–141 (2009)
Mahmood, A., Khan, S.: Early termination algorithms for correlation coefficient based block matching. In: Proc. Int. Conf. on Image Processing (ICIP 2007), vol. 2, pp. 469–472 (2007)
Wei, S.D., Lai, S.H.: Efficient Normalized Cross Correlation Based on Adaptive Multilevel Successive Elimination. In: Yagi, Y., Kang, S.B., Kweon, I.S., Zha, H. (eds.) ACCV 2007, Part I. LNCS, vol. 4843, pp. 638–646. Springer, Heidelberg (2007)
Pan, W.H., Wei, S.D., Lai, S.H.: Efficient NCC-Based Image Matching in Walsh-Hadamard Domain. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part III. LNCS, vol. 5304, pp. 468–480. Springer, Heidelberg (2008)
Alkhansari, M.G.: A fast globally optimal algorithm for template matching using low-resolution pruning. IEEE Trans. Image Processing 10(4), 526–533 (2001)
Gao, X.Q., Duanmu, C.J., Zou, C.R.: A multilevel successive elimination algorithm for block matching motion estimation. IEEE Trans. Image Processing 9(3), 501–504 (2000)
Hel-Or, Y., Hel-Or, H.: Real-time pattern matching using projection kernels. IEEE Trans. Pattern Analysis and Machine Intelligence 27(9), 1430–1445 (2005)
Bei, C.D., Gray, R.M.: An improvement of the minimum distortion encoding algorithm for vector quantization. IEEE Trans. on Communication 33, 1132–1133 (1985)
Montrucchio, B., Quaglia, D.: New Sorting-Based Lossless Motion Estimation Algorithms and a Partial Distortion Elimination Performance Analysis. IEEE Trans. on Circuits and Systems for Video Technology 15(2) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tombari, F., Mattoccia, S., Di Stefano, L., Regoli, F., Viti, R. (2009). A Template Analysis Methodology to Improve the Efficiency of Fast Matching Algorithms. In: Blanc-Talon, J., Philips, W., Popescu, D., Scheunders, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2009. Lecture Notes in Computer Science, vol 5807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04697-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-04697-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04696-4
Online ISBN: 978-3-642-04697-1
eBook Packages: Computer ScienceComputer Science (R0)