Beruflich Dokumente
Kultur Dokumente
The goal of image compression is to reduce the amount of data required to represent a digital image.
Reduce storage requirements and increase transmission rates.
Approaches
Lossless
Information preserving Low compression ratios
Lossy
Not information preserving High compression ratios
Data Information
Data and information are not synonymous terms!
Data is the means by which information is conveyed. Data compression aims to reduce the amount of data required to represent a given quantity of information while preserving as much information as possible.
Ex2:
Ex3:
Data Redundancy
compression
Compression ratio:
Coding Redundancy
Code: a list of symbols (letters, numbers, bits etc.) Code word: a sequence of symbols used to represent a piece of information or an event (e.g., gray levels). Code word length: number of symbols in each code word
E ( X ) xP ( X x )
x
Example:
Interpixel redundancy
Interpixel redundancy implies that any pixel value can be reasonably predicted by its neighbors (i.e., correlated).
f ( x) o g ( x)
f ( x) g ( x a)da
autocorrelation: f(x)=g(x)
Example:
original
Psychovisual redundancy
The human eye does not respond with equal sensitivity to all visual information. It is more sensitive to the lower frequencies than to the higher frequencies in the visual spectrum.
Idea: discard data that is perceptually insignificant!
C=8/4 = 2:1
What is the minimum amount of data that is sufficient to describe completely an image without loss of information?
Modeling Information
Information generation is assumed to be a probabilistic process.
Idea: associate information with probability! A random event E with probability P(E) contains:
Suppose that gray level values are generated by a random variable, then rk contains:
units of information!
E I (rk ) Pr( rk )
k 0
L 1
using
Entropy
units/pixel
Redundancy (revisited)
Redundancy:
where:
Entropy Estimation
It is not easy to estimate H reliably!
image
16
Better than before (i.e., H=1.81 for original image) However, a better transformation could be found since:
A variable-length coding technique. Optimal code (i.e., minimizes the number of code symbols per source symbol). Assumption: symbols are encoded one at a time!
Huffman Coding/Decoding
After the code has been created, coding/decoding can be implemented using a look-up table. Note that decoding is done unambiguously.
e.g., (0,1)(1,1)(0,1)(1,0)(0,2)(1,4)(0,2)
Lossy Compression
Transform the image into a domain where compression can be performed more efficiently (i.e., reduce interpixel redundancies).
~ (N/n)2 subimages
K << N
K-1 K-1
Transform Selection
DCT
forward
inverse
if u=0 if u>0
if v=0 if v>0
DCT (contd)
Basis set of functions for a 4x4 image (i.e.,cosines of different frequencies).
DCT (contd)
DFT
8 x 8 subimages
WHT
DCT
1.78
1.13
DCT (contd)
DCT minimizes "blocking artifacts" (i.e., boundaries between subimages do not become very visible).
DFT
i.e., n-point periodicity gives rise to discontinuities!
DCT
i.e., 2n-point periodicity prevents discontinuities!
DCT (contd)
original
2 x 2 subimages
4 x 4 subimages
8 x 8 subimages