VISVODAYA TECHNICAL ACADEMY:KAVALI

OBJECTIVE QUESTIONS

DIGITAL IMAGE PROCESSING

Unit-I

1. Digitization of the spatial co-ordinates (x, y) called [ ]

a) Gray Level quantization b) finite sampling
c) Image sampling d) Image quantization
2. A 128 x 128 Image with 64 gray levels requires ______ bits of storage [ ]
a) 4096 b) 8192
c) 12288 d) 98304
3. 4-neighbors of pixel p is [ ]
a) (X+1, Y) (X,Y+1) (X-1,Y) (X,Y-1) b) (X,Y) (X, Y+1) (X+1) (X,Y-1)
c) (X,Y) (X-1,Y+1) (X+1, Y+1) (X,Y-1) d) (X,Y) (X-1, Y-1) (X+1, Y+1) (X-1, Y+1)
4. The 4-bit diagonal neighbors of p have coordinate [ ]
a) (x+1, y), (x+1, y+1), (x-1, y+1), (x-1,y-1) b) (x, y), (x+1, y-1), (x-1, y+1), (x-1,y-11)
c) (x+1, y+1), (x+1, y-1), (x-1, y+1), (x-1, y-1) d) (x+1, y+1), (x, y), (x-1,y+1) ,(x-1, y-1)
5. A binary relation R over set A is said to be symmetric if for all a, b in A and [ ]
a) b R b implies b R a b) a R b implies a R a
c) a R b implies b R a d) a R a implies a R b
6. The number of bits necessary to represent a 256 x 256 Image with 256 gray levels is [ ]
a) 524288 b) 324288 c) 224288 d) 124288

7. The minimum D4 and D8 distances between the marked pixels 1 and 5 are [ ]

If set V= {1 2 4 5}
a) 3, 5 b) 5, 3 c) 6, 4 d) 4 , 3
8. The number of shades of gray in a six-bit Image is [ ]
a) 256 b) 128 c) 64 d) 32
9. The total number of bits required to represent a 32 x 32 Image with 16 gray levels is [ ]
a) 4096 b) 8192 c) 16777216 d) 131072
 10. A still Image with uniform intensity exhibits [ ]
a) Good spatial redundancy b) poor spatial redundancy
c) Good temporal redundancy d) poor temporal redundancy
11.How many gray levels requires 16, 384 bits of storage for a A 64 x 64 Image. [ ]
a) 4 bits b) 8bits c)2 bits d)16 bits
12. Which of the following is used to joining of objects and components of region in an Image [ ]
a) adjacent b)connectivity c)merging d)linking
13. For coordinate ---------------the 4- diagonal neighbors of p are (2,5),(4,5),(2,3),(4,3). [ ]
a) p (3, 4) b)(4, 3) c)(3, 3) d)(4, 4)
14._______ is the effect caused by the use of an insufficient number of gray levels in smooth areas of a digital
Image. [ ]
A)Zooming b)shrinking c)false contouring d)none
15.__________ is a technique used for reducing the storage required to save an Image. [ ]
a) segmentation b)acquisition c)compression d)enhancement
16 .The Image in which value of each pixel is a single sample, i.e., it carries full information about its intensity
is known as________________ [ ]
A) RGB image B)binary image c)Gray level image d)bilevel image

17. The principle logic operations used in an Image processing are _________ [ ]
a) AND,OR,NOT b)AND,NOT c)OR,NOT d)NOT
18. The elements of a digital Image is referred to as_______________ [ ]
a) pixels b)picture elements c)pels d)all the above
19._____________ are the foundation for representing Images in various degrees of resolution. [ ]

a) wave lets b)fourier transform c)FFT d)IFFT

20. Binary Image is also called as______________. [ ]

a) bilevel image b)RGB image c)gray level image d) monochrome image

21. D4 distance is also called as [ ]

(a) city block distance (b)chess board distance (c)Euclidean distance (d)mean distance
22. Black and white pixels of image are represented in matrix as. [ ]
a) 1 and 2 b) 0 and 1 c) 0 and 2 d) 0 and -1
23. ------ sampling is required in the neighborhood of sharp gray level transition and ------- [ ]
Sampling is used in relatively smooth regions
a) fine,fine b) coarse,coarse c) fine,coarse d) coarse,fine
24 ----- is used to Establishing boundaries of objects and components of regions in an image [ ]
a) connectivity b) morphology c) restoration d) compression
25. For coordinate p(5,5) the 4- neighbors of p are _ _ _ _ _ _ _ _ _ _ [ ]
a) ( 3, 4) ( 4, 8) ( 3, 1) ( 2, 2) b)( 4, 3) ( 4, 2) ( 2,5) ( 2, 3) c)( 5 , 4) (5, 6) ( 4, 5) ( 6, 5)
d) ( 3, 5) ( 3, 3) ( 2, 5) ( 2, 3)
26. De(p,q)=[(x-s)2+(y-t)2]1/2 is the Euclidean _ _ _ _ _ _ _ _ _ _ between _ _ _ _ _ _ _ _ _ _ [ ]
a) distance and p b) speed ,p and q c) speed, q and p d) distance, p and q
27. D(p,q)=|x-s|+|y-t| is called ----------- distance [ ]
a) Euclidian b) D4 c) D8 d) chess-board
28. Number of gray levels present in 8-bit image [ ]
a) 8 b) 32 c) 256 d) 512
29. Two pixels p and q with values from the set of gray level values are four connected , if q is in the set
N4(p) is known as [ ]
a) 8-connectivity b) 4 - adjacent c) 4 - connectivity d) 8- adjacent
30.Two pixels p and q with values from the set of gray-level values are 8-connected, if q is in the set N8( p)is
known as [ ]
a) 8-connectivity b) 4 - adjacent c) 4- connectivity d) 8 -adjacent

UNIT-II

1. Basic transformations are developed to overcome the _ _ _ _ _ _ _ _ _ _ problems [ ]

a) Image rotation, Image scaling, Image translation b) Image acquisition, Image translation
c) Image transition, Image rotation d) Image detection, Image translation
2. Consider 2-FT relationships that constitute a basic link between the spatial and frequency domains. These
relationships called _ _ _ _ _ _ _ _ _ _ and _ _ _ _ _ _ _ [ ]
a) Correlation, spatial convolution b) convolution, correlation
c) Spatial convolution, spatial correlation d) spatial correlation, spatial convolution
3. F (x, y) = 1/N 2 f(x, y) is the average value of the _ _ _ _ _ _ _ _ _ _ discrete function [ ]
a) 2-D b) 3-D
c) 1-D d) n-D
4. The individual periods of the convolution will overlap, a phenomenon commonly [ ]
a) Wrap around b) rounding off
c) Convection d) truncate
5. Application of correlation in Image processing is [ ]
a) Prototype matching, closest match between unknown Image and known Image
b) Prototype matching, no match between unknown Image and known Image
c) Prototype matching, closest match between unknown Image and prototype Image
 d) Match between similar Images
6. The transform which is widely used in Image compression [ ]
a) Fourier transforms b) Hough transform c) DCT d) Haar transform
7. The transform which possesses the highest ‘energy compaction’ property is [ ]
a) Fourier transforms b) Walsh transform c) Slant transform d) KL transform
8. The condition for the transform A to be unitary is (* denotes conjugate and T denotes transpose)
[ ]
a) A-1=AT b) A-1=A*T c) A-1=1/A*T d) A-1=1/ det (A)
9. The logarithm of a Fourier transform is generally termed. [ ]
a) spectrum b) Power spectrum c) Cepstrum d) Energy Spectrum
10. You have an Image f (m,n) . On taking two times the Fourier transform, the result will be[ ]
a) f (2m, 2n) b) f(m/2, n/2) c) 2 f(m, n) d) f(-m, -n)
11. The array formed by Walsh transformation kernel is a _________ matrix having ________ rows
and columns. [ ]
A)symmetric,non orthogonal b) asymmetric,non orthogonal
c) symmetric, orthogonal d) asymmetric, orthogonal
12. The DFT and its _ _ _ _ _ _ _ _ _ _ are periodic with period N. [ ]
a)forward b)inverse c)direct d)indirect
13. The elements of Hadamard matrix are derived from the following. [ ]
A)Walsh transformation b) HAARtransformation C) SLANT transformation D) KL
transformation

14. 2-d Fourier transform of f (x,y). e j2

 (u0 x + v0 y / N)
is [ ]
A) F(u+u0,v-v0) B) F(u-u0,v-v0) C) F(u-u0,v+v0) D) F(u+u0,v+v0)
15. Which of the following form a dual pair [ ]
a)FFT &IFFT B)DFT&IDFT C)STFT&ISTFT D)all the above
16. The Hadamard transform is represented in the form of _________matrices. [ ]
a)NxN b)M X N C)N X M D)none
17. Which of the following is obtained by successive applications of 1-DFT or its inverse. [ ]
a)rotation b)scaling c)separability d)correlations
18. Which of the following Image-processing operation is not commutative? [ ]
a)erosion b)dilation c)scaling d)rotation
19. KL Transform is also called________________ [ ]
A)Walsh transformation b) HAAR transformation C) SLANT transformation D) Hoteling
transformation

20. Expand KL in KL Transform________ [ ]

a) Karhunen loeve b)KILL c)Kaugh loeve d)none.
21)The transform used in JPEG image extension is [ ]
(a) Discrete Cosine Transform (b) Walsh Transform (c) Haar Transform (d) KL Transform

22) The transform whose kernel matrix contains elements which are either +1 or -1 is [ ]
(a) Discrete Cosine Transform (b) Discrete Sine Transform
(c) Hadamard Transform (d) Haar Transform
23. The elements of Hadmard matrix are derived from the [ ]

a. kernel values b. by normalizing the Hadmard matrix c. sequence of that Hadmard columns

d. sequence of that Hadmard rows

24. The array formed by Walsh transformation kernel is a _ _ _ _ _ _ _ _ _ _ _ _ matrix having _ _ _ _ _ _ _ _

_ _ _ _ rows and columns [ ]

a. symmetric, orthogonal b. asymmetric, orthogonal c. symmetric, polygonal d. asymmetric, polygonal

25 The DFT and its inverse are ________________ [ ]

a) equal b) periodic with period N c) proportional d)not have any relation

26. Which one is property of unitary transform [ ]

a) energy conservation and rotation b) energy compaction c) decorrelation d) all of the above

27. _________transform has many desirable properties, which make it optimal in many signal processing
applications.

a)KL b)DFT c)DCT d)none of above

28. The Discrete Fourier transform function is a _ _ _ _ _ _ _ _ _ _ function [ ]

a. continuous b. discrete c. discontinuous d. loop

29. The undesirable checker board effect is produced but reduces the computation in utilization of
________________regions.

a. non overlapping b. overlapping c. opposite d. nearest [ ]

30. Arithmetic and logic operation between pixels are used extensively in most branches of _ _ _ _ _ _ _ _ _ _
a. binary processing b. digital processing c. signal processing d. image processing [ ]