Lec32

Compression & Huffman Codes Nelson Padua-Perez William Pugh Department of Computer Science University of Maryland, College Park

Compression ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Compression Examples ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Sources of Compressibility ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Types of Compression ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Effectiveness of Compression ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Effectiveness of Compression ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Effectiveness of Compression ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Lossless Compression Techniques ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Huffman Code ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],A A B A A A A B

Huffman Code Example ,[object Object],[object Object],[object Object],Symbol Dog Cat Bird Fish Frequency 1/8 1/4 1/2 1/8 Original Encoding 00 01 10 11 2 bits 2 bits 2 bits 2 bits Huffman Encoding 110 10 0 111 3 bits 2 bits 1 bit 3 bits

Huffman Code Data Structures ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],1 1 0 0 A C H

Huffman Code Algorithm Overview ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Huffman Code – Creating Tree ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Huffman Tree Construction 1 3 5 8 2 7 A C E H I

Huffman Tree Construction 2 3 5 8 2 7 5 A C E H I

Huffman Tree Construction 3 3 5 8 2 7 5 10 A C E H I

Huffman Tree Construction 4 3 5 8 2 7 5 10 15 A C E H I

Huffman Tree Construction 5 3 5 8 2 7 5 10 15 25 1 1 1 1 0 0 0 0 A C E H I E = 01 I = 00 C = 10 A = 111 H = 110

Huffman Coding Example ,[object Object],[object Object],[object Object],[object Object],[object Object],E = 01 I = 00 C = 10 A = 111 H = 110

Huffman Code Algorithm Overview ,[object Object],[object Object],[object Object],[object Object]

Huffman Decoding 1 3 5 8 2 7 5 10 15 25 1 1 1 1 0 0 0 0 A C E H I 1 111001

Huffman Decoding 2 3 5 8 2 7 5 10 15 25 1 1 1 1 0 0 0 0 A C E H I 11 11001

Huffman Decoding 3 3 5 8 2 7 5 10 15 25 1 1 1 1 0 0 0 0 A C E H I 111 1001 A

Huffman Decoding 4 3 5 8 2 7 5 10 15 25 1 1 1 1 0 0 0 0 A C E H I 111 1 001 A

Huffman Decoding 5 3 5 8 2 7 5 10 15 25 1 1 1 1 0 0 0 0 A C E H I 111 10 01 A C

Huffman Decoding 6 3 5 8 2 7 5 10 15 25 1 1 1 1 0 0 0 0 A C E H I 11110 0 1 AC

Huffman Decoding 7 3 5 8 2 7 5 10 15 25 1 1 1 1 0 0 0 0 A C E H I 11110 01 AC E

Huffman Code Properties ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Huffman Code Properties ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Lec32

Recommandé

Recommandé

Contenu connexe

Tendances

Tendances (20)

En vedette

En vedette (10)

Similaire à Lec32

Similaire à Lec32 (20)

Plus de anithabalaprabhu

Plus de anithabalaprabhu (18)

Dernier

Dernier (20)

Lec32