Abstract
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.
| Original language | English |
|---|---|
| Article number | 5439951 |
| Pages (from-to) | 2029-2041 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Image Processing |
| Volume | 19 |
| Issue number | 8 |
| DOIs | |
| State | Published - Aug 2010 |
Bibliographical note
Funding Information:Manuscript received May 17, 2009; revised February 24, 2010. First published March 29, 2010; current version published July 16, 2010. This work was supported in part by the Ministry of Knowledge Economy, Korea, under the ITRC support program supervised by the National IT Industry Promotion Agency (NIPA-2009-C1090-0902-0017) and in part by Seoul R&BD Program (No. ST090818). The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Pier Luigi Dragotti.
Keywords
- Dynamic programming
- multiview video
- prediction structure
- rate-distortion optimization
- video coding