Fast intermode decision algorithm based on general and local residual complexity in H.264/AVC

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

This article is free to access.

Abstract

The state-of-the-art video coding standard H.264/AVC achieves significant coding performance by adopting variable block sizes for motion estimation (ME) and mode decision. However, this technique brings out high computational complexity since the optimal mode is determined by exhaustively performing rate-distortion optimization (RDO) on each coding mode with different block sizes. In this paper, the fast intermode decision algorithm is proposed to reduce the computational complexity. Based on the high correlation between the residual error of ME and the optimal block size, general residual complexity (GRC) and local residual complexity (LRC) are defined. According to MB activity evaluated on GRC and LRC, candidate intermodes are determined and RDO processes are only performed on selected intermodes. The experimental results demonstrate that the proposed algorithm achieves time saving by 63% on average with negligible degradation of coding efficiency. © 2013 Kim et al.; licensee Springer.

Cite

CITATION STYLE

APA

Kim, S., Lim, K., Kim, J. H., & Lee, S. (2013). Fast intermode decision algorithm based on general and local residual complexity in H.264/AVC. Eurasip Journal on Image and Video Processing, 2013. https://doi.org/10.1186/1687-5281-2013-30

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