Share Email Print

Proceedings Paper

Efficient rate-distortion optimized media streaming for tree-reducible packet dependencies
Author(s): Martin Röder; Jean Cardinal; Raouf Hamzaoui
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In packetized media streaming systems, packet dependencies are often modeled as a directed acyclic graph called the dependency graph. We consider the situation where the dependency graph is reducible to a tree. This occurs, for instance, in MPEG1 video streams that are packetized at the frame level. Other video coding standards such as H.264 also allow tree-reducible dependencies. We propose in this context efficient dynamic programming algorithms for finding rate-distortion optimal transmission policies. The proposed algorithms are much faster than previous exact algorithms developed for arbitrary dependency graphs.

Paper Details

Date Published: 16 January 2006
PDF: 12 pages
Proc. SPIE 6071, Multimedia Computing and Networking 2006, 607104 (16 January 2006); doi: 10.1117/12.651229
Show Author Affiliations
Martin Röder, Univ. of Konstanz (Germany)
Jean Cardinal, Univ. Libre de Bruxelles (Belgium)
Raouf Hamzaoui, Univ. of Konstanz (Germany)

Published in SPIE Proceedings Vol. 6071:
Multimedia Computing and Networking 2006
Surendar Chandra; Carsten Griwodz, Editor(s)

© SPIE. Terms of Use
Back to Top