Edge-based partition coding for fractal image compression

Lade...
Vorschaubild
Dateien
Ochotta_222998.pdf
Ochotta_222998.pdfGröße: 846.75 KBDownloads: 248
Datum
2004
Autor:innen
Ochotta, Tilo
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Arabian Journal for Science and Engineering / C. 2004, 29(2C), pp. 63-83. ISSN 0377-9211
Zusammenfassung

This paper presents an approach for fractal image compression that yields the best performance compared to fractal methods that do not rely on hybrid transform coding. The achievement is obtained using the standard algorithm in which the image is partitioned into non-overlapping range blocks which are approximated by corresponding larger domain blocks with image intensities that are affinely similar to those of the range blocks. The particular feature of our approach is the adaptive spatial partition, that proceeds in a split/merge fashion. In previous split/merge partitions for fractal image coding the merging started from a uniform partition consisting of square blocks of equal size. In this paper we base the block merging on an adaptive quadtree partitioning. An efficient encoding method for the quadtree-based split/merge partitions is proposed which generalizes the coding of region edge maps and which includes special context modeling. The encoding method may be used for other applications that rely on image partitions.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Datensätze
Zitieren
ISO 690OCHOTTA, Tilo, Dietmar SAUPE, 2004. Edge-based partition coding for fractal image compression. In: Arabian Journal for Science and Engineering / C. 2004, 29(2C), pp. 63-83. ISSN 0377-9211
BibTex
@article{Ochotta2004Edgeb-22299,
  year={2004},
  title={Edge-based partition coding for fractal image compression},
  number={2C},
  volume={29},
  issn={0377-9211},
  journal={Arabian Journal for Science and Engineering / C},
  pages={63--83},
  author={Ochotta, Tilo 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/22299">
    <dcterms:abstract xml:lang="eng">This paper presents an approach for fractal image compression that yields the best performance compared to fractal methods that do not rely on hybrid transform coding. The achievement is obtained using the standard algorithm in which the image is partitioned into non-overlapping range blocks which are approximated by corresponding larger domain blocks with image intensities that are affinely similar to those of the range blocks. The particular feature of our approach is the adaptive spatial partition, that proceeds in a split/merge fashion. In previous split/merge partitions for fractal image coding the merging started from a uniform partition consisting of square blocks of equal size. In this paper we base the block merging on an adaptive quadtree partitioning. An efficient encoding method for the quadtree-based split/merge partitions is proposed which generalizes the coding of region edge maps and which includes special context modeling. The encoding method may be used for other applications that rely on image partitions.</dcterms:abstract>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-03T06:39:03Z</dcterms:available>
    <dc:creator>Ochotta, Tilo</dc:creator>
    <dcterms:title>Edge-based partition coding for fractal image compression</dcterms:title>
    <dcterms:bibliographicCitation>Arabian Journal for Science and Engineering / C ; 29 (2004), 2C. - S. 63-83</dcterms:bibliographicCitation>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22299/1/Ochotta_222998.pdf"/>
    <dc:contributor>Saupe, Dietmar</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-04-03T06:39:03Z</dc:date>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22299"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Saupe, Dietmar</dc:creator>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Ochotta, Tilo</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:issued>2004</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22299/1/Ochotta_222998.pdf"/>
  </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
Ja
Begutachtet
Diese Publikation teilen