Unit-3
1. what is color?
a.
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
b. Red + Green + Blue = white
c. a & b
d. none of above
6. Color monitor works by exciting
a. red, green, blue phosphors using separate electronics guns
b. cyan, green, blue phosphors using separate electronics guns
c. red, magenta, blue phosphors using separate electronics guns
d. none of above
7. Primary colors for reflecting sources:
a. Red, Green, Blue
b. cyan, magenta, Yellow
c. a & b
d. none of above
8. Subtractive rule
a. Red + Green + Blue = Black
b. cyan+ magenta + Yellow = black
c. Red + Green + Blue = white
d. none of above
9. Color printer works by using
a. cyan, magenta, Yellow and black dynes
a. red, magenta, Yellow and black dynes
a. cyan, blue, Yellow and black dynes
d. none of above
10. Primary colors for reflecting sources
a. secondary colors
b. red, green, blue
c. a & b
d. none of above
11. Primary colors of pigments
a. cyan, magenta, Yellow
b. red, green, blue
c. a & b
d. none of above
12. If a surface coated with ........is illuminated with white light, no red light is reflected form the
surface.
a. cyan
b. yellow
c. magenta
d. none of above
13. ....... subtracts red light from white light which contains amounts of red, green and blue light.
a. cyan
b. yellow
c. magenta
d. none of above
14. CMYK stands as
a. CMY + K where K stands for brown
a. CMY + K where K stands for blue
a. CMY + K where K stands for black
d. none of above
15. Four colors printing as
a. CMYK
b. RGBK
c. RGYK
d. none of above
16.
a. RGB to CMY conversion
b. CMY to RGB conversion
c. RGB to RGB conversion
d. none of above
17. HSI color Model is
a. Height, Saturation, Intensity
b. Hue, symmetric, Intensity
c. Hue, Saturation, Intensity
d. none of above
18. Hue represents
with the dominant wavelength
b. non-
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
27. Principal sensing categories in eyes
a. Red light 65%, green light 33%, and blue light 2%
b. Yellow light 65%, green light 33%, and blue light 2%
c. Red light 65%, green light 33%, and cyan light 2%
d. none of above
28. Secondary colors:
a. G+Y=Cyan, R+G=Yellow, R+B=Magenta
b. G+B=Cyan, R+G=Yellow, R+B=Magenta
c. G+B=Cyan, R+G=Yellow, R+B=Magenta
d. none of above
29. below figure shows:
a. additive primaries
b. subtractive primaries
c. a & b
d. none of above
30. below figure shows
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
32. Suitable for hardware or applications
a. RGB model
b. CYM model
c. CYMK model
d. all of above
33. HSI model
a. match the human description
b. match the animal description
c. match the cat description
d. none of above
34. The number of bits used to represent each pixel in RGB space.
a. Pixel depth
b. no. of pixel
c. pixel size
d. none of above
35. Used to generate hardcopy output
a. CMY color model
b. RGB color model
c. HIS color model
d. none of above
36. Morphological Image Processing
a. used to compact image components that are useful in the representation and description of
region shape.
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}
c. Shrink the object
d. all of above
40. Dilution
a. Dilation of a set A by structuring element B: all z in A such that B hits A when origin of B=z
b. A B {z|( B) z A }
c. Grow the object
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}
c. Shrink the object
d. all of above
42. Dilation
a. Filling of holes of certain shape and size, given by SE
b. A B {z|( B) z A }
c. Grow the object
d. all of above
43. Wanted: Remove structures / fill holes and without affecting remaining parts
a. Solution: Combine erosion and dilation
b. Solution: dilation
c. Solution: erosion
d. none of above
44. Opening:
a. Erosion followed by dilation, denoted
b. A B (A B) B
c. Eliminates protrusions
d. all of above
45. Closing:
a. Dilation followed by erosion,
b. A B (A B) B
c. fuse narrow breaks and long thin gulfs
d. all of above
Answers-Key Unit-3:
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-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
x y
T(x, y)I( x u, y v)
C(u, v)
x 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
10. Fourier Transform Based Methods
a. Phase-Correlation
b. Cross power spectrum
c. Power cepstrum
d. all of above
11. All Fourier based methods are very efficient, only only work in cases of rigid transformation.
a. Projective Transformation
b. affine Transformation
c. rigid transformation
d. none of above
12. Point Mapping Registration
a. Control Points
b. Point Mapping with Feedback
c. Global Polynomial
d. all of above
13. Point mapping with Feedback
a. Clustering
b. determine the optimal spatial transformation between images by an evaluation of all possible
pairs of feature matches.
c. a & b
d. none of above
14. Characteristics of Registration Methods
a. Feature Space
b. Similarity Metrics
c. Search Strategy
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| T
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:
a. Point Detec on mask
b. Line detec on mask (Horizontal)
c. Line detec on mask (ver cal)
d. none of above
26. This is a:
a. Point Detec on mask
b. Line detec on mask (Horizontal)
c. Line detec on mask (ver cal)
d. none of above
27. This is a:
a. Point Detec on mask
b. Line detec on mask (+450)
c. Line detec on mask (ver cal)
d. none of above
28. This is a:
a. Point Detec on mask
b. Line detec on mask (+450)
c. Line detec on mask (ver cal)
d. none of above
29. This is a:
a. Point Detec on mask
b. Line detec on mask (-450)
c. Line detec on mask (ver cal)
d. none of above
30. ............will result with max response when a line passed through the middle row of the mask with a
constant background.
a. Horizon mask
b. Horizontal mask
c. ver cal mask
d. none of above
31. if we are interested in detec ng all lines in an image in the direc on defined by a given mask, we
simply run the mask through the image and threshold the absolute value of the result.
a. Line Detec on
b. edge detec on
c. point detec on
d. none of above
32. Blurred edges tend to be ....... and sharp edges tend to be......:
a. thick, thin
b. thick, thick
c. thin, thin
d. none of above
33. An imaginary straight line joining the extreme posi ve and nega ve values of the second deriva ve
would cross zero near the midpoint of the edge.
a. two-crossing property
b. one-crossing property
c. Zero-crossing property
d. none of above
34. ..............should be serious considera on prior to the use of deriva ves in applica ons where noise is
likely to be present.
a. Image smoothing
b. image compression
c. image enhancement
d. none of above
35. This is a:
a. Prewi edge detec on gradient mask
b. Sobel edge detec on gradient mask
c. Roberts edge detec on gradient mask
d. none of above
36. This is a:
a. Prewi edge detec on gradient mask
b. Sobel edge detec on gradient mask
c. Roberts edge detec on gradient mask
d. none of above
37. This is a:
a. Prewi edge detec on gradient mask
b. Sobel edge detec on gradient mask
c. Roberts edge detec on gradient mask
d. none of above
38. Laplacian combined with smoothing to find edges via.............
a. two-crossing
b. one-crossing
c. zero-crossing
d. none of above
39. The threshold used for each pixel depends on the loca on of the pixel in terms of the subimages,
this type of thresholding is...........
a. adap ve
b. sta c
c. modern
d. none of above
40. ................contributes significantly to algorithms for feature detec on, segmenta on, and mo on
analysis.
a. point detec on
b. line detec on
c. Edge detec on
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 segmenta on (seeded region growing)
a. advantage: With edge connec vity
a. advantage: With loose connec vity
a. advantage: With good connec vity
d. none of above
43. region-based segmenta on (seeded region growing)
a. Disadvantage: Ini al seed-points: different sets of ini al seed-point cause different segmented result
b. Disadvantage: Time-consuming problem
c. a & b
d. none of above
44. region-based segmenta on (Unseeded region growing)
a. Advantage: easy to use
b. Advantage: can readily incorporate high level knowledge of the image composi on through region
threshold
c. a & b
d. none of above
45. region-based segmenta on (Unseeded region growing)
a. Disadvantage: slow speed
b. Disadvantage: high speed
c. Disadvantage: slow capture
d. none of above
Answers-Key Unit-4:
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-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.
d. all of above
3. What kind of informa on we can use for Image Representa on and Descrip on
a. Boundary, shape
b. Region
c. Texture
d. all of above
4. Why we focus on a boundary?
a. The boundary is a good representa on of an object shape and also requires a few memory.
b. The boundary is a poor representa on of an object shape and also requires a few memory.
c. The boundary is a good representa on 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 direc on.
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 star ng point.
a. Solu on: treat a chain code as a rectangular sequence and redefine the star ng point so that the
resul ng sequence of numbers forms an integer of minimum magnitude.
b. Solu on: treat a chain code as a circular sequence and redefine the star ng point so that the resul ng
sequence of numbers forms an integer of minimum magnitude.
c. Solu on: treat a chain code as a circular sequence and redefine the ending point so that the resul ng
sequence of numbers forms an integer of maximum magnitude.
d. none of above
7. .................Coun ng the number of direc on 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. rota onal variant
c. rota onal invariant
d. none of above
10. ....................Par oning an object boundary by using ver ces 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 connec vity
c. Do not cause excessive erosion.
d. all of above
12. Thinning Algorithm Apply only to contour pixels:
a.
c.
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
16. Chain code: 0 0 3 2 2 1 for below structure:
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
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. E C H C = the number of connected components; H = the number of holes
a. Euler number
b. Euler formula
c. Euler value
d. none of above
22. V Q F C H E V = the number of ver ces; Q = the number of edges; F = the number
of faces
a. Euler number
b. Euler formula
c. Euler value
d. none of above
23. below figure shows:
a. Euler number (E): E=0
b. Euler number (E): E=1
c. Euler number (E): E=-1
d. none of above
24. below figure shows:
a. Euler number (E): E=0
b. Euler number (E): E=1
c. Euler number (E): E=-1
d. none of above
25. below figure shows:
a. Euler number (E): E=0
b. Euler number (E): E=1
c. Euler number (E): E=-2
d. none of above26. Texture Descriptors
27. The 2nd moment = variance measure
a. smoothness
b. skewness
c. flatness
d. none of above
28. The 3rd moment measure
a. smoothness
b. skewness
c. flatness
d. none of above
29. The 4th moment measure
a. smoothness
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 informa on as much as possible.
a. Descrip on
b. registra on
c. observa on
d. none of above
32. region-based segmentation fast scanning Advantage:
a. The speed is very fast
b. The result of segmenta on will be intact with good connec vity
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
mathema c
b. The result of segmenta on will be intact with good connec vity
c. a & b
d. none of above
34. a ............... is a family of pa erns that share some common proper es.
a. Pa ern classes
b. Pa ern recogni on
c. Pa ern checker
d. none of above
35. .................to assign pa erns to their respec ve classes.
a. Pa ern classes
b. Pa ern recogni on
c. Pa ern checker
d. none of above
36. Three common pa ern arrangements used in prac ces are
a. Vectors
b. Strings
c. Trees
d. all of above
37. ..........................is more powerful than string ones.
a. Tree descrip ons
b. regional descrip ons
c. space descrip ons
d. none of above
38. ...............to recogni on are based on the use decision func ons.
a. semi-theore c approaches
b. Final-theore c approaches
c. Decision-theore c approaches
d. none of above
39. The distance between two shapes a and b defined as: (Degree of similarity k)
1
a. D(a, b)
k
1
b. D(a , b)
2k
2
c. D(a, b)
k
d. none of above
40. A simple measure of similarity between a and b is the ra o
a. R
max( a , b )
b. Represent the number of matches between the two strings, where a match occurs in the kth
posi on if ak = bk.
c. The number of symbols that do not match is
d. all of above
Answers-Key Unit-4:
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
