Professional Documents
Culture Documents
Lec6 - Scalar Abnd Vector Quantization
Lec6 - Scalar Abnd Vector Quantization
Lecture 6
Definition:
Quantization: a process of representing a large –
possibly infinite – set of values with a much smaller set.
Scalar quantization: a mapping of an input value x into
a finite number of output values, y:
Q: x y
Codes
Problem 1:
You’re given 16-bit integers (0-65545). Unfortunately,
you only have space to store 8-bit integers (0-255).
Come up with a representation of those 16-bit
integers that uses only 8 bits!
Problem 2:
You have a string of those 8-bit integers that use your
representation. Recreate the 16-bit integers as best
you can!
Uniform Quantization
Uniform Quantizer
Zero is one of the output levels Zero is not one of the output levels
M is odd M is even
Scalar Quantization
2bits/pixel 1bit/pixel
Vector Quantization
Amount of compression:
Codebook size is K, input vector of dimension L
Inorder to inform the decoder of which code
vector is selected, we need to use log 2 K bits.
E.g. need 8 bits to represent 256 code vectors.
Rate: each code vector contains the log 2 K / L
reconstruction value of L source output samples,
the number of bits per sample would be:
.
Sample: a scalar value in vector.
K: level of vector quantizer.
Vector Quantization Example
When label size is much greater than codebook storage size , codebook
storage size can be neglected during compression ratio calculations
Note: codebook storage size is independent on image size , number of
labels depends on image size
Labels size= number of labels * number of bits per label= 22500 *
5=112500 bits = 14063 Bytes
Codebook storage size = number of vectors * vector size * number of bits
per pixel= 32*(4*4)*8=4096 bits = 512 bytes
Total compressed image size= label size = 112500 bits = 14063 bytes
Original image size = 600*600*8 = 2880000 bits = 36000bytes
Compression ratio =original/compressed=360000/14063= 25.59 :
1