A New Lossless Method of Image Compression by Decomposing the Tree of Huffman Technique

Abstract

The size of the largest data storage is exponentially increasing, and to store such data including images to make them obtainable over network became a very important issue. Thus, efficient compression techniques are necessity, because the original images need large amount of disk space. Moreover, the transmission bandwidth and time will serious trouble if the compression does not implement. Generally, the main purpose for image compression is to decrease the amount of data required for representing digital images and therefore all troubles can be resolved. Image compression techniques can be categorized into: lossless and lossy. Huffman coding is a well known lossless technique which used and utilized in the proposed method. Great efforts have been achieved to enhance image compression ratio (CR) using Huffman coding. This paper proposed a New Lossless Method of Images Compression by Decomposing the Tree of Huffman Technique (LM-DH). This method is focused on get a good compression ratio (CR) better than those that get through classical Huffman coding technique. LM-DH has two phases exactly as a Huffman technique: compress and decompress the original gray scale image. These phases has been developed and implemented in MATLAB platform. The results depict that the performance of classical Huffman coding technique can be enhanced by proposed method. LM-DH achieves -as average in all experiments- up to 20% compression ratio more than the classical Huffman technique.