Analysis and reduction of reference frames for motion estimation in MPEG-4 AVC/JVT/H.264

Authors:
Yu-Wen Huang;Bing-Yu Hsieh;Tu-Chih Wang;Shao-Yi Chen;Shyh-Yih Ma;Chun-Fu Shen;Liang-Gee Chen
Affiliations:
Dept. of Electr. Eng., Nat. Taiwan Univ., Taiwan;Dept. of Electr. Eng., Nat. Taiwan Univ., Taiwan;Dept. of Electr. Eng., Nat. Taiwan Univ., Taiwan;Dept. of Electr. Eng., Nat. Taiwan Univ., Taiwan;Center for Adv. Comput. Studies, Louisiana Univ., Lafayette, LA, USA;Inst. for Infocomm Res., A-STAR, Singapore;Inst. for Infocomm Res., Singapore, Singapore
Venue:
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1
Year:
2003

Citing 0
Cited 3

Survey on Block Matching Motion Estimation Algorithms and Architectures with New Results

Journal of VLSI Signal Processing Systems
Fast multi-reference motion estimation via statistical learning for H.264/AVC

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
A fast algorithm for macroblock mode selection in h.264 video coding

ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the new video coding standard, MPEG-4 AVC/JVT/H.264, motion estimation is allowed to use multiple reference frames. The reference software adopts full search scheme, and the increased computation is in proportion to the number of searched reference frames. However, the reduction of prediction residues is highly dependent on the nature of sequences, not on the number of searched frames. In this paper, we present a method to speed up the matching process for multiple reference frames. For each macroblock, we analyze the available information after intra prediction and motion estimation from previous one frame to determine whether it is necessary to search more frames. The information we use includes selected mode, inter prediction residues, intra prediction residues, and motion vectors. Simulation results show that the proposed algorithm can save up to 90% of unnecessary frames while keeping the average miss rate of optimal frames less than 4%.