University Quesiton Papers UQ.

B.E/B.Tech. DEGREE EXAMINATION, MAY/JUNE 2013

Seventh Semester
Electronics and Communication Engineering
EC 2029/EC 708 - DIGITAL IMAGE PROCESSING
(Regulation 2008)
Time: Three hours Maximum: 100 marks
Answer ALL questions.
PART A - (10 × 2 = 20 marks)

1.Define optical illusion and mach band.

2.Define checker board effect and false contouring.
3.Give the PDF of Gaussian noise and plot it.
4.Define and give the transfer function of contraharmonic filter.
5.Define image degradation model and sketch it.
6.Define rubber sheet transformation.
7.Write Sobel horizontal and vertical edge detection masks.
8.Define region splitting and merging.
9.State the optimality conditions for Huffman code.
10.State the need for data compression.
PART B - (5 × 16 = 80 marks)
11. (a) (i) Explain the basic concepts of sampling and quantization with neat
sketch. (8)
(ii) Find DCT Transform and its inverse for the given 2 × 2 image
[36; 64] (8)
Or
(b) Obtain forward KL transform for the given vectors.
X1 = [1 0 0]; X2 = [1 0 1]; X3 = [1 1 0] (Transpose these vectors)
and analyze how the principal components are used for remote sensing
applications? (16)
12. (a) Describe histogram equalization. Obtain Histogram equalization for the
following image segment of size 5 × 5? Write the inference on image
segment before and after equalization. (16)

20 20 20 18 16
15 15 16 18 15
15 15 19 15 17
16 17 19 18 16
20 18 17 20 15 (5 × 5) matrix
UQ.2 Digital Image Processing

Or
(b) (i) Describe how hormomorphic filtering is used to separate illumina-
tion and reflectance component? (8)
(ii) How mean filters are used for image enhancement. (8)
13. (a) Describe constrained least square filtering for image restoration and de-
rive its transfer function. (16)
Or
(b) (i) Explain the concept of geometric transformation for image restora-
tion? (8)
(ii) How wiener filtering is helpful to reduce the mean square error? (8)
14. (a) (i) How do you link edge pixels through global processing? (8)
(ii) Describe Watershed segmentation algorithm. (8)
Or
(b) (i) Explain the region based segmentation and region growing with an
example. (8)
(ii) Discuss how to construct dams using morphological operations?
(8)
15. (a) (i) Briefly explain Transform coding with neat sketch? (8)
(ii) A source emits letters from an alphabet A = {a1, a2, a3, a4, a5}
with probabilities P (a1) = 0.2, P (a2) = 0.4, P (a3) = 0.2,
P (a4) = 0.1 and P (a5) = 0.1. (8)
A. Find a Huffman code for this source?
B. Find the average length of the code and its redundancy?
Or
(b) (i) Generate the tag for the sequence 1 3 2 1 for the probabilities
P (1) = 0.8, P (2) = 0.02, P (3) = 0.18. (8)
(ii) How an image is compressed using JPEG Image compression stan-
dard? (8)
 University Quesiton Papers UQ.3

B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2013

Seventh Semester
Electronics and Communication Engineering
EC 2029/EC 708 - DIGITAL IMAGE PROCESSING
(Regulation 2008)
Time: Three hours Maximum: 100 marks
Answer ALL questions.
PART A - (10 × 2 = 20 marks)

1. Mention the difference between a monochrome and a gray scale image.

2. State two important properties of unity transforms.
3. What is a bit plane?
4. State how contrast adjustment can be done in an image.
5. List any two properties of a median filter.
6. Mention the drawbacks of inverse filtering.
7. Mention two applications of image segmentation techniques.
8. Write the importance of Edge detection.
9. Distinguish between scalar and vector quantization.
10. Mention the limitations of Huffman coding.
PART B - (5 × 16 = 80 marks)
11. (a) State and prove convolution property of 2D-FFT (16)
Or
(b) Determine the DCT matrix for N = 4. (16)
12. (a) Illustrate the steps in histogram equalization of the image. (16)
 
4 4 4 4 4

 3 4 5 4 3 


 3 5 5 5 3 

 3 4 5 4 3 
4 4 4 4 4

Or
(b) With the help of a block diagram, discuss the principle of homomorphic
filtering. (16)
13. (a) Illustrate the different causes of image degradation. (16)
Or
UQ.4 Digital Image Processing
 
 0.1 0.1 0.1 0 
 
 0.1 0.1 0.1 0.1 
(b) A blur filter h(m, n) is given by  
 0.05 0.1 0.1 0.05 

 0 0.05 0.05 0 
Find the deblur filter using inverse filtering. (16)
14. (a) Discuss the principle of image segmentation by watershed transforma-
tion and explain its drawbacks. (16)
Or
(b) Discuss image segmentation based on various thresholding techniques.
(16)
15. (a) For the image shown below compute
 the compression
 ratio that can be
3 3 3 2
 2 3 3 3 
achieved using Huffman coding.
 3 2 2 2 
 (16)
2 1 1 0
Or
(b) A source emits three symbols A, B, C with a probability {0.5, 0.25, 0.25}
respectively. Construct an arithmetic code to encode the word ‘C A B’.
(16)
 University Quesiton Papers UQ.5

B.E/B.Tech. DEGREE EXAMINATION, MAY/JUNE 2014

Seventh Semester
Electronics and Communication Engineering
EC 2029/EC 708 - DIGITAL IMAGE PROCESSING
(Regulation 2008)
Time: Three hours Maximum: 100 marks
Answer ALL questions.
PART A - (10 × 2 = 20 marks)

1. Define Hue and Saturation.

2. What do you mean by mach band effect?
3. Define Spatial Averaging.
4. Define the operation of a Harmonic Mean Filter.
5. Compare constrained and unconstrained Restoration.
6. What is the principle of Inverse filtering?
7. State the conditions for Region Splitting and Merging Processes.
8. What are factors affecting the accuracy of Region Growing?
9. What is the need for image compression?
10. What is Run Length Encoding?
PART B - (5 × 16 = 80 marks)
11. (a) (i) Briefly discuss about the elements of a Digital Image Processing
System. (8)
(ii) Explain about the Sampling. (4)
(iii) Write the kernel matrix for SVD transform. (4)
Or
(b) Explain in detail about the Vidicon and Digital camera working princi-
ples. (16)
12. (a) Briefly discuss about the Histogram Equalization and specification Tech-
niques. (16)
Or
(b) Explain in detail about the Homomorphic Filtering and Harmonic mean
filtering. (16)
13. (a) Explain the image restoration technique to remove the blue caused by
uniform linear motion. (16)
Or
(b) Discuss about the Inverse Filtering and Wiener Filter. (16)
UQ.6 Digital Image Processing

14. (a) (i) Write short notes on Region Merging. (4)

(ii) Discuss about the Edge dection and Edge hoking methods.
(12)
Or
(b) Explain in detail about the segmentation methods by Morphological Wa-
ter shed. (16)
15. (a) (i) What is the need for Date Compression? (6)
(ii) Explain in detail about the arithmetic Coding. (10)
Or
(b) Write short notes on the following image Codings:
(i) JPEG standard. (4)
(ii) MPEG (4)
(iii) Transform coding. (8)
 University Quesiton Papers UQ.7

B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2013

Seventh Semester
Electronics and Communication Engineering
EC 2029/EC 708/10144 ECE 41 - DIGITAL IMAGE PROCESSING
(Regulation 2008/2010)
(Common to 10144 ECE 41 - Digital Image Processing for B.E. (Part-Time)
Seventh Semester - ECE - Regulation 2010)
Time: Three hours Maximum: 100 marks
Answer ALL questions.
PART A - (10 × 2 = 20 marks)

1. Compare RGB and HSI color image models.

2. Write the Kernel for 2D-DCT and how this lead to data compression.
3. What are the possible ways, for adding noise in images?
4. For the following region, obtain the median filtered output.

72 55 33 65 30 30 21 12
15 20 3 5 18 21 65 30
35 40 34 200 200 17 51 87
0 225 20 100 101 87 59 42
65 32 18 78 86 50 21 11
30 11 8 97 108 129 151 2
68 72 19 37 14 27 50 64
36 202 111 18 26 192 23 63

5. What is Lagrange multiplier? Where it is used?

6. Why blur is to be removed from images?
7. How edges are linked through Hough transform?
8. State the problems in “region splitting and merging” based image segmenta-
tion.
9. What is a shift code? How this is used image analysis?
10. Write the performance metrics for image compression.
PART B - (5 × 16 = 80 marks)
11. (a) (i) Write the elements of an image processing system and its working.
Describe the working principle of operation of vidicon camera. (8)
(ii) How do you obtain the 2D-DFT for a digital image? Discuss about
the time complexities. (8)
Or
UQ.8 Digital Image Processing

(b) (i) What is visual perception model and explain. How this is analogous
to a DIP system. (8)
(ii) When do you prefer non-uniform sampling and quantization? Jus-
tify. (8)
12. (a) (i) Write the salient feature of image histogram. What do you infer?
(8)
(ii) Explain any two techniques for color image enhancement. (8)
Or
(b) (i) How do you perform directional smoothing in images? Why it is
required? (8)
(ii) What is geometric mean and harmonic mean with reference to an
image? What purpose do they serve for image analysis? Discuss.
(8)
13. (a) (i) Describe how image restoration can be performed for black and
white binary images. (8)
(ii) Compare restoration with image enhancement. (8)
Or
(b) (i) What is Weiner filtering approaclt? How this is used for image
restoration? Describe. (8)
(ii) What are the performance measures for ascertaining the adequacy
of image restoration? (8)
14. (a) (i) How edge detection is performed in digital image using
A. Laplacian operator (2)
B. Sobel operator and (2)
C. Prewitt operator and compare their out comes. (2 + 2)
(ii) Write morphological concepts applicable for image processing.
(8)
Or
(b) (i) What is meant by optimal thresholding? How do you obtain the
threshold for image processing asks? (8)
(ii) Describe watershed segmentation algorithm and compare with re-
gion based approaches. (8)
15. (a) (i) Discuss the need for image compression. Perform Huffman algo-
rithm for the following intensity distribution, for a 64 × 64 im-
age. Obtain the coding efficiency and compare with that of uniform
length code. (8)
 University Quesiton Papers UQ.9

r0 = 1008
r1 = 320
r2 = 456
r3 = 686
r4 = 803
r5 = 105
r6 = 417
r7 = 301

(ii) What is arithmetic coding? Illustrate. (8)

Or
(b) (i) Explain the procedure for obtaining Run Length Coding (RLC).
What are the advantages if any? (8)
(ii) Write short notes on
A. Vector Quantization (4)
B. JPEG Standard. (4)
UQ.10 Digital Image Processing

B.E/B.Tech. DEGREE EXAMINATION, APRIL/MAY 2015

Seventh Semester
Electronics and Communication Engineering
EC 2029/EC 708/10144 ECE 41 - DIGITAL IMAGE PROCESSING
(Regulation 2008/2010)
(Common to 10144 ECE 41 - Digital Image Processing for B.E. (Part-Time)
Seventh Semester - ECE - Regulation 2010)
Time: Three hours Maximum: 100 marks
Answer ALL questions.
PART A - (10 × 2 = 20 marks)

1. Define simultaneous contrast and mach band effect.

2. Define brightness and contrast.
3. Give the PDF of uniform noise and sketch it.
4. Define and give the transfer function of Mean and Geometric Mean filter.
5. Define image degradation model and sketch it.
6. Define Geometric transformation.
7. Write the properties of first order and second order derivative.
8. Define local thresholding for edge detection.
9. State the need for data compression and compare lossy and lossless compres-
sion techniques.
10. List the advantages of transform coding.
PART B - (5 × 16 = 80 marks)
11. (a) (i) Describe how the image is digitized by sampling and quantization
and explain about checker board effect and false contouring with
neat sketch. (8)
(ii) Find Discrete Cosine Transform and its inverse for the following
image data. [0255; 2550] [2 × 2] matrix. (8)
Or
(b) Obtain Discrete Fourier transform for the given vectors. Input image
matrix = [0 0; 255, 255] [2 × 2] matrix. Also analysis how the Fourier
transform is used if the image is rotated or translated. (16)
12. (a) Describe histogram equalization. Obtain Histogram equalization for the
following 8 bit image segment of size 5 × 5. Write the inference on
 University Quesiton Papers UQ.11

image segment before and after equalization. (16)

200 200 200 180 240

180 180 180 180 190
190 190 190 190 180
190 200 220 220 240
230 180 190 210 230 (5 × 5) matrix

Or
(b) (i) Describe how homomorphic filtering is used to separate illumina-
tion and reflectance component. (8)
(ii) How color image is enhanced and compare it with grayscale pro-
cessing? (8)
13. (a) Describe inverse filtering for removal of blur caused by any motion and
describe how it restore the image. (16)
Or
(b) How wiener filter is helpful to reduce the mean square error when image
is corrupted by motion blur and additive noise?
14. (a) (i) How do you link edge pixels through Hough transform?
(ii) Describe Watershed segmentation algorithm.
Or
(b) (i) Explain region based segmentation and region growing with an ex-
ample. (8)
(ii) Discuss how to construct dams using morphological operations. (8)
15. (a) (i) Describe vector quantization with neat sketch. (8)
(ii) A source emits letters from an alphabet A = (a1, a2, a3, a4, a5)
with probabilities P (a1) = 0.3, P (a2) = 0.4, P (a3) = 0.15,
P (a4) = 0.05 and P (a5) = 0.1. (8)
A. Find a Huffman code for this source?
B. Find the average length of the code and its redundancy?
Or
(b) (i) Described run length encoding with examples. (8)
(ii) How an image is compressed using JPEG image compression with
an image matrix? (8)
UQ.12 Digital Image Processing

B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015

Seventh Semester
Electronics and Communication Engineering
EC 2029/EC 708/10144 ECE 41 - DIGITAL IMAGE PROCESSING
(Regulation 2008/2010)
(Common to 10144 ECE 41 - Digital Image Processing for B.E. (Part-Time)
Seventh Semester - ECE - Regulation 2010)
Time: Three hours Maximum: 100 marks
Answer ALL questions.
PART A - (10 × 2 = 20 marks)

1. State Mach band effect.

2. Give the transform pair education of 2D DFT.
3. What is histogram equalization?
4. Define directional smoothing filter.
5. Distinguish between image enhancement and image restoration.
6. What are the various geometric transformations?
7. Give the principle of region growing.
8. What is global thresholding?
9. Define coding redundancy.
10. What is the basic concept of run length coding?
PART B - (5 × 16 = 80 marks)
11. (a) (i) List and explain various elements of a digital image processing sys-
tem. (8)
(ii) Explain the working principle of a digital camera with a diagram.
(8)
Or
(b) (i) Discuss HSI color model in detail. (6)
(ii) Describe various steps involved in the computation of KL transform
with equations. How will you use if for data compression? (10)
12. (a) (i) Explain histogram specification technique in detail with equations.
(8)
(ii) Discuss the following spatial enhancement techniques
A. Spatial averaging (4)
B. Median filtering. (4)
Or
 University Quesiton Papers UQ.13

(b) (i) Explain the following filtering techniques:

A. Geometric mean filter (3)
B. Harmonic mean filter (3)
C. Homomorphic filter. (4)
(ii) Describe the basics of color image enhancement. (6)
13. (a) (i) What is inverse filtering? Explain inverse filter with an equation.
(8)
(ii) Discuss constrained least square filtering method of restoration in
detail. (8)
Or
(b) (i) Explain Wiener filtering with equations. (8)
(ii) Discuss various types of spatial transformations. (8)
14. (a) (i) Describe gradient operators based edge detection method with nec-
essary masks and equations. (8)
(ii) Explain region splitting and merging method of image segmenta-
tion. (8)
Or
(b) (i) Explain the procedure to construct the dam for segmentation. (8)
(ii) Discuss watershed segmentation algorithm in detail. (10)
15. (a) (i) Obtain Huffman coding for the source symbols
S = {S0 , S1 , S2 , S3 , S4 } and the corresponding probabilities
P = {0.4, 0.2, 0.2, 0.1, 0.1}. (7)
(ii) Explain the principle of arithmetic coding with an example.
(9)
(b) (i) Explain vector quantization. (8)
(ii) Draw and explain the block diagram of transform coding. (8)
UQ.14 Digital Image Processing

QuestionPaperCode : 80593

B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2016

Sixth Semester
Electronics and Instrumentation Engineering
IT 6005 - DIGITAL IMAGE PROCESSING
(Regulation 2013)
Time: Three hours Maximum: 100 marks
Answer ALL questions.
PART A - (10 × 2 = 20 marks)
1. What is Machband effect?
2. Define Checker Board Effect.
3. What is meant by bit plane slicing?
4. What is unsharp masking?
5. State the causes of degradation in an image?
6. What do you understand by Mexican hat function?
7. What is an image pyramid?
8. State whether the given Huffman code 0,10,01,011 for the symbol a1, a2, a3, a4
is uniquely decodable or not?
9. What is Skeletonizing?
10. Define texture.

PART B - (5 × 16 = 80 marks)
11. (a) (i) With necessary diagrams explain how an Analog image is Con-
verted into digital image. (8)
(ii) What is meant by image sensing? Explain in detail the construction
and operation of various image acquisition device. (8)
Or
(b) (i) What is a color model? What are its types? Explain RGB and HSI
models with necessary diagrams. (12)
(ii) Explain the various distance measures used for image analysis. (4)
12. (a) (i) Briefly discuss about histogram equalization technique. (8)
(ii) Perform histogram equalization of the image. (8)
 
4 4 4 4 4
 3 4 5 4 3 
 
 3 5 5 5 3 
 
 3 4 5 4 3 
4 4 4 4 4
 University Quesiton Papers UQ.15

Or
(b) (i) Explain in detail the method for smoothing the image in frequency
domain. (10)
(ii) Explain gradient operators for Image Enhancement. (6)
13. (a) (i) Apply order statistics filter on the selected pixel in the image. (8)
(ii) Explain how wiener filter is used for image restoration. (8)
 
1 2 3
 0 1 2 
1 4 5

Or
(b) (i) Explain the process of edge linking using Hough transform (8)
(ii) Explain region based segmentation techniques. (8)
14. (a) (i) Explain two dimensional Discrete Wavelet Transform (DWT). (8)
(ii) Encode the word a1 a2 a3 a4 using arithmetic code and generate
the tag for the given symbol with probabilities. (8)

a1 → 0.2, a2 → 0.2, a3 → 0.4, a4 → 0.2

Or
(b) What is the need for image compression? Explain image compression
standards in detail. (16)
15. (a) Explain in detail any two boundary representation schemes and illus-
trate with examples. (16)
Or
(b) Explain image recognition based on matching. (16)