0% found this document useful (0 votes)
12 views2 pages

KEC071

This document outlines the structure of a BTECH Digital Image Processing examination for the academic year 2024-25, including various sections and types of questions. It consists of multiple-choice questions, descriptive questions, and practical applications related to image processing concepts such as quantization, edge detection, and compression techniques. The exam covers fundamental topics and requires students to demonstrate their understanding of digital image processing principles.
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
0% found this document useful (0 votes)
12 views2 pages

KEC071

This document outlines the structure of a BTECH Digital Image Processing examination for the academic year 2024-25, including various sections and types of questions. It consists of multiple-choice questions, descriptive questions, and practical applications related to image processing concepts such as quantization, edge detection, and compression techniques. The exam covers fundamental topics and requires students to demonstrate their understanding of digital image processing principles.
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

Printed Page: 1 of 2

Subject Code: KEC071


0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM VII) THEORY EXAMINATION 2024-25
DIGITAL IMAGE PROCESSING
TIME: 3 HRS M.MARKS: 100

Note: Attempt all Sections. In case of any missing data; choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


Q no. Question CO Level
a. Differentiate between a grayscale image and a binary image. 1 K1
b. Define quantization and its effect on image quality. 1 K1
c. Define unsharp masking and its application. 2 K1
d. What is the purpose of bandpass filtering. 2 K2
e. Mention any two properties of the Fourier Transform. 3 K2
f. Mention one advantage and one limitation of the DST. 3 K2
g. Define the term "redundancy". 4 K1
h. What is run-length encoding (RLE) and where is it used? 4 K1

1
i. Define the principle of edge detection in image segmentation. 5 K1

22
j. What is a "seed point" in region-growing techniques? 5 K2

7.
E
O

23
C

SECTION B

9.
TU

2. Attempt any three of the following: 10 x 3 = 20

13
AK

Q no. Question CO Level

4.
a. Enlist various fundamental steps in Digital Image Processing with neat
|1 1 K2
block diagram.
PM

b. Describe the concept of image smoothing using spatial domain 2 K2


techniques. Include examples of low-pass filters.
c. What is Haar Transform? Write the procedure to determine the Haar 3 K1
9

transformation matrix.
:0

d. Explain the MPEG video compression standard and its application in 4 K2


32

multimedia systems.
1:

e. What is the Hough Transform used for in image processing? What types 5 K2
of shapes can be detected using the Hough Transform?
25
20

SECTION C
n-

3. Attempt any one part of the following: 10 x 1 = 10


Ja

Q no. Question CO Level


0-

a. Explain the structure and usage of common image file formats, such as 1 K1
|1

JPEG, PNG, BMP, and TIFF. Highlight the advantages and limitations
of each.
b. Describe the digital halftone process and its significance in image 1 K2
representation for printing and display.

1|Page
AKTUCOE | 10-Jan-2025 1:32:09 PM | 14.139.237.221
Printed Page: 2 of 2
Subject Code: KEC071
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM VII) THEORY EXAMINATION 2024-25
DIGITAL IMAGE PROCESSING
TIME: 3 HRS M.MARKS: 100

4. Attempt any one part of the following: 10 x 1 = 10


Q no. Question CO Level
a. Explain histogram-based techniques for image enhancement. Illustrate 2 K2
with examples how histogram equalization enhances image quality.
b. Define image restoration and explain its role. Discuss the different types 2 K2
of image degradations.

5. Attempt any one part of the following: 10 x 1 = 10


Q no. Question CO Level
a. What is Hadamard transform? Explain in detail and Write its properties. 3 K1
b. Explain the Karhunen-Loève Transform and its significance in image 3 K2
compression. Discuss its advantages.

1
6. Attempt any one part of the following: 10 x 1 = 10

22
Q no. Question CO Level

7.
E
a. Differentiate between lossless and lossy compression techniques with 4 K1
O

23
suitable examples.
C

9.
b. Explain the working of Huffman coding as a lossless compression 4 K2
TU

13
algorithm with an example.
AK

4.
7. Attempt any one part of the following: |1 10 x 1 = 10
Q no. Question CO Level
PM

a. What is the region-growing technique in image segmentation? How is 5 K1


the seed point selected in the region-growing algorithm?
9

b. Define thresholding. What is the difference between global and 5 K2


:0

adaptive thresholding?
32
1:
25
20
n-
Ja
0-
|1

2|Page
AKTUCOE | 10-Jan-2025 1:32:09 PM | 14.139.237.221

You might also like