Image Compression and Decompression using Huffman Coding

Advances in digital image processing techniques have given way to image compression technology. Image compression becomes an immediate requirement for storage of digital images and image data transmission. In the present scenario when data has become digital and its transmission, reception and storage has become online, faster sending and receiving textual data or images has become top priority for every information system and thus image compression becomes a basic necessity as small size images become the basic requirement. In this paper, discussion on code redundancy algorithm using Huffman coding which chooses less number of bits for frequently occurring data for image compression is provided. The image compression and decompression models are provided with algorithms for easy implementation.