Loading…
Optimal data partitioning of MPEG-2 coded video
We analyze the problem of optimal data partitioning of MPEG-2 coded video in an operational rate-distortion context. The optimal algorithm is characterized and shown to have high complexity and delay. A causally optimal algorithm based on Lagrangian optimization is proposed, that optimally solves th...
Saved in:
Published in: | IEEE transactions on circuits and systems for video technology 2004-10, Vol.14 (10), p.1195-1209 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We analyze the problem of optimal data partitioning of MPEG-2 coded video in an operational rate-distortion context. The optimal algorithm is characterized and shown to have high complexity and delay. A causally optimal algorithm based on Lagrangian optimization is proposed, that optimally solves the problem for intra (I) pictures, and provides an optimal solution for predicted/interpolated (P/B) pictures when the additional constraints of causal operation and/or low-delay are imposed. A memoryless version of the algorithm, theoretically optimal for intrapictures only, is shown to perform almost identically but with significantly less computational complexity. Finally, a fast, suboptimal algorithm using purely rate-based optimization is also proposed, and is shown to perform quite close (within 1 dB) to the causally optimal one. Experimental results are provided using actual MPEG-2 coded video bitstreams. |
---|---|
ISSN: | 1051-8215 1558-2205 |
DOI: | 10.1109/TCSVT.2004.835149 |