Exploiting Reference Frame History in H.264/AVC Motion Estimation

Mahajan, A.K.; Kondayya, S.; Su, Xiao

doi:10.1109/apccas.2006.342476

Cited by 2 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A fast multi-frame based motion estimation algorithm was proposed for MPEG-4 to H.264 video transcoder, and it employs both temporal and spatial prediction methods form a high accuracy prediction scheme [13]. Anjali et al proposed a fast multi-reference frame selection method that used the strategy of Most-Used-Reference-First based on the usage history of reference frames [14].A fast block-based motion estimation using early stop search techniques for H.264/AVC standard which reduces the computational cost by reducing the number of candidate pixels required for the sum of absolute difference (SAD) for each block has been proposed in [15], it reduces the computational cost by decreasing the number of candidate pixels. However, the coding structures in MVC are more complex than that in stereo video coding, these fast algorithms for mono-view video coding can not be used directly for MVC.…”

Section: Introductionmentioning

confidence: 99%

A Fast Multi-reference Frame Selection Algorithm for Multiview Video Coding

Si¹,

Yu²,

Peng³

et al. 2010

JMM

View full text Add to dashboard Cite

Multiview video coding (MVC) plays an important role in three-dimensional video applications. Joint Video Team developed a joint multiview video model (JMVM) with multi-reference frame technology. Motion and disparity estimation are employed in multi-reference frame technology to provide better rate distortion performance. However, the process of searching blocks with variable sizes for motion and disparity estimation in multi-reference frames significantly increases the computational complexity. After analyzing the statistical features of multi-reference frames in MVC, this paper proposes a fast multi-reference frame selection algorithm based on a dynamic threshold technology correlated with the types of frames. All views of prediction structure in JMVM are categorized into three types, that is, the basic view without inter-view reference relation, the first layer views that only refer anchor frame from upper view, the second layer views that need to refer the basic view and the first layer views. Furthermore, all frames in MVC prediction structure are divided into three categories, the anchor frame without any reference, non-anchor frame in the base view and the first layer view, and the non-anchor frame in other views. Dynamic threshold technique is given to terminate the process of searching multi-reference frames early. The proposed algorithm also reduces the useless candidate reference frames by filtering out those reference frames that are less likely to contain the best matched results and achieves significant speed-up. Experimental results show that the proposed algorithm can achieve 50.13% ~ 72.19% reduction of encoding time in comparison with JMVM7.0, while the proposed algorithm hardly influences the rate distortion performance of MVC.

show abstract

Section: Introductionmentioning

confidence: 99%

A Fast Multi-reference Frame Selection Algorithm for Multiview Video Coding

Si¹,

Yu²,

Peng³

et al. 2010

JMM

View full text Add to dashboard Cite

show abstract

“…Many methods have been proposed to reduce the computation [1][2][3][4][5][6][7][8][9][10][11] and the memory access [12,13] for the MRF-ME. In [1][2][3][4], the motion vectors between two successive reference frames are used to predict the optimal motion vectors between the current frame and the reference frames (second to the oldest).…”

Section: Introductionmentioning

confidence: 99%

“…These approaches effectively simplify the complexity of the MRF-ME but are more suitable for software-oriented implementations. Several researches [5][6][7] use a threshold condition to determine whether to terminate the ME process or to skip remaining reference frames early so the computational cost can be reduced. Ting et al [8] propose a center-based frame selection algorithm which only searches on a selected path in each reference frame to determine a final frame for full search.…”

Section: Introductionmentioning

confidence: 99%

Avoiding unnecessary frame memory access and multi-frame motion estimation computation in H.264/AVC

Lin

Chen

2008

2008 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

H.264/AVC video compression standard uses multiple reference frame motion estimation (MRF-ME) to enhance the coding performance. The required frame memory accesses and the computational cost of the MRF-ME, however, are very high. This paper proposes an approach which exploits the characteristic of a constant luminance macroblock (L-MB) to avoid unnecessary frame memory accesses and MRF-ME computation. Simulation results show that the proposed scheme can reduce about 43% of the frame memory accesses and 33% of the MRF-ME computation for low motion video sequences without any PSNR degradation and bit-rate increase.

show abstract

Exploiting Reference Frame History in H.264/AVC Motion Estimation

Cited by 2 publications

References 6 publications

A Fast Multi-reference Frame Selection Algorithm for Multiview Video Coding

A Fast Multi-reference Frame Selection Algorithm for Multiview Video Coding

Avoiding unnecessary frame memory access and multi-frame motion estimation computation in H.264/AVC

Contact Info

Product

Resources

About