BM 471 Introduction to Digital Image Processing - Fall 2013

FINAL EXAM

(10/01/2014)

Name:
Surname:
No:
Number of pages used:
Instructions:
All answers should be written in English.
Exam duration is 90 minutes.
Total points are 120. 20 points are bonus.

1. (20 points) In the below figure (size: 42 * 62 pixels), there are identical two bars with 7 pixels width and
42 pixels height.

a) Size of the bars became: 3 * 38

b) Only two pixels from all corners will be omitted

2. (10 points) write suitable filtering method for the different noise types given in the below:
a) for reducing effect of both salt and pepper noise: contraharmonic mean filter
b) for reducing effect of impulse noise: adaptive median filtering
c) for reducing effect of periodic noise: Frequency domain filtering

3. (10 points)
a) Explain the RGB model and sketch the RGB coordinate system.
In the RGB model each colour appears in its primary spectral components of red, green and blue
The model is based on a Cartesian coordinate system
RGB values are at 3 corners
Cyan magenta and yellow are at three other corners
Black is at the origin
White is the corner furthest from the origin
Different colours are points on or inside the cube represented by RGB vectors

b) Give the names of 3 color image processing methods.

Color slicing, color image smoothing, color image sharpening, color edge detection, pseudocolor
image processibng

4. (10 points)
a) Write the types of redundancies in the image.
Interpixel redundancy
Spectral redundancy
Psychovisual redundancy
Coding redundancy

b) Write the steps of JPEG compression.

1. (Optionally) If the color is represented in RGB mode, translate it to YUV.
2. Divide the file into 8 X 8 blocks.
3. Transform the pixel information from the spatial domain to the frequency domain with the
Discrete Cosine Transform.
4. Quantize the resulting values by dividing each coefficient by an integer value and rounding off to
the nearest integer.
5. Look at the resulting coefficients in a zigzag order. Do a run-length encoding of the coefficients
ordered in this manner. Follow by Huffman coding.

5. (20 points) Sketch the result of following morphological operations (attention to the origin point):

6. (10 points) Sketch the result of hit-or-miss transform of the image with specified structuring element:
The resulting of applying the hitormiss transform would be four single points where the four
Is were in perfect registration. The location of the point would be the same as the origin of the
structuring element.

7. (30 points) Sketch the gradient and laplacian (first and second derivatives) of each profile.

8. (10 points) For image segmentation, in which situations basic adaptive thresholding is suitable and write
the main steps of basic adaptive thresholding.
An approach to handling situations in which single value thresholding will not work is to divide an
image into sub images and threshold these individually
Divide the original image into subimages and then utilize a different threshold to segment each
subimage.
The key issues in this approach are how to subdivide the image and how to estimate the threshold for
each resulting subimage.
Since the threshold for each pixel depends on its location within an image this technique is said to
adaptive

Good Luck
Assist.Prof.Dr. Umut ARIZ