MCQ UNIT1andUNIT2 DIP
MCQ UNIT1andUNIT2 DIP
MCQ UNIT1andUNIT2 DIP
Subject: DIP
1. DIP Stands:
a) Digital image processing b)Digital information processing
c) Digital induction process d) None of these
2. What is image?
a) Picture
d) Matrix of pixel
c) Collection of pixel
d) All of these
5. What is pixel?
a) Pixel is the elements of a digital image
b) Pixel is the elements of a analog image
c) a & b
d) none of these
8. Among the following image processing techniques which is fast, precise and
flexible a) optical
b) digital
c) electronic
d) photographic
10. Which is the image processing technique used to improve the quality of image for
human viewing?
a) compression
b)enhancement
c) restoration
d)analysis
11. Which type of enhancement operations are used to modify pixel values according to the
value of the pixel‗s neighbors?
a) point operations
b) local operations
c) global operations
d) mask operations
12. In which type of progressive coding technique,gery color is encoded first and then
other colors are encoded?
a) quality progressive
b) resolution progressive c) component progressive
d) region progressive
17. Which is a fundamental task in image processing used to match two or more
pictures? a) registration
b) segmentation c)
computer vision
d) image differencing
18. Which technique is used for the images of the same scene are acquired from different
viewpoints
a) multiview analysis
b) multitemporal analysis
c) multisensory analysis
d) image differencing
19. Which sensor is used for obtaining the video source in 3d face recognition
system a) optical
b) electronic
c) 3d sensor
d) 2d sensor
21. Which technique turns the unique lines, patterns, and spots apparent in a person‘s skin into
a mathematical space
a) registration
b) segmentation
c) skin texture analysis
d) image differencing
22. In which technique which is used to determine changes between two images ?
a) Image differencing
b) segmentation
c) skin texture analysis
d) image differencing
31. The identification technique using voice, keystroke, gait etc. are included in
a) image enhancement
b) behavioral biometrics
c) face recognition
d) physical biometrics
Answers-Key Unit-1:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
41 42 43 44 45
Unit-2
1. DFT stands as:
a. Discrete Fourier transform
b. digital function transform
c. digital frequency transform
d. none
4. Restoration is:
a. attempts to reconstruct or recover an image that has been degraded by using a priori
knowledge of the degradation phenomenon.
b. attempts to reconstruct or recover an image that has been graded by using a priori knowledge
of the gradation phenomenon.
c. a & b
d. None of above
5. Restoration technique:
a. its oriented toward modeling the degradation and applying the inverse process in
order to recover the original image.
b. its oriented toward modeling the gradation and applying the inverse process in order to
recover the original image.
c. its oriented toward modeling the degradation and applying the process in order to recover
the original image.
d. none of above
11. A ……….achieves smoothing comparable to the arithmetic mean filter, but it tends to
lose less image detail in the process.
a. Arithmetic mean filter b. geometric mean filter
c. spatial filter
d. none of above
12. A geometric mean filter achieves smoothing comparable to the arithmetic mean filter, but
it tends to …………….image detail in the process.
a. lossy
b. corrupted
c. lose less
d. none of above
13. The harmonic mean filter works well for………..but fails for pepper
noise. a. salt and pepper noise
b. salt noise
c. pepper noise
d. none of above
14. The harmonic mean filter works well for salt noise, but fails for ...................
a. salt and pepper
noise b. salt noise
c. pepper noise
d. none of above
16. Contra harmonic mean filter is well suited for reducing or virtually eliminating the effects of
................................
a. salt and pepper noise
b. Gaussian noise
c. pepper noise
d. none of above
17. For ...................value of Q, the Contra harmonic mean filter eliminates pepper
noise. a. positive
b. negative
c. equal
d. none of above
18. for negative value of Q, the Contra harmonic mean filter eliminates salt noise.
a. positive
b. negative
c. equal
d. none of above
19. The Contra harmonic mean filter reduces to the arithmetic mean filter if......, and to
the harmonic mean filter if Q=-1.
a. Q=0
b. Q=1
c. Q=-1
d. none of above
20. The arithmetic and geometric mean filters are well suited for random noise like Gaussian
or uniform noise.
a. random noise
b. uniform noise
c. Gaussian noise
d. all of above
21. The ..................are well suited for random noise like Gaussian or uniform
noise. a. arithmetic and geometric mean filters
a. arithmetic mean filters
a geometric mean filters
d. all of these
22. The Contra harmonic mean filter is well suited for impulse noise, but it has the disadvantage
that it must be known whether the noise is dark or light in order to select the proper sign for Q.
a. random noise
b. uniform noise
c. impulse noise
d. all of above
23. The best known order statistics filter is the median filter, which replaces the value of a
pixel by the median of the gray levels in the neighborhood of that pixel.
ˆ
d. none of above
d. none of above
25. Using 0th percentile results in the so-called min filter,
ˆ
a. f (x, y) median{g(s, t)}
(s,t ) Sxy
ˆ
b. f (x, y) max {g(s, t)}
(s,t ) Sxy
ˆ
c. f (x, y) min {g(s, t)}
(s,t ) Sxy
d. none of above
b. min filter
c. median filter
d. none of above
b. min filter
c. median filter
d. none of above
31.
d. none of above
32.
a. 2-D DFT
b. 1-D DFT
c. 2-D FFT
d. none of above
d. none of above
a. Discrete function with twice the number of nonzero, it‘s Fourier spectrum
b. Discrete function with the number of nonzero, it‘s Fourier spectrum
filtering
c. SEM image of a damaged integrated circuit, result of low-pass filtering
d. none of above
37.
d. none of above
38.
d. none of above
39. ..............can be thought of as one low-pass filtered image minus another low pass filtered
image.
d. none of above
enhancement
d. none of above
d. none of above
d. none of above
44. Given: observation y(m,n) and blurring function h(m,n); Design: g(m,n), such that the
b. Blind deblurring/deconvolution
c. Non-blind blurring/convolution
d. none of above
45. Given: observation y(m,n); Design: g(m,n), such that the distortion between x(m,n)
and is minimized
a. Non-blind deblurring/deconvolution
b. Blind deblurring/deconvolution
c. Non-blind blurring/convolution
d. none of above
Answers-Key Unit-2:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
41 42 43 44 45