A COMPARATIVE STUDY OF DCT AND DWT IMAGE COMPRESSION TECHNIQUES COMBINED WITH HUFFMAN CODING

Image compression techniques have been widely used to store and transmit data which requires storage space and high transfer speed. the explosive growth of high-quality photos leads to the requirement of efficient technique to store and exchange data over the internet. in this paper, we present a comparative study to compare between the discrete cosine transform (dct) and discrete wavelet transform (dwt) algorithms in combination with huffman algorithm; dct-h and dwt-h. the comparison is based on five factors: compression ratio (cr), mean square error (mse), peak signal-to-noise ratio (psnr), structural similarity index measure (ssim) and compression/decompression time. the experiments are conducted on five bmp gray-scale file images. we found out that dwt-h coding is comparable to dct-h coding in term of cr and outperforms dct-h in terms of mse, psnr and ssim. the cr average results of the five test images for dct-h and dwt-h are 2.36 and 3.17, respectively. moreover, dct-h has the average results of mse = 13.19, psnr = 37.15 and ssim = 0.76, while wdt-h has the average results of mse = 4.54, psnr = 42.5 and ssim = 0.85. on the other hand, dct-h outperforms dwt-h in term of execution time for compression and decompression. dct-h has an average compression time of 0.358s and an average decompression time of 0.122s, while wdt-h has 2.38s compression time and 2.13s decompression time.