TY - GEN

T1 - VLSI oriented fast multiple reference frame motion estimation algorithm for H.264/AVC

AU - Liu, Zhenyu

AU - Li, Ngfeng

AU - Song, Yang

AU - Ikenaga, Takeshi

AU - Goto, Satoshi

PY - 2007/12/1

Y1 - 2007/12/1

N2 - In H.264/AVC standard, motion estimation can be processed on multiple reference frames (MRF) to improve the video coding performance. For the VLSI real-time encoder, the heavy computation of fractional motion estimation (FME) makes the integer motion estimation (IME) and FME must be scheduled in two macro block (MB) pipeline stages, which makes many fast MRF algorithms inefficient for the computation reduction. In this paper, two algorithms are provided to reduce the computation of FME and IME. First, through analyzing the block's Hadamard transform coefficients, all-zero case after quantization can be accurately detected. The FME processing in the remaining frames for the block, detected as all-zero one, can be eliminated. Second, because the fast motion object blurs its edges in image, the effect of MRF to aliasing is weakened. The first reference frame is enough for fast motion MBs and MRF is just processed on those slow motion MBs with a small search range. The computation of IME is also highly reduced with this algorithm. Experimental results show that 61.4%-76.7% computation can be saved with the similar coding quality as the reference software. Moreover, the provided fast algorithms can be combined with fast block matching algorithms to further improve the performance.

AB - In H.264/AVC standard, motion estimation can be processed on multiple reference frames (MRF) to improve the video coding performance. For the VLSI real-time encoder, the heavy computation of fractional motion estimation (FME) makes the integer motion estimation (IME) and FME must be scheduled in two macro block (MB) pipeline stages, which makes many fast MRF algorithms inefficient for the computation reduction. In this paper, two algorithms are provided to reduce the computation of FME and IME. First, through analyzing the block's Hadamard transform coefficients, all-zero case after quantization can be accurately detected. The FME processing in the remaining frames for the block, detected as all-zero one, can be eliminated. Second, because the fast motion object blurs its edges in image, the effect of MRF to aliasing is weakened. The first reference frame is enough for fast motion MBs and MRF is just processed on those slow motion MBs with a small search range. The computation of IME is also highly reduced with this algorithm. Experimental results show that 61.4%-76.7% computation can be saved with the similar coding quality as the reference software. Moreover, the provided fast algorithms can be combined with fast block matching algorithms to further improve the performance.

UR - http://www.scopus.com/inward/record.url?scp=46449088525&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46449088525&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:46449088525

SN - 1424410177

SN - 9781424410170

T3 - Proceedings of the 2007 IEEE International Conference on Multimedia and Expo, ICME 2007

SP - 1902

EP - 1905

BT - Proceedings of the 2007 IEEE International Conference on Multimedia and Expo, ICME 2007

T2 - IEEE International Conference onMultimedia and Expo, ICME 2007

Y2 - 2 July 2007 through 5 July 2007

ER -