Please use this identifier to cite or link to this item: https://doi.org/10.1109/CGIV.2006.13
Title: A two-pass improved encoding scheme for fractal image compression
Authors: Eugene, K.-W.C.
Ong, G.-H. 
Issue Date: 2006
Citation: Eugene, K.-W.C.,Ong, G.-H. (2006). A two-pass improved encoding scheme for fractal image compression. Proceedings - Computer Graphics, Imaging and Visualisation: Techniques and Applications, CGIV'06 2006 : 214-219. ScholarBank@NUS Repository. https://doi.org/10.1109/CGIV.2006.13
Abstract: An improvement scheme, so named the Two-Pass Improved Encoding Scheme (TIES), for the application to image compression through the extension of the existing concept of Fractal Image Compression (FIC), which capitalizes on the self-similarity within a given image to be compressed, is proposed in this paper. We first briefly explore the existing image compression technology based on FIC, before proceeding to establish the concept behind the TIES algorithm. We then devise an effective encoding and decoding algorithm for the implementation of TIES through the consideration of the domain pool of an image, domain block transformation, scaling and intensity variation, range block approximation using linear combinations, and finally the use of an arithmetic compression algorithm to store the final data as close to source entropy as possible. We then conclude by explicitly comparing the performance of this implementation of the TIES algorithm against that of FIC under the same conditions, in which the TIES algorithm exhibits significantly better compression performance for large images (1024×1024px) compared to the FIC algorithm. © 2006 IEEE.
Source Title: Proceedings - Computer Graphics, Imaging and Visualisation: Techniques and Applications, CGIV'06
URI: http://scholarbank.nus.edu.sg/handle/10635/41849
ISBN: 0769526063
DOI: 10.1109/CGIV.2006.13
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.