Publikation:

Branch and bound algorithms for rate-distortion optimized media streaming

Vorschaubild

Dateien

Röder_222138.pdf
Röder_222138.pdfGröße: 235.26 KBDownloads: 182

Datum

2006

Autor:innen

Röder, Martin
Cardinal, Jean

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-222138
DOI (zitierfähiger Link)
https://doi.org/10.1109/TMM.2005.861281
ArXiv-ID

Internationale Patentnummer

Link zur Lizenz
Urheberrechtlich geschützt

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

IEEE Transactions on Multimedia. 2006, 8(1), pp. 170-178. ISSN 1520-9210. eISSN 1941-0077. Available under: doi: 10.1109/TMM.2005.861281

Zusammenfassung

We consider the problem of ratedistortion 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 realworld situations, they provide a significantly better rate-distortion performance.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690RÖDER, Martin, Jean CARDINAL, Raouf HAMZAOUI, 2006. Branch and bound algorithms for rate-distortion optimized media streaming. In: IEEE Transactions on Multimedia. 2006, 8(1), pp. 170-178. ISSN 1520-9210. eISSN 1941-0077. Available under: doi: 10.1109/TMM.2005.861281
BibTex
@article{Roder2006Branc-22213,
  year={2006},
  doi={10.1109/TMM.2005.861281},
  title={Branch and bound algorithms for rate-distortion optimized media streaming},
  number={1},
  volume={8},
  issn={1520-9210},
  journal={IEEE Transactions on Multimedia},
  pages={170--178},
  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/22213">
    <dc:creator>Cardinal, Jean</dc:creator>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dc:language>eng</dc:language>
    <dc:contributor>Röder, Martin</dc:contributor>
    <dcterms:abstract xml:lang="eng">We consider the problem of ratedistortion 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&lt;br /&gt;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 realworld situations, they provide a significantly better rate-distortion performance.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22213"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Röder, Martin</dc:creator>
    <dcterms:issued>2006</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-02T09:05:13Z</dcterms:available>
    <dcterms:bibliographicCitation>IEEE Transactions on Multimedia ; 8 (2006), 1. - S. 170-178</dcterms:bibliographicCitation>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-02T09:05:13Z</dc:date>
    <dc:contributor>Cardinal, Jean</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22213/2/R%c3%b6der_222138.pdf"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22213/2/R%c3%b6der_222138.pdf"/>
    <dcterms:title>Branch and bound algorithms for rate-distortion optimized media streaming</dcterms:title>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen