Edge-based partition coding for fractal image compression

Loading...
Thumbnail Image
Date
2004
Authors
Ochotta, Tilo
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
DOI (citable link)
ArXiv-ID
International patent number
Link to the license
EU project number
Project
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Journal article
Publication status
Published in
Arabian Journal for Science and Engineering / C ; 29 (2004), 2C. - pp. 63-83. - ISSN 0377-9211
Abstract
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.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690OCHOTTA, Tilo, Dietmar SAUPE, 2004. Edge-based partition coding for fractal image compression. In: Arabian Journal for Science and Engineering / C. 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>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed