Optimal error protection of progressively compressed 3D meshes

Ahmad, Shakeel; Hamzaoui, Raouf

Optimal error protection of progressively compressed 3D meshes

Files

Ahmad_229995.pdf(82.12 KB)

Date

2006

Publication type

Contribution to a conference collection

Published in

2006 IEEE International Conference on Multimedia and Expo. - IEEE, 2006. - pp. 201-204. - ISBN 1-4244-0367-7

Abstract

Given a number of available layers of source data and a transmission bit budget, we propose an algorithm that determines how many layers should be sent and how many protection bits should be allocated to each transmitted layer such that the expected distortion at the receiver is minimum. The algorithm is used for robust transmission of progressively compressed 3D models over a packet erasure channel. In contrast to the previous approach, which uses exhaustive search, the time complexity of our algorithm is linear in the transmission bit budget.

Subject (DDC)

004 Computer Science

Conference

2006 IEEE International Conference on Multimedia and Expo, Jul 9, 2006 - Jul 9, 2006, Toronto, ON, Canada

Cite This

ISO 690

AHMAD, Shakeel, Raouf HAMZAOUI, 2006. Optimal error protection of progressively compressed 3D meshes. 2006 IEEE International Conference on Multimedia and Expo. Toronto, ON, Canada, Jul 9, 2006 - Jul 9, 2006. In: 2006 IEEE International Conference on Multimedia and Expo. IEEE, pp. 201-204. ISBN 1-4244-0367-7. Available under: doi: 10.1109/ICME.2006.262417

BibTex

@inproceedings{Ahmad2006-12Optim-22999,
  year={2006},
  doi={10.1109/ICME.2006.262417},
  title={Optimal error protection of progressively compressed 3D meshes},
  isbn={1-4244-0367-7},
  publisher={IEEE},
  booktitle={2006 IEEE International Conference on Multimedia and Expo},
  pages={201--204},
  author={Ahmad, Shakeel 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/22999">
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22999"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22999/2/Ahmad_229995.pdf"/>
    <dcterms:title>Optimal error protection of progressively compressed 3D meshes</dcterms:title>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Ahmad, Shakeel</dc:creator>
    <dcterms:bibliographicCitation>Proceedings / 2006 IEEE International Conference on Multimedia and Expo, ICME 2006 : July 9 - 12, 2006, Hilton, Toronto, Toronto, Ontario, Canada / the Institute of Electrical and Electronics Engineers, Circuits and Systems Society, Communications Society ... . - Piscataway, NJ : IEEE Service Center, 2006. - S. 201-204. - ISBN 1-424-40366-9</dcterms:bibliographicCitation>
    <dcterms:issued>2006-12</dcterms:issued>
    <dc:language>eng</dc:language>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:09:08Z</dcterms:available>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22999/2/Ahmad_229995.pdf"/>
    <dc:contributor>Ahmad, Shakeel</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-25T10:09:08Z</dc:date>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="eng">Given a number of available layers of source data and a transmission bit budget, we propose an algorithm that determines how many layers should be sent and how many protection bits should be allocated to each transmitted layer such that the expected distortion at the receiver is minimum. The algorithm is used for robust transmission of progressively compressed 3D models over a packet erasure channel. In contrast to the previous approach, which uses exhaustive search, the time complexity of our algorithm is linear in the transmission bit budget.</dcterms:abstract>
  </rdf:Description>
</rdf:RDF>