Image Processing
Tribhuvan University
Institute of Science and Technology
2082
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.
Distinguish between high frequency emphasis filter and Laplacian filter. Find the output of the following image using histogram equalization, where number of possible gray levels is 8.
| 3 | 3 | 3 | 3 | 3 |
| 2 | 3 | 4 | 3 | 2 |
| 2 | 4 | 4 | 4 | 2 |
| 2 | 3 | 4 | 3 | 2 |
| 3 | 3 | 3 | 3 | 3 |
Define noise. Explain the models for image degradation and restoration process.
What are the differences between spatial domain and frequency domain? Compute the 2D DFT of the following image.
| 1 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 |
Section B
Attempy any eight questions.
Discuss about chain code. Write the shape number of the object having chain code {0, 7, 5, 4, 3, 1}.
How logic operation on binary images can be used for masking and feature detection? Explain.
Define pattern and pattern class. How decision theoretic methods minimize the probability of misclassification?
Given the following image, detect the edge using magnitude and direction of gradient, using Prewitt operator.
| 0 | 30 | 60 |
| 5 | 32 | 62 |
| 10 | 38 | 64 |
What is image segmentation? How do you detect horizontal and vertical line?
Describe the steps in digital image processing.
How do you measure distance between pixels? Discuss about region oriented segmentation.
Define clipping and contrast stretching. Compute Hadamard transform of the data sequence {1, 2, 0, 3}.
Distinguish between forward and inverse transform. Define pixel coding, run length and bit plane.
