Image Processing
Tribhuvan University
Institute of Science and Technology
2081
Bachelor Level / elective-i-semester / Science
Computer Science and Information Technology( CSC332 )
Image Processing
Full Marks: 60 + 20 + 20
Pass Marks: 24 + 8 + 8
Time: 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.
Section A
Attempt any two questions.
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 |
Write expression for forward and inverse Discrete Fourier Transform (DFT) for 2D signal. What are the properties of DFT?
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 |
Section B
Attemt any eight questions.
Define region and boundary. List some elements of visual perception.
What are implications of periodicity and symmetry? Discuss about lossless predictive model.
Describe Chain Codes with necessary examples. How can you make chain code rotation and scaling invariant?
How vertical lines and horizontal lines are detected? Illustrate with an example.
Write the algorithm for basic global thresholding.
How do you represent image in spatial domain? Differentiate between intensity level and bit plane slicing.
What is pattern recognition? Discuss about Mexican Hat Filters.
What are the usages of derivative based filters? Derive mask for Laplacian second order derivative based filter.
Show that the points (1,1), (-2,7) and (3,3) are collinear using Hough Transform and find the equation of the line.
