Region-based fractal image compression

Hartenstein, Hannes; Ruhl, Matthias; Saupe, Dietmar

Region-based fractal image compression

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2000

Autor:innen

Hartenstein, Hannes

Ruhl, Matthias

Saupe, Dietmar

DOI (zitierfähiger Link)

https://doi.org/10.1109/83.847831

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

IEEE Transactions on Image Processing. 2000, 9(7), pp. 1171-1184. ISSN 1057-7149. eISSN 1941-0042. Available under: doi: 10.1109/83.847831

Zusammenfassung

A fractal coder partitions an image into blocks that are coded via self-references to other parts of the image itself. We present a fractal coder that derives highly image-adaptive partitions and corresponding fractal codes in a time-efficient manner using a region-merging approach. The proposed merging strategy leads to improved rate-distortion performance compared to previously reported pure fractal coders, and it is faster than other state-of-the-art fractal coding methods.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Fractals, Image coding, Merging, Rate-distortion, Image segmentation, Associate members, Image representation, Image resolution, Brightness, NP-hard problem

Zitieren

ISO 690

HARTENSTEIN, Hannes, Matthias RUHL, Dietmar SAUPE, 2000. Region-based fractal image compression. In: IEEE Transactions on Image Processing. 2000, 9(7), pp. 1171-1184. ISSN 1057-7149. eISSN 1941-0042. Available under: doi: 10.1109/83.847831

BibTex

@article{Hartenstein2000Regio-42197,
  year={2000},
  doi={10.1109/83.847831},
  title={Region-based fractal image compression},
  number={7},
  volume={9},
  issn={1057-7149},
  journal={IEEE Transactions on Image Processing},
  pages={1171--1184},
  author={Hartenstein, Hannes and Ruhl, Matthias 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/42197">
    <dc:creator>Hartenstein, Hannes</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Saupe, Dietmar</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Ruhl, Matthias</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-04-28T13:22:30Z</dcterms:available>
    <dcterms:abstract xml:lang="eng">A fractal coder partitions an image into blocks that are coded via self-references to other parts of the image itself. We present a fractal coder that derives highly image-adaptive partitions and corresponding fractal codes in a time-efficient manner using a region-merging approach. The proposed merging strategy leads to improved rate-distortion performance compared to previously reported pure fractal coders, and it is faster than other state-of-the-art fractal coding methods.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <dc:contributor>Hartenstein, Hannes</dc:contributor>
    <dcterms:issued>2000</dcterms:issued>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/42197"/>
    <dc:creator>Ruhl, Matthias</dc:creator>
    <dcterms:title>Region-based fractal image compression</dcterms:title>
    <dc:contributor>Saupe, Dietmar</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-04-28T13:22:30Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein