[go: up one dir, main page]

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

Bangladesh Army University of Engineering &technology: (Bauet)

Download as pdf or txt
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

“Knowledge & Technology”

Bangladesh Army University of Engineering &Technology (BAUET)


Department of Computer Science and Engineering (CSE)
B.Sc. Engineering 4th Year 8th Semester, Final Examination, Fall-2020
Course Code: CSE-4213
Course Title: Digital Image Processing
Full Marks: 40 Time: 02 Hours
N.B.:
1. Answering to Question No. 1 is compulsory.
2. Answer Four questions, taking Two from each section.
3. Use separate script for each section.
4. Figures shown in the right margin indicate full marks.

Section-A

Marks
Q.1 (a) What is digital image processing? Identify the continuum break-up levels from 3
image processing to computer vision.
(b) Suppose you are given a dark image and told to use the power-law transformation 3
function. After applying the power-law transformation function on the dark
image. What outputs will you find and why? Explain briefly.
(c) Construct the equalized histogram from the given histogram. Let, X = last two 4
digits of your university id.

Intensity No. of pixels


0 12
1 32
2 40
3 13
4 5
5 8
6 X
7 22

Q.2 (a) Describe all the fundamental steps in digital image processing briefly. 3

(b) Differentiate between an RGB image and an intensity image. 2


(c) What is gray-level slicing? How can you implement gray-level slicing on an 5
image? Discuss with an example.

Q.3 (a) Derive the mathematical formula for the Laplacian mask and show the Laplacian 4
kernel coefficient.
(b) What is bit-plane slicing image enhancement? Explain with example. 3

(c) Differentiate between image blurring and image sharpening. 3

Section-B

Q.4 (a) Why we use image sharpening? Explain. 2

(b) Consider the following image. What will be the new value of the image pixels 6
(2,3), (5,5) of smoothing is done using a 3x3 neighborhood.
i. Weighted average filter
ii. Median filter
iii. Max filter
1 1 1 0 1 0 2 7
1 1 1 2 7 7 4 0
1 1 1 5 6 4 3 3
1 1 0 7 5
5 4 2 2 5
w(δ,t) f(x,y)
(c) Write down the characteristics of the first-order and second order derivatives. 2

1
Q.5 (a) What is normalized histogram? 1
(b) For spatial filtering, discuss with mathematical formula 4
i. Correlation
ii. Convolution
(c) Define Marr-Hildreth edge detector. Also derive the 5x5 mask using the Marr- 5
Hildreth edge detector.

Q.6 (a) Differentiate between coding redundancy and temporal redundancy. 2


(b) Why the problem “Blocky Effect” is found in the image? How can you remove 3
them?
(c) In 1952 D.A Huffman developed a code construction method that can be used to 5
perform lossless compression. The table below shows different symbols with their
corresponding occurring probabilities.

Symbol Probability
@ 0.05
B 0.2
A 0.1
U 0.05
E 0.3
T 0.2
? 0.1
Now, create a Huffman table for the table above. The table should show the code
word for each symbol.

You might also like