TUTORIAL | Huffman Coding (Image Processing)
1. Find the probability of occurrence of any symbol (if not given in question).
2. If given (probabilities) or once you calculate them; arrange all symbols in descending order of probability.
3. Add two smallest probabilities and place them to the position where they best fit when arranged as per decreasing order of probability.
4. Once all smallest nodes are added and placed in position as per rule 3 and only two probabilities remains, give code 0 and 1 to each corresponding symbol.
5. Iteratively, assign 0 and 1 to all other merging symbols to generate new symbol
6. Finally compute average bit length by summation(Pi, Li) where Li is code length and Pi is corresponding probability.
if 1 or 2 symbols are given, the original total bit length will be 1;
if 3 or 4 symbols are given, the original total bit length will be 2;
if 5 to 8 symbols are given, the original total bit length will be 3;
i.e. the total bit length is represented by n computed from 2^n.
On this page of the site you can watch the video online TUTORIAL | Huffman Coding (Image Processing) with a duration of hours minute second in good quality, which was uploaded by the user Learn to DevOps 22 January 2017, share the link with friends and acquaintances, this video has already been watched 1,963 times on youtube and it was liked by 10 viewers. Enjoy your viewing!
