Basics on Image Compression.ppt

SPIE ITcom 8/01 ENEE631 Digital Image Processing (Spring04) Basics on Image Compression Spring ’04 Instructor: Min Wu  ECE Department, Univ. of Maryland, College Park Overview Last Time: image restoration A few commonly seen linear distortions in imaging system Deconvolution: inverse filtering, pseudo-inverse filtering Wiener filtering: balance between inverse filtering noise removal Today: Wrap up with image restoration Basics compression techniques Overview Last Time: Further discussion on image restoration Filtering through frequency-domain operations Basic concept on source compression: codec, source vs channel coding Basic coding techniques: PCM, Entropy coding Today: Continue on source coding/compression techniques = Lossless coding vs. Lossy coding Image CompressionPart-1. Basics Why Need Compression? Savings in storage and transmission multimedia data (esp. image and video) have large data volume difficult to send real-time uncompressed video over current network Accommodate relatively slow storage devices they do not allow playing back uncompressed multimedia data in real time 1x CD-ROM transfer rate ~ 150 kB/s 320 x 240 x 24 fps color video bit rate ~ 5.5MB/s = 36 seconds needed to transfer 1-sec uncompressed video from CD Example: Storing An Encyclopedia 500,000 pages of text (2kB/page) ~ 1GB = 2:1 compress 3,000 color pictures (640?480?24bits) ~ 3GB = 15:1 500 maps (640?480?16bits=0.6MB/map) ~ 0.3GB = 10:1 60 minutes of stereo sound (176kB/s) ~ 0.6GB = 6:1 30 animations with average 2 minutes long (640?320?16bits?16frames/s=6.5MB/s) ~ 23.4GB = 50:1 50 digitized movies with average 1 minute long (640?480?24bits?30frames/s = 27.6MB/s) ~ 82.8GB = 50:1 Require a total of 111.1GB storage capacity if without compression Reduce to 2.96GB if with compression Outline Lossless encoding tools Entropy coding: Huffman, Lemple-Ziv, and others (Arithmetic coding) Run-length coding Lossy tools for reducing redundancy Quantizat