[1] Lossless image compression:-
A simple application of Huffman coding to image compression would be to generate a Huffman code for set of values that any pixel may take.
For monochrome images, this set usually consists of integers from 0 to 255.
The original image representation uses 8 bits /pixel.
[2] Text compression:-
Text compression seems natural for Huffman coding.
In text, we have a discrete alphabet that, in a given class, has relatively stationary probabilities.
[3]Audio compression:-
Applying Huffman coding reduces its size thus a lower bandwidth is required for transmission of audio data over a communication link.
Huffman coding shows significant amount of reduction in size of an audio file.Uncompressed CD quality audio data requires enormous amount of bandwidth for transmission.
Comments
Post a Comment