Enhancing Efficiency of Huffman Coding using Lempel Ziv Coding for Image Compression
C. Saravanan1, M. Surender2

1Dr. C. Saravanan, Department of Computer Center, National Institute of Technology, Durgapur, West Bengal, India.
2M. Surender, Department of Information Technology, National Institute of Technology, Durgapur, West Bengal, India.
Manuscript received on January 01, 2013. | Revised Manuscript received on January 02, 2013. | Manuscript published on January 05, 2013. | PP: 38-41 | Volume-2, Issue-6, January 2013. | Retrieval Number: F1081112612/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Compression is a technology for reducing the quantity of data used to represent any content without excessively reducing the quality of the picture. The need for an efficient technique for compression of images ever increasing because the raw images need large amounts of disk space seems to be a big disadvantage during transmission & storage. Compression is a technique that makes storing easier for large amount of data. It also reduces the number of bits required to store and transmit digital media. In this paper, a fast lossless compression scheme is presented and named as HL which consists of two stages. In the first stage, a Huffman coding is used to compress the image. In the second stage all Huffman code words are concatenated together and then compressed with Lempel Ziv coding. This technique is simple in implementation and utilizes less memory. A software algorithm has been developed and implemented to compress and decompress the given image using Huffman coding techniques in MATLAB software.
Keywords: Lossless image compression, Huffman coding, Lempel Ziv coding.