We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Reseach Article

Difference based Non-linear Fractal Image Compression

by Dinesh Rao B., Ganesh Kamath, Arpitha K. J.
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 38 - Number 1
Year of Publication: 2012
Authors: Dinesh Rao B., Ganesh Kamath, Arpitha K. J.
10.5120/4656-6744

Dinesh Rao B., Ganesh Kamath, Arpitha K. J. . Difference based Non-linear Fractal Image Compression. International Journal of Computer Applications. 38, 1 ( January 2012), 41-44. DOI=10.5120/4656-6744

@article{ 10.5120/4656-6744,
author = { Dinesh Rao B., Ganesh Kamath, Arpitha K. J. },
title = { Difference based Non-linear Fractal Image Compression },
journal = { International Journal of Computer Applications },
issue_date = { January 2012 },
volume = { 38 },
number = { 1 },
month = { January },
year = { 2012 },
issn = { 0975-8887 },
pages = { 41-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume38/number1/4656-6744/ },
doi = { 10.5120/4656-6744 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:24:28.527583+05:30
%A Dinesh Rao B.
%A Ganesh Kamath
%A Arpitha K. J.
%T Difference based Non-linear Fractal Image Compression
%J International Journal of Computer Applications
%@ 0975-8887
%V 38
%N 1
%P 41-44
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Good fractal compression methods rely on iterative function systems (IFS), which have been designed by Barnsley [1] and Jacquin [2]. The main principle is that an image can be built by combining parts which are similar to the other parts. When encoding an image, the image is partitioned into possibly overlapping square blocks called domain blocks. Subsequently a new partition is made into smaller range blocks [2]. For each range block the closest domain block is searched among all domain blocks by applying a set of transformations on the domain blocks. Compression is obtained by storing only the information about these transformations. The information stored includes domain number, scaling constant, offset etc. This method of compressing images is called Partitioned Iterated Function System (PIFS). This paper explores the use of difference between range and domain elements to find the scaling constants and offset. This paper also explores the implications of mapping IFS blocks on a non-linear basis between range and domain blocks. Further, difference based non-linear mapping is also looked upon. The results show comparable ratios of compression and RMS error with PIFS based fractal compression.

References
  1. M.F. Barnsley and L.P. Huard, Fractal Image Compression, AK Peters. Ltd. (1992).
  2. Ning Lu, Fractal Imaging, Academic Press, 1997.
  3. Arnaud E. Jacquin, Fractal Image Coding: A Review, Proceeding of the IEEE, Vol. 81, No. 10, October 1993.
  4. Dan C. Popescu, Alex Dimca, and Hong Yan, A Nonlinear Model for Fractal Image Coding: IEEE Transaction on image processing, Vol. 6, No. 3, March 1997.
  5. Zhuang Wu, Bixi Yan, “An effective fractal image compression algorithm” IEEE International conference on ICCASM, 2010, pp.139-143.
  6. Hosseini, Shookooh, Shahhosseini, Beizaee, “Speeding up fractal image de-compression”, IEEE International conference on ICCAIE, 2010, pp.521-526.
  7. Hui Yu, Li Li, Dan Liu, HongyuZhai, Xiaoming Dong, “ Based on Quadtree Fractal Image Compression Improved Algorithm for Research”, IEEE Trans, 2010, pp.1-3.
Index Terms

Computer Science
Information Sciences

Keywords

Fractal Image Compression IFS