A Hybrid Image Compression Scheme Using DCT and Fractal Image Compression

A Hybrid Image Compression Scheme Using DCT and Fractal Image Compression

Chandan Rawat1 and Sukadev Meher2
1Department of Electronics and Communication Engineering, National Institute of Technology, India
2Department of Electronics and Computer Engineering, National Institute of Technology, India

 

Abstract:
Digital images are often used in several domains. Large amount of data is necessary to represent the digital images so the transmission and storage of such images are time-consuming and infeasible. Hence the information in the images is compressed by extracting only the visible elements. Normally the image compression technique can reduce the storage and transmission costs. During image compression, the size of a graphics file is reduced in bytes without disturbing the quality of the image beyond an acceptable level. Several methods such as Discrete Cosine Transform (DCT), DWT, etc. are used for compressing the images. But, these methods contain some blocking artifacts. In order to overcome this difficulty and to compress the image efficiently, a combination of DCT and fractal image compression techniques is proposed. DCT is employed to compress the color image while the fractal image compression is employed to evade the repetitive compressions of analogous blocks. Analogous blocks are found by using the Euclidean distance measure. Here, the given image is encoded by means of Huffman encoding technique. The implementation result shows the effectiveness of the proposed scheme in compressing the color image. Also a comparative analysis is performed to prove that our system is competent to compress the images in terms of Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM) and Universal Image Quality Index (UIQI) measurements.


Keywords: Image compression, DCT, fractal image compression, quantization, zig-zag scanning, huffman coding.
 
Received May 23, 2010; accepted, 2011
  

Full Text

Read 4122 times Last modified on Thursday, 24 October 2013 03:46
Share
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…