0% found this document useful (0 votes)
29 views5 pages

QB

Uploaded by

cricketholythe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
29 views5 pages

QB

Uploaded by

cricketholythe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

SIDDHARTH INSTITUTE OF ENGINEERING & TECHNOLOGY: PUTTUR

(AUTONOMOUS)
Siddharth Nagar, Narayanavanam Road – 517583
QUESTION BANK (DESCRIPTIVE)

Subject with Code: DIGITAL IMAGE PROCESSING (20EC0441)


Course & Branch: B.Tech. – ECE Year & Sem: IV-B.Tech.& I-Sem. Regulation: R20

UNIT – I
INTRODUCTION TO DIGITAL IMAGE PROCESSING
1 a) State the purpose of the image processing. List out the fundamental [L1][CO1] [6M]
steps in digital image processing which can be applied to images.
b) Define image processing. Illustrate example fields of its usage. [L2][CO1] [6M]
2 a) Discuss the three principal sensor arrangements used to transform [L2][CO1] [6M]
illumination energy into digital images.
b) List out the applications of digital image processing. [L1][CO1] [6M]
3 a) Discuss the method of image sensing and acquisition along with [L2][CO1] [6M]
suitable diagrams.
b) Calculate the number of bits required to store a digitized image if [L3][CO1] [6M]
image sizes are 8×8, 32×32 for 8-bit pixel depth.
4 a) Explain about image sampling and quantization process with proper [L2][CO1] [8M]
steps.
b) Discuss the method for representation of a digital image. [L2][CO1] [4M]
5 a) Discuss the classification of digital images and image types. [L2][CO1] [6M]
b) Explain the neighbors of a pixel with suitable example. [L3][CO1] [6M]
6 a) Illustrate about the adjacency, connectivity, regions and boundaries. [L2][CO1] [6M]
b) Let V = {1}, Compute the 4-adjacency, 8-adjacency and different paths [L3][CO1] [6M]
between two pixels (1,1) and (3,3) for the center pixel in the given
image.

1 4 7
𝐴 = [2 1 1]
3 1 9

7 a) Discuss about the distance measures of a pixel with suitable example. [L2][CO1] [6M]
b) Demonstrate the Arithmetic operations on digital images with [L2][CO1] [6M]
relevant expressions.
8 a) List out the applications of image subtraction and image [L2][CO1] [6M]
multiplication.
b) Explain the Linear versus Nonlinear operations on digital images with [L2][CO1] [6M]
relevant equations.
9 a) Compute the array product and matrix product for the following two [L3][CO1] [6M]
images and comment the result.
1 −1 2 −2
𝐴=[ ] and 𝐵 = [ ]
−1 1 −2 2

b) Explain the Array versus Matrix operations on digital images with [L3][CO1] [6M]
relevant equations.
10 a) Demonstrate the set operation and logical operations in digital image [L2][CO1] [6M]
processing along with suitable example.
b) Compute the image addition, image subtraction and image [L3][CO1] [6M]
multiplication operation for the following images.
1 −1 2 −2
𝑓(𝑥, 𝑦) = [ ] and 𝑔(𝑥, 𝑦) = [ ]
−1 1 −2 2

UNIT- II
IMAGE TRANSFORMS
1 a) Discuss the need of image transforms. [L2][CO2] [6M]
b) Define 2D Orthogonal and Unitary transforms. [L1][CO2] [6M]
2 a) Discuss the properties of Unitary transforms. [L2][CO2] [6M]
b) Define 1D and 2D – Discrete Fourier Transform with equations. [L1][CO2] [6M]
3 a) Prove the Separable property of 2D – Discrete Fourier Transform. [L3][CO2] [6M]
b) Prove the Periodicity property of 2D – Discrete Fourier Transform. [L3][CO2] [6M]
4 a) Deduce the basis function of 2D – Discrete Fourier Transform for N = 4. [L4][CO2] [6M]
b) Compute 2D – Discrete Fourier Transform for the following image. [L3][CO2] [6M]
1 1 1 1
𝑓(𝑥, 𝑦) = [1 1 1 1]
1 1 1 1
1 1 1 1

5 a) Define 2D – Discrete Cosine Transform with equations. [L1][CO2] [4M]


b) Deduce the Discrete Cosine Transform basis matrix for N = 4. [L4][CO2] [8M]
6 a) List the applications of 2D-Discrete Cosine Transforms. [L1][CO2] [4M]
b) Compute 2D – Discrete Cosine Transform for the following image. [L3][CO2] [8M]
1 1 1 1
𝑓(𝑥, 𝑦) = [1 1 1 1]
1 1 1 1
1 1 1 1

7 a) Compute the image basis function of Hadamard Transform when N = 2. [L3][CO2] [6M]
b) Evaluate Hadamard transform for the given image [L3][CO2] [6M]
1 0
𝑓(𝑥, 𝑦) = [ ]
0 1

8 a) Deduce the basis matrix of Walsh Transform for N = 4. [L4][CO2] [6M]


b) Calculate Walsh transform for the given image [L3][CO2] [6M]
1 1
𝑓(𝑥, 𝑦) = [ ]
1 1

9 a) Define Haar transform and give the algorithm and flowchart to [L1][CO2] [6M]
compute Haar basis.
b) Compute Haar transform for the given image. [L3][CO2] [6M]
1 1
𝑓(𝑥, 𝑦) = [ ]
1 1

1 a) Compute the Haar basis for N=2. [L3][CO2] [8M]


0 b) Compare different Image Transforms. [L2][CO2] [4M]
UNIT- III
IMAGE ENHANCEMENT
1 a) Define image enhancement and point operations in image [L1][CO3] [6M]
enhancement?
b) Illustrate the contrast stretching in image enhancement with suitable [L2][CO3] [6M]
example.
2 a) Define negative image transformation and illustrate with suitable [L1][CO3] [6M]
example.
b) Explain the Intensity level slicing operation and bit extraction [L2][CO3] [6M]
operation in image enhancement with suitable example.
3 a) Define histogram and draw the histogram four basic image types. [L1][CO3] [6M]
b) Explain the procedure for histogram process and uses of histogram. [L2][CO3] [6M]
4 a) Discuss the mechanics of spatial filtering with suitable diagram. [L2][CO3] [6M]
b) Illustrate the smoothing spatial filters along with the required [L2][CO3] [6M]
expressions.
5 a) Illustrate the sharpening spatial filters along with the required [L2][CO3] [6M]
expressions.
b) Define the image enhancement in frequency domain and give the [L1][CO3] [6M]
expression.
6 a) Discuss the smoothing filters in frequency domain along with the [L2][CO3] [6M]
required expressions.
b) Explain the sharpening filters in frequency domain along with the [L2][CO3] [6M]
required expressions.
7 a) Define the following terms: Saturation, Hue and Brightness. [L1][CO3] [6M]
b) Draw the CIE chromaticity diagram and mention its significance. [L1][CO3] [6M]
8 a) Define the following terms: Radiance, Luminance and Brightness. [L1][CO3] [6M]
b) Give the importance of the Color Models and explain the RGB models. [L2][CO3] [6M]
9 a) Write brief notes on CMY and CMYK color models. [L1][CO3] [6M]
b) Explain the method of converting colors from RGB to HSI. [L2][CO3] [6M]
10 a) Illustrate the method of converting colors from HSI to RGB. [L2][CO3] [6M]
b) Draw the functional block diagram of pseudo colour processing and [L1][CO3] [6M]
explain each block.
UNIT- IV
IMAGE RESTORATION & IMAGE SEGMENTATION
1 1.
a) Draw the degradation/restoration model in image processing and [L1][CO4] [6M]
describe the each part presented on it.
b) Differentiate the Image Enhancement and Image Restoration. [L4][CO4] [6M]
2 2.
a) Explain the Gaussian and Rayleigh noises with their PDF expressions. [L2][CO4] [6M]
b) Explain the Erlang and Exponential noises with their PDF [L2][CO4] [6M]
expressions.
3 a) Explain the Uniform and Impulse noises with their PDF expressions. [L1][CO4] [6M]
3 3 b) Explain the Normal and Gamma noises with their PDF expressions. [L2][CO4] [6M]
4 3.
a) Explain restoration in the presence of noise only using arithmetic and [L2][CO4] [6M]
geometric mean filters.
b) Write the expression for Harmonic and contraharmonic mean filter [L1][CO4] [6M]
and with their importance.
5 5 a) Explain the method of inverse filtering for image restoration. [L2][CO4] [6M]
b) Give the advantages and disadvantages of the inverse filtering. [L2][CO4] [6M]
6 a) Explain the method of the Least mean square filters for image [L2][CO4] [6M]
restoration.
b) Discuss the method of constrained least square restoration for image [L2][CO4] [6M]
restoration.
7 a) Give the importance of image segmentation in image processing. [L2][CO5] [6M]
b) Explain the Region based Approach for image segmentation. [L2][CO5] [6M]
8 a) Illustrate the Clustering techniques for image segmentation with [L2][CO5] [6M]
example.
b) Discuss the basics of the intensity thresholding. [L2][CO5] [6M]
9 a) List out the different types of thresholding. [L1][CO5] [6M]
b) Discuss the Edge detection with the help of the following operators: [L2][CO5] [6M]
i) Gradient ii) Roberts iii) Prewitt iv) Sobel.
10 a) Discuss the Laplacian operator in edge detection. Also mention its [L2][CO5] [6M]
drawbacks.
b) Discuss the concept of Laplacian of Gaussian (LoG) operator for edge [L2][CO5] [6M]
detection.
UNIT- V
IMAGE COMPRESSION
a) Define the following terms : [L1][CO6] [6M]
Data, Information, Data Redundancy, Data compression and
Compression Ratio.
b) Explain the Coding Redundancy with suitable example. [L2][CO6] [6M]
1 a) Explain the Spatial and Temporal Redundancy with suitable example. [L2][CO6] [6M]
b) Compute the average length, compression and coding redundancy if [L4][CO6] [6M]
the computer-generated image has the intensity distribution shown in
table. If a natural 8-bit code is used to represent its 4 possible
intensities.
Intensities rk Probabilities pk
r87=87 0.25
r128=128 0.47
r186=186 0.25
r256=256 0.03
rk for k≠87,128,186,256 0
2 a) Define Entropy and irrelevant information. [L2][CO6] [6M]
b) Consider an image strip of size 50 × 100. The image consists of five [L4][CO6] [6M]
vertical stripes. The gray levels of the stripes are 128, 64, 32, 16 and
8. The corresponding widths of the stripes are 35, 30, 2 0, 10 and 5
pixels respectively. If this stripe image coded is by Huffman coding,
determine its efficiency.
3 a) Discuss the Objective fidelity criteria and subjective fidelity criteria [L2][CO6] [6M]
with suitable example.
b) Compare zero-memory source and Markov or finite memory source. [L2][CO6] [6M]
4 a) Differentiate lossy compression process and lossless compression [L2][CO6] [6M]
process.
b) Explain the functional block diagram of a general image compression [L2][CO6] [6M]
system with neat sketch.
5 a) Explain the procedure for Huffman coding for image compression [L2][CO6] [6M]
method.
b) Justify Huffman coding is a uniquely decodable coding. [L4][CO6] [6M]
6 a) For the image shown below, compute the degree of compression that [L3][CO6] [6M]
can be achieved using Huffman coding of pixel values. Assume 2 bits
to represent the pixel value.
3332
2333
| |
3222
2110

b) Why Huffman coding is called as block code. [L4][CO6] [6M]


7 a) Explain the procedure for Arithmetic coding with suitable example. [L2][CO6] [6M]
b) Summarize the procedure of Bit plane coding with suitable example. [L2][CO6] [6M]
8 a) Explain the Run length coding with proper example. [L2][CO6] [6M]
b) Explain the functional block diagram of a transform coding technique. [L2][CO6] [6M]
9 a) Compare the adaptive transform coding and non- adaptive transform [L2][CO6] [6M]
coding.
b) Discuss the different Image Formats and compression standards. [L2][CO6] [6M]

Prepared by: Dr P G KUPPUSWAMY ,Dr R GOMALAVALLI, P CHANDANAKALA

You might also like