| |
| | Lossy Compression |
 | | Actually, lossy compression is normally very tricky and requires some higher math, but for this assignment we've provided the code for SVD decomposition algorithm. |
 | | Obviously some files can be compressed much more than others, but even when they can't compress a file at all, both LZW and Huffman will still run, and the file they produce can always be decompressed to produce the original exactly. |
 | | The compression algorithm we're using only works with one color component at a time, so when you extract the 128x128 chunks (or 8x8 chunck's in extra credit) of the image to pass to the SVD, you'll need to do this separately for the red, green, and blue components of the image. |
| edbardsley.org /classes/15-211/lab4/lossy.html (2617 words) |
|