Constructing dependency trees for rate-distortion optimized media streaming
| Type of Publication: | Contribution to a conference collection |
| URI (citable link): | http://nbn-resolving.de/urn:nbn:de:bsz:352-230018 |
| Author: | Röder, Martin; Cardinal, Jean; Hamzaoui, Raouf |
| Year of publication: | 2006 |
| Conference: | 2006 IEEE International Conference on Acoustics Speed and Signal Processing, Toulouse, France |
| 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 |
| DOI (citable link): | https://dx.doi.org/10.1109/ICASSP.2006.1661290 |
| Summary: |
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 |
| Link to License: | In Copyright |
| Bibliography of Konstanz: | Yes |
Cite This
Files in this item
![[PDF]](/themes/Kops/images/mimes/pdf.png "PDF file"){kind=small}
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
@inproceedings{Roder2006Const-23001, title={Constructing dependency trees for rate-distortion optimized media streaming}, year={2006}, doi={10.1109/ICASSP.2006.1661290}, 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 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/rdf/resource/123456789/23001"> <dc:creator>Röder, Martin</dc:creator> <dc:creator>Hamzaoui, Raouf</dc:creator> <dc:contributor>Cardinal, Jean</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:26:36Z</dcterms:available> <dc:contributor>Hamzaoui, Raouf</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:26:36Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:title>Constructing dependency trees for rate-distortion optimized media streaming</dcterms:title> <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> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23001/1/R%c3%b6der_230018.pdf"/> <dcterms:issued>2006</dcterms:issued> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23001/1/R%c3%b6der_230018.pdf"/> <dc:contributor>Röder, Martin</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23001"/> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Cardinal, Jean</dc:creator> <dc:rights>terms-of-use</dc:rights> <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> </rdf:Description> </rdf:RDF>
Downloads since Oct 1, 2014 (Information about access statistics)
| Röder_230018.pdf | 168 |
This item appears in the following Collection(s)
Search KOPS
Browse
My Account
