0% found this document useful (0 votes)
16 views

Exam 3 Image Processing End Mid Term 2022-1

The document is a midterm exam for a digital image processing course. It contains 5 questions testing knowledge of topics like image transforms, edge detection techniques including Sobel, Roberts Cross, Prewitt operators, and Laplacian of Gaussian kernels. It asks the student to identify true/false statements, match filter masks, write equations for Roberts Cross operator, compute a histogram and use it to scale an image, and write steps for Canny edge detection.

Uploaded by

Yousef
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)
16 views

Exam 3 Image Processing End Mid Term 2022-1

The document is a midterm exam for a digital image processing course. It contains 5 questions testing knowledge of topics like image transforms, edge detection techniques including Sobel, Roberts Cross, Prewitt operators, and Laplacian of Gaussian kernels. It asks the student to identify true/false statements, match filter masks, write equations for Roberts Cross operator, compute a histogram and use it to scale an image, and write steps for Canny edge detection.

Uploaded by

Yousef
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/ 4

Menoufia University

Computer Engineering and Sciences Department


Course Code: CES 325
Course Title: Digital Image Processing
Semester: Second - Spring
20 Marks Mid Term Exam
Date: 14 Jun 2022 Duration: 60 minutes

Question 1: [4 Marks]
Identify the following statements a: h as true () or false (×) statements:

The three texture images shown below are quite different; all images have size
80×80, with black (0) and white (1) pixels.

a) Is their histograms are identical ( )


b) Suppose that both images in (a) are blurred with a 3×3 smoothing mask. The
resultant histograms will be the same. ( )
c) Edge direction: perpendicular to the direction of maximum intensity change ( )
d) Edge strength: the magnitude of edge normal and it related to the local image
contrast along the normal. ( )
e) In Global image transforms, output derived from pixels neighbourhood. ( )
f) In local image transforms the whole image contributes to each output value. ( )
g) The Sobel operator is slower to compute than the Roberts Cross operator ( )
h) The Sobel operator less sensitive to noise. Compared to the Roberts Cross operator
( )
Question 2: [4 Marks]
Match the mask name or its corresponding number from the following list:
1. Prewitt operator in x direction Gx
2. Prewitt operator in y direction Gy
3. Sobel Edge Detector in y direction Gy
4. Laplacian mask (in x and y directions)
5. Sobel Edge Detector in x direction Gx
6. Laplacian mask (second-order derivative in x direction)
7. Laplacian mask (second-order derivative in y direction)
8. Laplacian mask (in x and y directions)
And write it underneath of the following Masks(kernels).

[ ] [ ] [ ] [ ]

[ ] [ ] [ ] [ ]
Question 3: [3 Marks]
Roberts Cross Edge Detector:
(a)
Write the kernels.
Answer: the kernels are:

1. ………………………. 2.……………………….
(b) How to calculate the gradient component? write the equation.
Answer: the gradient component calculated by the following equation:
……………………….

(c) The direction of the gradient can also be defined as follows:

……………………….

(d) Its main disadvantages are:


1. ……………………….

2. ……………………….
Question 4: [ 4 Marks]

a. Compute the histogram of pixel values of the input image shown below.

b. Scale the input image using your result in (a) and the cumulative distribution function
to produce the output image.
Question 5: [5 Marks]
a. Rewrite the following Laplacian of Gaussian (LoG) equation which is used to obtain
LoG kernel. (Replace the “?” with the corresponding parameter or letter). [2 Marks]

b. Write the Canny operator steps as a multi-step algorithm that can detect edges with
noise supressed at the same time. [3 Marks]

You might also like