摘要
H.264采用的多参考帧运动估计极大地增加了编码器的复杂度。文中分析了各参考帧在运动估计中的作用,提出一种快速多参考帧选择算法以降低运算复杂度。该算法利用已编码相邻块参考帧的相关性,对参考帧进行预选择和排序,以避免不必要的运动搜索。可以与其它多参考帧运动估计算法相结合。实验结果表明,与H.264参考软件JM9.6中的快速算法UMHexagonS相比,提出的算法在保持编码图像质量的同时,可以进一步降低多参考帧运动估计的运算量,能够节省约35%的编码时间。
H. 264 encoder complexity is considerable due to the multiple reference frame motion estimation (MRFME). In this paper, a fast multiple reference frame selection algorithm is proposed to reduce the computational complexity of MRFME. Based on the reference frame correlation of the neighboring blocks, the early selection and reordering of the reference frames are adopted to avoid the unnecessary searching procedure. And this algorithm can be combined with other MRFME methods. Experimental results show that the proposed algorithm can further decrease the search calculation and can save about 35% of MRFME time with little loss of the peak signal noise ratio (PSNR) of pictures compared with the original fast motion estimation algorithm named UMHexagonS adopted by H. 264 reference software JM9. 6.
出处
《电子科技》
2008年第5期49-53,共5页
Electronic Science and Technology
关键词
H.264
多参考帧选择
参考帧遍历重排
H. 264
multiple reference frame selection
reference frame reordering