Packet loss protection of embedded data with fast local search

Stankovic, Vladimir; Hamzaoui, Raouf; Xiong, Zixiang

Packet loss protection of embedded data with fast local search

Dateien

Stankovic_231289.pdfGröße: 86.97 KBDownloads: 351

Datum

2002

Autor:innen

Stankovic, Vladimir

Hamzaoui, Raouf

Xiong, Zixiang

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

Proceedings. International Conference on Image Processing. IEEE, 2002, pp. II-165-II-168. ISBN 0-7803-7622-6. Available under: doi: 10.1109/ICIP.2002.1039913

Zusammenfassung

Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with low memory requirements for the computation of an unequal loss protection solution is essential in real-time systems. Because the determination of an optimal solution is time-consuming, fast suboptimal solutions have been used. In this paper, we present a fast iterative improvement algorithm with negligible memory requirements. Experimental results for the JPEG2000, 2D, and 3D set partitioning in hierarchical trees (SPIHT) coders showed that our algorithm provided close to optimal peak signal-to-noise ratio (PSNR) performance, while its time complexity was significantly lower than that of all previously proposed algorithms.

Fachgebiet (DDC)

004 Informatik

Konferenz

ICIP 2002 International Conference on Image Processing, Rochester, NY, USA

Zitieren

ISO 690

STANKOVIC, Vladimir, Raouf HAMZAOUI, Zixiang XIONG, 2002. Packet loss protection of embedded data with fast local search. ICIP 2002 International Conference on Image Processing. Rochester, NY, USA. In: Proceedings. International Conference on Image Processing. IEEE, 2002, pp. II-165-II-168. ISBN 0-7803-7622-6. Available under: doi: 10.1109/ICIP.2002.1039913

BibTex

@inproceedings{Stankovic2002Packe-23128,
  year={2002},
  doi={10.1109/ICIP.2002.1039913},
  title={Packet loss protection of embedded data with fast local search},
  isbn={0-7803-7622-6},
  publisher={IEEE},
  booktitle={Proceedings. International Conference on Image Processing},
  pages={II-165--II-168},
  author={Stankovic, Vladimir and Hamzaoui, Raouf 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/23128">
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <dcterms:issued>2002</dcterms:issued>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-29T13:35:02Z</dc:date>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dcterms:bibliographicCitation>Proceedings - 2002 International Conference on Image Processing : 22 - 25 September 2002, Rochester Riverside Convention Center, Rochester, New York, USA ; vol. 2 . - Piscataway, NJ : IEEE Operations Center, 2002. - S. 165-168. - ISBN 0-7803-7622-6</dcterms:bibliographicCitation>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Xiong, Zixiang</dc:creator>
    <dc:creator>Stankovic, Vladimir</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23128"/>
    <dcterms:abstract xml:lang="eng">Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with low memory requirements for the computation of an unequal loss protection solution is essential in real-time systems. Because the determination of an optimal solution is time-consuming, fast suboptimal solutions have been used. In this paper, we present a fast iterative improvement algorithm with negligible memory requirements. Experimental results for the JPEG2000, 2D, and 3D set partitioning in hierarchical trees (SPIHT) coders showed that our algorithm provided close to optimal peak signal-to-noise ratio (PSNR) performance, while its time complexity was significantly lower than that of all previously proposed algorithms.</dcterms:abstract>
    <dc:language>eng</dc:language>
    <dc:contributor>Stankovic, Vladimir</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23128/1/Stankovic_231289.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-29T13:35:02Z</dcterms:available>
    <dc:contributor>Xiong, Zixiang</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:title>Packet loss protection of embedded data with fast local search</dcterms:title>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23128/1/Stankovic_231289.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein