Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, USA.
IEEE Trans Image Process. 2010 Aug;19(8):2029-41. doi: 10.1109/TIP.2010.2046792. Epub 2010 Mar 29.
The coding gain that can be achieved by improving the coding order of B frames in the H.264/AVC standard is investigated in this work. We first represent the coding order of B frames and their reference frames with a binary tree. We then formulate a recursive equation to find out the binary tree that provides a suboptimal, but very efficient, coding order. The recursive equation is efficiently solved using a dynamic programming method. Furthermore, we extend the coding order improvement technique to the case of multiview video sequences, in which the quadtree representation is used instead of the binary tree representation. Simulation results demonstrate that the proposed algorithm provides significantly better R-D performance than conventional prediction structures.
本文研究了通过改进 H.264/AVC 标准中 B 帧的编码顺序所能获得的编码增益。我们首先用二叉树表示 B 帧及其参考帧的编码顺序,然后推导出一个递归方程来找到提供次优但非常有效的编码顺序的二叉树。递归方程通过动态规划方法高效求解。此外,我们将编码顺序改进技术扩展到多视点视频序列的情况,其中使用四叉树表示代替二叉树表示。仿真结果表明,所提出的算法提供了比传统预测结构显著更好的 R-D 性能。