Branch and bound algorithms for rate-distortion optimized media streaming

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:3671b5b92f685612a8a7769d9b42b53a

RÖDER, Martin, Jean CARDINAL, Raouf HAMZAOUI, 2006. Branch and bound algorithms for rate-distortion optimized media streaming. In: IEEE Transactions on Multimedia. 8(1), pp. 170-178. ISSN 1520-9210. eISSN 1941-0077. Available under: doi: 10.1109/TMM.2005.861281

@article{Roder2006Branc-22213, title={Branch and bound algorithms for rate-distortion optimized media streaming}, year={2006}, doi={10.1109/TMM.2005.861281}, number={1}, volume={8}, issn={1520-9210}, journal={IEEE Transactions on Multimedia}, pages={170--178}, author={Röder, Martin and Cardinal, Jean and Hamzaoui, Raouf} }

eng We consider the problem of ratedistortion optimized streaming of packetized multimedia data over a single quality of service network using feedback and retransmissions. For a single data unit, we prove that the problem is NP-hard<br />and provide efficient branch and bound algorithms that are much faster than the previously best solution based on dynamic programming. 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 much slower than the current state of the art, a heuristic technique known as sensitivity adaptation. However, in many realworld situations, they provide a significantly better rate-distortion performance. Cardinal, Jean Röder, Martin deposit-license 2006 Hamzaoui, Raouf 2013-04-02T09:05:13Z IEEE Transactions on Multimedia ; 8 (2006), 1. - S. 170-178 Röder, Martin Branch and bound algorithms for rate-distortion optimized media streaming 2013-04-02T09:05:13Z Hamzaoui, Raouf Cardinal, Jean

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Röder_222138.pdf 80

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto