MU Computer Engineering (Semester 7)
Image Processing
December 2016
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1(a) Explain any five zero memory operatons.
10 M
1(b) Perform histogram equalization and draw new equalized histogram of the following image data.
Gray level 0 1 2 3 4 5 6 7
Number of pixels 800 1000 850 650 300 250 100 150
10 M

2(a) Find the DFT of the Given image:
0 3 3 1
3 1 2 1
3 2 4 2
1 1 2 1
10 M
2(b) What is segmentation? Explain
i) Region Growing
ii) Region Splitting
iii) Thresholding.
10 M

3(a) Explain with an example that the first difference of chain code normalizes it to rotation.
10 M
3(b) Explain the following morphological operations:
i) Opening
ii) Closing
10 M

4(a) Classify Image Compression methods in detail along with the different redundancies that can be present in digital images.
10 M
4(b) What are various file formats? Explain each in brief.
10 M

5(a) Given
F = 10 44 15
10 14 48
11 10 22

i) Find 3-bit IGS coded image and calculate compression factor and BPP.
ii) Find the decoded image and calculate MSE and PNSR.
10 M
5(b) Write 8×8 HADAMARD transform matrix and its signal flow graph. Using Butterfly diagram, compute HADAMARD transform for x(n) = { 1,
2,
1,
2,
1,
2,
3,
4}
10 M

write a short note Q6.(a,b,c,d)
6(a) Discrete Cosine Transform.
5 M
6(b) Hough transform.
5 M
6(c) HSI color model.
5 M
6(d) 4,
8 and m-connectivity
5 M



More question papers from Image Processing
SPONSORED ADVERTISEMENTS