Skip to Main Content
Advances in Visual Data Compression and Communication
book

Advances in Visual Data Compression and Communication

by Feng Wu
July 2014
Intermediate to advanced content levelIntermediate to advanced
513 pages
16h 40m
English
Auerbach Publications
Content preview from Advances in Visual Data Compression and Communication
i
i
i
i
i
i
i
i
8 1 Information Theory
1.2.1 Huffman Coding
An optimal prefix code for a given distribution can be constructed by a simple al-
gorithm proposed by Huffman [6], widely known as Huffman coding. In Huffman
coding, a binary tree of nodes is first created. The size is equal to the number of sym-
bols to code, q. Initially, all nodes are leaf nodes containing the probabilities of the
symbols they represent. The coding process essentially begins with the leaf nodes. A
new node whose children are the two nodes with the smallest probability is created.
The new node’s probability is equal to the sum of the children’s probabilities. With
the previous two ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

The Magic of Computer Graphics

The Magic of Computer Graphics

Noriko Kurachi

Publisher Resources

ISBN: 9781482234138