QUESTION BANK

SUBJECT : DIGITAL IMAGE PROCESSING [3ES501CS]

UNIT I
Digital Image Fundamentals & Image Transforms: Digital Image Fundamentals, Sampling
and Quantization, Relationship between Pixels. Image Transforms: 2-D FFT, Properties,
Walsh Transform, Hadamard Transform, Discrete Cosine Transform, Haar Transform,
Slant Transform, Hotelling Transform
SHORT ANSWER QUESTION: 2MARKS
Sr. Question Bloom’s Taxonomy
No
1. Define the following terms: Remembering
(i)Image (ii) Resolution (iii) Pixel and (iv) Digital Image
2. Define D4 and D8 distances Remembering
3. Define sampling and quantization Remembering
4. Define the following terms Remembering
(i) Hue (ii)Saturation
5. List the steps involved in digital image processing Understanding
6. How do you represent the digital images Remembering
7. Name various arithmetic and logical operations that can be done on
Images
8. State the different fields in which Digital Image Processing is used Understanding
9. Define discrete fourier transform Remembering
10. Write the expressions for Walsh transform kernel and Walsh Understanding
transform (1D &2D)
11. Compute the Haar transform of the 2 x 2 image Applying

12. Apply Walsh Transform on f(x) = {1,2,0,3} Applying

LONG ANSWER QUESTION: 4/6/8 MARKS

Sr. Question Bloom’s Taxonomy
No
 1. Explain the steps involved in digital image processing Understanding
2. Explain about sampling and quantization of an image. Understanding
3. Discuss about the following relationships between pixels with neat Understanding
diagrams i) Neighbors of a pixel ii) Connectivity iii) Distance
measures iv) Path
4. Explain the following transformations Understanding
a) Walsh Transform (b) Haar Transform (c) Hadamard transform
5. What do you mean by convolution? Explain all the properties of Understanding
convolution
6. What is the need of Fourier transform? Explain all the properties of Understanding
2-DFT.
7. Compute the Euclidean Distance (D1), City-block Distance (D2) Applying
and Chessboard distance (D3) for points p and q, where p and q be
(5, 2) and (1, 5) respectively. Give answer in the form (D1, D2, D3).
8. Discuss about Slant transform (1-D , 2-D) and Hadamard transform Understanding
(1-D ,2-D) in detail
9. Explain Hotelling Transformation in detail with example Understanding,
Applying
10. Discuss the following intensity transformations. Understanding
(a) Image negatives
(b) Contrast stretching
11. How the Discrete Cosine Transform is used to process the digital Understanding
image? Write its Kernel function

UNIT II
Image Enhancement (Spatial Domain): Introduction, Image Enhancement in Spatial
Domain, Enhancement through Point Processing, Types of Point Processing, Histogram
Manipulation, Linear and Non – Linear Gray Level Transformation, Local or
Neighborhood criterion, Median Filter, Spatial Domain High-Pass Filtering. Image
Enhancement (Frequency Domain): Filtering in Frequency Domain, Low Pass (Smoothing)
and High Pass (Sharpening) Filters in Frequency Domain.
SHORT ANSWER QUESTION: 2MARKS
Sr. Question Bloom’s Taxonomy
No
 1. What is the importance of filters in image enhancement Understanding
2. Differentiate image enhancement in spatial and frequency domain Analyzing
3. Define spatial and frequency domain image enhancement Remembering
4. Define thresholding Remembering
5. Describe Histogram Specification Remembering
6. What are the applications where histogram manipulation is useful Understanding
(any 4)
7. What is meant by image enhancement by point processing? Discuss Remembering
any two methods in it.
8. What is the objective of image enhancement? Define spatial Remembering
domain. Define point processing
9. What are the advantages of filtering in frequency domain Understanding
10. Compare image sharpening and image smoothening in image Analyzing
enhancement
11. Compare high and low pass filter Analyzing

LONG ANSWER QUESTION : 4/6/8 MARKS

Sr. Question Bloom’s Taxonomy
No
1. Explain image enhancement in spatial domain Understanding
2. Explain the different point processing techniques Understanding
3. Explain contrast stretching with suitable example Understanding
4. Explain Histogram Manipulation in detail with example Understanding,
Applying
5. Explain Gray level transformation functions for contrast Understanding
enhancement
6. Define Histogram of Image. Explain the concept of Histogram Understanding,
manipulation for Image enhancement with an example Applying
7. Discuss about the mechanics of filtering in spatial domain. Mention Understanding
the points to be considered in implementation neighbourhood
operations for spatial filtering
8. Given below are two histograms (i) and )ii) . Modify histogram (i) Applying
as given by histogram (ii)
i)
 Gray Level 0 1 2 3 4 5 6 7
(rk)
No. of pixels 80 100 90 60 30 20 10 0
(nk)

ii)
Gray Level 0 1 2 3 4 5 6 7
(rk)
No. of pixels 0 0 0 60 80 100 80 70
(nk)
9. Explain frequency domain high pass filtering Understanding
10. Explain the basic steps for filtering used to enhance an image in Understanding
frequency domain
11. Explain Median filters with example for image enhancement Understanding,
Applying

UNIT III
Image Restoration: Degradation Model, Algebraic Approach to Restoration, Inverse
Filtering, Least Mean Square Filters, Constrained Least Squares Restoration, Interactive
Restoration.
SHORT ANSWER QUESTION : 2MARKS
Sr. Question Bloom’s Taxonomy
No
1. Compare image enhancement and restoration techniques? Analyzing
2. State the probability density functions for Rayleigh noise models Understanding
3. State the probability density functions for Gaussian noise models Understanding
4. State the probability density functions for Salt and Pepper noise Understanding
models
5. Define Image restoration Remembering
6. Define image degradation Remembering
7. List the different image restoration techniques Understanding
8. Define white noise Remembering
9. Why impulse noise is called salt and pepper noise Understanding
 10. What is Inverse filtering Remembering
11. List the different types of noise models Understanding
12. How a degradation process is modeled Remembering

LONG ANSWER QUESTION : 4/6/8 MARKS

Sr. Question Bloom’s Taxonomy
No
1. Explain the method of Least Mean Squares Filtering (Wiener) for Understanding
image restoration(8M)
2. Explain model of image degradation/restoration process with a Understanding
block diagram
3. Explain the method of Constrained Least Squares Filtering for Understanding
image restoration
4. Discuss the process of image restoration by direct inverse filtering Understanding
5. Write about Noise Probability Density Functions for all noise Understanding
models
6. Explain the Frequency domain filters in detail Understanding
7. Explain Mean, Median, Max and Min filter with example Understanding,
Applying

UNIT IV
Image Segmentation: Detection of Discontinuities, Edge Linking And Boundary Detection,
thresholding, Region Oriented Segmentation. Morphological Image Processing: Dilation and
Erosion: Dilation, Structuring Element Decomposition, Erosion, Combining Dilation and
Erosion, Opening and Closing, Hit or Miss Transformation.
SHORT ANSWER QUESTION : 2MARKS
Sr. Question Bloom’s Taxonomy
No
1. Determine edges and boundary Understanding
2. Define image segmentation Remembering
3. Give two applications of image segmentation Understanding
4. List the various methods of thresholding in image segmentation. Understanding
5. List the methods for finding Dicontinuity and Similarity Understanding
 6. Classify the types of edges in the digital image Understanding
7. Define local thresholding for edge detection Remembering
8. Differentiate between local and global thresholding technique for Analyzing
image segmentation.
9. State the mask for prewitt operator Understanding
10. State the mask for sobel operator Understanding
11. What is meant by discontinuities in an image Remembering
12. What is meant by Erosion and dilation Remembering
13. Define Hit and Miss transformation Remembering
14. Differentiate between Dilation and Erosion Analyzing

LONG ANSWER QUESTION : 4/6/8 MARKS

Sr. Question Bloom’s Taxonomy
No
1. Write short notes on detection of Discontinuity(8M) Understanding
2. What are the derivative operators useful in image segmentation? Understanding
Explain their role in segmentation(8M)
3. How edge detection is performed in digital images using: Understanding,
a) Robert operator. Analyzing
b) Sobel operator.
c) Prewitt operator
d) Laplacian operator and compare their outcomes.(8M)
4. Explain Hough Transform in detail (8M) Understanding
5. Explain about the Global processing via the Hough Transform for Understanding
edge linking(8M)
6. Show that the following points are collinear using Hough Transform Applying
Also find the equation of the line (1,2) , (2,3) and (3,4) (4M)
7. What do you mean by optimal thresholding in detail and how do Understanding
you obtain the threshold for image processing (8M)
8. Explain global and adaptive thresholding in detail with an example Understanding
9. Explain about Region Splitting and Merging with an example Understanding
10. Apply region splitting and merging on the following image with Applying
threshold value =3 (8M)
 5 6 6 6 7 7 6 6
6 7 6 7 5 5 4 7
6 6 4 4 3 2 5 6
5 4 5 4 2 3 4 6
0 3 2 3 3 2 4 7
0 0 0 0 2 2 5 6
1 1 0 1 0 3 4 4
1 0 1 0 2 3 5 4
11. Explain Structuring Elements in detail (8M) Understanding
12. Write short notes on Morphological Operations (8M) Understanding
13. Explain Dilation and Erosion in detail with example (8M) Understanding,
Applying
14. Explain Hit or Miss Transformation with an example(8M) Understanding,
Applying
15. Apply Robert , Sobel and Prewit operator on the pixel(1,1) in the Applying
following image (4M)
50 50 100 100
50 50 100 100
50 50 100 100
50 50 100 100

UNIT V
Image Compression: Redundancies and their Removal Methods, Fidelity Criteria, Image
Compression Models, Huffman and Arithmetic Coding, Error Free Compression, Lossy
Compression, Lossy and Lossless Predictive Coding, Transform Based Compression, JPEG
2000 Standards.
SHORT ANSWER QUESTION : 2MARKS
Sr. Question Bloom’s Taxonomy
No
1. Classify various redundancies Understanding

2. Categorize compression models Understanding

 3. Define image compression Remembering

4. Define compression ratio Remembering

5. List the different types of redundancy and their removal methods Understanding

6. What is data redundancy Remembering

7. What is relative data redundancy Remembering

8. Compare with data redundancy with relative data redundancy Analyzing

9. Differentiate between lossy & lossless compression ( 4 marks mai Analyzing

ata)
10. What is Huffman coding Remembering

11. What is variable coding Remembering

12. What is arithmetic coding Remembering

13. Outline the block diagram of lossy compression technique Understanding

14. Outline the block diagram of lossless compression technique Understanding
15. List the different types of data Remembering
16. Summarize JPEG 2000 Standards Remembering

LONG ANSWER QUESTION : 4 / 8 MARKS

Sr. Question Bloom’s Taxonomy
No
1. Explain about Image Compression Models in detail (8M) Understanding

2. Explain about fidelity criterion (4M) Knowledge

3. Explain the different types of redundancies in detail(8M) Understanding

4. What are the characteristics of lossy and lossless compression(4M) Understand

5. Explain a method of generating variable length codes with an Understanding,

 example (8M) Applying
6. Explain arithmetic encoding process with an example(8M) Understanding,
Applying
7. Explain LZW coding with an example (8M) Understanding,
Applying
8. Explain the concept of bit plane coding method (4M) Understanding,
Applying
9. Explain about lossless predictive coding (4M) Understanding

10. Explain about lossy predictive coding(4M) Understanding

11. Explain with a block diagram about transform coding system(8M) Understanding
12. Explain lossy and lossless Predictive coding (8M) Understanding
Explain about JPEG compression standard and the steps involved in Understanding
13.
JPEG compression (8M)
What are the parameters used to measure the quality of an Understanding
14.
image(4M)
Discuss in detail about run length encoding with an example.(8M) Understanding,
15.
Applying
Solve and find a Huffman code and average length of the code and Applying
its redundancy for the source emits letters from an alphabet
16.
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. (4M)
Evaluate the need for image compression. How run length encoding Analyzing
17.
approach is used for compression? Is it lossy? Justify.
Design a coder which a source emits letters from an alphabet Creating
A={k1,k2,k3,k4,k5} with probabilities P(k1)=p(k3)=0.2, P(k2)=0.4,
18. P(k4)= P(k5)=0.1, entropy = 2.122bits/symbol. Find a Huffman
code for this source and the average length of the code and its
redundancy. (4M)
19. Consider a 5 bit image of 10 X 10 with probabilities p(a1) = 0.1 , Applying
p(a2)= 0.4, p(a3) =0.06, p(a4) = 0.1, p(a5) = 0.04, p(a6)= 0.3.
Find 1) Huffman Code
(2) Encode the string 010100111100
(3) Average length of code
(4) Total number of bits transmitted
 (5) Entropy
(6) Efficiency (8M)
Encode the string “Went *” using arithmetic coding and find Applying
codeword . Generate the Tag Value (6 M)
20.
Symbol e n t W *
Probability 0.3 0.3 0.2 0.1 0.1