0400CST446052303

Scheme of Valuation/Answer Key

(Scheme of evaluation (marks in brackets) and answers of problems/key)
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
EIGHTH SEMESTER B.TECH(R,S)DEGREE EXAMINATION, MAY2024 (2019 SCHEME)
Course Code: CST446
Course Name: DATA COMPRESSION TECHNIQUES
Max. Marks: 100 Duration: 3 Hours

PART A
Answer all questions, each carries 3 marks. Marks

1 Lossless compression techniques involve no loss of information. The original (3)

data can be recovered exactly from the compressed data. Text compression is an
important area for lossless compression. (1.5 marks)
Lossy compression techniques involve some loss of information. Data that have
been compressed using lossy techniques cannot be recovered or reconstructed
exactly. We can obtain much higher compression ratios. reconstruction of a
video sequence (1.5 marks)
2 In lossy compression, the reconstruction differs from the original data (3)
The difference between the original and the reconstruction is often called the
distortion. Definition (3 marks)

3 Huffman code for the source is OR (3)

a1 – 110 a1 –001
a2 – 1111 a2 –0000
a3 – 10 a3 –01
a4 – 1110 a4 –0001
a5 – 0 a5 –1
Demonstrate with proper tree structure (3 marks)
4 A prefix code is a variable-size code that satisfies the prefix property. This (3)
property requires that once a certain bit pattern has been assigned as the code of
a symbol, no other codes should start with that pattern (the pattern cannot be the
prefix of any other code).
Explanation (2 marks)
Example (1mark)

Page 1of 10
 0400CST446052303
5 LZ77- LZ1, sliding window.uses triplet <offset,length,codeword> (3)
LZ78- uses dublet <offset,codeword>
Valid comparison (3 marks)
6 sequential mode (3)
progressive mode
lossless mode
hierarchical mode
any three modes and explanation (3 marks)
7 The motion vector is the relative location of the block to be used for prediction (3)
obtained by subtracting the coordinates of the upper-left corner pixel of the
block being encoded from the coordinates of the upper-left corner pixel of the
block being used for prediction. Suppose the block being encoded is an 8×8
block between pixel locations
Explanation (2 marks)
Example (1mark)
8 1.Streaming multimedia data over the Internet or over local-area networks. (3)
2. Communications
3. Broadcasting digital multimedia.
4. Context-based storage and retrieval.
5. Studio and television postproduction.
6. Surveillance.
7. Virtual conferencing.
Any 3 application (3 marks)
9 (3)

Figure (1.5 marks)

Explanation (1.5 marks)
10 Digitizing sound is done by measuring the voltage at many points in time, (3)
translating each measurement into a number, and writing the numbers on a file.
This process is called sampling. The sound wave is sampled, and the samples

Page 2of 10
 0400CST446052303
become the digitized sound. The device used for sampling is called an analog-to-
digital converter (ADC).
Any valid explanation (3 marks)
PART B
Answer one full question from each module, each carries 14 marks.
Module I
11 a) Four probability models (2 marks each) (8)
• Uniform distribution - this is an ignorance model. we do not know anything
about the distribution of the source output, except possibly the range of values,
we can use the uniform distribution to model the source.

• Gaussian distribution - a normal distribution or Gaussian distribution is a

type of continuous probability distribution for a real-valued random variable .it
is symmetric about the mean

• Laplacian distribution - distributions that are quite peaked at zero. For

example, speech consists mainly of silence. Therefore, samples of speech will be
zero or close to zero with high probability.

• Gamma distribution - distribution that is more peaked an considerably less

tractable

Page 3of 10
 0400CST446052303
b) compression ratio -Ratio of the number of bits required to represent the data (6)
before compression to the number of bits required to represent and any valid
example (2 marks)
rate - the average number of bits required to represent a single sample any valid
example (2 marks)
In lossy compression, the reconstruction differs from the original data
The difference between the original and the reconstruction is often called the
distortion.
Fidelity and quality. When we say that the fidelity or quality of a
reconstruction is high, we mean that the difference between the reconstruction
and the original is small (2 marks)
OR
12 a) If the experiment is a source that puts out symbols Ai from a set A , then the (7)
entropy is a measure of the average number of binary symbols needed to code
the output of the source.
Physical Models • Physics of the data generation process • In speech-related
applications, knowledge about the physics of speech production can be used to
construct a mathematical model for the sampled speech process • Models for
certain tel
Probability Models • Ignorance model • assume that each letter that is generated
by the source is independent of every other letter, and each occurs with the same
probability • Probability model • assume that each letter that is generated by the
source is independent of every other letter, and each occurs with the different
probability • For a source that generates letters from an alphabet A= a1,
a2,….aM , we can have a probability model P= Pa1, Pa2,…….PaM .
Proper explanations with equations and examples (7 marks)
b) Exact compression scheme we use will depend on the characteristics of the data (7)
that need to be compressed • Redundancies inherent in the data. • The
development of data compression algorithms for a variety of data can be divided
into two phases.
• The first phase is modeling. • extract information about any redundancy that
exists in the data and describe the redundancy in the form of a model.
• The second phase is called coding. • A description of the model and a

Page 4of 10
 0400CST446052303
“description” of how the data differ from the model are encoded, using a binary
alphabet. • The difference between the data and the model is referred to as the
residual
Valid explanation (4 marks)
Example (3 marks)
Module II
13 a) Arithmetic encoding (AE) is a lossless algorithm that uses a low number of bits (8)
to compress data. It’s an entropy-based algorithm. AE encodes the entire
message using a single number between 0.0 and 1.0. Each symbol in the
message takes a sub-interval in the 0-1 interval, corresponding to its probability.
1. Start by defining the “current interval” as [0, 1).
2. Repeat the following two steps for each symbol s in the input stream:
2.1. Divide the current interval into subintervals whose sizes are proportional to
the symbols’ probabilities.
2.2. Select the subinterval for s and define it as the new current interval.
Explanation (4 marks)
Example (4 marks)
b) variable-size codes, with the shorter codes assigned to symbols or groups of (6)
symbols that appear more often in the data (have a higher probability of
occurrence.
• assigning codes that can be decoded unambiguously
• assigning codes with the minimum average size
Explanation (6 marks)
OR

Page 5of 10
 0400CST446052303
14 a) (8)

Flow chart (4 marks)

Example (4 marks)
b) Proper explanation and comparison using example 3 marks each (6)
Module III
15 a) Proper illustration and final result (7 marks) (7)
b) If same answer with proper steps (7 marks) (7)
OR
16 a) Proper illustration and definition of the full dictionary (8 marks) (8)
b) (6)

Explanation of each steps in detail (6 marks)

Page 6of 10
 0400CST446052303
Module IV
17 a) (8)

Explanation (4 marks)
Example (4 mark)
b) Object descriptor framework (6)
Systems decoder model
Binary format for scenes
MPEG-J
Extensible MPEG-4 textual format
Transport tools
Video compression
Robustness tools
Fine-grain scalability
Face and body animation.
Speech coding
Audio coding
Synthetic audio coding
Any valid 6 tools 6 marks
OR
18 a) MPEG uses I, P, and B pictures. They are arranged in groups, where a group can (7)
be open or closed. The pictures are arranged in a certain order, called the coding
order, but (after being decoded) they are output and displayed in a different

Page 7of 10
 0400CST446052303
order, called the display order. In a closed group, P and B pictures are decoded
only from other pictures in the group. In an open group, they can be decoded
from pictures outside the group. Different regions of a B picture may use
different pictures for their decoding. A region may be decoded from some
preceding pictures, from some following pictures, from both types, or from
none. Similarly, a region in a P picture may use several preceding pictures for its
decoding, or use none at all, in which case it is decoded using MPEG’s intra
methods. The basic building block of an MPEG picture is the macroblock). It
consists of a 16×16 block of luminance (grayscale) samples (divided into four
8×8 blocks) and two 8 × 8 blocks of the matching chrominance samples. The
MPEG compression of a macroblock consists mainly in passing each of the six
blocks through a discrete cosine transform, which creates decorrelated values,
then quantizing and encoding the results.
A picture in MPEG is organized in slices, where each slice is a contiguous set of
macroblocks (in raster order) that have the same grayscale (i.e., luminance
component). The concept of slices makes sense because a picture may often
contain large uniform areas, causing many contiguous macroblocks to have the
same grayscale.
(Proper exaplanation and detailing 7 marks)
b) (7)

Explanation (4)
Figure (3)
Module V
19 a) To hide quantization noise, we can make use of the fact that signals below a (7)
particular amplitude at a particular frequency are not audible. If we select the
quantizer step size such that the quantization noise lies below the audibility

Page 8of 10
 0400CST446052303
threshold, the noise will not be perceived. Furthermore, the threshold of
audibility is not absolutely fixed and typically rises when multiple sounds
impinge on the human ear. This phenomenon gives rise to spectral masking. A
tone at a certain frequency will raise the threshold in a critical band around that
frequency.
The temporal masking effect is the masking that occurs when a sound raises the
audibility threshold for a brief interval preceding and following the sound.
Valid explanation (3 marks for each)
b) Proper explanation with supporting figures (7 marks) (7)
OR
20 a) (7)

Explanation with figure (3.5 marks each)

b) (7)

Explanation with figure (3.5 marks each)

Page 9of 10
0400CST446052303
****

Page 10of 10