Publikation:

Fast code enhancement with local search for fractal image compression

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2000

Autor:innen

Hiller, Michael

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
https://doi.org/10.1109/ICIP.2000.899251
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

Proceedings 2000 International Conference on Image Processing ; vol. 3. Piscataway: IEEE, 2000, pp. 156-159. ISSN 1522-4880. ISBN 0-7803-6297-7. Available under: doi: 10.1109/ICIP.2000.899251

Zusammenfassung

Optimal fractal coding consists of finding, in a finite set of contractive affine mappings, one whose unique fixed point is closest to the original image. Optimal fractal coding is an NP- hard combinatorial optimization problem. Conventional coding is based on a greedy suboptimal algorithm known as collage coding. In a previous study, we proposed a local search algorithm that significantly improves on collage coding. However the algorithm, which requires the computation of many fixed points, is computationally expensive. In this paper we provide techniques that drastically reduce the time complexity of the algorithm.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Fractals, Image coding, Image reconstruction, Terminology, Rate-distortion, Extraterrestrial measurements, Iterative decoding, PSNR, Partitioning algorithms, Acceleration

Konferenz

Proceedings of 7th IEEE International Conference on Image Processing, 10. Sept. 2000 - 13. Sept. 2000, Vancouver, Canada
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690HAMZAOUI, Raouf, Dietmar SAUPE, Michael HILLER, 2000. Fast code enhancement with local search for fractal image compression. Proceedings of 7th IEEE International Conference on Image Processing. Vancouver, Canada, 10. Sept. 2000 - 13. Sept. 2000. In: Proceedings 2000 International Conference on Image Processing ; vol. 3. Piscataway: IEEE, 2000, pp. 156-159. ISSN 1522-4880. ISBN 0-7803-6297-7. Available under: doi: 10.1109/ICIP.2000.899251
BibTex
@inproceedings{Hamzaoui2000enhan-42224,
  year={2000},
  doi={10.1109/ICIP.2000.899251},
  title={Fast code enhancement with local search for fractal image compression},
  isbn={0-7803-6297-7},
  issn={1522-4880},
  publisher={IEEE},
  address={Piscataway},
  booktitle={Proceedings 2000 International Conference on Image Processing ; vol. 3},
  pages={156--159},
  author={Hamzaoui, Raouf and Saupe, Dietmar and Hiller, Michael}
}
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/42224">
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <dc:contributor>Saupe, Dietmar</dc:contributor>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <dc:creator>Saupe, Dietmar</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:issued>2000</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-05-02T07:57:57Z</dcterms:available>
    <dcterms:abstract xml:lang="eng">Optimal fractal coding consists of finding, in a finite set of contractive affine mappings, one whose unique fixed point is closest to the original image. Optimal fractal coding is an NP- hard combinatorial optimization problem. Conventional coding is based on a greedy suboptimal algorithm known as collage coding. In a previous study, we proposed a local search algorithm that significantly improves on collage coding. However the algorithm, which requires the computation of many fixed points, is computationally expensive. In this paper we provide techniques that drastically reduce the time complexity of the algorithm.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/42224"/>
    <dc:language>eng</dc:language>
    <dcterms:title>Fast code enhancement with local search for fractal image compression</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-05-02T07:57:57Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Hiller, Michael</dc:creator>
    <dc:contributor>Hiller, Michael</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen