Compressions Notes
- Shannon's Entropy: H = - sum( pi log pi )
- lossless compression - the basics
- JPEG - a lossy image compression algorithm
- Steps:
- break into 8x8 pixel blocks
- convert RGB to YUV color (with fewer bits in UV; some loss here)
- discrete cosine transform (DCT, like FFT)
- round off fourier components (most of loss is here)
- compress with Huffman (or arithmetic) coding
- write to file in SPIFF format
- paper describing the details
- MP3
- See google directory compression
- this directory
Jim Mahoney
Last modified: Tue Dec 4 12:59:06 EST 2001