1 (a)
State and explain significance of convolution property of 2D Fourier Transform
5 M
1 (b)
Justify/contradict all image compression techniques are invertible.
5 M
1 (c)
Lossy and lossless compression
5 M
1 (d)
Why zig-zag scanning preferred in JPEG standard?
5 M
2 (a)
What is Hadamard transform? Write a 4 × 4 Hadamard matrix and its applications.
Is H(4) orthogonal ?
10 M
2 (b)
Explain segmentation based on discontinuity and segmentation based on similarities
10 M
3 (a)
8 level image is given below
F(x,y) =
Prepare histogram of given image
Perform histogram equalization and draw new histogram
F(x,y) =
4 | 6 | 0 | 3 | 7 |
2 | 1 | 5 | 0 | 3 |
4 | 2 | 7 | 0 | 7 |
1 | 5 | 4 | 6 | 0 |
4 | 7 | 5 | 4 | 1 |
Prepare histogram of given image
Perform histogram equalization and draw new histogram
10 M
3 (b)
Compute 2D DF T of 4 × 4 gray scale image given below and then compute inverse 2D, DFT of transform coefficients. The image f(x, y) is given by
1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 |
10 M
4 (a)
Apply Slant transform and DCT transform on the given image and compare the result.
F(x,y)=
F(x,y)=
2 | 2 | 2 | 1 |
2 | 4 | 4 | 2 |
2 | 4 | 4 | 2 |
2 | 2 | 2 | 2 |
10 M
4 (b)
Explain Homomorphic filter
10 M
5 (a)
Write notes on Hotelling transform
10 M
5 (b)
Calculate entropy and coding redundancy for symbols given in table using Huffman codes.
Symbol | a1 | a2 | a3 | a4 | a5 | a6 | a7 | a8 |
Probability | 0.1 | 0.4 | 0.05 | 0.05 | 0.1 | 0.2 | 0.07 | 0.03 |
10 M
6 (a)
Explain JPEG 2000 image compression standard.
10 M
6 (b)
Explain JPEG 2000 image compression standard.
10 M
7
Write notes on
1. Connectivity of pixels
2. Image restoration.
3. Wiener filter.
1. Connectivity of pixels
2. Image restoration.
3. Wiener filter.
20 M
More question papers from Image Processing