KỸ THUẬT XỬ LÝ VÀ TRUYỀN THÔNG

ĐA PHƯƠNG TIỆN

2021
 Learning Flow
Image Video Coding
Lossless Image Lossy Image
Compression & Motion
Compression Compression
Standards Estimation

Video Indexing Multimedia Video Coding

Audio Coding
and Retrieval Synchronization Standards

Multimedia Formation and Representation

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Lossless Image Compression Systems

 Image Compression
 Huffman Coding
 Arithmetic & Lempel - Ziv Coding
 Run-length coding

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Image Compression

 Expected Outcomes:
1. Identify and classify redundancies present in an image
2. Distinguish between lossless and lossy image compression
3. Measure the quality of reconstructed images
4. State the element of an image compression system

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Image Compression

Multimedia Communication challenge is to transmit the multimedia

signal, especially the image and video signals through the limited
bandwidth channels

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Image Compression

How to compress the data (Image) ?

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Image Compression

Identify the Redundancies in Image and Remove them!!!

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Image Compression

Higher degree of detail, less redundancies

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Classification of Redundancies

1. Statistical redundancy: Pixels within an image tend to have very similar

intensities as those of its neighborhood

2. Psychovisual redundancy : Out eyes are more responsive to slow and

gradual changes of illumination than perceiving finer details and rapid
changes of intensities

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Classification of Image Compression

1. Lossless image compression: exploit redundancies without incurring any

loss of data;  Only statistical redundancy

2. Lossy image compression: exploit redundancies incurring loss of data

and hence suffer a loss of quality in reconstruction

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Reconstructed Image Quality Measurement

1. Subjective measurement: MOS: Mean Opinion Score

2. Objective measurement: PSNR, SSIM,…

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Elements of Image Compression System

a) Encoding system

b) Decoding system
Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Huffman Coding

 Expected Outcomes:
1. Measure source entropy
2. State Shannon coding theorem
3. Measure coding efficiency
4. Huffman coding

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Source Entropy (H)

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Shannon’s Coding Theorem (noiseless channel)

 In any coding scheme, the average code word length of source of symbols
can at best be equal to the source entropy and can never be less than it.

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 David Huffman

 David Albert Huffman

 Aug. 1925 – Oct. 1999
 Computer scientist
 Mathematical origami
 Famous on Huffman codes

David Huffman in 1978 and in 1999 (both photos courtesy of

University of California, Santa Cruz)

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Huffman Code

 Huffman coding is based on the frequency of occurrence of a data item

(pixel in images). The principle is to use a lower number of bits to encode
the data that occurs more frequently.

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 The Story of Huffman Code
 In 1951 David A. Huffman attended a course on information theory which were given
the choice of a term paper or a final exam.
 For the term paper, Huffman’s professor, Robert M. Fano, had assigned what at first
appeared to be a simple problem.

“Students were asked to find the most

efficient method of representing
numbers, letters or other symbols using
a binary code. Besides being a nimble
intellectual exercise, finding such a code
would enable information to be
compressed for transmission over a David Huffman and his professor, Fano
computer network or for storage in a
computer’s memory.”
Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Exercise

 Consider a random variable X taking values in the set

X = {1, 2, 3, 4, 5} with probabilities 0.25, 0.25, 0.2, 0.15, 0.15, respectively. Using
Huffman code to construct the optimal code for representing these letter and compute
the code length

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Exercise
 Consider a random variable X taking values in the set
X = {1, 2, 3, 4, 5} with probabilities 0.25, 0.25, 0.2, 0.15, 0.15, respectively. Using
Huffman code to construct the optimal code for representing these letter and compute
the code length

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện
 Questions

Hoang Van Xiem, Ph.D., VNU-UET KT Xử lý & Truyền thông Đa phương tiện