TY - GEN
T1 - VLSI friendly edge gradient detection based multiple reference frames motion estimation optimization for H.264/AVC
AU - Liu, Zhenyu
AU - Huang, Yiqing
AU - Song, Yang
AU - Goto, Satoshi
AU - Ikenaga, Takeshi
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. The computation is also increased in proportion to the reference frame number. Many software oriented fast multiple reference frames motion estimation (MRF-ME) algorithms have been proposed. However, 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-ME algorithms inefficient. In this paper, one edge gradient detection based algorithm is provided to reduce the computation of MRF-ME. The image being rich of texture and sharp edges contains much high frequency signal and this nature makes MRF-ME essential. Through analyzing the edges' gradient, we just perform MRF-ME on those blocks with sharp edges, so the redundant ME computation can be efficiently reduced. Experimental results show that average 26.43% computation can be saved by our approach with the similar coding quality as the reference software. This proposed algorithm is friendly to hardwired encoder implementation. Moreover, the provided fast algorithms can be combined with other fast ME 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. The computation is also increased in proportion to the reference frame number. Many software oriented fast multiple reference frames motion estimation (MRF-ME) algorithms have been proposed. However, 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-ME algorithms inefficient. In this paper, one edge gradient detection based algorithm is provided to reduce the computation of MRF-ME. The image being rich of texture and sharp edges contains much high frequency signal and this nature makes MRF-ME essential. Through analyzing the edges' gradient, we just perform MRF-ME on those blocks with sharp edges, so the redundant ME computation can be efficiently reduced. Experimental results show that average 26.43% computation can be saved by our approach with the similar coding quality as the reference software. This proposed algorithm is friendly to hardwired encoder implementation. Moreover, the provided fast algorithms can be combined with other fast ME algorithms to further improve the performance.
UR - http://www.scopus.com/inward/record.url?scp=43049162240&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=43049162240&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:43049162240
SN - 9788392134022
T3 - European Signal Processing Conference
SP - 1809
EP - 1813
BT - 15th European Signal Processing Conference, EUSIPCO 2007 - Proceedings
T2 - 15th European Signal Processing Conference, EUSIPCO 2007
Y2 - 3 September 2007 through 7 September 2007
ER -