Content-Aware Fast Motion Estimation for H.264/AVC

Zhenyu LIU; Satoshi GOTO; Takeshi IKENAGA

doi:10.1093/ietfec/e91-a.8.1944

Content-Aware Fast Motion Estimation for H.264/AVC

Zhenyu LIU, Satoshi GOTO, Takeshi IKENAGA

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.8 pp.1944-1952

Publication Date: 2008/08/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e91-a.8.1944

Type of Manuscript: Special Section PAPER (Special Section on Signal Processing)

Category

Cite this

Copy

Zhenyu LIU, Satoshi GOTO, Takeshi IKENAGA, "Content-Aware Fast Motion Estimation for H.264/AVC" in IEICE TRANSACTIONS on Fundamentals, vol. E91-A, no. 8, pp. 1944-1952, August 2008, doi: 10.1093/ietfec/e91-a.8.1944.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.8.1944/_p

Copy

@ARTICLE{e91-a_8_1944,
author={Zhenyu LIU, Satoshi GOTO, Takeshi IKENAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Content-Aware Fast Motion Estimation for H.264/AVC},
year={2008},
volume={E91-A},
number={8},
pages={1944-1952},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e91-a.8.1944},
ISSN={1745-1337},
month={August},}

Copy

TY - JOUR
TI - Content-Aware Fast Motion Estimation for H.264/AVC
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1944
EP - 1952
AU - Zhenyu LIU
AU - Satoshi GOTO
AU - Takeshi IKENAGA
PY - 2008
DO - 10.1093/ietfec/e91-a.8.1944
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2008
AB - 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.
ER -