Complexity Reduction of Fast Block Matching Algorithm
P. Muralidhar1, A. Vishnupriya2, C. B. RamaRao3
1P. Muralidhar, Department of Electronica and Communication Engineering, N.I.T. Warangal, India.
2A. Vishnupriya, Department of Electronica and Communication Engineering, N.I.T. Warangal, India.
3C. B. Amarao, Department of Electronica and Communication Engineering, N.I.T. Warangal, India.
Manuscript received on July 17, 2012. | Revised Manuscript received on August 25, 2012. | Manuscript published on August 30, 2012. | PP: 277-281 | Volume-1 Issue-6, August 2012. | Retrieval Number: F0675081612/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This paper presents a new block matching motion estimation algorithm using the macro block features to reduce the computational complexity of motion estimation in video encode applications. Motion estimation block is the computationally intensive block in video encoders. To reduce computational cost various motion estimation algorithms have been proposed. Global Elimination is an algorithm based on pixel averaging to reduce the complexity of motion search while keeping performance close to that of full search. Here adaptive version of Global elimination is proposed that uses macro block features like variance and Hadamard transform to further reduce the computational complexity of motion estimation. Performance achieved is close to the full search method and global elimination. Operational complexity is reduced compared to global elimination method.
Keywords: Block Matching Motion Estimation Algorithm, Global Elimination, Matching complexity reduction, Feature based partitioning.