IEEE Transactions on Multimedia
Efficiency analysis of multihypothesis motion-compensated prediction for video coding
IEEE Transactions on Image Processing
Motion- and aliasing-compensated prediction for hybrid video coding
IEEE Transactions on Circuits and Systems for Video Technology
Fast mode decision algorithm for intraprediction in H.264/AVC video coding
IEEE Transactions on Circuits and Systems for Video Technology
Fast intermode decision in H.264/AVC video coding
IEEE Transactions on Circuits and Systems for Video Technology
Fast multiple reference frame motion estimation for H.264/AVC
IEEE Transactions on Circuits and Systems for Video Technology
Analysis and complexity reduction of multiple reference frames motion estimation in H.264/AVC
IEEE Transactions on Circuits and Systems for Video Technology
Analysis and architecture design of an HDTV720p 30 frames/s H.264/AVC encoder
IEEE Transactions on Circuits and Systems for Video Technology
Analysis and architecture design of scalable fractional motion estimation for H.264 encoding
Integration, the VLSI Journal
Hi-index | 0.00 |
The key to high performance in video coding lies on efficiently reducing the temporal redundancies. For this purpose, H.264/AVC coding standard has adopted variable block size motion estimation on multiple reference frames to improve the coding gain. However, the computational complexity of motion estimation is also increased in proportion to the product of the reference frame number and the intermode number. The mathematical analysis in this paper reveals that the prediction errors mainly depend on the image edge gradient amplitude and quantization parameter. Consequently, this paper proposes the image content based early termination algorithm, which outperforms the original method adopted by JVT reference software, especially at high and moderate bit rates. In light of rate-distortion theory, this paper also relates the homogeneity of image to the quantization parameter. For the homogenous block, its search computation for futile reference frames and intermodes can be efficiently discarded. Therefore, the computation saving performance increases with the value of quantization parameter. These content based fast algorithms were integrated with Unsymmetrical-cross Multihexagon-grid Search (UMHexagonS) algorithm to demonstrate their performance. Compared to the original UMHexagonS fast matching algorithm, 26.14–54.97% search time can be saved with an average of 0.0369 dB coding quality degradation.