CS101 Lecture 13: Image Compression. What You ll Learn Today

Transcription

1 CS101 Lecture 13: Image Compression Vector Graphics Compression Techniques Aaron Stevens 22 February 2013 What You ll Learn Today Review: how big are image files? How can we make image files smaller? What are the main image file formats, and how are they different from each other? What are the main techniques for compressing images? 1

2 Image File Size: HUGE! Raster/Bitmap Graphics Storage of data on a pixel-by-pixel basis Bitmap (BMP), GIF, JPEG, and PNG, for example How much data is required to represent a picture? Typical size might be 1024 by 768 pixels (~ 800,000) At 3 bytes per pixel, about 2,400,000 bytes for one picture. A 10Mpixel picture would be 30,000,000 bytes per picture. Consider download times Example: A 10Mpixel picture would be 30,000,000 bytes This is 240,000,000 bits. Typical home cable modem downloads at 5 Mbits per second (5,000,000 bits per second). How long to download this picture? 240,000,000 / 5,000,000 = 48 seconds Average download speed on 3G networks is closer to 1MB/second. 2

3 Describe this picture Vector Graphics describes an image by coordinates, lines, geometric shapes and colors. This image was a homework assignment by a CS108 student, Spring Vector Graphics Example Instructions written in Python by CS108 student (Spring 2010). File size: bytes. 3

4 Vector Graphics Advantages: Small file sizes (instructions take much less space than sampling pixels) Easy to resize mathematically without loss of detail Disadvantages: Image shapes are not lifelike Color contrast and texturing are rigid, not lifelike Requires software to interpret the drawing instructions Raster vs. Vector Graphics When would you use each? Drawings, Diagrams, Games, etc. Photography, video, etc. 4

5 Storing an image in fewer bytes What are our choices? What are reasonable tradeoffs? Raster Graphics vs. Vector Graphics? Decrease sampling rate (fewer pixels) Decrease quantization (fewer colors) Compression algorithms What is the output resolution? iphone 3 has a resolution of 640 X 960 pixels. Evo has 480 X 800 pixels. Facebook pictures (in web browser) are 560 X 750 pixels. 5

6 Lower Image Resolution? Original bitmap image dimensions: 1524 * 2034 = 3,099,816 pixels 3,099,816 pixels * 3 bytes = 9,299,448 bytes How about 300 * 400 pixels? 300 * 400 pixels = 120,000 pixels 120,000 pixels * 3 bytes = 360,000 bytes A compression ratio of What s the catch? Fewer Colors: GIF Images Graphics Interchange Format (GIF) Each image is made up of any 256 (or 16) RGB colors, but only those colors. 256 colors: 8 bits per pixel 16 colors: 4 bits per pixel 6

7 Fewer Colors: GIF Images 16 Color GIF 120,000 bytes 256 Color GIF 200,000 bytes Original BMP 360,000 bytes How do you fit more cars on this lot? Compress them! Data compression Reduction in the amount of space needed to store a piece of data. 7

8 Data Compression (saving space) Data compression Reduction in the amount of space needed to store a piece of data. Data compression techniques can be: lossless, which means the data can be retrieved without any loss of the original information lossy, which means some information may be lost in the process of compaction JPEG Images The Joint Photographic Experts Group created the standard codec in Default format on most digital cameras Compression reduces file size up to 90% with little loss in visible quality Great for life-like images the web Is JPEG compression lossy or lossless? 8

9 Recall: RGB Colorspace = RGB has a lot of redundant information. JPEG uses the YCbCr Colorspace Y (luminance) Cb (chroma blue) Cr (chroma red) 9

10 YCbCr Colorspace YCbCr separates luminance (brightness) from chroma (color differences). Our eyes are more sensitive to changes in luma than to changes in chroma. JPEG thus stores a high resolution Y, and lower-resolution CbCr. Smoothing colors among adjacent pixels. JPEG Color Smoothing This image is progressively more less smoothed from left to right (lowest to highest quality). 10

11 JPEG Compression Convert color space from RGB to YCbCr Smooth adjacent colors in Cb/Cr Apply Huffman compression after smoothing Which part of this is lossy compression? PNG Image Format Portable Network Graphics (PNG) 24-bit bitmapped color. Uses lossless compression. 2-stage compression process: 1. Filter image by adjacent pixels, record the differences 2. Use the DEFLATE algorithm (Huffman encoding scheme) 11

12 Same Picture, Many Formats Original image was 2048 * 1536 pixels All others are 300 * 400 pixels 12

13 What You Learned Today Vector graphics vs. raster graphics Factors in image file size Resolution, color depth Compression strategies Reduce colors Reduce resolution Lossless compression algorithms Lossy compression algorithms GIF, JPEG, and PNG Announcements and To Do HW06 due Wednesday 2/27 Readings: Wong ch 3, pp (today) Wong ch 4, pp (next week) 13

14 Image Manipulation Software There are many different image manipulation software packages, e.g.: Paint Built in to windows Photoshop Commercial software Irfanview Free software Paintshop Pro Shareware/Commercial GIMP Free software Example: Text Compression Problem: Unicode assigns 16 bits to each character in a document; uses a heck of a lot of space. We need ways to store and transmit text efficiently. Why? Common lossless compression techniques: keyword encoding run-length encoding Huffman encoding 14

15 Keyword Encoding Replace frequently used words with a single character Keyword Encoding Example Given the following paragraph, We hold these truths to be self-evident, that all men are created equal, that they are endowed by their Creator with certain unalienable Rights, that among these are Life, Liberty and the pursuit of Happiness. That to secure these rights, Governments are instituted among Men, deriving their just powers from the consent of the governed, That whenever any Form of Government becomes destructive of these ends, it is the Right of the People to alter or to abolish it, and to institute new Government, laying its foundation on such principles and organizing its powers in such form, as to them shall seem most likely to effect their Safety and Happiness. 15

16 Keyword Encoding Example The encoded paragraph is We hold # truths to be self-evident, $ all men are created equal, $ ~y are endowed by ~ir Creator with certain unalienable Rights, $ among # are Life, Liberty + ~ pursuit of Happiness. $ to secure # rights, Governments are instituted among Men, deriving ~ir just powers from ~ consent of ~ governed, $ whenever any Form of Government becomes destructive of # ends, it is ~ Right of ~ People to alter or to abolish it, + to institute new Government, laying its foundation on such principles + organizing its powers in such form, ^ to ~m shall seem most likely to effect ~ir Safety + Happiness. Keyword Encoding Compression ratio The size of the compressed data divided by the size of the original data (0 < c.r. <= 1) What did we save? Original paragraph: 656 characters Encoded paragraph: 596 characters Characters saved: 60 characters Compression ratio: 596/656 = Could we use this substitution chart for all text? How could we apply keyword encoding to images? 16

17 Run-Length Encoding Consider a single character which is repeated over and over again in a long sequence. Replace a repeated sequence with a flag character repeated character number of repetitions Example: *n8 * is the flag character n is the repeated character 8 is the number of times n is repeated Run-Length Encoding Example Original text bbbbbbbbjjjkllqqqqqq+++++ Encoded text *b8jjjkll*q6*+5 (Why isn't l encoded? J?) The compression ratio is 15/25 or.6 Encoded text *x4*p4l*k7 Original text xxxxpppplkkkkkkk This type of repetition isn t very helpful for English text. Can you think of a situation where it might be helpful? 17

18 Run-Length Encoding Example How would you describe the colors in this image? Which letters occur most? 18

19 Huffman Encoding Why should the character X" and "z" take up the same number of bits as "e" or " "? Huffman codes use variable-length bit strings to represent each character. More frequently used letters have fewest bits. Huffman Encoding Example ballboard would be !! Encoded is 28 bits vs 144 bits with Unicode; The compression ratio is 28/144 or 0.39 Try to encode roadbed 19

20 Huffman Encoding Prefix Property No character's bit string is the prefix of any other character's bit string. To decode look for match left to right, bit by bit record letter when a match is found begin next character where you left off Huffman Encoding Example Try it! Decode!! ! 20

21 Huffman Encoding The technique for creating codes guarantees the prefix property of the codes. There is no single Huffman code -- each depends on the application. Two types of Huffman codes: general, based on use of letters in English, Spanish,. specialized, based on text itself or specific types of text 21