Efficient rate-distortion optimized media streaming for tree-reducible packet dependencies

Martin Röder; Jean Cardinal; Raouf Hamzaoui

doi:10.1117/12.651229

16 January 2006 Efficient rate-distortion optimized media streaming for tree-reducible packet dependencies

Martin Röder, Jean Cardinal, Raouf Hamzaoui

Proceedings Volume 6071, Multimedia Computing and Networking 2006; 607104 (2006) https://doi.org/10.1117/12.651229
Event: Electronic Imaging 2006, 2006, San Jose, California, United States

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.

Citation Download Citation

Martin Röder, Jean Cardinal, and Raouf Hamzaoui "Efficient rate-distortion optimized media streaming for tree-reducible packet dependencies", Proc. SPIE 6071, Multimedia Computing and Networking 2006, 607104 (16 January 2006); https://doi.org/10.1117/12.651229

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available