Fast code enhancement with local search for fractal image compression

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

HAMZAOUI, 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, Sep 10, 2000 - Sep 13, 2000. In: Proceedings 2000 International Conference on Image Processing ; vol. 3. Piscataway:IEEE, pp. 156-159. ISSN 1522-4880. ISBN 0-7803-6297-7. Available under: doi: 10.1109/ICIP.2000.899251

@inproceedings{Hamzaoui2000enhan-42224, title={Fast code enhancement with local search for fractal image compression}, year={2000}, doi={10.1109/ICIP.2000.899251}, isbn={0-7803-6297-7}, issn={1522-4880}, address={Piscataway}, publisher={IEEE}, booktitle={Proceedings 2000 International Conference on Image Processing ; vol. 3}, pages={156--159}, author={Hamzaoui, Raouf and Saupe, Dietmar and Hiller, Michael} }

<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/rdf/resource/123456789/42224"> <dc:contributor>Hamzaoui, Raouf</dc:contributor> <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> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-05-02T07:57:57Z</dc:date> <dc:contributor>Hiller, Michael</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Hiller, Michael</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/42224"/> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Saupe, Dietmar</dc:creator> <dc:creator>Hamzaoui, Raouf</dc:creator> <dc:contributor>Saupe, Dietmar</dc:contributor> <dcterms:title>Fast code enhancement with local search for fractal image compression</dcterms:title> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-05-02T07:57:57Z</dcterms:available> <dcterms:issued>2000</dcterms:issued> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account