Randomized Algorithm for Scaling Factors in Fractal Image Compression

Rao, Dinesh B and Kamath, Ganesh and Niranjan, U C (2012) Randomized Algorithm for Scaling Factors in Fractal Image Compression. International Journal of Computer Applications, 41 (7). pp. 19-22. ISSN 0975 – 8887

[img] PDF
Randomized Algorithm for Scaling Factors in Fractal Image Compression_2.pdf - Published Version
Restricted to Registered users only

Download (490kB) | Request a copy


Modern fractal compression methods are based on iterative function systems (IFS), which was developed by Barnsley [1] and Jacquin [2]. During compression, the algorithm partitions the image into a set of square blocks (domain blocks). After this a new partition is made into smaller range blocks [2]. The domain blocks are generally double the size of range blocks. For every range block the nearest domain block is identified among all domain blocks after applying a set of transformations on the domain blocks. Smaller sized images are obtained by storing the information about these transformations alone. The transforms store the domain number, scaling constant, offset etc. This method of compression is called the partitioned iteration function system (PIFS). This paper explores the use of variable scaling factors for the transformation from domain to the range blocks. This variable factor has been generated using a pseudo-random number generator. The results show comparable ratios of compression and RMS error with PIFS (Partitioned iterated function systems) based fractal compression.

Item Type: Article
Uncontrolled Keywords: Fractal image compression, IFS.
Subjects: Information Sciences > MCIS Manipal
Depositing User: MIT Library
Date Deposited: 12 Jun 2014 10:30
Last Modified: 12 Jun 2014 10:30
URI: http://eprints.manipal.edu/id/eprint/139755

Actions (login required)

View Item View Item