MCQ ON DIGITAL IMAGE PROCESSING by KALAIVANI NAGARAJAN, SATHYA SENTHILNATHAN (e reader manga .TXT) π
THIS BOOK IS ABOUT THE MCQ ON IMAGE ENHANCEMENT TECHNIQUES. FOR EASY UNDERSTANDING OF IMAGE EHNANCEMENT TECHNIQUES THIS MULTI CHOICE QUESTIONS WILL BE HELPFUL.
Read free book Β«MCQ ON DIGITAL IMAGE PROCESSING by KALAIVANI NAGARAJAN, SATHYA SENTHILNATHAN (e reader manga .TXT) πΒ» - read online or download for free at americanlibrarybooks.com
- Author: KALAIVANI NAGARAJAN, SATHYA SENTHILNATHAN
Read book online Β«MCQ ON DIGITAL IMAGE PROCESSING by KALAIVANI NAGARAJAN, SATHYA SENTHILNATHAN (e reader manga .TXT) πΒ». Author - KALAIVANI NAGARAJAN, SATHYA SENTHILNATHAN
DIGITAL IMAGE PROCESSING
MULTI CHOICE QUESTIONS
IMAGE ENHANCEMENT
1. Histogram is technique processed in
intensity domain
frequency domain
spatial domain
undefined domain
C
2. Sum of all components in normalized histogram is equal to
100
2
0
1
D
3. Pixel to pixel movement of center and to define neighborhood is
local histogram processing
equalized histogram processing
normalized histogram processing
global histogram processing
A
4. Local histogram processing deals with
whole image
slices of image
center of image
edges of image
B
5. Digital image with intensity levels in range [0,L-1] is called
k-map
histogram
truth table
graph
B
6. Method generating a processed image having specified histogram is called
histogram enhancement
histogram normalization
histogram equalization
histogram matching
D
7. In expression s = Tr, Tr, in range 0 = < r = < L-1 is the
strictly monotonically increasing function
monotonically increasing function
monotonically decreasing function
strictly monotonically decreasing function
A
8. PDF in histogram equalization stands for
probability dual function
partial density function
parametric density function
probability density function
D
9. Strictly monotonical function guarantee inverse mapping as
dual valued
single valued
multi valued
running sum
B
10. Probability density functions are always
decreasing
increasing
positive
negative
C
11. Image can be blurred using
low pass filter
contouring
erosion
high pass filter
A
12. Image can be sharpened using
low pass filter
contouring
erosion
high pass filter
D
13. High pass filters promotes
low intensity components
mid intensity components
high intensity components
all components
C
14. Low pass filters promotes
low intensity components
mid intensity components
high intensity components
all components
A
15. Smoothing filters are mostly used in
blurring
noise reduction
contrast
Both A and B
D
16. 1024 x 1024 image has resolution of
1048576
1148576
1248576
1348576
A
17. In MxN, M is no of
intensity levels
colors
rows
columns
C
18. Type of zooms are
8
6
4
2
D
19. DPI stands for
dots per image
dots per inches
dots per intensity
diameter per inches
B
20. In MxN, N is no of
intensity levels
colors
rows
columns
D
21. Process involved in linear spatial filtering is
correlation
convolution
histogram equalization
Both A and B
D
22. Fourier transform of unit impulse at origin is
undefined
infinity
1
0
C
23. Sum of cosines and sines coefficient multiplied is
Fourier series
Fourier transform
fast Fourier series
fast Fourier transform
A
24. Fourier transform's domain is
frequency domain
spatial domain
Fourier domain
time domain
A
25. Impulse has property called
rotating property
shifting property
additive property
additive inverse
B
26. A complex number is defined as
c = jI
c = R+jI
c = R
c = R+I
B
27. Name that does not relates to spatial filters
spatial masks
kernels
templates
B
28. Spatial filtering method uses
low pass filter
high pass filter
bandpass filter
spatial filter
D
29. Principle tools used in image processing for a broad spectrum of applications
low pass filtering
intensity filtering
spatial filtering
high pass filtering
C
30. Log transformation is given by formula
s = clog(r)
s = clog(1+r)
s = clog(2+r)
s = log(1+r)
B
31. In formula s = clog(1+r), r ranges
r >= 0
r >= 1
0 >= r
1 >= r
A
32. Giving one period of periodic convolution is called
periodic convolution
aperiodic convolution
correlation
circular convolution
D
33. Forward and inverse Fourier transforms exist for samples having values
integers
infinite
finite
discrete
C
34. Band limited function can be recovered from its samples if acquired samples are at rate twice highest frequency, this theorem is called
sampling theorem
sampling theorem
sampling theorem
sampling theorem
A
35. Any function whose Fourier transform is zero for frequencies outside finite interval is called
high pass function
low pass function
band limited function
band pass function
C
36. Sampled frequency less than nyquist rate is called
under sampling
over sampling
critical sampling
nyquist sampling
A
37. Effect caused by under sampling is called
smoothing
sharpening
summation
aliasing
D
38. Product of two functions in spatial domain is what, in frequency domain
correlation
convolution
Fourier transform
fast Fourier transform
B
39. The principle energy source for images
electrical spectrum
magnetic spectrum
electro spectrum
electro magnetic spectrum
D
40. The most energetic rays of EM energy spectrum
gamma rays
x-rays
ultraviolet rays
visible rays
A
ImprintPublication Date: 06-24-2016
All Rights Reserved
Dedication:
tHIS BOOK IS DEDICATED TO MY GURU, MY COLLEGE AND MY LITTLE DEAR LAKSHITH NIRANJAN AND MY HUSBAND NAGARAJAN FOR THEIR SUPPORT.
Comments (0)