Publikation:

Fast joint source-channel coding algorithms for Internet/wireless multimedia

Lade...
Vorschaubild

Dateien

Hamzaoui_231337.pdf
Hamzaoui_231337.pdfGröße: 533.94 KBDownloads: 293

Datum

2002

Autor:innen

Stankovic, Vladimir
Xiong, Zixiang

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290). IEEE, 2002, pp. 2108-2113. ISBN 0-7803-7278-6. Available under: doi: 10.1109/IJCNN.2002.1007467

Zusammenfassung

We consider joint source-channel coding for Internet and wireless multimedia applications. Embedded source bitstreams are protected against noise in both binary symmetric channels (BSC) and packet erasure channels. For each channel, a local search jojint source-channel coding (JSCC) algorithm is proposed to search for the optimal unequal error protection (UEP) scheme. Each algorithm starts with a linear-complexity step that maximizes the number of correctly decoded source bits, followed by a quick local refinement of the resulting UEP solution to minimize the average distortion. Experiments for both binary symmetric channels and packet erasure channels with the SPIHT, JPEG2000 and 3D SPIHT coders show that our local search algorithms are near-optimal in performance, whereas they are orders of magnitude faster than the best previous solutions.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

2002 International Joint Conference on Neural Networks (IJCNN), Honolulu, HI, USA
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690HAMZAOUI, Raouf, Vladimir STANKOVIC, Zixiang XIONG, 2002. Fast joint source-channel coding algorithms for Internet/wireless multimedia. 2002 International Joint Conference on Neural Networks (IJCNN). Honolulu, HI, USA. In: Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290). IEEE, 2002, pp. 2108-2113. ISBN 0-7803-7278-6. Available under: doi: 10.1109/IJCNN.2002.1007467
BibTex
@inproceedings{Hamzaoui2002joint-23133,
  year={2002},
  doi={10.1109/IJCNN.2002.1007467},
  title={Fast joint source-channel coding algorithms for Internet/wireless multimedia},
  isbn={0-7803-7278-6},
  publisher={IEEE},
  booktitle={Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290)},
  pages={2108--2113},
  author={Hamzaoui, Raouf and Stankovic, Vladimir and Xiong, Zixiang}
}
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/23133">
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <dcterms:issued>2002</dcterms:issued>
    <dc:contributor>Xiong, Zixiang</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23133/2/Hamzaoui_231337.pdf"/>
    <dc:creator>Xiong, Zixiang</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Stankovic, Vladimir</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-27T11:33:38Z</dcterms:available>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-27T11:33:38Z</dc:date>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>Fast joint source-channel coding algorithms for Internet/wireless multimedia</dcterms:title>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23133"/>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dcterms:bibliographicCitation>Proceedings of the 2002 International Joint Conference on Neural Networks, IJCNN '02 : May 12 - 17, 2002, Hilton Hawaiian Village Hotel, Honolulu, Hawaii ; Vol. 3 / co-sponsored by Institute of Electrical and Electronics Engineers (IEE); IEEE Neural Networks Society (NNS); International Neural Network Society (INNS). - Piscataway, NJ : IEEE Service Center, 2002. - S. 2108-2113. - ISBN 0-7803-7278-6</dcterms:bibliographicCitation>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23133/2/Hamzaoui_231337.pdf"/>
    <dcterms:abstract xml:lang="eng">We consider joint source-channel coding for Internet and wireless multimedia applications. Embedded source bitstreams are protected against noise in both binary symmetric channels (BSC) and packet erasure channels. For each channel, a local search jojint source-channel coding (JSCC) algorithm is proposed to search for the optimal unequal error protection (UEP) scheme. Each algorithm starts with a linear-complexity step that maximizes the number of correctly decoded source bits, followed by a quick local refinement of the resulting UEP solution to minimize the average distortion. Experiments for both binary symmetric channels and packet erasure channels with the SPIHT, JPEG2000 and 3D SPIHT coders show that our local search algorithms are near-optimal in performance, whereas they are orders of magnitude faster than the best previous solutions.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Stankovic, Vladimir</dc:creator>
  </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
Nein
Begutachtet
Diese Publikation teilen