Computer Science 1033A/B Lecture Notes - Lecture 5: Lossless Compression, Huffman Coding, Lossy Compression

22 views8 pages
mikekuo58 and 38820 others unlocked
COMPSCI 1033A/B Full Course Notes
25
COMPSCI 1033A/B Full Course Notes
Verified Note
25 documents

Document Summary

Several different ways to do compression depending on the type of image. Rather than ascii (each letter is 8bits or 1 byte) use the least number of bits for common letters and more bits for less common letters. The human eye is more sensitive to brightness details than to fine colour details. If it finds two adjacent pixels with very similar colours, it will store both those pixels with the same colour and discard the other colour. Depends on the type of image we are representing. How many colours are needed for the image. The type of image we are trying to compress will determine the best file format to choose. Only supports 8 bit colour therefore doesn"t work well for images, but works well for clipart, logos, animation. Finds a pattern, and compresses it based on that pattern. Looks for large blocks of areas that all have the same colour.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents