Scalar Quantization - PowerPoint PPT Presentation

About This Presentation
Title:

Scalar Quantization

Description:

Many of the fundamental ideas of quantization and ... Digitizing a Sine Wave -0. 1.5. 101. 1.2. 0.2 -0. 2.5. 110. 2.4. 0.2 -0. 3.5. 111. 3.2. 0.1. 0.3 ... – PowerPoint PPT presentation

Number of Views:1119
Avg rating:3.0/5.0
Slides: 25
Provided by: nzh
Learn more at: http://www.cs.ucf.edu
Category:

less

Transcript and Presenter's Notes

Title: Scalar Quantization


1
Scalar Quantization
  • CAP5015
  • Fall 2004

2
Quantization
  • 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
  • One of the simplest and most general idea in
    lossy compression.

3
Scalar Quantization
  • Many of the fundamental ideas of quantization and
    compression are easily introduced in the simple
    context of scalar quantization.
  • An example any real number x can be rounded off
    to the nearest integer, say
  • q(x) round(x)
  • Maps the real line R (a continuous space) into a
    discrete space.

4
Quantizer
  • The design of the quantizer has a significant
    impact on the amount of compression obtained and
    loss incurred in a lossy compression scheme.
  • Quantizer encoder mapping and decode mapping.
  • Encoder mapping
  • The encoder divides the range of source into a
    number of intervals
  • Each interval is represented by a distinct
    codeword
  • Decoder mapping
  • For each received codeword, the decoder
    generates a reconstruct value

5
Components of a Quantizer
  1. Encoder mapping Divides the range of values that
    the source generates into a number of intervals.
    Each interval is then mapped to a codeword. It
    is a many-to-one irreversible mapping. The code
    word only identifies the interval, not the
    original value. If the source or sample value
    comes from a analog source, it is called a A/D
    converter.

6
Mapping of a 3-bit Encoder
Codes

000 001 010 011 100 101 110
111
-3.0 -2.0 -1.0 0 1.0 2.0
3.0 input
7
Mapping of a 3-bit D/A Converter
Input Codes Output
000 -3.5
001 -2.5
010 -1.5
011 -0.5
100 0.5
101 1.5
110 2.5
111 3.5
8
Components of a Quantizer
2. Decoder Given the code word, the decoder
gives a an estimated value that the source might
have generated. Usually, it is the midpoint of
the interval but a more accurate estimate will
depend on the distribution of the values in the
interval. In estimating the value, the decoder
might generate some errors. (Give Table 8.1 and
explain)
9
Digitizing a Sine Wave
t 4cos(2Pit) A/D Output D/A Output Error
0.1 3.8 111 3.5 0.3
0.1 3.2 111 3.5 -0
0.2 2.4 110 2.5 -0
0.2 1.2 101 1.5 -0
10
Step Encoder
11
(No Transcript)
12
  • resulting quantization error (noise)
    so that

13
Probability Density Function
  • A probability density function f(x) of the random
    variable x is said to meet the following
    criterion
  • Probability associated with a value of x in its
    domain X is given by Pr( Xlt x ).
  • The corresponding cumulative distribution
    function CDF or F(x) requires that F(x) is
    non-decreasing for x1 lt x2. When sampling
    occurs at discrete intervals then F(x) is said to
    be monotonically increasing.
  • F(x) is said to be continuous from the right or
    that the limit of f(x e) exists when evaluated
    as e-gt 0 from the right positive abscissa.
  • In the discrete case the point probabilities of
    particular values of xi have a probability that
    is always greater or equal to 0, pi Pr( X
    xi ) gt 0.
  • CDF may be expressed as 
  • In the continuous case, the CDF may be expressed
    as the following relationship 

14
  • Quantization operation
  • Let M be the number of reconstruction levels
  • where the decision boundaries are
  • and the reconstruction levels are

15
Quantization Problem
  • MSQE (mean squared quantization error)
  • If the quantization operation is Q
  • Suppose the input is modeled by a random variable
    X with pdf fX(x).
  • The MSQE is

16
Quantization Problem
  • Rate of the quantizer
  • The average number of bits required to represent
    a single quantizer output
  • For fixed-length coding, the rate R is
  • For variable-length coding, the rate will depend
    on the probability of occurrence of the outputs

17
Quantization Problem
  • Quantizer design problem
  • Fixed -length coding
  • Variable-length coding
  • If li is the length of the codeword corresponding
    to the output yi, and the probability of
    occurrence of yi is
  • The rate is given by

18
Uniform Quantization
19
Uniform Quantizer
Zero is one of the output levels M is odd
Zero is not one of the output levels M is even
20
Uniform Quantization of A Uniformly Distributed
Source
21
Uniform Quantization of A Uniformly Distributed
Source
22
Uniform Quantization of A Non-uniformly
Distributed Source
23
Image Compression
3bits/pixel
Original 8bits/pixel
24
Image Compression
2bits/pixel
1bit/pixel
Write a Comment
User Comments (0)
About PowerShow.com