24-huff-moreOwen Astrachan Jeff Forbes
W is for … • World Wide Web
• www.totallyfun.org • Wiki
• We need this everyday • Windows
• From OS to …
PFTD • Review of Huffman Compression
• Key aspects of compression at a high-level • Decompression with more detail
• Looking at bits and information • What's in a .jpeg compared to .mp3
• WOTO and finishing the semester in 201
12/1/17 CompSci 201, Fall 2017, Huff and More 3
A tale of two disks • 10Mb for $2,990 in 1981 • 64GB for $29.90 in 2018
12/1/17 CompSci 201, Fall 2017, Huff and More 4
Lossy v Lossless Compressoin • RAW format compared to JPEG format
• Tradeoffs – another example of "it depends"
• Why do you ZIP files/folders? • Upload to Dropbox/Google Drive
• What are advantages of MP3 • You were 0-3 years old
12/1/17 CompSci 201, Fall 2017, Huff and More 5
Huffman is Optimal • We create an encoding for each 8-bit character
• Can’t do better than this on per-character basis
• Normally ‘A’ is 65 and ‘Z’ is 90 (ASCII/Unicode) • A is 01000001 and Z is 01011010 • Why does this make sense? 8- or 16-bit/char • Why doesn’t this make sense?
12/1/17 CompSci 201, Fall 2017, Huff and More 6
Leveraging Redundancy • If there are 1,000 “A” and 10 “Z” characters …
• Use fewer bits for “A” and more bits for “Z”
• Huffman treats all A’s equally, no context • A as first letter in a file is the same as last letter
• Other compression techniques can do better • Faster and better compression, more complex
12/1/17 CompSci 201, Fall 2017, Huff and More 7
Summary of Huff Compress • Count how many times every character occurs
• Character is 8-bit “chunk”, use .readBits(8)
• Create a Huffman Trie/Tree, greedy algorithm PQ • Infrequent chars are far away from root • Frequent chars are close to root
• Create encodings from trie to write compressed file • Reset/reread file, look up encoding, write out
12/1/17 CompSci 201, Fall 2017, Huff and More 8
Starting to code… what first? • If you write compress first, how to test
• The bits written aren't "readable" as is • Shadow-print.writeBits with .println?
• If you write decompress first, how to test? • Until you've got a compressed file … • We'll provide several compressed files!
12/1/17 CompSci 201, Fall 2017, Huff and More 9
Huffman Trie/Tree
SPACE
11
6
445
68
6
8
16
10
21
11
12
2337
60
From counts to trie via PQ • After counting every 8-bit chunk # occurrences, create the Trie
• Greedy approach: frequencies[x]= # x's in file
PriorityQueue<HuffNode> forest = new PriorityQueue<>(); for (int i = 0; i < 256; i++)
if (frequencies[i] > 0) // computed elsewhere forest.add(new HuffNode(i, frequencies[i]));
while (forest.size() > 1) { HuffNode left = forest.remove(); HuffNode right = forest.remove(); forest.add(new HuffNode(-1, left.weight()+right.weight(),
left, right)); } HuffNode root = forest.remove();
Trie used to encode & decode • Compress: create encodings for each char/leaf
• Similar to LeafTrails APT • Each 8-bit chunk/char mapped to encoding,
e.g., in an array with codings[‘A’] == “010101”
• Decompress: Use trie/tree to decompress bits • Trie unique to each file, part of compressed file
• Compress: write trie, Decompress: read trie
12/1/17 CompSci 201, Fall 2017, Huff and More 12
Compressing kjv10.txt Encoding Length
# values with this length
3 1,159,124 4 1,487,471 5 712,325 6 485,333 7 261,611 8 84,107 9 81,467 10 48,019 11 21,065 12 1,863
Encoding Length
# values with this length
13 1,108 14 664 15 476 16 225 17 71 18 44 19 22 20 11 21 3 22 6 23 6
Uncompression with Huffman • We need the trie to uncompress
• 000100100010011001101111
• As we read a bit, what do we do? • Go left on 0, go right on 1 • When do we stop? What to do?
• How do we get the trie? • Could store 256 counts, use same code • Could store trie: read and write
12/1/17 CompSci 201, Fall 2017, Huff and More 14
Reading and Writing Huff Trie • Similar to concept/techniques in Tree APTs
• Distinguish interior and leaf nodes • In huff we label with 0 and 1 respectively • In Tree APT we store "null" explicitly
• 8 4 x 6 x x 12 10 x x 15 x x • Number? Read two subtrees • X ? Return null, no recursion • 8 [ 4 x 6 x x] [12 10 x x 15 x x] • 12 [10 x x] [15 x x]
12/1/17 CompSci 201, Fall 2017, Huff and More 15
Huff WOTO
http://bit.ly/201f17-huff-2
• How does decompress have access to Trie? • When does decompressing stop, how many
bits are written?
Anita borg: 1949-2003
12/1/17 CompSci 201, Fall 2017, Huff and More 17
“Dr. Anita Borg tenaciously envisioned and set about to change the world for women and for technology. … she fought tirelessly for the development technology with positive social and human impact.”
“Anita Borg sought to revolutionize the world and the way we think about technology and its impact on our lives.”
http://www.youtube.com/watch?v=1yPxd5jqz_Q
Decoding a message
G 12/1/17 CompSci 201, Fall 2017, Huff and More 19
Decoding a message
G 12/1/17 CompSci 201, Fall 2017, Huff and More 20
Decoding a message
G 12/1/17 CompSci 201, Fall 2017, Huff and More 21
Decoding a message
G 12/1/17 CompSci 201, Fall 2017, Huff and More 22
Decoding a message
G 12/1/17 CompSci 201, Fall 2017, Huff and More 23
Decoding a message
GO 12/1/17 CompSci 201, Fall 2017, Huff and More 24
Decoding a message
GO 12/1/17 CompSci 201, Fall 2017, Huff and More 25
Decoding a message
GO 12/1/17 CompSci 201, Fall 2017, Huff and More 26
Decoding a message
GO 12/1/17 CompSci 201, Fall 2017, Huff and More 27
Decoding a message
GO 12/1/17 CompSci 201, Fall 2017, Huff and More 28
Decoding a message
GOO 12/1/17 CompSci 201, Fall 2017, Huff and More 29
Decoding a message
GOO 12/1/17 CompSci 201, Fall 2017, Huff and More 30
Decoding a message
GOO 12/1/17 CompSci 201, Fall 2017, Huff and More 31
Decoding a message
GOO 12/1/17 CompSci 201, Fall 2017, Huff and More 32
Decoding a message
GOO 12/1/17 CompSci 201, Fall 2017, Huff and More 33
Decoding a message
GOOD 12/1/17 CompSci 201, Fall 2017, Huff and More 34
Decoding a message
GOODhttp://bit.ly/201-f17-1129-0 12/1/17 CompSci 201, Fall 2017, Huff and More 35
How to Interpret Bits • What can we tell from file extensions
• Foo.class, bar.jpg, file.txt, coolness.mp3 • How does OS know how to open these?
12/1/17 CompSci 201, Fall 2017, Huff and More 36
0000000: cafe babe 0000 0034 001d 0a00 0600 0f09 .......4........ 0000010: 0010 0011 0800 120a 0013 0014 0700 1507 ................ 0000020: 0016 0100 063c 696e 6974 3e01 0003 2829 .....<init>...()
0000000: ffd8 ffe0 0010 4a46 4946 0001 0200 0064 ......JFIF.....d 0000010: 0064 0000 ffec 0011 4475 636b 7900 0100 .d......Ducky... 0000020: 0400 0000 5d00 00ff ee00 0e41 646f 6265 ....]......Adobe
0000000: 4944 3303 0000 0000 0048 5458 5858 0000 ID3......HTXXX.. 0000010: 001a 0000 0045 6e63 6f64 6564 2062 7900 .....Encoded by. 0000020: 4d79 7374 6572 7920 4d65 7468 6f64 5452 Mystery MethodTR
Bits in a .class file • Does JVM read bit-by-bit? By symbol?
• Consider file in Hex or Binary, does it matter? • Compare Foo.java to Foo.class
12/1/17 CompSci 201, Fall 2017, Huff and More 37
0000000: cafe babe 0000 0034 001d 0a00 0600 0f09 .......4........ 0000010: 0010 0011 0800 120a 0013 0014 0700 1507 ................ 0000020: 0016 0100 063c 696e 6974 3e01 0003 2829 .....<init>...()
0000000: 11001010 11111110 10111010 10111110 00000000 00000000 ...... 0000006: 00000000 00110100 00000000 00011101 00001010 00000000 .4....)
PicassoGuernica.jpg • Viewed using "open .." and via "xxd .."
• Wikimedia "knows" how to display?
12/1/17 CompSci 201, Fall 2017, Huff and More 38
0000000: ffd8 ffe0 0010 4a46 4946 0001 0100 0001 ...JFIF...... 0000010: 0001 0000 ffdb 0043 0008 0606 0706 0508 ....C........ 0000020: 0707 0709 0908 0a0c 140d 0c0b 0b0c 1912 .............
Limits of Compression • How many values represented with 3 bits?
• 000, 001, 010, 011, 100, 101, 110, 111 • How many values represented with N bits? 2N
• Can we compress all of these? Suppose N = 10 • 2 1-bit files, 4 2-bit files, … 512 9-bit files • How many is this in total?
• Is this about lossy or lossless compression
12/1/17 CompSci 201, Fall 2017, Huff and More 39
Measuring Information • Original Huff explanation at Duke used example:
• Compress "go go gophers"
12/1/17 CompSci 201, Fall 2017, Huff and More 40
ASCII 3 bits g 103 1100111 000 00 o 111 1101111 001 01 p 112 1110000 010 1100 h 104 1101000 011 1101 e 101 1100101 100 1110 r 114 1110010 101 1111 s 115 1110011 110 100 sp. 32 1000000 111 101
3
2
Autocomplete meets Huff
Autocomplete meets Huff
Autocomplete meets Huff
YAHW
http://bit.ly/201f17-huff-3