Scribd
Upload
8 views2 pages

AECC56_qp

This document is an examination paper for B.Tech V Semester in Digital Image Processing at the Institute of Aeronautical Engineering. It outlines the structure of the exam, including modules and questions covering various topics such as digital image processing fundamentals, transformations, filtering techniques, image restoration, and compression methods. Students are required to answer all questions in Modules I and II and choose one question from Modules III, IV, and V.

Uploaded by

Vasavi Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views2 pages

AECC56_qp

This document is an examination paper for B.Tech V Semester in Digital Image Processing at the Institute of Aeronautical Engineering. It outlines the structure of the exam, including modules and questions covering various topics such as digital image processing fundamentals, transformations, filtering techniques, image restoration, and compression methods. Students are required to answer all questions in Modules I and II and choose one question from Modules III, IV, and V.

Uploaded by

Vasavi Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Hall Ticket No Question Paper Code: AECC56

INSTITUTE OF AERONAUTICAL ENGINEERING


(Autonomous)
Dundigal-500043, Hyderabad
B.Tech V SEMESTER END EXAMINATIONS (REGULAR/ SUPPLEMENTARY) - FEBRUARY 2024
Regulation: UG20
DIGITAL IMAGE PROCESSING
Time: 3 Hours (ELECTRONICS AND COMMUNICATION ENGINEERING) Max Marks: 70
Answer ALL questions in Module I and II
Answer ONE out of two questions in Modules III, IV and V
All Questions Carry Equal Marks
All parts of the question must be answered in one place only

MODULE – I

1. (a) Discuss the fundamental steps involved in digital image processing. Summarize slant transform
in digital image processing. [BL: Understand| CO: 1|Marks: 7]
(b) Compute the Discrete Cosine Transform (DCT) matrix for N=4. [BL: Apply| CO: 2|Marks: 7]

MODULE – II

2. (a) Illustrate the concept of


i) Linear and non-linear gray level transformation
ii) Image sharpening. [BL: Understand| CO: 3|Marks: 7]
 
1 5 7
 
(b) Compute the median value of the marked pixel 2 4 6 using a 3 x 3 mask.
 
 
3 2 1
[BL: Apply| CO: 3|Marks: 7]

MODULE – III

3. (a) Elucidate the importance of Hit-or-Miss morphological transformation operation on a digital


binary image. [BL: Understand| CO: 4|Marks: 7]
(b) Illustrate the working of Weiner filtering technique. What is the condition under which Weiner
filter acts as inverse filter? [BL: Understand| CO: 4|Marks: 7]

4. (a) Interpret the derivative operators useful in image segmentation and also analyze their role in
segmentation. [BL: Understand| CO: 4|Marks: 7]
(b) Discuss about boundary extraction and region filling algorithm. Interpret the significance of
thresholding in image segmentation [BL: Apply| CO: 4|Marks: 7]

MODULE – IV

5. (a) What is the purpose of image restoration? Explain about image restoration using inverse filtering.
Write the draw backs of this method. [BL: Understand| CO: 5|Marks: 7]
(b) Identify which linear image restoration technique is used to produce perfect reconstruction in the
absence of noise. [BL: Apply| CO: 5|Marks: 7].

Page 1 of 2
6. (a) Discuss the minimum mean square error filtering which includes both the degradation function
and statistical characteristics of noise into the restoration process.
[BL: Understand| CO: 5|Marks: 7]
(b) Find the dilated version of the input image shown in Figure 6b1 using structuring element shown
in Figure 6b2. [BL: Apply| CO: 5|Marks: 7]

MODULE – V

7. (a) Infer how compression is achieved in transform coding. Generate a tag applying arithmetic coding
procedure to transmit the word INDIA [BL: Understand| CO: 6|Marks: 7]
(b) Construct
i) Huffman code for the word COMMITTEE.
ii) Shannon-Fano code for the word MUMMY. [BL: Apply| CO: 6|Marks: 7]

8. (a) Summarize about


i) Error free compression with an example
ii) Data redundancy [BL: Understand| CO: 6|Marks: 7]
(b) Calculate the efficiency of Huffman code for the symbols whose probability of occurrence is given
in Table 1.

Table 1

Symbol Probability
a1 0.9
a2 0.06
a3 0.02
a4 0.02

[BL: Apply| CO: 6|Marks: 7]

−◦◦ ◦◦−

Page 2 of 2

You might also like