Canonical Huffman Coding Based Image Compression using Wavelet

Abstract

The explosive growth of digital imaging, especially in the fields of medicine, education, and e-commerce, has made data maintenance and transmission over networks a daunting task. Therefore, the development and use of image compression techniques have become vital for overcoming the problems of storage and transmission of digital image data. Two methods that are extensively used for data compression are Discrete Cosine Transformation and Discrete Wavelet Transform (DWT). In our present study, we have shown the benefits of a DWT-based approach by utilizing the canonical Huffman coding as an entropy encoder. DWT decomposes the image into different sub-bands. These sub bands are known as approximate image and detail images. The approximate image is normalized in the range (0, 1) for obtaining the Canonical Huffman coding bit stream. In a similar way, details coefficients are also normalized in the range (0, 1) for obtaining the canonical Huffman coding bit stream of detail images. Hard thresholding is often used to discard insignificant coefficients of detail images. Our proposed method takes less computing time and has a smaller codebook size than that of conventional Huffman coding. Moreover, the results show an improvement over Wavelet Scalar Quantization often used for image compression of fingerprints. We have applied our method to various popular images and obtained promising PSNR, CR, and BPP that highlight the advantages of our approach and the efficiency of our algorithms.