Progressive fractal coding

Kopilovic, Ivan; Saupe, Dietmar; Hamzaoui, Raouf

Progressive fractal coding

Dateien

Kopilovic_231451.pdfGröße: 437.69 KBDownloads: 264

Datum

2001

Autor:innen

Kopilovic, Ivan

Saupe, Dietmar

Hamzaoui, Raouf

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205). IEEE, 2001, pp. 86-89. ISBN 0-7803-6725-1. Available under: doi: 10.1109/ICIP.2001.958959

Zusammenfassung

Progressive coding is an important feature of compression schemes. Wavelet coders are well suited for this purpose because the wavelet coefficients can be naturally ordered according to decreasing importance. Progressive fractal coding is feasible, but it was proposed only for hybrid fractal-wavelet schemes. We introduce a progressive fractal image coder in the spatial domain. A Lagrange optimization based on rate-distortion performance estimates determines an optimal ordering of the code bits. The optimality is in the sense that the reconstruction error is monotonically decreasing and minimum at intermediate rates. The decoder recovers this ordering without side information. As a side effect, our work motivates improved bit allocation strategies for fractal coding.

Fachgebiet (DDC)

004 Informatik

Konferenz

2001 International Conference on Image Processing, Thessaloniki, Greece

Zitieren

ISO 690

KOPILOVIC, Ivan, Dietmar SAUPE, Raouf HAMZAOUI, 2001. Progressive fractal coding. 2001 International Conference on Image Processing. Thessaloniki, Greece. In: Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205). IEEE, 2001, pp. 86-89. ISBN 0-7803-6725-1. Available under: doi: 10.1109/ICIP.2001.958959

BibTex

@inproceedings{Kopilovic2001Progr-23145,
  year={2001},
  doi={10.1109/ICIP.2001.958959},
  title={Progressive fractal coding},
  isbn={0-7803-6725-1},
  publisher={IEEE},
  booktitle={Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)},
  pages={86--89},
  author={Kopilovic, Ivan and Saupe, Dietmar 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/23145">
    <dc:contributor>Saupe, Dietmar</dc:contributor>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <dcterms:abstract xml:lang="eng">Progressive coding is an important feature of compression schemes. Wavelet coders are well suited for this purpose because the wavelet coefficients can be naturally ordered according to decreasing importance. Progressive fractal coding is feasible, but it was proposed only for hybrid fractal-wavelet schemes. We introduce a progressive fractal image coder in the spatial domain. A Lagrange optimization based on rate-distortion performance estimates determines an optimal ordering of the code bits. The optimality is in the sense that the reconstruction error is monotonically decreasing and minimum at intermediate rates. The decoder recovers this ordering without side information. As a side effect, our work motivates improved bit allocation strategies for fractal coding.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:bibliographicCitation>Proceedings, 2001 International Conference on Image Processing, ICIP : 7 - 10 October 2001, Makedonia Palace Hotel, Thessaloniki, Greece; vol. 1. - Piscataway, NJ : IEEE Operations Center, 2001. - S. 86-89. - ISBN 0-7803-6725-1</dcterms:bibliographicCitation>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-26T07:00:06Z</dcterms:available>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Kopilovic, Ivan</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23145"/>
    <dc:creator>Kopilovic, Ivan</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-26T07:00:06Z</dc:date>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23145/1/Kopilovic_231451.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:issued>2001</dcterms:issued>
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dcterms:title>Progressive fractal coding</dcterms:title>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23145/1/Kopilovic_231451.pdf"/>
    <dc:creator>Saupe, Dietmar</dc:creator>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein