Fractal Image Compression with Adaptive Quadtree Partitioning and Lossless Encoding on the Parameters of Affine Transformations
This paper proposes two ways to improve the compression ratio achieved by Fractal image compression. During subdivision of the input image into range and domain blocks, Adaptive Quadtree Partitioning is used. During the final save, the parameters of the affine transforms of the fractal compressed images are losslessly compressed using two methods—once by Modified Region Based Huffman (MRBH) coding, and another time by its variant, MRBHM. The proposed techniques offer much better compression ratios most of the time, keeping PSNRs unchanged. However, compression time of the proposed techniques are significantly more than their counterparts.
KeywordsFractal compression AQP MRBH MRBHM IFS PIFS
The authors would like to thank CST Department, University of Kalyani and CS Department, Bangabasi College, for providing the infrastructures.
- 2.Nandi, U., Mandal, J.: Fractal image compression with adaptive quadtree partitioning scheme. In: International Conference on Signal, Image Processing and Pattern Recognition (SIPP-2013), vol. 3, pp. 289–296 (2013)Google Scholar
- 3.Nandi, U., Mandal, J.K.: Region based huffman (RBH) compression technique with code interchange. Malays. J. Comput. Sci. 23(2), 111–120 (2010)Google Scholar
- 4.Nandi, U., Mandal, J.: Region based huffman compression with region wise multiple interchanging of codes. Adv. Model. Simul. Tech. Enterprises (AMSE), France 17(2), 44–58 (2012)Google Scholar