Canonical Huffman Coding for Image Compression

With the rapid growth of multimedia technology, sharing of multimedia components have become a common practice. Thus, compression of image has become an integral approach that motivates the image compression for the efficient and lossless transmission and for storage of digital data. Huffman coding is one of the entropy encoding approach for compression of image. This paper is based on the fractal image in which Canonical Huffman coding is used for better fractal compression than arithmetic encoding. The result obtained shows that Canonical Huffman coding increases the speed of the compression and has good PNSR, as well as it has better compression ratio than standard Huffman coding.