Published Articles >> Table of Contents >> Abstract

Data Compression Conference (DCC '04)   p. 192
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media
Martin Roder, Universität Konstanz, Germany
Jean Cardinal, Université Libre de Bruxelles, Brussels, Belgium
Raouf Hamzaoui, Universität Konstanz, Germany

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2004.1281464
Send link to a friend

Abstract
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For a single data unit, we prove that the problem is NP-hard and provide efficient branch and bound algorithms that are in practice much faster than the best known solution. For a group of interdependent data units, we show how to compute optimal solutions with branch and bound algorithms. The branch and bound algorithms for a group of data units are slower than the current state of the art, the heuristic sensitivity adaptation algorithm, but provide a significantly better rate-distortion performance in many real-world situations.
Back to Top Additional Information
Citation:  Martin Roder, Jean Cardinal, Raouf Hamzaoui, "On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media," dcc, p. 192,  Data Compression Conference (DCC '04),  2004