Branch and bound algorithms for rate-distortion optimized media streaming

De Montfort University Open Research Archive

Show simple item record

dc.contributor.author Hamzaoui, Raouf en
dc.contributor.author Cardinal, J. en
dc.contributor.author Röder, M. en
dc.date.accessioned 2008-11-24T14:02:19Z
dc.date.available 2008-11-24T14:02:19Z
dc.date.issued 2006-02-01 en
dc.identifier.citation Roder, M., Cardinal,J. and Hamzaoui, R.(2006) Branch and bound algorithms for rate-distortion optimized media streaming. IEEE Transactions on Multimedia, 8(1), pp. 170-178.
dc.identifier.issn 1520-9210 en
dc.identifier.uri http://hdl.handle.net/2086/274
dc.description.abstract We consider the problem of rate-distortion 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 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 real-world situations, they provide a significantly better rate-distortion performance.
dc.language.iso en en
dc.publisher IEEE en
dc.subject RAE 2008
dc.subject UoA 24 Electrical and Electronic Engineering
dc.title Branch and bound algorithms for rate-distortion optimized media streaming en
dc.type Article en
dc.identifier.doi http://dx.doi.org/10.1109/TMM.2005.861281 en
dc.researchgroup Centre for Electronic and Communications Engineering


Files in this item

This item appears in the following Collection(s)

Show simple item record