Optimal bit allocation under multiple rate constraints

Authors:
A. Ortega
Affiliations:
-
Venue:
DCC '96 Proceedings of the Conference on Data Compression
Year:
1996

Citing 0
Cited 6

Further improvement on dynamic programming for optimal bit allocation

Journal of Computer Science and Technology
Recent advances in rate control for video coding

Image Communication
Remote interactive browsing of video surveillance content based on JPEG 2000

IEEE Transactions on Circuits and Systems for Video Technology
Energy efficient distributed image compression in resource-constrained multihop wireless networks

Computer Communications
Hill climbing algorithm for the transmission of layered JPEG2000 video under multiple rate constraints

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Parity bit replenishment for JPEG 2000-based video streaming

Journal on Image and Video Processing - Special issue on distributed video coding

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new Lagrangian-based iterative technique for rate-distortion optimization under multiple rate constraints. We show how for sets of "linear" constraints this technique can be proven to be optimal up to a convex hull approximation. As an application we consider the problem of optimal buffer-constrained bit allocation. Our technique can be used to find an excellent approximation to the solutions achieved using dynamic programming. In cases where the buffer size is relatively large our approach shows a significant reduction in complexity as compared to dynamic programming.