A fast normalized cross correlation-based block matching algorithm using multilevel Cauchy-Schwartz inequality

13Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a fast block-matching algorithm based on the normalized cross-correlation, where the elimination order is determined based on the gradient magnitudes of subblocks in the current macroblock. Multilevel Cauchy-Schwartz inequality is derived to skip unnecessary block-matching calculations in the proposed algorithm. Also, additional complexity reduction is achieved re-using the normalized cross correlation values for the spatially neighboring macroblock because the search areas of adjacent macroblocks are overlapped. Simulation results show that the proposed algorithm can improve the speed-up ratio up to about 3 times in comparison with the existing algorithm. © 2011 ETRI.

Cite

CITATION STYLE

APA

Song, B. C. (2011). A fast normalized cross correlation-based block matching algorithm using multilevel Cauchy-Schwartz inequality. ETRI Journal, 33(3), 401–406. https://doi.org/10.4218/etrij.11.0110.0315

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free