Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
7 views4 pages

Final 2015 Image Processing Sol

This document is a final exam for 4th year students at Benha University, focusing on Image Processing. It includes multiple-choice questions, practical tasks involving histogram transformation, and explanations of image processing techniques such as edge detection and thresholding. The exam assesses knowledge on various concepts including convolution, filters, and redundancies in image data.
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)
7 views4 pages

Final 2015 Image Processing Sol

This document is a final exam for 4th year students at Benha University, focusing on Image Processing. It includes multiple-choice questions, practical tasks involving histogram transformation, and explanations of image processing techniques such as edge detection and thresholding. The exam assesses knowledge on various concepts including convolution, filters, and redundancies in image data.
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

Benha University Faculty of Computers & Informatics

st
1 Term (January 2015) Final Exam Date: 10/1/2016
Class: 4th Year Students Time: 3 Hours
Subject: Image Processing Examiner: Dr. M. Taha

Answer the following questions:


Question (1) please make a table of two columns, one for the question no. and the other for your selection

1) The process of moving a filter mask over the image and computing the sum of products at each location is
defined by_____________
a) Convolution b) Rotation c) Linearity d) Correlation e) None of the above
2) The sum of all components of a normalised histogram is equal to_________
a)Size of the image b) Size of rows of the image c) Size of columns of the image d) One e) MxN
3) Image restoration usually uses a model that is based on ____
a) Additive noise b) Multiplicative noise c) Division noise d) Subtractive noise
e) None of the above
4) Convolution is usually used in the ________ domain.
a) Frequency b) Spatial c) Feature d) Featureless e) None of the above
5) Fourier transform is a ________________ transform
a) Linear b) Nonlinear c) Bilinear d) Bicubic e) None of the above
6) Ideal filters can be ____________
a) LPF b) HPF c) BPF d) All of the above e) None of the above
7) The Rayleigh density can be used to approximate ______
a) Ideal histograms b) Non-Ideal histograms c) Butterworth histograms d) Gaussian histograms
e) Skewed histograms
8) Which of the following filters is effective in the presence of salt-and-pepper noise?
a) Average filter b) Median filter c) Sobel filter d) Robert filter e) All of the above
9) ____________ is the process of using known data to estimate values at unknown locations .
a) Decimation b) Interpolation c) Formulation d) All of the above e) None of the above
10) An image element is usually called a _____________
a) Pixel b)f(x,y) c) picture point d) All of the above e) None of the above

Question (2)
a) For the image shown in Fig. 2(a), find a transformation function (i.e. a look-up-table) that will change its
histogram to match the one shown in Table 1. Draw the transformed image in Fig. 2(b). Also determine the
histogram of the transformed image. Assume that the processed images can only take integer values
between 0 and 7 (including 0 and 7).

b) Briefly explain the operation of the Alpha-trimmed mean filter. What are its uses for image processing?

Page 1 of 4
Question (3)

a)

For every pixel: 1) compute vertical gradient gx by convolving with Hx, 1) compute horizontal gradient gy by
convolving with Hy, 3) find the gradient magnitude using A= sqrt(gx^2+gy^2). 4) if A>=T, this pixel is an edge,
otherwise, it is not an edge.

b) Write a MATLAB function that will implement these steps in (a). Assuming the image size is W (width) x H
(height). Also you can ignore the boundary problem by performing edge detection only on non-boundary
pixels.

Question (4)
a) For regular (global) thresholding you find threshold value or values for the entire image. In adaptive
thresholding the image id divided into part, usually square, and threshold levels are found for each
separate part. Global thresholding is useful when you want the image is similar in most parts. Adaptive
thresholding is very useful when the image is changing in intensity, e.g., because of a light source from
the right side. Then the threshold values should be quite different on the left and right side of the image.

b) the opening of the binary image, F,


Page 2 of 4
c)

Page 3 of 4
Question (5)
A) Redundancies Types
a) Coding Redundancy.
Let’s assume, that a discrete random variable rK in the interval [0 , 1] represents the gray levels
of an image and each rK occurs with probability Where L is the number gray levels , nK is the
number of times that the Kth gray level appears in image . n is the total number of pixel in the
image . The average length of the code words assigned to the various gray level values where
l(rk) no.of bits used to represent each gray pr(rk) probability that gray level occurs
b) Spatial and Temporal Redundancy.
i.e. Video sequence (Correlated pixels are not repeated.)
c) Irrelevant Information.
Information that ignored by human visual system
b)

﴾ GOOD LUCK ﴿

Page 4 of 4

You might also like