Sciweavers

Share
ICASSP
2008
IEEE

Iterative R-D optimization of H.264

9 years 8 months ago
Iterative R-D optimization of H.264
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. The primal decomposition method enables spatial or temporal prediction dependency within a Group Of Picture (GOP) to be processed in the master primal problem. As a result, we can apply the dual decomposition to minimize independently the Lagrangian cost of all the MBs using the reference software model of H.264. Furthermore, the optimal Lagrange multiplier λ∗ is iteratively derived from the solution of the dual problem. As an example, we derive the optimal bit allocation condition with the consideration of temporal prediction dependency among the pictures. Experimental results show that the proposed method achieves better performance than the reference software model of H.264 with rate control for given bit constraint.
Cheolhong An, Truong Q. Nguyen
Added 30 May 2010
Updated 30 May 2010
Type Conference
Year 2008
Where ICASSP
Authors Cheolhong An, Truong Q. Nguyen
Comments (0)
books