Image Processing_2016
Image Processing_2016
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
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?
Question (3)
a) List the major steps needed for performing edge detection of an image by thresholding the gradient
magnitude computed using Sobel operator. For simplicity, assuming the threshold value is given in
advance, denoted by T.
Page 1 of 2
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) Explain the differences between regular and adaptive thresholding. Give examples of when each type
should be used.
b) Find the opening of the binary image, F, in Fig. (a) by the structuring element H in Fig. (b).
c) Given an input image of size 7 x 7 shown below, was filtered using 3 x 3 adaptive median filter with
maximum allowed size of 5 x 5. What are the values of the pixels x, y, and z in the output image?
3 3 4 3 3 3 0 0
3 0 0 0 0 0 3 0
3 4 0 0 4 4 3 Adaptive Median z
4 5 7 7 0 0 3 Filter 0 x 1 0 0 0
3 3 6 0 0 7 0 0 y
3 0 4 3 3 5 3 0
3 4 3 3 0 0 4 0
Fig.(a) Fig.(b)
Question (5)
a) Explain with examples the type of data redundancies?
b) You have a source with 6 symbols {a1, a2, a3, a4, a5, a6}. The probability for each symbol is z=[0.15
0.25 0.05 0.05 0.4 0.1].
1. Calculate the entropy of the source.
2. Create a Huffman code for the source.
3. Calculate the average word length of the source.
4. Calculate the coding efficiency for the Huffman
code.
﴾ GOOD LUCK ﴿
Page 2 of 2