Professional Documents
Culture Documents
Subject: DIP
Unit-1
1. DIP Stands:
a) Digital image processing
b) Digital information processing
c) Digital induction process
d) None of these
2. What is image?
a) Picture
b) Matrix of pixel
c) Collection of pixel
d) All of these
4. The field of digital image processing refers to processing digital images by means:
a) Digital computer
b) Super computer
c) mini-computer
d) None of these
5. What is pixel?
a) Pixel is the elements of a digital image
b) Pixel is the elements of a analog image
c) a & b
d) none of these
8. Among the following image processing techniques which is fast, precise and flexible
a) optical
b) digital
c) electronic
d) photographic
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 pixel‗s 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
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
21. Which technique turns the unique lines, patterns, and spots apparent in a person‘s 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
28. ___ is the most reliable and accurate biometric identification technique.
a) Computer vision
b) Iris recognition
c) Medical imaging
d) Remote sensing
31. The identification technique using voice, keystroke, gait etc. are included in
a) image enhancement
b) behavioral biometrics
c) face recognition
d) physical biometrics
Answers-Key Unit-1:
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-2
1. DFT stands as:
a. Discrete Fourier transform
b. digital function transform
c. digital frequency transform
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
11. A ............. achieves smoothing comparable to the arithmetic mean filter, but it tends to lose
less image detail in the process.
a. Arithmetic mean filter
b. geometric mean filter
c. spatial filter
d. none of above
12. A geometric mean filter achieves smoothing comparable to the arithmetic mean filter, but it
tends to ..................... image detail in the process.
a. lossy
b. corrupted
c. lose less
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
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
d. none of above
d. none of above
25. Using 0th percentile results in the so-called min filter,
d. none of above
a. max filter
b. min filter
c. median filter
d. none of above
a. max filter
b. min filter
c. median filter
d. none of above
31.
d. none of above
32.
a. 2-D DFT
b. 1-D DFT
c. 2-D FFT
d. none of above
d. none of above
a. Discrete function with twice the number of nonzero, it‘s Fourier spectrum
b. Discrete function with the number of nonzero, it‘s Fourier spectrum
c. Discrete function with fourth the number of nonzero, it‘s Fourier spectrum
d. none of above
d. none of above
d. none of above
37.
d. none of above
38.
d. none of above
39 ............... can be thought of as one low-pass filtered image minus another low pass filtered
image.
d. none of above
d. none of above
d. none of above
d. none of above
d. none of above
44. Given: observation y(m,n) and blurring function h(m,n); Design: g(m,n), such that the
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 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-3
1. what is color?
d. all of above
d. all of above
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
c. a & b
d. none of above
5. Additive rule
c. a & b
d. none of above
d. none of above
c. a & b
d. none of above
8. Subtractive rule
d. none of above
d. none of above
10. Primary colors for reflecting sources
a. secondary colors
c. a & b
d. none of above
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
d. none of above
a. CMYK
b. RGBK
c. RGYK
d. none of above
16.
d. none of above
d. none of above
c. a & b
d. none of above
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
a. less saturated
b. more saturated
c. better saturated
d. none of above
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
a. Radiance
b. Luminance
c. a & b
d. none of above
a. lumens
b. km
c. mm
d. none of above
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
d. none of above
d. none of above
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
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
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
d. none of above
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
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
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}
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 Φ}
41. Erosion
b. A B {z|(B)z A}
d. all of above
42. Dilation
b. A B {z|(B̂) z A Φ}
d. all of above
43. Wanted: Remove structures / fill holes and without affecting remaining parts
b. Solution: dilation
c. Solution: erosion
d. none of above
44. Opening:
b. A B (A B) B
c. Eliminates protrusions
d. all of above
45. Closing:
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
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
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
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
I2 (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
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
a. Control Points
c. Global Polynomial
d. all of above
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
a. Feature Space
b. Similarity Metrics
c. Search Strategy
d. all of above
c. a & b
d. none of above
c. a & b
d. none of above
17. Goal: Suppress non-common information & capture the common scene details
d. none of above
18. Apply the Laplacian high pass filter to the original images
d. none of above
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
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
a. points
b. lines
c. edges
d. all of above
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:
d. none of above
26. This is a:
d. none of above
27. This is a:
a. Point Detection mask
d. none of above
28. This is a:
d. none of above
29. This is a:
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. vertical mask
d. none of above
31. if we are interested in detecting all lines in an image in the direction defined by a given mask, we
simply run the mask through the image and threshold the absolute value of the result.
a. Line Detection
b. edge detection
c. point detection
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 positive and negative values of the second derivative
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 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
36. This is a:
d. none of above
37. This is a:
a. Prewitt edge detection gradient mask
d. none of above
a. two-crossing
b. one-crossing
c. zero-crossing
d. none of above
39. The threshold used for each pixel depends on the location of the pixel in terms of the subimages,
this type of thresholding is...........
a. adaptive
b. static
c. modern
d. none of above
40 ................. contributes significantly to algorithms for feature detection, segmentation, and motion
analysis.
a. point detection
b. line detection
c. Edge detection
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
d. none of above
c. a & b
d. none of above
b. Advantage: can readily incorporate high level knowledge of the image composition through region
threshold
c. a & b
d. none of above
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
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
a. Easier to understand
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
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
b. Chain codes
c. binary codes
d. none of above
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
d. none of above
d. none of above
a. circular invariant
b. rotational variant
c. rotational invariant
d. none of above
d. none of above
d. all of above
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
d. none of above
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
a. Fourier descriptor
b. Laplace descriptor
c. Regional Descriptors
d. none of above
a. C = 1/pi
b. C = 1/4pi
c. C = 1/8pi
d. none of above
a. Topological Descriptors
b. Laplace descriptor
c. Regional Descriptors
d. none of above
a. Euler number
b. Euler formula
c. Euler value
d. none of above
a. Euler number
b. Euler formula
c. Euler value
d. none of above
d. none of above
d. none of above
25. below figure shows:
a. smoothness
b. skewness
c. flatness
d. none of above
a. smoothness
b. skewness
c. flatness
d. none of above
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 information as much as possible.
a. Description
b. registration
c. observation
d. none of above
c. a & b
d. none of above
a. The matching of physical object is not good: It can be improved by morphology and geometric
mathematic
c. a & b
d. none of above
b. Pattern recognition
c. Pattern checker
d. none of above
a. Pattern classes
b. Pattern recognition
c. Pattern checker
d. none of above
a. Vectors
b. Strings
c. Trees
d. all of above
a. Tree descriptions
b. regional descriptions
c. space descriptions
d. none of above
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)
1
a. D(a, b)
k
1
b. D(a, b)
2k
2
c. D(a, b)
k
d. none of above
a. R
max( a , b )
b. Represent the number of matches between the two strings, where a match occurs in the kth
position if ak = bk.
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