OBJECTIVE QUESTIONS

Date: 03.01.2023

S.No Question Description Unit Answer

1. Electromagnetic visible spectrum ranges from________
I 1
(1) 400-700nm (2) 600-900nm (3) 400-700pm (4) 600-900pm
2. How is radiance measured?
I 2
(1) Lumens (2) Watts (3) Armstrong (4) Hertz
3. Which of the following is impractical to measure?
I 4
(1) Frequency (2) Radiance (3) Luminance (4) Brightness
4. _____________ is the effect caused by the use of an insufficient number of
intensity levels in image
I 2
(1) Gaussian smooth (2) False Contouring
(3) Interpolation (4) Checker board pattern
5. Which of the following is the fundamental step in image processing.
I 3
(1) Restoration (2) Enhancement (3) Acquisition (4) Compression
6. The smallest discernible change in intensity level is called ____________
(1) Intensity Resolution (2) Contour (3) Saturation (4) I 1
Contrast
7. If R is a subset of pixels, we call R a _________ of the image if R is a
connected set. I 2
(1) Disjoint (2) Region (3) Closed (4) Adjacent
8. The quality of a digital image is well determined by ___________
(1) The number of samples (2) The discrete gray levels I 3
(3) Both A & B (4) None
9. The difference is intensity between the highest and the lowest intensity levels
in an image is __ I 4
(1) Noise (2) Saturation (3) Brightness (4) Contrast
10. The digital Image consist of set of discrete elements are called____
I 1
(1) Pixels (2) Dots (3) Coordinates (4) Intensities
11. The number of Intensity levels in 8-bit image are_____
I 2
(1) 255 (2) 256 (3) 8 (4) 7
12. An image is a two dimensional function where x and y are______
(1) Gray levels (2) Frequency coordinates (3) Spatial coordinates I 3
(4) Real coordinates
13. Function that combines to produce f(x,y) is _________
(1) Illumination and Frequency (2) Intensity and Reflectance I 4
(3) Intensity and Frequency (4) Illumination and Reflectance
14. In 4-neighbours of a pixel p, how far are each of the neighbours located from
p? I 1
(1) One pixel apart (2) Four pixels apart (3) Alternating pixels (4) None
S.No Question Description Unit Answer
15. After digitization process a digital image with M rows and N columns have to
be positive and for the number, L, max gray levels i.e. an integer power of 2
for each pixel. Then, the number b, of bits required to store a digitized image I 2
is____
(1) M*N*L (2) M*N*k (3) M*L*k (4) None
16. What role does the segmentation play in image processing?
(1) Deals with extracting attributes that result in some quantitative
information of interest
(2) Deals with techniques for reducing the storage required saving an
I 3
image, or the bandwidth required transmitting it
(3) Deals with partitioning an image into its constituent parts or objects
(4) Deals with property in which images are subdivided successively into
smaller regions
17. In digital image of M rows and N columns and L discrete gray levels, calculate
the bits required to store a digitized image for M=N=32 and L=16. I 2
(1) 16384 (2) 4096 (3) 8192 (4) 512
18. The D8 distance between p and q with coordinates (x, y), (s, t) is defined as
(1) | x –s | + | y –t | (2) [( x –s )2+ ( y –t )2] ½ I 4
(3) Min(| x –s | , | y –t | (4) Max(| x –s | , | y –t |)
19. The D4 distance between p and q with coordinates (x, y), (s, t) is defined as
(1) | x –s | + | y –t | (2) [( x –s )2+ ( y –t )2] ½ I 1
(3). Max(| x –s | , | y –t |) (4) Min(| x –s | , | y –t |
20. The De distance between p and q with coordinates (x, y), (s, t) is defined as
(1) | x –s | + | y –t | (2) [( x –s )2+ ( y –t )2] ½ I 2
(3). Max(| x –s | , | y –t |) (4) Min(| x –s | , | y –t |
21. The process of manipulating the digital image to make results more suitable is
called___ II 1
(1) Enhancement (2) Restoration (3) Compression (4) Segmentation
22. Spatial domain refers to_______________
(1) Manipulations on whole image II 2
(2) Direct manipulation of image pixel
(3) Modifications on Fourier transform of an image (4) None of the above
23. Point processing do the transformation performing on_______
II 2
(1) Total Image (2) Single pixel (3) Group of pixels (4) None
24. Which of the following function reverses the order from black to white?
II 2
(1) Bit plane slicing (2) Image negative (3) Both 1 & 2 (4) None
25. The method used for effective way to compress the dynamic range of pixel
value II 3
(1) Bit plane slicing (2) Image negative (3) Log transformation (4) None
26. The process used to correct in the power law response phenomenon is
called___
II 1
(1) Gamma Correction (2) Linear transformation
(3) Inverse transformation (4) Sharpening filter
27. Which of the following map a narrow range of dark input values into wider
range of output values?
II 2
(1) Bit plane slicing (2) Power law transformation
(3) Log transformation (4) None
28. The method is used to highlight the contribution made to the total image
appearance by specific bits is called_________
II 4
(1) Contrast stretching (2) Power law transformation
(3) Grey level slicing (4) Bit plane slicing
29. Thresholding function in contrast stretching creates______ image.
II 3
(1) Color image (2) Gray scale image (3) Binary (4) All the above
30. Log transformation is given by_________ II 1
 (1) S = C log(1+r) (2) S = C log(r)
γ
(3) S = C r (4) S = L-1-r
31. To highlight a specific range of gray levels in an image
(1) Contrast stretching (2) Power law transformation II 3
(3) Grey level slicing (4) Bit plane slicing
32. Histogram equalization also known as histogram
(1) Histogram linearization (2) Histogram matching II 1
(3) Local enhancement (4) All the above
33. Which of the following in an image can be removed by using smoothing
filter?
(1) Smooth transitions of gray levels II 3
(2) Smooth transitions of brightness levels (3) Sharp transitions of gray levels
(4) Sharp transitions of brightness levels
34. Median filter belongs to which category of filters?
(1) Linear spatial filter (2) Frequency domain filter II 3
(3) Order static filter (4) Sharpening filter
35. The following filters used for blurring and for noise reduction
II 1
(1) Smoothing (2) Sharpening (3) Both 1 & 2 (4) None
36. A low contrast image will have what kind of histogram when, the histogram,
h(rk) = nk, rk the kth gray level and nk total pixels with gray level rk, is plotted
nk versus rk?
(1) The histogram that are concentrated on the dark side of gray scale
II 3
(2) The histogram whose component are biased toward high side of gray scale
(3) The histogram that is narrow and centered toward the middle of gray scale
(4) The histogram that covers wide range of gray scale and the distribution of
pixel is approximately uniform
37. In terms of enhancement, what does mean and variance refers to
(1) Average contrast and average gray level respectively
II 2
(2) Average gray level and average contrast respectively
(3) Average gray level in both (4) Average contrast in both
38. Which of the following operators are used for sharpening the image in spatial
and frequency domain? II 3
(1) Gradient (2) Laplacian (3) Both 1 & 2 (4) None of the above
39. While performing the median filtering, suppose a 3*3 neighborhood has value
(10, 20, 20, 20, 15, 20, 20, 25, 100), then what is the median value to be given
II 2
to the pixel under filter?
(1) 15 (2) 20 (3) 100 (4) 25
40. Partitioning an image into its constituent regions is known as_____________ III 1
(1) Segmentation (2) Enhancement (3) Restoration (4) Compression
41. Basic types of gray level discontinuities are__________
III 4
(1) Points (2) Lines (3) Edges (4) All the above
42. Segmentation can be done based on______ measurements taken from the
image III 4
(1) Grey level (2) Colour (3) Texture (4) All the above
43. The mask is related to detection of isolated points in image is______

(1) (2) (3) (4)

III 1

44. A point can be detected at the location on which the mask is centered if it
satisfies III 1
(1) |R|>T (2) |R|<T (3) |R|=T (4) None
45. For finding the Horizontal lines we use the mask of values is_____________ III 1
 (1) (2) (3) (4)

46. For finding the diagonal lines with 450 , we use the mask of values
is___________

(1) (2) (3) (4)

III 2

47. For finding the diagonal lines with 1350 , we use the mask of values
is___________

(1) (2) (3) (4)

III 4

48. The expression for cost function in graph theoretic method of boundary
detection is___
(1) (2) (1) III 3
(3) (4)

49. The boundary between two regions with relatively distinct gray-level
properties is known as______ III 2
(1)Line (2) Edge (3) Point (4) None

DESCRIPTIVE QUESTIONS
------------------------------------------------------------------------------------------------------------------------

S.No Question Description Unit CO BL

1 Define the terms (i) Image (ii) Digital image I CO1 L2
(iii) Representation of digital image with an example.
2 Differentiate binary image, gray scale image and color image with an I CO1 L2
example.
3 Explain the fundamental steps in digital image processing with a neat I CO2 L3
block diagram.
4 Explain the components involved in digital image processing system I CO1 L2
with neat schematics.
5 Discuss the application areas of image processing with an examples. I CO1 L2
6 Interpret the concepts of image sampling and quantization with neat I CO1 L2
diagram.
7 Describe the reasons behind the occurrence of checker board effect I CO2 L3
in spatial resolution and false contouring in gray level resolution.
9 Summarize the types of adjacency relationships involved in the I CO2 L3
digital image processing with an example.

Let V be the set of intensity values used to define

 adjacency.

In a binary image, V ={1} if we are referring to

adjacency of pixels with value 1. In a gray-scale
image, the idea is the same, but set V typically
contains more elements.

For example, in the adjacency of pixels with a range

of possible intensity values 0 to 255, set V could be
any subset of these 256 values.

We consider three types of adjacency:

a) 4-adjacency: Two pixels p and q with values

from V are 4-adjacent if q is in the set N4(p).

b) 8-adjacency: Two pixels p and q with values

from V are 8-adjacent if q is in the set N8(p).

c) m-adjacency(mixed adjacency): Two pixels p

and q with values from V are m-adjacent if

1. q is in N4(p), or

2. 2) q is in ND(p) and the set N4(p)∩N4(q)

has no pixels whose values are from V.
10 Differentiate between numerous distance measures with necessary I CO2 L3
mathematical expressions.
11 Define 2D DFT and Explain the Properties of 2D DFT with necessary I CO2 L3
equations.
12 Define DCT, derive the basis matrix for N=4 and List the Properties I CO2 L3
13 Discuss the need of image enhancement and differentiate the point II CO1 L2
and mask processing of image enhancement
14 Examine the intensity transformation functions for image II CO2 L3
enhancement with an example.
15 How to apply the piecewise linear transformation functions for II CO2 L3
image enhancement, explain with an example.
16 Demonstrate the histogram equalization with an example for image II CO2 L3
enhancement.
17 Examine the role of linear and non-linear filters for image smoothing II CO2 L3
in spatial domain enhancement.
18 Examine the significance of Laplacian and Gradient operator in II CO2 L3
spatial domain based image enhancement.
19 Illustrate the steps in frequency domain enhancement of an image II CO1 L2
with a neat block diagram.
20 Examine the role of low pass filters used in smoothing image in II CO2 L3
frequency domain enhancement.
21 Examine the role of high pass filters used in sharpening image in II CO2 L3
frequency domain enhancement.
22 Interpret the role of Laplacian operator in frequency domain image II CO2 L3
enhancement.
23 Illustrate the techniques used in detection of discontinuities in image III CO3 L2
segmentation.
24 Describe the Edge linking procedure using Local Processing. III CO3 L2
25 Illustrate the Edge linking procedure using global processing via III CO3 L2
Hough transformation.
26 Illustrate the edge detection process using Gradient and Laplacian III CO3 L2
operation in image segmentation.