REG

. NO.

SRM Institute of Science and Technology

College of Engineering and Technology SET B
School of Computing
DEPARTMENT OF COMPUTING TECHNOLOGIES
SRM Nagar, Kattankulathur – 603203, Chengalpattu District, Tamilnadu
Academic Year:2024-2025 (ODD SEM)

Test: CLAT III Date: 18-07-2024

Course Code & Title: 18CSE353T & Digital Image Processing Duration: 2 periods
Year & Sem: IV Year / VII Sem Max. Marks: 50

Course Articulation Matrix:

Course Outcome PO1 PO PO3 PO PO5 PO6 PO PO8 PO9 PO10 PO11 PO12
2 4 7

CO1 H H H

CO2 H H H

CO3 H H H

CO4 H H H

CO5 H H H

Part - A
(10 × 1 = 10 Marks)

Questions Marks BL CO PO PI
Code
In the coding redundancy technique we use 01 1 2 3 3.6.3
o Fixed length Code and Variable Length Code
o Only Variable length code
o Only Fixed Length code
o Byte code

Information per source 01 2 2 1 3.6.2

is called
o Sampling
o Quantization
o Entropy
o normalization
How many bits per pixel per color do a BMP (Bitmap 01 2 2 3 3.6.2
image) uses, which matches the resolution of most
monitors?

o 8
o 32
o 64
o 16

What is the running time of the Huffman encoding 01 2 2 3 3.6.2

algorithm?

o O(log C)
o O(C)
o O(C log C)
o O(N log C)

Convert the given binary number to gray code : 10000000 01 3 2 3 3.6.2

o 10000000
o 11000000
o 11100000
o 11110000

Calculate free chain code for the given object. 01 3 3 3 3.6.2

o 7064442
o 7064222
o 7604422
o 7064422
Which of the following of a boundary is defined as the line 01 2 3 3 3.6.2
perpendicular to the major axis?
o Equilateral axis
o Equidistant axis
o Minor axis
o Median axis
The texture of the region provides measure of which 01 1 3 3 3.6.2
of the following properties?

o Smoothness alone
o Coarseness alone
o Regularity alone
o Smoothness, coarseness an Regulariy
If the boundary is traversed in the clockwise direction, a 01 2 3 3 3.6.2
vertex point ‘p’ is said to be a part of the convex segment
if the rate of change of slope at ‘p’ is:
o Negative o Zero
o Non Negative o Cannot be
determined

Which of the following is the useful descriptor of a 01 1 3 3 3.6.2

boundary, whose value is given by the ratio of length of the
major axis to the minor axis?

o Radius
o Perimeter
o Area
o Eccentricity
Part – B

( 04 x 10 = 40 Marks)

Q. Question Marks BL CO PO PI
No Code

11.a Encode the message BCCABBDDAECCBBAEDDCC using 10 4 4 3 3.6.2

Huffman coding and calculate the final bits

B: 110

C: 111

A: 00

D: 10

E: 01

Final Encoded Message and Total Bits

Encoded Message:
1101111110011011010001111111000001100110111111

Total Bits: 50 bits

OR

11.b Explain the general compression system model. 10 2 4 3 3.6.2

 Input Data

 Preprocessing

 Source Encoding (Compression Algorithm)

 Quantization (if applicable)

 Entropy Encoding
  Compressed Data Output

 Input Data

 Preprocessing

 Source Encoding (Compression Algorithm)

 Quantization (if applicable)

 Entropy Encoding

 Compressed Data Output

 Source Decoding

 Postprocessing

 Reconstructed Data

12.a Compute LZW coding the given image of size (4×4) 10 4 4 3 3.6.3

39 39 126 126

39 39 126 126

39 39 126 126

39 39 126 126
 OR

12.b Encode the word ABCCD using arithmetic code. 10 4 4 3 3.6.2

Final encoding:
After encoding all symbols, any value within the final interval
[0.3364, 0.3367) represents the encoded form of the sequence
"ABCCD".
13.a Discuss about Freeman 10 3 5 3 3.6.2
chain code and calculate
the chain code the given
image.
 OR

13.b Illustrate Signature and Boundary segments with 10 4 5 3 3.6.3

example.

Signature
A signature (or shape descriptor) is a compact representation
of a shape or contour that captures essential characteristics
such as curvature, length, orientation, and other geometric
properties. It is often used for shape matching, recognition, and
classification tasks. One common type of signature is the
Fourier descriptor.

Boundary Segments
Boundary segments refer to the straight-line segments that
approximate the boundary or contour of a shape. These
segments can be extracted from the shape's boundary to
simplify its representation or to perform geometric operations
such as intersection detection or area calculation.

14.a Discuss about Polygonal 10 3 5 3 3.6.2

Approximation of a Digital
Boundary. And List out the
observations for the given image
using MPP algorithm.

Polygonal Approximation
Technique

Polygonal approximation aims to reduce the complexity of the

digital boundary while preserving its essential shape
characteristics. The goal is to replace the original boundary
with a simpler polygonal representation that closely
approximates the original shape.
 OR

14.b Describe in detail about recognition based on matching 10 2 5 3 3.6.2

Steps Involved in Recognition Based on Matching

Feature Extraction

Template or Model Creation

Matching Algorithm

Decision Making