TUTORIAL | Huffman Coding (Image Processing)

Опубликовано: 22 Январь 2017
на канале: Learn to DevOps

1,963

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.

На этой странице сайта вы можете посмотреть видео онлайн TUTORIAL | Huffman Coding (Image Processing) длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Learn to DevOps 22 Январь 2017, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 1,963 раз и оно понравилось 10 зрителям. Приятного просмотра!