Professional Documents
Culture Documents
discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/259294678
READS
7,266
1 author:
mahendra Kumar
MI Research Lab & MI GATE Center, Kota (Raj.
50 PUBLICATIONS 54 CITATIONS
SEE PROFILE
c) a & b
d) none of these
6. First application of digital image was in the:
a) News paper industry
b) communication system
c) a & b
d) None of these
7. The process of extracting information from the image is called as
a) Image enhancement
b) Image restoration
c) Image Analysis
d) Image compression
8. Among the following image processing techniques which is fast, precise and flexible
a) optical
b) digital
c) electronic
d) photographic
9. 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
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 pixels 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
13. Which image processing technique is used to eliminate electronic noise by mathematical
process?
a) Frame averaging
b) Image understanding
c) Image compression
d) none
14. The amount of noise decreases by of number of frames averaged
a) division
b) square root
c) linear
d) none
15. Dilation-Morphological image operation technique is used to
a) shrink brighter areas of the image
b) diminishes intensity variation over the image
c) expands brighter areas of the image
d) scales pixel intensity uniformly
16. Image compression is
a) making image look better
b) sharpening the intensity-transition regions
c) minimizing degradation over image
d) reducing the redundancy of the image data
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
20. What algorithm is used in fingerprint technology
a) Intensity based algorithm
b) pattern based algorithm
c) feature based algorithm
d) Recognition algorithm
21. Which technique turns the unique lines, patterns, and spots apparent in a persons 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
23. Select one of the most appropriate application of Computer vision?
a) medical computer imaging
b) remote sensing
c) geographical map
d) medical diagnosis
24. What does SDR stands for?
a) standard dynamic range
b) Software defined radio
c) Session directory
d) System design view
25. Which software has a built in face recoginition system ?
a) Googles picasa digital image orgranizer
b) Apple iphotos organizer
c) PMB
d) Sonys photo organizer
26. Which device is used to capture the fingerprint pattern?
a) Capture device
b) Fingerprint sensor
c) 2d sensor
d) digital sensor
27. An image is converted to two-dimensional matrix of pixel values by
a) pixel grabber
b) bough transform
c) masking
d) none
28. _____ is the most reliable and accurate biometric identification technique.
a) Computer vision
b) Iris recognition
c) Medical imaging
d) Remote sensing
29. A biometrics may be
a) fingerprint images
b) satellite images
c) computer vision
d) none
30. The initial step in any image processing technique is
a) segmentation
b) masking
c) image acquisition
d) normalization
31. The identification technique using voice, keystroke, gait etc. are included in
a) image enhancement
b) behavioral biometrics
c) face recognition
d) physical biometrics
32. Which of the following steps are included in iris segmentation?
a) image acquisition
b) iris normalization
c) iris localization
d) code generation
33. Localization of iris, pupil, eyelids come under
a) normalization
b) masking
c) extraction
d) segmentation
34. Verification using genetic algorithm and back propagation is done in
a) iris recognition
b) face detection
c) fingerprint identification
d) none
35. The dominant application of imaging in the microwave band is:
a) Radar
b) satellite
c) communication
d) None
36. Whats recognition?
a) Its the process that assigns a label to an object based on its descriptors.
b) its process of search a image
c) a & b
d) None
37. Morphological processing deals:
a. with tools for extracting image components that are useful in the representation and
description of shape.
b. with tools for changes in image components that are useful in the representation and
description of shape.
c) a & b
d) None
38. What is digitizer?
a. its a device for converting the output of the physical sensing device into digital form.
b. its a device for converting the output of the physical sensing device into analog form.
c) a & b
d) None
39. What is brightness adaption?
a. For a given set of conditions, the current sensitivity level of the visual system.
b. For a given set of conditions, the current sensitivity level of the in-visual system.
c) a & b
d) None
40. What is spatial resolution?
a. its the largest discernible detail in an image.
b. its the smallest discernible detail in an image.
c) a & b
d) None
41. The spatial domain refers:
a. to the image plane itself, and approaches in this category are based on indirect manipulation of
pixels in an image.
b. to the image plane itself, and approaches in this category are based on direct manipulation of
pixels in an image.
c) a & b
d) None
42. Frequency domain refers:
a. its processing techniques are based on modifying the Fourier transform of an image.
b. its processing techniques are based on modifying the laplace transform of an image.
c) a & b
d) None
43. Image negatives a gray level transformation is defined as:
a. s=L-1-r
b. s=L-r
c. s=r-1-L
d. none
Answers-Key Unit-1:
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
2. Basic steps for filtering in the frequency domain:
a. Fourier transform
b. filter function
c. Inverse Fourier transform
d. all of these
3. A generalization of unsharp masking is:
a. high boost filtering
b. low boost filtering
c. a & b
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
6. An image transmitted using wireless network:
a. corrupted as a result of lighting or other atmospheric disturbance.
b. non-corrupted as a result of lighting or other atmospheric disturbance.
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
15. The harmonic mean filter works well for.............
a. salt and pepper noise
b. Gaussian 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.
a. f ( x, y) median{g(s, t )}
( s , t ) Sxy
b. f ( x, y)
c. f ( x, y)
max {g(s, t )}
( s , t ) Sxy
min {g(s, t )}
( s , t ) Sxy
d. none of above
median{g(s, t )}
( s , t ) Sxy
max {g(s, t )}
( s , t ) Sxy
min {g(s, t )}
( s , t ) Sxy
d. none of above
median{g(s, t )}
( s , t ) Sxy
b. f ( x, y)
c. f ( x, y)
max {g(s, t )}
( s , t ) Sxy
min {g(s, t )}
( s , t ) Sxy
d. none of above
32.
a. 2-D DFT
b. 1-D DFT
c. 2-D FFT
d. none of above
33. Below figures shows:
.
Fig. (a)
Fig. (b)
Fig. (a)
Fig. (b)
a. Discrete function with twice the number of nonzero, its Fourier spectrum
Fig. (a)
Fig. (b)
Fig. (a)
Fig. (b)
is minimized
a. Non-blind deblurring/deconvolution
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
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-3
1. what is color?
a. its an attribute of objects (feature)
b. its an attribute of objects (shape)
c. its an attribute of objects (smoothness)
d. all of above
2. color depends on:
a. spectral characteristics of the light sources illuminating the objects
b. spectral characteristics of objects
c. spectral characteristics of the sensors of the imaging device
d. all of above
3. Tri-chromatic color mixing theory is
a. any color can be obtained by mixing of three secondary colors with a right proportion.
b. any color can be obtained by mixing of three primary colors with a right proportion.
c. a & b
d. none of above
4. Primary colors for illuminating sources:
a. Red, Green, Blue
b. cyan, magenta, Yellow
c. a & b
d. none of above
5. Additive rule
a. cyan+ magenta + Yellow = white
a. Dominant color as perceived by an observer. Its an attribute with the dominant wavelength
b. non-Dominant color as perceived by an observer. Its an attribute with the dominant
wavelength
c. a & b
d. none of above
19. Saturation refers in HS color model as
a. To the relative purity or the amount of white light mixed with a hue. The pure spectrum colors
are semi-fully saturated.
b. To the relative purity or the amount of white light mixed with a hue. The pure spectrum colors
are partially saturated.
c. To the relative purity or the amount of white light mixed with a hue. The pure spectrum colors
are fully saturated.
d. none of above
20. Pink and Lavender are.......
a. less saturated
b. more saturated
c. better saturated
d. none of above
21. Intensity reflects in HIS color model as
a. The brightness
b. The contrast
c. a & b
d. none of above
22. Total amount of energy that flow from the light source, measured in watts (W)
a. Radiance
b. Luminance
c. a & b
d. none of above
23. Amount of energy an observer perceives from a light source
a. Radiance
b. Luminance
c. a & b
d. none of above
24. Luminance measured in........
a. lumens
b. km
c. mm
d. none of above
25. Far infrared light:
a. high radiance, but 0 luminance
b. low radiance, but 0 luminance
c. high radiance, but 1 luminance
d. none of above
26. Subjective descriptor that is hard to measure, similar to the achromatic notion of intensity
a. Radiance
b. Brightness
c. a & b
d. none of above
a. additive primaries
b. subtractive primaries
c. a & b
d. none of above
a. additive primaries
b. subtractive primaries
c. a & b
d. none of above
31. below figure shows
a. Color TV
b. Picture
c. image
d. none of above
b. used to extract image components that are useful in the representation and description of
region shape.
c. used to extract image components that are useful in the compression of region shape.
d. none of above
37. The element of the set is the coordinates (x,y) of pixel belong to the object Z2
a. Binary image (0 = white, 1 = black)
b. gray-scaled image
c. a & b
d. none of above
38. The element of the set is the coordinates (x,y) of pixel belong to the object and the gray
levels Z3
a. Binary image (0 = white, 1 = black)
b. gray-scaled image
c. a & b
d. none of above
39. Erosion
a. Erosion of a set A by structuring element B: all z in A such that B is in A when origin of B=z
b.
A B {z|(B)z
A}
)
B {z|(B
z
d. all of above
41. Erosion
a. Removal of structures of certain shape and size, given by SE
b.
A B {z|(B)z
A}
)
B {z|(B
z
(A
B)
c. Eliminates protrusions
d. all of above
45. Closing:
a. Dilation followed by erosion, denoted
b. A
(A
B)
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-4
1. Registration Goals: I2(x,y)=g(I1(f(x,y))
a. f() 2D spatial transformation
b. g() 1D intensity transformation
c. a & b
d. none of above
2. Spatial Transformations
a. Rigid
b. Affine
c. Projective
d. all of above
3. Rigid Transformation
a. Rotation(R)
b. Translation (t)
c. Similarity (scale)
d. all of above
4. Affine Transformation
a. Rotation
b. Translation
c. Scale
d. all of above
5. Flat plane tilted with respect to the camera requires
a. Projective Transformation
b. affine Transformation
c. rigid transformation
d. none of above
6. Methods of Registration
a. Correlation
b. Fourier
c. Point Mapping
d. all of above
7. ..........must be normalized to avoid contributions from local image intensities.
a. Correlation
b. Convolution
c. circular convolution
d. none of above
8. Given a two images T & I, 2D normalized ..............function measures the similarity for each
translation in an image patch
C(u, v)
y
x
T ( x , y ) I( x u , y v )
y
I 2 ( x u , y v)
a. Correlation
b. Convolution
c. circular convolution
d. none of above
9. Correlation Theorem
a. Fourier transform of the correlation of two images is the product of the Fourier transform of
one image and the Fourier transform of the other.
b. Fourier transform of the correlation of two images is the product of the Fourier transform of
one image and the inverse of the Fourier transform of the other.
c. Fourier transform of the correlation of two images is the product of the Fourier transform of
one image and the complex conjugate of the Fourier transform of the other.
d. none of above
d. all of above
15. Same Modality Camera Sensors enough correlated structure at................
a. all resolution levels
b. high resolution levels
c. a & b
d. none of above
16. Different Modality Camera Sensors primary correlation only in..................
a. all resolution levels
b. high resolution levels
c. a & b
d. none of above
17. Goal: Suppress non-common information & capture the common scene details
a. Solution: low pass energy images
b. Solution: High pass energy images
c. Solution: band pass energy images
d. none of above
18. Apply the Laplacian high pass filter to the original images
a. Square the results NO contrast reversal
b. Square the results contrast reversal
c. Square the results high contrast reversal
d. none of above
19. Alignment Algorithm
a. Do not assume global correlation, use only local correlation information
b. Use Normalized Correlation as a similarity measure
c. Thus, no assumptions about the original data
d. all of above
20. ............is to subdivide an image into its component regions or objects.
a. Segmentation
b. fragment
c. addition
d. none of above
21. ........should stop when the objects of interest in an application have been isolated.
a. Segmentation
b. fragment
c. addition
d. none of above
22. Segmentation algorithms generally are based on one of 2 basis properties of intensity values
a. discontinuity : to partition an image based on sharp changes in intensity (such as edges)
b. Similarity: to partition an image into regions that are similar according to a set of predefined
criteria.
c. a & b
d. none of above
23. Detect the three basic types of gray-level discontinuities
a. points
b. lines
c. edges
d. all of above
24. Point Detection
a. a point has been detected at the location on which the mark is centered if |R|
b. T is a nonnegative threshold
c. R is the sum of products of the coefficients with the gray levels contained in the region
encompassed by the mark.
d. all of above
25. This is a:
34. ..............should be serious consideration prior to the use of derivatives in applications where noise is
likely to be present.
a. Image smoothing
b. image compression
c. image enhancement
d. none of above
35. This is a:
d. none of above
41. An ........a place where there is a rapid change in the brightness (or other property) of an image.
a. edge
b. point
c. line
d. none of above
42. region-based segmentation (seeded region growing)
a. advantage: With edge connectivity
a. advantage: With loose connectivity
a. advantage: With good connectivity
d. none of above
43. region-based segmentation (seeded region growing)
a. Disadvantage: Initial seed-points: different sets of initial seed-point cause different segmented result
b. Disadvantage: Time-consuming problem
c. a & b
d. none of above
44. region-based segmentation (Unseeded region growing)
a. Advantage: easy to use
b. Advantage: can readily incorporate high level knowledge of the image composition through region
threshold
c. a & b
d. none of above
45. region-based segmentation (Unseeded region growing)
a. Disadvantage: slow speed
b. Disadvantage: high speed
c. Disadvantage: slow capture
d. none of above
Answers-Key Unit-4:
1
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-5
1. Objective of Image Representation and Description?
a. To represent and describe information embedded in an image in other forms that are less
suitable than the image itself.
b. a. To represent and describe information embedded in an image in other forms that are more
suitable than the image itself.
c. a & b
d. none of above
2. Benefits of Image Representation and Description:
a. Easier to understand
b. Require less memory, faster to be processed
c. More ready to be used
d. all of above
3. What kind of information we can use for Image Representation and Description
a. Boundary, shape
b. Region
c. Texture
d. all of above
4. Why we focus on a boundary?
a. The boundary is a good representation of an object shape and also requires a few memory.
b. The boundary is a poor representation of an object shape and also requires a few memory.
c. The boundary is a good representation of an object shape and also requires a high memory.
d. none of above
5. .......represent an object boundary by a connected sequence of straight line segments of specified
length and direction.
a. hex codes
b. Chain codes
c. binary codes
d. none of above
6. Problem of a chain code: a chain code sequence depends on a starting point.
a. Solution: treat a chain code as a rectangular sequence and redefine the starting point so that the
resulting sequence of numbers forms an integer of minimum magnitude.
b. Solution: treat a chain code as a circular sequence and redefine the starting point so that the resulting
sequence of numbers forms an integer of minimum magnitude.
c. Solution: treat a chain code as a circular sequence and redefine the ending point so that the resulting
sequence of numbers forms an integer of maximum magnitude.
d. none of above
7. .................Counting the number of direction change (in counterclockwise) between 2 adjacent
elements of the code.
a. The second difference of a chain code
b. The third difference of a chain code
c. The first difference of a chain code
d. none of above
8. A chain code: 10103322
a. The first difference = 3133030
a. The first difference = 3130030
a. The first difference = 3100030
d. none of above
9. The first difference is.............
a. circular invariant
b. rotational variant
c. rotational invariant
d. none of above
10. ....................Partitioning an object boundary by using vertices of a convex hull.
a. Boundary Segments Concept
a. Boundary distribute Concept
a. edge Segments Concept
d. none of above
11. Thinning Algorithm Concept:
a. Do not remove end points
b. Do not break connectivity
c. Do not cause excessive erosion.
d. all of above
12. Thinning Algorithm Apply only to contour pixels:
a. pixels 1 having at least one of its 8 neighbor pixels valued 0
b. pixels 2 having at least one of its 8 neighbor pixels valued 0
c. pixels 1 having at least one of its 8 neighbor pixels valued 1
d. none of above
Shape number of the boundary:
a. the first difference of smallest magnitude
b. the second difference of smallest magnitude
c. the first difference of largest magnitude
d. none of above
14. The order n of the shape number:
a. the number of nibbles in the sequence
a. the number of bits in the sequence
a. the number of digits in the sequence
d. none of above
15. Chain code: 0 3 2 1 for below structure:
a. difference: 3 3 3 3
b. shape no.: 3 3 3 3
c. a & b
d. none of above
a. difference: 3 0 3 3 0 3
b. shape no.: 0 3 3 0 3 3
c. a & b
d. none of above
17. ..................view a coordinate (x,y) as a complex number (x = real part and y = imaginary part) then
apply the Fourier transform to a sequence of boundary points.
a. Fourier descriptor
b. Laplace descriptor
c. Regional descriptor
d. none of above
18. ..................Purpose: to describe regions or areas
a. Fourier descriptor
b. Laplace descriptor
c. Regional Descriptors
d. none of above
19. a circle is the most compact shape with
a. C = 1/pi
b. C = 1/4pi
c. C = 1/8pi
d. none of above
20. ..............Use to describe holes and connected components of the region
a. Topological Descriptors
b. Laplace descriptor
c. Regional Descriptors
d. none of above
21.
a. Euler number
b. Euler formula
c. Euler value
d. none of above
22. V Q F C H
of faces
a. Euler number
b. Euler formula
c. Euler value
d. none of above
23. below figure shows:
b. skewness
c. flatness
d. none of above
30. Fourier Approach for ..............Concept: convert 2D spectrum into 1D graphs
a. Texture Descriptor
b. regional Descriptor
c. topological Descriptor
d. none of above
31. Principal Components for ............Purpose: to reduce dimensionality of a vector image while
maintaining information as much as possible.
a. Description
b. registration
c. observation
d. none of above
32. region-based segmentation fast scanning Advantage:
a. The speed is very fast
b. The result of segmentation will be intact with good connectivity
c. a & b
d. none of above
33. region-based segmentation fast scanning Disadvantage:
a. The matching of physical object is not good: It can be improved by morphology and geometric
mathematic
b. The result of segmentation will be intact with good connectivity
c. a & b
d. none of above
34. a ............... is a family of patterns that share some common properties.
a. Pattern classes
b. Pattern recognition
c. Pattern checker
d. none of above
35. .................to assign patterns to their respective classes.
a. Pattern classes
b. Pattern recognition
c. Pattern checker
d. none of above
36. Three common pattern arrangements used in practices are
a. Vectors
b. Strings
c. Trees
d. all of above
37. ..........................is more powerful than string ones.
a. Tree descriptions
b. regional descriptions
c. space descriptions
d. none of above
38. ...............to recognition are based on the use decision functions.
a. semi-theoretic approaches
b. Final-theoretic approaches
c. Decision-theoretic approaches
d. none of above
39. The distance between two shapes a and b defined as: (Degree of similarity k)
a. D(a , b)
1
k
b. D(a , b)
1
2k
c. D(a, b)
2
k
d. none of above
40. A simple measure of similarity between a and b is the ratio
a.
max( a , b )
b.
Represent the number of matches between the two strings, where a match occurs in the kth
position if ak = bk.
c. The number of symbols that do not match is
d. all of above
Answers-Key Unit-4:
1
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