CS6632 MIDTERM STUDY QUESTIONS

1- Explain why contra-harmonic filter is effective in elimination pepper noise when Q is

positive and explain why that filter is effective in elimination salt noise when Q is negative.
2- What is the band pass and band reject filters? Where and how are they being used?
3- How would you model noise and estimate parameters? Consider Gaussian, uniform,
salt/pepper noise.
4- How would you obtain information about periodic noise from magnitude spectrum?
5- Describe 3 methods for the determination of the degradation operator H, explain them
briefly.
6- Why Wiener filter is not affected by the fact that H(u,v) has zeros in the uv-plane?
7- Describe the convolution approach for locating points and lines?
8- Describe 3 fundamental steps that are usually necessary for successful edge detection.
9- Name the common edge operators used for computing the gradient image.
10- Describe Hough transform approach for finding lines in an image.
11- What is the reason for smoothing the image before using global thresholding algorithm to
segment the image into two regions?
12- When would you use the region growing algorithm for image segmentation?
13- What are the advantages and disadvantages of global thresholding?
14- What are the advantages and disadvantages of local/adaptive thresholding?
15- List advantages and disadvantages of Hough Transform approach for locating parametric
curves.
16- What is Wiener filtering? When would you use it?
17- What is Homomorphic filtering? When would you use it?
18- An image corrupted with salt and pepper noise. The density of noise varies across the
image. Write and appropriate algorithm to remove the noise.
19- List one advantage and one disadvantage of geometric mean filter over arithmetic mean
filter.
20- Consider a 3x3 spatial mask that averages the four closest neighbors of a point (x,y), but
excludes the point itself from the average. Find the equivalent filter, H(u,v) in the frequency
domain.
21- Find the equivalent filter, H(u,v) that implements in the frequency domain the spatial
operation performed by the following Laplacian filter.
0
1
0

1
-4
1

0
1
0

22- Show that highpass Butterworth filter transfer function can be obtained by subtracting
Butterworth lowpass transfer function from 1.
23- What is median filter, when would you use it?
24- What are the main steps of digital image processing? Explain every step in one sentence.
25- Find the number of bits required to store a 512 X 256 image with 64 gray levels.
26- What is sampling and quantization. Describe the difference.
27- Explain the model of image degradation process.

CS6632 MIDTERM STUDY QUESTIONS

28- Describe is inverse and pseudo-inverse filtering. What is the main difference between two
techniques?
29- What is the difference between Image Enhancement and Restoration?
30- Describe local histogram equalization algorithm.
31- Arrange Ultraviolet, Infrared, Gamma rays, X-Rays, Microwaves, and radio waves in the
ascending order of wavelength and frequency. Give one example use of each ray in real
world.
32- Explain image negatives and give an example where image negative enhances image.
33- When is log transformation is helpful in displaying images?
34- What are the steps in histogram specification algorithm? Explain it briefly.
35- What is ringing effect? In which cases, we may have ringing effect.
36- Apply histogram equalization for the following image with size 6x6 and color range [0, 7).
Show your work.
1
2
3
4
5
4

3
4
3
2
2
6

4
1
7
4
4
3

0
4
1
4
0
3

2
4
7
0
6
3

2
3
3
4
4
5

37- Apply spatial filtering using 3x3 Averaging filter (provided below) to following image.
156
205
74
161

76
203
25
151

251
128
187
19

97
8
155
102

38- Apply spatial filtering using 3x3 filter (provided below) to following image.
156
205
74
161

76
203
25
151

251
128
187
19

97
8
155
102

Kernel=
-1
2
-1

-1
2
-1

-1
2
-1

39- Create 4x4 Butterworth Low Pass Filter where D0=1.5, n=2, show your work.
40- List advantages and disadvantages of histogram equalization.
41- List advantages and disadvantages of histogram specification.
42- List advantages and disadvantages of contrast stretching. When would you use it?

CS6632 MIDTERM STUDY QUESTIONS

43- If the normalized histogram of an 8-level image is [0.17, 0.24, 0.24, 0.10, 0.14, 0.06, 0.03,
0.02], then determine the look up table for the histogram equalization method.
44- For an 8-level image with the normalized histogram [0.17, 0.24, 0.24, 0.10, 0.14, 0.06,
0.03, 0.02], determine the mapping using histogram specification method if the desired
histogram is [0.00, 0.00, 0.00, 0.40, 0.40, 0.20, 0.00, 0.00].
45- What is high boost filtering? When would you use this filtering approach?
46- What are the main step in frequency domain filtering?
47- What are main steps in K-means clustering?