Constructing dependency trees for rate-distortion optimized media streaming

Röder, Martin; Cardinal, Jean; Hamzaoui, Raouf

Constructing dependency trees for rate-distortion optimized media streaming

Files

Röder_230018.pdf(139.79 KB)

Date

2006

Authors

Röder, Martin

Cardinal, Jean

Hamzaoui, Raouf

Publication type

Contribution to a conference collection

Published in

2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings. - IEEE, 2006. - pp. V-373-V-376. - ISBN 1-4244-0469-X

Abstract

Finding adequate packet transmission strategies for media streaming systems is a challenging algorithmic task. Recently, we proposed an efficient dynamic programming algorithm for streams in which the dependencies between packets, such as those prescribed between video frames by video codecs, can be modeled with a tree. In this contribution, we propose a heuristic algorithm for arbitrary dependency graphs. This algorithm consists of first transforming the dependency graph into a tree by adding dependencies, and then applying the dynamic programming algorithm on the tree thus obtained. The algorithm is both simple and efficient, as shown by experimental results on video sequences.

Subject (DDC)

004 Computer Science

Conference

2006 IEEE International Conference on Acoustics Speed and Signal Processing, Toulouse, France

Cite This

ISO 690

RÖDER, Martin, Jean CARDINAL, Raouf HAMZAOUI, 2006. Constructing dependency trees for rate-distortion optimized media streaming. 2006 IEEE International Conference on Acoustics Speed and Signal Processing. Toulouse, France. In: 2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings. IEEE, pp. V-373-V-376. ISBN 1-4244-0469-X. Available under: doi: 10.1109/ICASSP.2006.1661290

BibTex

@inproceedings{Roder2006Const-23001,
  year={2006},
  doi={10.1109/ICASSP.2006.1661290},
  title={Constructing dependency trees for rate-distortion optimized media streaming},
  isbn={1-4244-0469-X},
  publisher={IEEE},
  booktitle={2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings},
  pages={V-373--V-376},
  author={Röder, Martin and Cardinal, Jean and Hamzaoui, Raouf}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/23001">
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23001"/>
    <dc:language>eng</dc:language>
    <dc:contributor>Cardinal, Jean</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23001/1/R%c3%b6der_230018.pdf"/>
    <dcterms:title>Constructing dependency trees for rate-distortion optimized media streaming</dcterms:title>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23001/1/R%c3%b6der_230018.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:26:36Z</dcterms:available>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:abstract xml:lang="eng">Finding adequate packet transmission strategies for media streaming systems is a challenging algorithmic task. Recently, we proposed an efficient dynamic programming algorithm for streams in which the dependencies between packets, such as those prescribed between video frames by video codecs, can be modeled with a tree. In this contribution, we propose a heuristic algorithm for arbitrary dependency graphs. This algorithm consists of first transforming the dependency graph into a tree by adding dependencies, and then applying the dynamic programming algorithm on the tree thus obtained. The algorithm is both simple and efficient, as shown by experimental results on video sequences.</dcterms:abstract>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <dcterms:issued>2006</dcterms:issued>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dc:creator>Röder, Martin</dc:creator>
    <dc:contributor>Röder, Martin</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:26:36Z</dc:date>
    <dcterms:bibliographicCitation>2006 IEEE International Conference on Acoustics, Speech and Signal Processing, 2006, ICASSP 2006 : 14 - 19 May 2006, [Toulouse, France]; proceedings, Vol. 5 / sponsored by The Institute of Electrical and Electronics Engineers. - Piscataway, NJ : IEEE Operations Center, 2006. - S. 373-376. - ISBN 1-424-40469-X</dcterms:bibliographicCitation>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Cardinal, Jean</dc:creator>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

Yes