Fast algorithm for optimal error protection of embedded wavelet codes

Stankovic, Vladimir; Hamzaoui, Raouf; Saupe, Dietmar

Fast algorithm for optimal error protection of embedded wavelet codes

Dateien

Stankovic_231415.pdfGröße: 297.99 KBDownloads: 159

Datum

2003

Autor:innen

Stankovic, Vladimir

Hamzaoui, Raouf

Saupe, Dietmar

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

IEEE Transactions on Communications. 2003, 51(11), pp. 1788-1795. ISSN 0090-6778. Available under: doi: 10.1109/TCOMM.2003.819235

Zusammenfassung

Embedded wavelet codes are very sensitive to channel noise because a single bit error can lead to an irreversible loss of synchronization between the encoder and the decoder. Sherwood and Zeger protected a zero-tree based embedded wavelet code sent through a memoryless noisy channel by using cyclic redundancy detection codes (CRC) and channel correction codes. Chande and Farvardin proposed an optimal joint source-channel allocation strategy for such systems. We show how to accelerate their algorithm without quality loss. For grey scale test images of size 512 x 512, our speedup factors ranged from 1.2 to 6 for total bit rates between 0.25 and 1.0 bits per pixel. Moreover, by using turbo codes as channel codes, we obtained competitive peak-signal-tonoise ratio (PSNR) results.

Fachgebiet (DDC)

004 Informatik

Konferenz

IEEE Fourth Workshop on Multimedia Signal Processing, 3. Okt. 2001 - 5. Okt. 2001, Cannes, France

Zitieren

ISO 690

STANKOVIC, Vladimir, Raouf HAMZAOUI, Dietmar SAUPE, 2003. Fast algorithm for optimal error protection of embedded wavelet codes. IEEE Fourth Workshop on Multimedia Signal Processing. Cannes, France, 3. Okt. 2001 - 5. Okt. 2001. In: IEEE Transactions on Communications. 2003, 51(11), pp. 1788-1795. ISSN 0090-6778. Available under: doi: 10.1109/TCOMM.2003.819235

BibTex

@article{Stankovic2003-11algor-23141,
  year={2003},
  doi={10.1109/TCOMM.2003.819235},
  title={Fast algorithm for optimal error protection of embedded wavelet codes},
  number={11},
  volume={51},
  issn={0090-6778},
  journal={IEEE Transactions on Communications},
  pages={1788--1795},
  author={Stankovic, Vladimir and Hamzaoui, Raouf and Saupe, Dietmar}
}

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/23141">
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <dc:language>eng</dc:language>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Saupe, Dietmar</dc:contributor>
    <dcterms:title>Fast algorithm for optimal error protection of embedded wavelet codes</dcterms:title>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-27T07:16:51Z</dcterms:available>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-27T07:16:51Z</dc:date>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23141/1/Stankovic_231415.pdf"/>
    <dcterms:issued>2003-11</dcterms:issued>
    <dcterms:abstract xml:lang="eng">Embedded wavelet codes are very sensitive to channel noise because a single bit error can lead to an irreversible loss of synchronization between the encoder and the decoder. Sherwood and Zeger protected a zero-tree based embedded wavelet code sent through a memoryless noisy channel by using cyclic redundancy detection codes (CRC) and channel correction codes. Chande and Farvardin proposed an optimal joint source-channel allocation strategy for such systems. We show how to accelerate their algorithm without quality loss. For grey scale test images of size 512 x 512, our speedup factors ranged from 1.2 to 6 for total bit rates between 0.25 and 1.0 bits per pixel. Moreover, by using turbo codes as channel codes, we obtained competitive peak-signal-tonoise ratio (PSNR) results.</dcterms:abstract>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23141/1/Stankovic_231415.pdf"/>
    <dc:creator>Stankovic, Vladimir</dc:creator>
    <dc:creator>Saupe, Dietmar</dc:creator>
    <dc:contributor>Stankovic, Vladimir</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dcterms:bibliographicCitation>2001 IEEE Fourth Workshop on Multimedia Signal Processing : October 3 - 5, 2001, Cannes, France / ed. by Jean-Luc Dugelay ... - Piscataway, NJ : IEEE Operations Center, 2001. - S. 593-598. - ISBN 0-7803-7025-2</dcterms:bibliographicCitation>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23141"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja