MCQ 2
MCQ 2
which of the following image processing techniques is fast, precise and flexible:
a) Electronic
b) Digital
c) Optical
d) Photographic
Answer: b
3. Define pixel:
a) It is the elements of a digital image
b) It is the elements of an analog image
c) It is the cluster of a digital image
d) It is the cluster of an analog image
Answer: a
4. The range of values, which has spanned by the gray scale is known as:
a) Resonance Range
b) Band Range
c) Peak Range
d) Dynamic Range
Answer: d
9. Identify the correct step being performed before color image processing in image processing:
a) Wavelets
b) Image Enhancement
c) Image Restoration
d) Image Segmentation
Answer: c
14. If L = 2K and total number of levels in an image is 8, what should be the value of K:
a) 4
b) 3
c) 8
d) 6
Answer: b
15. Digital images are displayed as a discrete set of:
a) Intensities
b) Resolution
c) Frequencies
d) Values
Answer: a
18. Number of bits required to encode the pixel value is known as:
a) Pixel
b) Bit Depth
c) Resolution
d) None of above
Answer: b
23. Black and White pixels of an image are represented in an matrix as:
a) 1 and o
b) 1 and -1
c) 1 and 2
d) O and 1
Answer: d
30. If image f(x, y) is sampled so that the result has M rows and N columns. The values of the
coordinates at the origin are (x, y) = (0, 0), then the notation (0, 1) signify:
a) Second sample along first row
b) First sample along second row
c) First sample along first row
d) Second sample along second row
Answer: a
31. 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:
a) 16384
16) 4096
c) 4026
d) 6096
Answer: b
32. Which gives a measure of the degree to which a pure colour is diluted by white light?
a) Saturation
b) Hue
c) Intensity
d) Brightness
Answer: a
33. Pick that step which deals with tools for extracting image components, those are useful in the
representation and description of shape:
a) Segmentation
b) Representation & Description
c) Enhancement
d) Morphological Processing
Answer: d
34. In image processing, which step is responsible for assigning a label to an object based on its
descriptors:
a) Object Recognition
b) Morphological Processing
c) Segmentation
d) Representation & Description
Answer: a
35. Number of rows in digital image is known as:
a) Vertical Resolution
b) Horizontal Resolution
c) Spatial Coordinates
d) None of above
Answer: a
37. How many bits are required in True Color Image to represent all colors:
a) 8-bit
b) 16-bit
c) 24-bit
d) 32-bit
Answer: c
3. The difference between the highest intensity and lowest intensity levels in an image is known as:
a) Saturation
b) Contrast
c) Brightness
d) Noise
Answer: b
6. Dynamic range of imaging system is a ratio where the lower limit is determined by:
a) Brightness
b) Noise
c) Saturation
d) Contrast
Answer: b
8. The section of the real plane spanned by the coordinates of an image is known as:
a) Spatial Domain
b) Coordinate Axes
c) Frequency Domain
d) None of the above
Answer: a
9. The process of using known data to estimate values at unknown locations is known as:
a) Interpolation
b) Acquisition
c) Pixelization
d) Sampling
Answer: a
10. Name the process used on a digital image to alter the values of its individual pixels is:
a) Neighbourhood Operations
b) Image Registration
c) Spatial Transformation
d) Single Pixel Operation
Answer: d
14. Wavelength (n) and frequency (f) are related with speed of light (c) as:
a) c= wavelength / frequency
b) frequency = wavelength /
c) wavelength = c * frequency
d) c = wavelength * frequency
Answer: d
18. In which manner, array operation can be carried out involving one or more images:
a) pixel by pixel
b) column by column
c) row by row
d) array by array
Answer: a
19. Which type of tools are used in performing tasks like zooming, shrinking, rotating images:
a) Sampling
b) Interpolation
c) Filters
d) Quantization
Answer: b
20. The type of Interpolation where for each new location the intensity of the immediate pixel is
assigned:
a) Cubic interpolation
b) Bilinear interpolation
c) Nearest neighbor interpolation
d) Bi-cubic interpolation
Answer: c
21. The ratio of the brightest and the darkest region pixel value is known as:
a) Dynamic Range
b) Focal Length
c) Contrast Ratio
d) None of above
Answer: a
22. The difference in brightness perception between foreground and background objects is known
as:
a) Brightness
b) Contrast
c) Digitization
d) Illumination
Answer: b
24. Type of systems where data processing or reconstruction is required before the image is
reproduced:
a) Direct Imaging System
b) Indirect Imaging System
c) Active Imaging System
d) None of above
Answer: b
25. Name the ratio which defines size of the image to the size of object:
a) Contrast Ratio
b) Sampling
c) Magnification Factor (M)
d) Pixelization Error
Answer: c
28. Lateral inhibition of the cones and rods creates the concept of:
a) Simultaneous Contrast
b) Dynamic Range
c) Brightness Adaptation
d) None of above
Answer: a
7) the process of using known data to estimate values at unknown location is known
as:
ans:- interpolation
10) which effect is caused by the use of an insufficient number of gray levels in
smooth areas of a digital image:
ans:- fale countring
11) in terms of N( number of pixels) and k (L=2^k,L is the grey level) values,
which statement is correct:
ans:- larger values for N and k, implies better picture quality
12) for an image witha large amount of detail, if the value of N (number of pixels)
is fixed then what is the grey level dependency in the perceived quality of this
type of image ?
ans:- nearly independent of the number of gray levels used.
13) which theorem states that " if the function is sampled at a rate equal to or
grater than twice its highest frequency, the original function can be recovered
from its samples" ( for a band limited function):
ans:- shanon sampling theorem.
14) name the effect which corrupts the sampled image, and how does it happen:
ans:- aliasing, if the band-limited functions are under sampled.
21) a pixel p at coordinates (x,y) has neighbors whose coordinates are given by:
(x+1,y), (x-1,y), (x,y+1), (x,y-1) this set of pixels is known as:
ans:- 4-neighbors
22) a pixel p at coordinates (x,y) has neighbors whose coordinates are given by:
(x+1, y+1), (x+1, y-1), (x-1, y+1), (x-1, y-1) this set of pixels is known as:
ans:- diagonal neighbors.
23) for pixels p(x,y), q(s,t) and z(v,w), D is a distance function or metric if:
ans:- D(p,q) >= 0,
D(p,q) = D(q,p) all of above
D(p,z) <= D(p,q) + D(q,z)
24) for pixels p(x,y), q(s,t) the euclidean distance between p and q is defined as:
ans:- D(p,q) = [ (x-s)^2 + (y-t)^2]^1/2
25)for pixels p(x,y), q(s,t), the city-block distnace betwen p and q is:
ans:- D(p,q) = | x-s| + | y-t |
26) for pixels p(x,y), q(s,t), the chessboard distance between p and q is defined
as:
ans:- D(p,q) = max(|x-s| + | y-t |)
27) the domain that refers to image plane itself is knwon as:
ans: spatial domain
28) the domain which deals with fourier transform of an image is knwon as:
ans:- frequency domain
31) if r be the grey-level of image before processing and s after processing then
which of the given expression is used for digital negative transformation:
ans:- s = (L-1) - r
32) if r be the grey-level of image before processing and s after processing then
which of the given expression is used for logarithmic transformation:
ans:- s = c log ( 1 + r ), c is a constant and r >= 0
33) if r be the grey-level of image before processing and s after processing then
which of the given expression is used for power law transformation:
ans: s = cr^gamma, c and gamma are positive constants.
34) pick the appropriate transformation which is particularly well suited for
enhancing an image with white and gray detail embedded in dark regions of the
image, especially when there is more black area in the image.
ans:- negative transformation.
35) for what values of c and gamma power -law tranformation becomes identity
transformation:
ans:- c = 1 and gamma = 1
36) whic of the following transformation is used in cathode ray tube (CRT) devices:
ans:- power-law transformation
38) the power-law transformation is given as: s = cr^gamma. what will happen if the
value of gamma is increased from 0.3 to 0.7:
ans:- the contrast increases and the detail decreases.
1 Gaussian Noise is referred as : Normal noise
3 Name the filter that replaces the pixel value with the medians of intensity level
is known as: Meddian Filter
4 In Geometric Mean Filter when alpha is equal to 1, it works as: Inverse Filter
6 Name the filter which performs opposite operation to Band Reject operation: Band
pass Filter
9 In which type of filter, power spectra and noise of un-degraded image must be
known: Weiner filter
11 Which of the following is not a type of mean filter: Sequence Mean Filter
19 Band Reject filter are used where noise componentes are usually: Known
22 Order Statisics filters are those filters, whose response are based on: Ranking
24 Minimum mean square error filter is also known as: least square error filter
27 Which type of filter replaces the pixel values with minimum values of intensity
levels: Min Filter
28 In witch domain, degraded image is given as: Spatial domain
30 Wich type of filter computes midpoint between min and max value: Mid Point
Filter
32 Which type of filter passes low frequency components: Low Pass Filter
36 Salt and Peeper Noise is also referred to the mentioned term: Spike Noise
37 Constrained Least Square Filter does not implied good in: Optimum Restoration
42 For which type of noise, power spectrum is not constant and is proportionnal to
the frequency (1/f): Pink Noise
43 Which type of noise occurs due to the statistical nature of EM waves: photon
Noise
44 Which of the following filter is not used to remove the periodic noise: High
Pass Filter
v
ideo5mcqi
magecompr
essi
on
1.Di
git
izi
ngt
hei
magei
ntensi
tyampl
i
tudei
sknown
a)Sampl
i
ngb)Quant
izat
ionc)Fr
ami
ngd)Noneofabov
e
Answer
:b
2.Compr
essedi
mageber
ecov
eredbackby
:
a)I
mageCont
rastb)I
mageCompr
essi
onc)I
mageEnhancementd)I
mageDecompr
essi
on
Answer
:d
3.Di
git
alv
ideoi
sasequenceof
:
a)Coor
dinat
esb)Pi
xel
sć)Fr
amesd)Mat
ri
xAnswer
:c
4.I
nfor
mat
ioni
sthe:
a)RawDat
ab)Concr
eteDat
ac)Meani
ngf
ulDat
aNoneofabov
e
Answer
:c
5.Codi
ngr
edundancywor
kson:
a)Coor
dinat
esb)I
ntensi
tyc)Pi
xel
sd)Fr
ames
Answer
:b
6.Sour
ceofCodeassi
gnedi
sknownas:
a)Ni
bbl
eb)By
tec)Codewor
dWor
d
Answer
:c
7.Ev
eryr
unl
engt
hpai
rint
roducesnew:
a)Coor
dinat
esb)I
ntensi
tyc)Pi
xel
sd)Fr
ames
Answer
:b
8.I
fthepi
xel
sar
ereconst
ruct
edwi
thouter
rormappi
ng,
isknownas:
a)Rev
ersi
bleb)I
rr
ever
sibl
ec)Tempor
ald)Facsi
mil
e
Answer
:a
9.I
nthecodi
ngr
edundancyt
echni
que,
wemayuse:
a)Var
iabl
elengt
hCodeb)Fi
xedl
engt
hCodec)Bot
hofabov
ed)Answeri
snotment
ioned
Answer
:c
10.Mor
phol
ogyr
efer
sto:
a)Pi
xel
sb)Fr
amesc)Mat
ri
xd)Shapes
Answer
:d
11.Sav
ingper
cent
agei
sgi
venas:
a)1-
(N2/
N1)b)1+(
N2/
N,)c)1-(
N;/
N2)d)1+(
N1/
N2)
Answer
:a
12.I
nfor
mat
ionpersour
cei
sknownas:
a)Sampl
i
ngb)Quant
izat
ionc)Nor
mal
i
zat
iond)Ent
ropy
Answer
:d
13.I
frangei
sgi
venas[
0,L-
1],
wher
eLi
sthe:
a)Cont
rastb)Br
ight
nessc)No.ofCoor
dinat
esd)No.ofI
ntensi
tyLev
els
Answer
:d
14.Compr
essi
oni
susual
l
ydonef
orsav
ing:
a)Bandwi
dthb)St
oragec)Notr
equi
redd)Bot
haandbopt
ions
Answer
:d
15.Sy
stem ofsy
mbol
stor
epr
esentanev
enti
sknownas:
a)By
teb)Ni
bbl
ec)Coded)Wor
d
Answer
:c
16.Hi
stogr
am Equal
i
zat
ionofani
mager
efer
sas:
a)Sampl
i
ngb)Quant
izat
ionc)Nor
mal
i
zat
iond)Fr
ami
ng
Answer
:c
17.I
nHi
stogr
am equal
i
zat
ionofani
mage,
int
ensi
tychangesar
e:
a)Lowb)Hi
ghc)I
nvi
sibl
ed)Vi
sibl
e
Answer
:d
18.Sour
ceofanev
enti
tsel
fisknownas:
a)Memor
ySour
ceb)Zer
oSour
cee)Zer
oMemor
ySour
ced)Nonzer
oMemor
ySour
ce
Answer
:c
19.Repl
i
cat
ionoft
hepi
xel
sisknownas:
a)Spat
ial
Redundancyb)Tempor
alRedundancyc)Bot
hofabov
ed)Answernotment
ioned
Answer
:c
20.I
nformat
ionwhi
chisignoredbyhumaneyeisknownas:a)Spat
ial
Redundancyb)Tempor
al
Redundancyc)I
rr
elev
antInformat
iond)Codi
ngRedundancy
Answer
:c
21.Whati
sthedat
arat
eatwhi
chusual
l
yint
ernetdel
i
ver
ed:
a)65Kbpsb)56Kbpsc)24Kbpsd)42Kbps
Answer
:b
22.I
nfor
mat
ionl
ostwheni
tisexpr
essedmat
hemat
ical
l
y,knownas:
a)Noi
sel
essTheor
em b)Mar
kovPr
ocessc)Fi
del
i
tyCr
it
eri
ad)Fi
nit
eMemor
ySour
ce
Answer
:c
23.Er
rori
nanyI
magesi
sref
err
edas:
á)Noi
seb)Pi
xel
sc)Coor
dinat
esd)Fr
ames
Answer
:a
24.For
mul
ap,
=n/
MNi
susedt
orepr
esentt
he:
a)Spat
ial
Redundancyb)Tempor
alRedundancyc)I
rr
elev
antI
nfor
mat
iond)Codi
ngRedundancy
Answer
:d
25.I
nthef
ormul
a:1-
(1/
c),
Cisr
efer
redas:
a)Compl
exr
ati
ob)Compr
essi
onr
ati
oc)Const
antd)Condi
ti
on
Answer
:b
26.I
rr
elev
antdat
aissai
das:
a)RawDat
ab)Meani
ngf
ulDat
ac)RedundantDat
ad)Sequent
ial
Dat
a
Answer
:c
27.Namet
het
echni
quewhi
chi
nvol
vesr
educt
ioni
ndat
a:
a)I
mageCompr
essi
onb)I
mageEnhancementc)I
mageRest
orat
iond)I
mageEqual
i
zat
ion
Answer
:a
28.Whi
choft
hef
oll
owi
ngi
snotat
ypeofdat
aredundancy
:
a)Spat
ial
b)Tempor
alc)Facsi
mil
ed)Codi
ng
Answer
:c
29.Redundancyoft
hedat
acanber
epr
esent
edbyt
hef
ormul
a:
a)1-
(1/
C)b)1+(
1/C)c)(
1-1/
C)d)(
1+1/
C)Answer
:a
30.Tr
ansf
ormi
ngt
hedi
ff
erencebet
weenadj
acentpi
xel
sisknownas:
a)Equal
i
zat
ionb)Mappi
ngc)Speci
fi
cat
iond)Compr
essi
on
Answer
:b
31.Si
mpl
estwayofcompr
essi
oni
sremov
ing:
a)I
nfor
mat
ionb)Dat
ac)Super
fl
uousDat
ad)Meani
ngf
ulDat
a
Answer
:c
32.Pr
ocessofi
nser
ti
ngdat
aont
hei
magei
sknownas:
a)Equal
i
zat
ionb)Wat
ermar
kingc)Compr
essi
ond)Enhancement
Answer
:b
33.Shannon'
sTheor
em i
sal
soknownas:
a)CodingTheorem b)Noi
syCodi
ngTheor
em c)Noi
sel
essCodi
ngTheor
em d)Noi
sel
ess
ChannelTheor
em
Answer
:c
34.Forwhi
cht
ypeofoper
ati
on,
Encoderi
sused:
a)Equal
i
zat
ionb)Wat
ermar
kinge)Compr
essi
onEnhancement
Answer
:c
35.Namet
het
ypeofcodi
ngt
hati
sbasedont
heent
ropyoft
hesour
ce:
a)Huf
fmanCodi
ng)Ent
ropyCodi
ngc)Lossl
essCompr
essi
ond)LossyCompr
essi
on
Answer
:b
36.Namet
het
ypeofcodi
ngt
hati
sbasedont
hepr
edi
cti
onoft
hesubsequentdat
a:
a)Huf
fmanCodi
ngb)Ent
ropyCodi
ngC)Pr
edi
cti
veCodi
ngd)Pr
ogr
essi
veCodi
ng
Answer
:c
37.Namet
hepr
ocessofgr
adual
compr
essi
onf
oll
owi
nganunder
li
neor
derofpr
ior
it
y:
a)Huf
fmanCodi
ngb)Ent
ropyCodi
ngc)Pr
edi
cti
veCodi
ngd)Pr
ogr
essi
veCodi
ng
Answer
:d
38.Mat
hemat
ical
model
oft
hehumanaudi
tor
ysy
stem i
sknownas:
a)Compr
essi
onModel
b)Lossl
essModel
c)Mar
kovModel
d)Psy
choacoust
icModel
Answer
:d
39.Namet
het
ypeofcodi
ngt
hati
sbasedonmat
hemat
ical
transf
orms:
a)Tr
ansf
orm Codi
ngb)Ent
ropyCodi
ngc)Pr
edi
cti
veCodi
ngd)Pr
ogr
essi
veCodi
ng
Answer
:a
40.Namet
het
ypeofcodi
ngt
hati
sbasedonbl
ocksofdat
a:
a)Tr
ansf
orm Codi
ngb)Ent
ropyCodi
ngc)Vect
orQuant
izat
iond)Pr
ogr
essi
veCodi
ng
Answer
:c
41.Namethecompressi
onalgor
it
hm t
hatpreser
vesdat
awit
hnolossofinf
ormat
ion:a)
Lossl
essCompressi
onb)LossyCompressi
onc)Entr
opyCompr
essiond)Noneofabove
Answer
:a
42.Whi
cht
ypeofcodi
ngal
gor
it
hm usessi
ngl
ecodewor
dforast
ri
ngofchar
act
ers:
a)Tr
ansf
orm Codi
ngb)Ar
it
hmet
icCodi
ngc)Pr
edi
cti
veCodi
ngd)Pr
ogr
essi
veCodi
ngAnswer
:b
43.Whichty
peofcodi
ngprocessi
nvol
vesmul
ti
ply
ingeacht
ransf
orm coef
fi
cientbyt
he
corr
espondi
ngel
ementinz
onal mask:
a)Tr
ansf
orm Codi
ngb)Ar
it
hmet
icCodi
ngc)Pr
edi
cti
veCodi
ngd)Zonal
Codi
ng
Answer
:d
44.Whi
choft
hef
oll
owi
ngcodi
ngt
echni
quei
sav
ari
abl
elengt
hcodi
ng:
a)Huf
fmanCodi
ngb)Zonal
Codi
ngc)Pr
edi
cti
veCodi
ngd)Pr
ogr
essi
veCodi
ng
Answer
:a
45.Namet
hecompr
essi
onal
gor
it
hm t
hati
ncurdat
alossi
.e.accept
abl
etot
hehumanobser
ver
:
a)Lossl
essCompr
essi
on)LossyCompr
essi
onc)Ent
ropyCompr
essi
ond)Noneofabov
e
Answer
:b
46.Howmanyt
ypesofr
edundancyexi
st:
a)3b)4c)5d)6
Answer
:b
v
ideo6i
magesegment
ati
on
1.Segment
ati
oni
susual
l
ynotper
fectbecauseofnumberoff
act
orsl
i
ke:
a)Noi
seandBadill
umi
nat
ionb)Duet
oboundar
y-f
il
li
ngc)Duet
ocl
osedcont
ourd)Obj
ect
Cont
ainsev
eral
regi
on
Answer
:a
2.Whatar
ethet
woappr
oachesofi
magesegment
ati
on?
a)Haar
-l
ikefeat
ure&3-Drectangleappr
oachb)Regi
onbasedsegment
ati
on&edge
segment
ationc)Adaboostapproach&edgesegmentat
iond)Noneoft
heabov
e
Answer
:b
3.Whi
cht
echni
quei
sappl
i
edf
orEdgesegment
ati
on:
a)Heur
ist
icsoper
atorb)Cannyoper
atorc)Bot
hoft
heabov
ed)Noneoft
heabov
e
Answer
:c
4.Whati
stheCr
it
eri
aforr
egi
onsegment
ati
on:
a)Pi
xel
smaybeassi
gnedtothesameregionb)Pi
xel
smaybeassi
gnedt
othedi
ff
erentr
egi
on
c)Bot
hoft
heaboved)Noneoftheabove
Answer
:a
5.Nameoft
echniquewher
epi
xel
sar
eal
l
ocat
edt
ocat
egor
iesaccor
dingt
other
angeofv
alues
i
nwhichapi
xell
ies:
a)Thr
eshol
dingbasedsegmentat
ionb)Edge-basedsegment
ati
onc)Regi
onbased
segment
ati
ond)Noneoft heabove
Answer
:a
6.Edgeel
ementi sassoci
atedwit
hwhichcomponent
s:a)Magni
tudeoft
hegr
adi
entb)Regi
on
ofthegr
adientc)Bothoftheaboved)Noneoft
heaboveAnswer:a
7.Lapl
aci
aniswhi
chtypeofoperat
or:a)Fi
rstor
derder
ivat
ivef
il
terb)Secondor
derder
ivat
ive
fi
lt
erc)Sobel
oper
atord)Cannyoperat
orAnswer:b
8.Agradientoper
atorf
oredgedetect
ioni
sfa)Rober
tsb)Zer
ocr
ossi
ngoper
atorc)Second
orderder
ivati
ved)NoneAnswer:a
9.Imagesegment
ationist
heprocessof:Ja)Par
ti
ti
oni
ngdi
git
ali
mageint
omulti
plesegmentb)
Classi
fyt
heimageintonumberofobject
sc)Compressi
ngt
heimaged)Noneoftheabove
Answer:a
10.Thr
eshol
dbasedsegmentat
ioni
sbasedon:
a)Numberofcl
ust
ers)Cl
i
plev
elc)Numberof
regi
onsd)NumberofCoor
dinat
esAnswer:
b
11.Whi
chsegment
ati
ont
echni
quei
sbasedoncl
ust
eri
ngappr
oaches?
a)K-meansalgori
thm b)Threshol
dbasedal
gor
it
hm c)Edgedet
ect
ionbasedal
gor
it
hm d)
Hist
ogram basedalgori
thm
Answer
:a
12.I
nhi
stogr
am basedsegment
ati
on,
measur
ementi
sdonef
or:
a)Col
orori
ntensi
tyofobj
ect
sb)Regi
onofobj
ect
sc)Reduci
ngobj
ect
sd)Noneoft
heabov
e
Answer
:a
13.Zer
ocr
ossi
ngoper
atoruset
hef
oll
owi
ng:
a)Fi
rstder
ivat
iveb)Secondder
ivat
ivec)Sobel
oper
atord)Noneoft
heabov
e
Answer
:b
14.Whi
cht
ypeofoper
atori
susedbyCl
assi
cal
edgedet
ect
ors:
a)Pr
ewi
ttoper
atorRober
toper
atorc)Gaussi
anoper
atord)Thr
eshol
doper
ator
Answer
:a
15.Sobel
edgedet
ect
ionuses:
a)Fi
rstder
ivat
iveb)Secondder
ivat
ivec)Rober
toper
atord)Noneoft
heabov
e
Answer
:a
16.Adv
ant
agesofcannyoper
atori
s:
a)Si
mpli
cit
yofthemethodb)Perf
ormancegood,
Usi
ngpr
obabi
l
ityf
orf
indi
nger
rorr
atec)
Impr
ovedPerf
ormanced)All
oftheabove
Answer
:b
17.Onwhi
chpr
oper
ti
es,
Grayl
evel
imagesegment
ati
oni
sbasedon:
a)Di
scont
inui
tyandsi
mil
ari
tyb)Cont
inui
tyandsi
mil
ari
tyc)Onl
ysi
mil
ari
tyd)Onl
yCont
inui
ty
Answer
:a
18.Edgebasedsegment
ati
onal
gor
it
hm i
susi
ng:
a)Discont
inui
tyandsi
mil
ari
tyb)Thr
eshol
dval
uec)Cont
inui
tyandsi
mil
ari
tyd)Edgel
i
nki
ngand
boundary
Answer
:d
19.Gr
eyl
evel
thr
eshol
dingi
sagener
ali
zat
ionof
:
a)Edgedet
ect
ionb)Bi
nar
ythr
eshol
dingc)Bot
hoft
heabov
ed)Noneoft
heabov
e
Answer
:b
20.Regi
ongr
owi
ngi
swhi
cht
ypeofi
magesegment
ati
onappr
oach:
a)bot
tom-
upb)Topdownc)Spl
i
tti
ngd)Noneoft
heabov
e
Answer
:a
21.Whati
sthedat
arat
eatwhi
chusual
l
yint
ernetdel
i
ver
ed:
a)65Kbpsb)56Kbpsc)24Kbpsd)42Kbps
Answer
:b
22.I
nfor
mat
ionl
ostwheni
tisexpr
essedmat
hemat
ical
l
y,knownas:
a)Noi
sel
essTheor
em b)Mar
kovPr
ocessc)Fi
del
i
tyCr
it
eri
ad)Fi
nit
eMemor
ySour
ce
Answer
:c
23.Pi
ckt
hecor
rectexampl
eofEdgeDet
ect
ionMet
hod:
a)Neural
Net worksSegmentat
ion6)Wat
ershedTr
ansf
ormat
ionc)Mul
ti
-scal
eSegment
ati
ond)
GraphPart
it
ioningMethods
Answer
:b
24.Whi
choft
hef
oll
owi
ngi
sanexampl
eofRegi
onGr
owi
ngMet
hod:
a)LevelSetMet
hodsb)Gr
aphPar
ti
ti
oni
ngMet
hodsc)Wat
ershedTr
ansf
ormat
iond)Neur
al
NetworksSegment
ati
on
Answer
:d
25.Di
git
alf
unct
ionder
ivat
ivesar
edef
inedas:
a)Addi
ti
onb)Mul
ti
pli
cat
ionc)Di
vi
siond)Di
ff
erences
Answer
:d
26.Forl
i
nedet
ect
ion,
whi
cht
ypeofmaski
sused:
a)Lapl
aci
anb)Gaussi
anc)I
deal
d)But
ter
wor
th
Answer
:a
27.Gr
adi
entcomput
ati
onequat
ioncanbewr
it
tenas:
a)I
G,I+|
G|b)I
G,I-I
G,Ic)I
G,I/I
G,Id)I
G,IxI
G,I
Answer
:a
28.Forf
indi
nghor
izont
all
i
nes,
whi
choft
hef
oll
owi
ngmaskv
aluesi
sused:
´
a)[
-1-
1-1;
222;
-1-
1-1]b)[
2-1-
1;-
12-
1;-
1-12]c)[
-12-
1;-
12-
1;-
12-
1]d)[
-1-
12;
-12-
1;2-
1-
1]
Answer
:a
29.I
ftheobj
ecti
nnerr
egi
oni
stext
ured,
whi
choft
hef
oll
owi
ngappr
oachcanbeused:
a)Si
mil
ari
tyb)Di
scont
inui
tyc)Ext
ract
iond)Recogni
ti
on
Answer
:a
30.Thehor
izont
algr
adi
entpi
xel
sar
edenot
edby
:
a)Gyb)Gxc)Gd)G,
Answer
:b
31.Accor
dingt
ofi
rstder
ivat
iveappr
oxi
mat
ion,
val
uesofconst
anti
ntensi
ti
esmustbe:
a)Posi
ti
veb)Negat
ivec)Oned)Zer
o
Answer
:d
32.Forf
indi
ngl
i
neatangl
e45°,
whi
choft
hef
oll
owi
ngmaskofv
aluesi
sused:
a)[
-1-
1-1;
222;
-1-
1-1]b)[
2-1-
1;-
12-
1;-
1-12]c)[
-12-
1;-
12-
1;-
12d)[
-1-
12;
-12-
1;2-
1-1]
Answer
:b
33.Accor
dingt
osecondder
ivat
iveappr
oxi
mat
ion,
val
uesal
ongt
her
ampmustbe:
a)Posi
ti
veb)Negat
ivec)Oned)NonZer
o
Answer
:d
34.Gr
adi
entmagni
tudei
magesar
emostusef
uli
n:
a)Poi
ntDet
ect
ionb)Li
neDet
ect
ion)EdgeDet
ect
iond)Ar
eaDet
ect
ion
Answer
:c
35.I
mageswhi
char
ehav
inggr
adi
entpi
xel
sar
eknownas:
a)Bi
nar
yImageb)Shar
pImagec)Bl
urI
maged)Gr
adi
entI
mage
Answer
:d
36.I
nlapl
aci
ani
mages,
li
ghtshadesofgr
eyl
evel
isr
epr
esent
edby
:
a)Posi
ti
veb)Negat
ivec)OneZer
o
Answer
:a
37.Whi
choft
hef
oll
owi
ngoper
ati
oni
susedf
ornoi
ser
educt
ion:
a)I
mageEnhancementb)I
mageRecogni
ti
onc)I
mageSmoot
hingd)I
mageCont
our
ing
Answer
:c
38.Tr
ansi
ti
onbet
weenobj
ect
sandbackgr
oundsshows:
a)RampEdgesb)St
epEdgesc)Shar
pEdgesd)Bot
hRampandSt
epEdges
Answer
:d
39.St
epedget
ransi
ti
oni
sbet
weenpi
xel
sov
ert
hedi
stanceof
:
a)4Pi
xel
sb)3Pi
xel
sc)2Pi
xel
sd)1Pi
xel
Answer
:d
40.Sobel
gradi
enti
snotgoodf
ort
hedet
ect
ionof
:
a)Edgesb)Hor
izont
alLi
nesc)Ver
ti
cal
Linesd)Di
agonal
Lines
Answer
:d
41.Comput
ati
onofder
ivat
ivesi
nsegment
ati
oni
sal
soknownas:
a)LowPassFi
l
ter
ingb)Hi
ghPassFi
l
ter
ingc)Spat
ial
Fil
ter
ingd)Fr
equencyFi
l
ter
ingAnswer
:c
42.Model
ofl
i
nest
hroughr
egi
oni
sknownas:
a)RampEdgesb)St
epEdgesc)Shar
pEdgesd)RoofEdges
Answer
:d
43.Av
eragi
ngi
sanal
ogoust
o:
a)Di
ff
erent
iat
ionb)I
ntegr
ati
onc)Addi
ti
ond)Der
ivat
ion
Answer
:b
44.i
nimagesegment
ati
on,
subdi
vi
siondependsupon:
a)Obj
ectb)Par
ti
ti
onc)Li
nesd)Pr
obl
em
Answer
:d
45.Di
scont
inui
tyappr
oachofsegment
ati
ondependsupon:
a)LowFr
equencyb)Abr
uptChangec)Smoot
hChangesd)Cont
rast
Answer
:b
46.Twor
egi
onsar
esai
dtobeadj
acenti
fthei
runi
onf
orms:
a)I
mageb)Regi
onc)Boundar
iesd)Connect
edSet
Answer
:d
47.I
nwhi
chy
earSobel
oper
atorwasi
ntr
oduced:
a)1970b)1980c)1972d)1982
Answer
:a
48.Forwhi
chpar
ti
cul
aroper
ati
oni
nani
mage,
Sobel
oper
atori
sbet
tert
hanPr
ewi
ttoper
ator
:
a)Shar
peni
ngb)Smoot
hingc)Bl
urr
ingd)Cont
rast
Answer
:b
49.Mar
rhi
l
dret
hmet
hodwasi
ntr
oducedf
or:
a)Shar
peni
ngb)Edgef
indi
ngc)Segment
ati
ond)Recogni
ti
on
Answer
:b
50.Fordi
agonal
edgedet
ect
ion,
whi
cht
ypeofmaski
sused:
a)1DMask6)2DMaskc)3DMaskd)4DMask
Answer
:b
1.The histogram of a digital image with gray levels in the range (O, L-1] is represented by a
discrete function:
a) pirk)=nk
b) h(r=nk
c) hírk)=n/nk
d) h(rk)=n/n
Answer: b
2.Which of the following expression is used to represent for the normalized histogram:
a) pirk)=nk
b) p(x)=nk
c) pork )=n/ng
d) plrk )=nx/n
Answer: d
Answer: c
Answer: b
5.What is the method that is used to generate a processed image that have a specified
histogram:
a) Histogram linearization
b) Histogram equalization
c) Histogram specification
d) Histogram processing
Answer: c
6. In case of dark image, the components of histogram are concentrated on which side of
the grey scale:
a) High
b) Low
c) Middle
d) None of the above
Answer: b
Answer: c
8. In which of the image, components of histogram are concentrated on the low side on
intensity scale:
a) Bright
b) Dark
c) Colorful
d) None of the above
Answer: b
Answer: c
Answer: a
11.
Histogram Equalization is commonly used for:
a) Image enhancement
b) Blurring
c) Contrast adjustment
d) None of the above
Answer: a
12.
The type of Histogram Processing in which pixels are modified based on the intensity
distribution of the image is known as:
a) Intensive
b) Local
c) Global
d) Random
Answer: c
13.Which type of Histogram Processing is best suited for minute detailed enhancements:
a) Local
b) Intensive
c) Global
d) Random
Answer: a
Answer: b
15. A bright image will have what kind of histogram when, the histogram, h(r) = nk, rk the kth
gray level and nk total pixels with gray level rk, is plotted nk versus rk:
a) concentrated on the dark side of gray scale
b) whose component are biased toward high side of gray scale
c) narrow and centered toward the middle of gray scale
d) covers wide range of gray scale and the distribution of pixel is approximately uniform
Answer: b
16. A low contrast image will have what kind of histogram when, the histogram, hark) = nk,
rk the kth gray level and nk total pixels with gray level rk, is plotted nk versus rk:
a) concentrated on the dark side of gray scale
b) whose component are biased toward high side of gray scale
c) narrow and centered toward the middle of gray scale
d) covers wide range of gray scale and the distribution of pixel is approximately uniform
Answer: c
17. If h(rk) = nk, rk the kth gray level and nk total pixels with gray level rk, is a
histogram in gray level range [0, L-1). Then how normalization of histogram is done:
a) pink)=nk+n
b) pirk=nk-n
c) p(x)=nk*n
d) p(x)=nk/n
Answer: b
18. The transformation T (rk) = 5*{j=0) nj /n, k = 0,1, 2, ..., L-1, where L is max gray value
possible and rk is the kth gray level, is known as:
a) Histogram specification
6) Histogram equalization
c) Histogram sliding
d) None of the above
Answer:d
19. Inverse transformation plays an important role in which of the following Histogram
processing Techniques:
a) Histogram Linearization
b) Histogram Equalization
VC) Histogram Matching
d) None of the mentioned
Answer: c
20. In Histogram specification r and z are gray level of input and output image and p stands
for PDF, then, what does pz(z) stands for:
a) Specific probability density function
b) Specified pixel distribution function
c) Specific pixel density function
a) Specified probability density function
Answer:d
Answer:d
22. In terms of enhancement, what does mean and variance refers to:
a) Average contrast and average gray level respectively
b) Average gray level and average contrast respectively
c) Average gray level in both
d) Average contrast in both
Answer: b
23. Which type of operation normalizes pixel values to their average value to improve the
image quality:
a) Histogram Normalization
b) Histogram Specification
c) Histogram Matching
d) None of the above
Answer: a
24. Which type of operation is used to spread the histogram to cover the entire dynamic
range without changing the shape of the histogram:
a) Histogram Normalization
b) Histogram Specification
c) Histogram Stretching
d) None of the above
Answer:c
Answer: d
Answer: a
1.
The spatial coordinates of a digital image (x,y) are proportional to:
A. Position
B. Brightness
C. Contrast
D. Noise
2.
An image is considered to be a function of a(x,y), where a represents:
A. Height of image
B. Width of image
C. Amplitude of image
D. Resolution of image
3.
What is pixel?
A. Pixel is the elements of a digital image
B. Pixel is the elements of an analog image
C. Pixel is the cluster of a digital image
D. Pixel is the cluster of an analog image
4.
The range of values spanned by the gray scale is called:
A. Dynamic range
B. Band range
C. Peak range
D. Resolution range
5.
Which is a colour attribute that describes a pure colour?
A. Saturation
B. Hue
C. Brightness
D. Intensity
6.
A typical size comparable in quality to monochrome TV image is of size:
A. 256 x 256
B. 512 X 512
C. 1920 x 1080
D. 1080 x 1080
7.
The number of grey values are integer power of:
A. 4
B. 8
c. 2
D. 1
8.
What is the first and foremost step in image processing:
A. Image restoration
B. Image enhancement
C. Image acquisition
D. Segmentation
9.
What is the next step in image processing after compression?
A. Wavelets
B. Segmentation
C. Representation and description
D. Morphological processing
10.
How many number of steps are involved in image processing?
A. 10
B. 9
C. 11
D. 12
11.
A continuous image is digitized at points:
A. Random
B. Vertex
C. Contour
D. Sampling
12.
The transmission between continuous values of the image function and its digital equivalent is
called is ______.
a) Quantization
b) Sampling
c) Rasterization
d) None of the mentioned
13.
What is the equation used to obtain I (intensity) component of each RGB pixel in RGB color
format?
A. I= 1/2 (R+G+B)
B. I=1/3 (R+G+B)
C. I=1/3 (R-G-B)
D. I=1/3 (R-G+B)
14.
How many bit RGB color image is represented by full color image?
A. 32-bit RGB color image
B. 24-bit RGB color image
C. 16-bit RGB color image
D. 8-bit RGB color image
15.
The mask shown in the figure below belongs to which type of filter?
A. Sharpening spatial filter
B. Median filter
C. Smoothing spatial filter
D. Sharpening frequency filter
16.
Which of the following is the primary objective of sharpening of an image?
A. Blurring the image
B. Highlight fine details in the image
C. Increase the brightness of the image
D. Decrease the brightness of the image
17.
If f(x,y) is an image function of two variables, then the first order derivative of a one dimensional
function, f(x) is:
A. f(x+1)-f(x)
B. f(x)-f(x+1)
C. f(x-1)-f(x+1)
D. f(x) + f(x-1)
18.
Which of the following is a second order derivative operator:
A. Histogram
B. Laplacian
C. Gaussian
D. None of the above
19.
_______ is used to detect diseases such as bone infection and tumors:
A. MRI Scan
B. PET Scan
C. Nuclear Whole Body Scan
D. X-Ray
20.
How is the expression represented for the normalized histogram?
A. P(rk) = nk
B. P(rk) = nk/n
C. P(rk) = nnk
D. P(rk) = n/nk
21.
Which of the following conditions does the (Tr) must satisfy:
A. T(r) is doubled-valued and monotonically decreasing in the interval 0≤r≤1; and 0≤ T(r) ≤1 for
0≤r≤1
B. T(r) is doubled-valued and monotonically increasing in the interval 0≤r≤1; and 0≤ T(r) ≤1 for
0≤r≤1
C. T(r) is single-valued and monotonically decreasing in the interval 0≤r≤1; and 0≤ T(r) ≤1 for
0≤r≤1
D. T(r) is single-valued and monotonically increasing in the interval 0≤r≤1; and 0≤ T(r) ≤1 for 0≤r≤1
22.
What is the method that is used to generate a processed image that have a specified histogram?
A. Histogram Linearization
B. Histogram equalization
C. Histogram matching
D. Histogram processing
23.
In _____ image we notice that the components of histogram are concentrated on the low side
on intensity scale:
A. Bright
B. Dark
C. Colorful
D. All the mentioned
24.
What is histogram equalization also called as?
A. Histogram matching
B. Image enhancement
C. Histogram linearization
D. None of the mentioned
25.
The output of a smoothing, linear spatial filter is a of the pixels contained in the neighborhood of
the filter mask:
A. Sum
B. Product
C. Average
D. Dot Product
26.
What is/are the resultant image of a smoothing filter?
A. Image with high sharp transitions in gray levels
B. Image with reduced sharp transitions in gray levels
C. All of the mentioned
D. None of the mentioned
27.
What is/are the resultant image of a smoothing filter?
A. Image with high sharp transitions in gray levels
B. Image with reduced sharp transitions in gray levels
C. All of the mentioned
D. None of the mentioned
28.
Smoothing filter is used for which of the following work(s)?
A. Blurring
B. Noise reduction
c. All of the mentioned
D. None of the mentioned
29.
Principle sources of noise arise during image:
A. Destruction
B. Degradation
C. Restoration
D. acquisition
30.
Salt and pepper noise is also known as:
A. Rayleigh noise
B. Impulse noise
C. Black noise
D. Exponential noise
31.
PDF in image processing is called:
A. Probability Degradation Function
B. Probability Density Function
C. Probability Degraded Function
D. None of the above
32.
Degraded noise is produced using degradation process and
A. Additive noise
B. Destruction
C. Pixels
D. Coordinates
33.
Gaussian noise is referred to as:
A. Red Noise
B. Black Noise
C. White Noise
D. Normal Noise
34.
If degradation function is unity the equation for degradation function will be?
A. g(x,y)=h(x,y) * f(x,y) + n(x,y)
B. g(x,y) = f(x,y) + n(x,y)
C. g(x,y) = n(x,y)
D. g(x,y) = f(x,y)
35.
Which image is not known as mean filter?
A. Athematic mean filter
B. Contra harmonic mean filter
C. Median filter
D. Geometric mean filter
36.
B. g(x,y)=f(x,y) + n(x,y)
C. g(x,y)=h(x,y) + n(x,y)
D. g(x,y)=f(x,y) + n(x,y)
Answer: A
37.
c. Wiener filtering
D. Mean filtering
Answer :c
38.
A. Notch filter
C. Wiener filter
D. Inverse filter
Answer: D
39.
filter is called:
D. Max. Filter
Answer:B
40.
A. Degraded image
B. Original image
C. Restored Image
D. Plan
Answer: C
41.
Answer: D
42.
A. Variance
B. Noise
C. Restoration
D. Power
Answer: A
43.
A. Erosion
B. Dilation
C. Set theory
D. Both A and B
Answer:D
44.
A. Opening
B. Closing
C. Blurring
D. Translation
Answer: B
45.
A. Pixels
B. Lines
C. Contour
D. Boundary
Answer : c
46.
A. Top left
B. Top right
C. Center
D. Bottom left
Answer: c
47.
a) Thinner
b) Shrinked
c) Thickened
d) Sharpened.
Answer: C
48.
A. Erosion
B. Dilation
C. Opening
D. Closing
Answer: A
49.
C. Watershed Transformation
D. Multi-scale Segmentation
Answer : c
50.
Answer: B
51.
A. Bottom up
B. Top down
Answer : A
52.
C. Watershed Transformations
Answer: D
53.
B. Threshold value
Answer: D
54.
Answer: A
55.
A. Prewitt operator
B. Robertoperator
C. Threshold operator
D. Gaussian operator
Answer : A
56.
C. Only similarity
Answer: A
57.
by:
A. Image enhancement
B. Image decompression
C. Image contrast
D. Image equalization
Answer: B
58.
A. Encoder
B. Decoder
C. Frames
D. Both A and B
Answer: D
59.
occur?
A. Roots
B Leaves
C. Leaf sub trees
Answer: B
60.
From the following given tree, what is the code word for the character 'a':
A. 011
B. 101
C. 100
D. 101
Answer: A
61.
A. Music
B. Pictures
C. Images
D. Frames
Answer :c
62.
Moving Picture Experts Group (MPEG-2), was designed for high quality DVD with a data rate of:
A. 3 to 6 Mbps
B. 4 to 6 Mbps
C. 5 to 6 Mbps
D. 6 to 6 Mbps
Answer: A
63.
A.000030032232221211
B. 003010203310321032
C. 022332103210201330
D. 012302301023100321
Answer: A
64.
In Audio and Video Compression, each frame is divided into small grids, called picture elements or:
A. Frames
B. Packets
C. Pixels
D. Mega Pixels
Answer : c
65
A. Objects
B. Activities
C. Motion
Answer : D
66.
A. 3A2B1C4D
B. 3A1B1C4D
C. 2A2B1C4D
D. 4D1C2B3A
Answer: A
67.
Which of the following measure are not used to describe a region?
Answer: C
68.
What is the study of properties of a figure that are unaffected by any deformation?
A. Topology
B. Geography
C. Statistics
D. Deformation
Answer: A
69.
shown below:
A. O
B. 1
C. 2
D. -1
Answer : D
70.
What is the Euler number of the region shown in the figure below?
A. 1
B. -2
C. -1
D. 2
Answer : B