Session 2

Special Topics in Multimedia System
Indian Institute of Technology Delhi

(IITD)
New Delhi
SIL801
Recap: Audio
Digital Representation
Audio (Sound): continuous signal (wave form) in time 1D function f(x)
Sampling
Continuous
Quantization
Sampling
Discrete
Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801
Recap: Image
2D function f(x,y)
x
Quantization
Sampling: Discretization in x and y

Recap: Video
Video is a sequence of images in time
3D function f(x,y,t)
Image
(Frame)
Time

Recap: Graphics
Geometry Data: Meshes
• Points
• Connectivity

Recap: Graphics

Multimedia Communication
Elements Transmitter End
Text
Acquisition and Storage

Sound
Synchronization
Compression
Integration
Video Communication
Channel
Image
Geometry/
Graphics/
Animation
Elements Receiver End
De-compression
Synchronization
Communication Media Extractor Play back
Channel

Some Challenges
4 Bandwidth capacity of the communication channel
4 Real-time processing
4 Synchronization (inter-media)
4 Continuity (intra-media)
4 End-to-end delay

Sampling
Fourier Transform Convolution
Source https://www.tutorialspoint.com/signals_and_systems/signals_sampling_theorem.htm
Sampling
Sampling
Reconstruction
Filter (Low Pass)
Aliasing
Sampling
The Nyquist–Shannon sampling theorem is a theorem in the field of
digital signal processing which serves as a fundamental bridge between
continuous-time signals and discrete-time signals. It establishes a
sufficient condition for a sample rate that permits a discrete sequence of
samples to capture all the information from a continuous-time signal of
finite bandwidth.
Source: Wikipedia
Sampling: Reading Assignment
Reading Assignment

Quantization
Quantization, in mathematics and digital signal processing, is the process of mapping

input values from a large set (often a continuous set) to output values in a (countable)
smaller set, often with a finite number of elements.
Input (Continuous) Output (Discrete)

Quantization
Source: Wikipedia
Quantization
Uniform Quantization
Source: https://www.tutorialspoint.com/digital_communication/digital_communication_quantization.htm
Quantization
Source: https://www.tutorialspoint.com/digital_communication/digital_communication_quantization.htm
Image Compression
Compression Ratio
Cr = no/nc
no = Number of carrying units (bits) in the original

data (image)
nr = Number of carrying units (bits) in the compressed
data (image)
Also,
Rd = 1 – 1/ Cr
Rd = Relative data redundancy

Image Compression
Fidelity Criteria
Measure of loss or degradation
• Mean Square Error (MSE)
• Signal to Noise Ratio (SNR)

• Subjective Voting

Image Compression
Compression Techniques
• Loss-less Compression
Information can be compressed and
restored without any loss of information
• Lossy Compression
Large compression, perfect recovery is
not possible

Image Compression
Compression Techniques
Symmetric
• Same time for compression (coding) and decompression (decoding)
• Used for dialog (interactive) mode applications
Asymmetric
• Compression is done once so can take longer
• Decompression is done frequently so should be fast
• Used for retrieval model applications

Image Compression
Data Redundancy
• Coding
Variable length coding with shorter codes
for frequent symbols
• Interpixel
Neighboring pixels are similar
• Psychovisual
Human visual perception - limited

Image Compression
Coding Redundancy
Example: (from Digital Image Processing by Gonzalez and Woods)
fixed length coding variable length coding

Avg length=3 bits Avg length=2.7 bits
Image Compression
Interpixel Redundancy
Image Histogram

Image Compression
Interpixel Redundancy
Image Histogram
High interpixel correlation

Image Compression
Psychovisual Redundancy
Original 256 levels 16 level quantization IGS quantization

Image Compression
Loss-less Techniques
• Coding redundancy
Variable length coding
• Interpixel redundancy
Run length coding
Predictive coding

Image Compression
Variable Length Coding (Huffman Coding)
Sequence of symbols (a1, a2, a3, a4, a5) with associated
probabilities (p1, p2, p3, p4, p5)
• Start with two symbols of the least probability

a1:p1
a2:p2
• Combine (a1 or a2) with probability (p1+p2)
• Do it recursively (sort and combine)
• A binary tree construction

Image Compression
Example:
Symbols and their probabilities of occurrence a2 (0.4)
a1 (0.2), a2 (0.4), a3 (0.2), a4 (0.1), a5 (0.1)
a1(0.2)
Sort in a3(0.2)
probability
a4(0.1)
a5(0.1)

Image Compression
Sort
a2 (0.4)
a1(0.2)
a3(0.2)
a4(0.1)
a5(0.1)
Image Compression
Sort combine
a2 (0.4)
a1(0.2)
a3(0.2)
a4(0.1) 0.2
a5(0.1)
Image Compression
Sort combine Sort
0.4
a2 (0.4)
0.2
a1(0.2)
0.2
a3(0.2)
a4(0.1) 0.2 0.2
a5(0.1)
Image Compression
Sort combine Sort combine Sort combine Sort combine
0.4 0.4 0.6

a2 (0.4) 1
0.2 0.4
a1(0.2) 0.6 0.4
0.2 0.2
a3(0.2) 0.4
a4(0.1) 0.2 0.2
a5(0.1)
Image Compression
Sort combine Sort combine Sort combine Sort combine
1 0.4 1 0.4 1 0.6 0

1 a2 (0.4) 1
01 0.2 01 0.4 00
01 a1(0.2) 0.6 0.4 1
000 0.2 000 0.2
000 a3(0.2) 0.4
01
0010
0010 a4(0.1) 0.2 0.2
Assign code
001
0011 a5(0.1)
0011
Image Compression
Example:
Avg length code:

0.4x1 + 0.2x2 + 0.2x3 + 0.1x4 + 0.1x4
= 2.2 bits

Image Compression
Example:
Entropy A measure of information that captures uncertainity

[I(e) = log (1/P(e))]

Image Compression
Example: Decoding
00111010001
?
Image Compression
Root
1
Example: Decoding 0
00111010001 0 1 a2
0 1 a1
0 1
a3
a4 a5
Image Compression
Root
1
Example: Decoding 0
00111010001 0 1 a2
a5 0 1 a1
a2
0 1
a1 a3
a3
a2 a4 a5
Image Compression

Session 2

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Session 2

Uploaded by

Copyright:

Available Formats

Special Topics in Multimedia System

Indian Institute of Technology Delhi

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Acquisition and Storage

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Fourier Transform Convolution

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Quantization, in mathematics and digital signal processing, is the process of mapping

Input (Continuous) Output (Discrete)

no = Number of carrying units (bits) in the original

Rd = Relative data redundancy

• Signal to Noise Ratio (SNR)

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

fixed length coding variable length coding

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

High interpixel correlation

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Original 256 levels 16 level quantization IGS quantization

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

• Start with two symbols of the least probability

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

a4(0.1) 0.2 0.2

0.4 0.4 0.6

a4(0.1) 0.2 0.2

1 0.4 1 0.4 1 0.6 0

Avg length code:

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Entropy A measure of information that captures uncertainity

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

Special Topics in Multimedia System http://www.cse.iitd.ac.in/~pkalra/sil801

You might also like