Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 5 · TU Board 2081
Course Title: Image Processing (CSC332)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks.
Group A
Attempt any two questions.(2 × 10 = 20)
- 1.10
Define linear filter. Given the following histogram of image, stretch to the whole dynamic range using histogram equalization.
Gray Level
0
1
2
3
4
5
6
7
Frequency
0
25
0
10
35
50
0
0 - 2.10
Write expression for forward and inverse Discrete Fourier Transform (DFT) for 2D signal. What are the properties of DFT?
- 3.10
Briefly list any two noise models. From the following probability distribution construct the Huffman Code for each gray level.
rk
0
1
2
3
4
5
P(rk)
0.4
0.18
0.1
0.25
0.7
0.05
Group B
(8 × 5 = 40)
- 4.5
Define region and boundary. List some elements of visual perception.
- 5.5
What are implications of periodicity and symmetry? Discuss about lossless predictive model.
- 6.5
Describe Chain Codes with necessary examples. How can you make chain code rotation and scaling invariant?
- 7.5
How vertical lines and horizontal lines are detected? Illustrate with an example.
- 8.5
Write the algorithm for basic global thresholding.
- 9.5
How do you represent image in spatial domain? Differentiate between intensity level and bit plane slicing.
- 10.5
What is pattern recognition? Discuss about Mexican Hat Filters.
- 11.5
What are the usages of derivative based filters? Derive mask for Laplacian second order derivative based filter.
- 12.5
Show that the points (1,1), (-2,7) and (3,3) are collinear using Hough Transform and find the equation of the line.
— The End —