DIP Objective MCQ Vijay Chakole 1 1
DIP Objective MCQ Vijay Chakole 1 1
By
Unit 1
Digital Image Fundamentals
Components of Image Processing System. , Image Sensing and
Acquisition, Image Sampling & Quantization, Spatial and Gray Level
Resolution, Basic Relationships between Pixels. Statistical parameters,
Measures and their significance, Mean, standard deviation, variance,
SNR, PSNR etc.
d. Both b and c
Answer d
5. L = 23 would have
a. 2 levels
b. 4 levels
c. 6 levels
d. 8 levels
Answer d
6. The cornea is the tough transparent tissues that covers eye's
a. eye lid
b. lashes
c. anterior
d. exterior
Answer c
7. Digital images are displayed as a discrete set of
a. values
b. numbers
c. frequencies
d. intensities
Answer d
8. In MxN, M is no of
a. intensity levels
b. colors
c. rows
d. columns
Answer c
9. Each element of the matrix is called
a. dots
b. coordinate
c. pixels
d. value
Answer c
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 3
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
b. 1.5mm
c. 1.6mm
d. 1.7mm
Answer b
16. Type of zooms are
a. 8
b. 6
c. 4
d. 2
Answer d
17. DPI stands for
a. dots per image
b. dots per inches
c. dots per intensity
d. diameter per inches
Answer b
18. Hard x-rays are used in
a. medicines
b. lithoscopy
c. industry
d. radar
Answer c
19. No of bits to store image is denoted by the formula
a. b = NxK
b. b = MxN
c. b = MxNxK
d. b = MxK
Answer c
20. MRI in imaging stands for
a. magnetic resonance imaging
b. magnetic resistance imaging
c. magnetic resonance intensity
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 5
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
b. 0 and 1
c. 0 and 2
d. 0 and -1
Answer b
32. Image sensor produces
a. voltage waveform
b. current waveform
c. audio
d. discrete signals
Answer a
33. Mechanical digitizers are referred to
a. densitometer
b. micrometer
c. microdensity
d. microdensitometer
Answer d
34. Cone vision is called
a. photopic
b. photogenic
c. photograph
d. protoplasm
Answer a
35. Digitizing the image requires
a. reflection
b. sampling
c. quantization
d. Both b and c
Answer d
36. A matrix is denoted by
a. M.N
b. M x N
c. M+N
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 8
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
d. MN
Answer b
37. Changing the overall sensitivity of the image is called
a. illumination
b. brightness
c. brightness adaption
d. illumination adaption
Answer c
38. Image linear interpolation is given by the formula
a. v(x,y) = ax+by+cxy+d
b. v(x,y) = ax+by+cxy
c. v(x,y) = ax+by+d
d. v(x,y) = by+cxy+d
Answer a
39. One that is not the type of image sensor is
a. single sensor
b. line sensor
c. matrix sensor
d. array sensor
Answer c
40. X-rays pass through the patient's body for generating diagnostic
a. x-ray film
b. rays
c. images
d. reel
Answer a
41. Value of plank's constant h is
a. 9.55x10-34
b. 8.55x10-34
c. 7.55x10-34
d. 6.55x10-34
Answer d
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 9
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
b. column
c. values
d. Both a and b
Answer d
48. Discernible small details of image is
a. wide domain
b. spatial domain
c. frequency domain
d. algebraic domain
Answer b
49. To convert a continuous sensed data into Digital form, which of the following is
required?
a. Sampling
b. Quantization
c. Both Sampling and Quantization
d. Neither Sampling nor Quantization
Answer c
50. To convert a continuous image f(x, y) to digital form, we have to sample the
function in __________
a. Coordinates
b. Amplitude
c. All of the mentioned
d. None of the mentioned
Answer c
Unit 2
Image Enhancement
Enhancement in Spatial Domain: basic gray level transformations,
histogram processing, equalization, Arithmetic and logical operations
between images, Basics of spatial filtering, smoothening and
sharpening spatial filters, Image Enhancement in frequency Domain:
smoothening and sharpening frequency domain filters, Fundamental of
color image processing: color models, RGB, CMY, YIQ, HIS, Pseudo
Color Image processing: Intensity filtering, gray level to color
transformation, Basics of full color image processing.
b. Ridging
c. Graininess
d. False contouring
Answer d
4. Using rough rule of thumb, and assuming powers of 2 for convenience, what image
size are about the smallest images that can be expected to be reasonably free of
objectionable sampling checkerboards and false contouring?
a. 512*512pixels and 16 gray levels
b. 256*256pixels and 64 gray levels
c. 64*64pixels and 16 gray levels
d. 32*32pixels and 32 gray levels
Answer b
5. What does a shift up and right in the curves of iso preference curve simply means?
Verify in terms of N (number of pixels) and k (L=2k, L is the gray level) values.
a. Smaller values for N and k, implies a better picture quality
b. Larger values for N and k, implies low picture quality
c. Larger values for N and k, implies better picture quality
d. Smaller values for N and k, implies low picture quality
Answer c
6. How does the curves behave to the detail in the image in isopreference curve?
a. Curves tend to become more vertical as the detail in the image decreases
b. Curves tend to become less vertical as the detail in the image increases
c. Curves tend to become less vertical as the detail in the image decreases
d. Curves tend to become more vertical as the detail in the image increases
Answer d
7. For an image with a large amount of detail, if the value of N (number of pixels) is
fixed then what is the gray level dependency in the perceived quality of this type of
image?
a. Totally independent of the number of gray levels used
b. Nearly independent of the number of gray levels used
c. Highly dependent of the number of gray levels used
d. None of the mentioned
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 13
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
Answer b
8. What is a band-limited function?
a. A function of limited duration whose highest frequency is finite
b. A function of limited duration whose highest frequency is infinite
c. All of the mentioned
d. None of the mentioned
Answer a
9. For a band-limited function, which Theorem says that “if the function is sampled at
a rate equal to or greater than twice its highest frequency, the original function can
be recovered from its samples”?
a. Band-limitation theorem
b. Aliasing frequency theorem
c. Shannon sampling theorem
d. None of the mentioned
Answer c
10. What is the name of the phenomenon that corrupts the sampled image, and how
does it happen?
a. Shannon sampling, if the band-limited functions are undersampled
b. Shannon sampling, if the band-limited functions are oversampled
c. Aliasing, if the band-limited functions are undersampled
d. Aliasing, if the band-limited functions are oversampled
Answer c
11. How aliasing does corrupts the sampled image?
a. By introducing additional frequency components to the sampled function
b. By removing some frequency components from the sampled function
c. All of the mentioned
d. None of the mentioned
Answer a
12. How can one reduce the aliasing effect on an image?
a. By reducing the high-frequency components of image by blurring the image
b. By increasing the high-frequency components of image by blurring the image
c. By reducing the high-frequency components of image by clarifying the image
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 14
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
Answer a
22. 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 called ____________
a. 4-neighbors of p
b. Diagonal neighbors
c. 8-neighbors
d. None of the mentioned
Answer a
23. 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 called
____________
a. 4-neighbors of p
b. Diagonal neighbors
c. 8-neighbors
d. None of the mentioned
Answer b
24. What is the set of pixels of 8-neighbors of pixel p at coordinates (x, y)?
a. (x+1, y), (x-1, y), (x, y+1), (x, y-1), (x+2, y), (x-2, y), (x, y+2), (x, y-2)
b. (x+1, y), (x-1, y), (x, y+1), (x, y-1), (x+1, y+1), (x+1, y-1), (x-1, y+1), (x-1, y-1)
c. (x+1, y+1), (x+1, y-1), (x-1, y+1), (x-1, y-1), (x+2, y+2), (x+2, y-2), (x-2, y+2),
(x-2, y-2)
d. (x+2, y), (x-2, y), (x, y+2), (x, y-2), (x+2, y+2), (x+2, y-2), (x-2, y+2), (x-2, y-2)
Answer b
25. Two pixels p and q having gray values from V, the set of gray-level values used to
define adjacency, are m-adjacent if:
a. q is in N4(p)
b. q is in ND(p) and the set N4(p) ∩ N4(q) has no pixels whose values are from V
c. Any of the mentioned
d. None of the mentioned
Answer c
c. Negative transformations
d. None of the mentioned
Answer a
39. Although power-law transformations are considered more versatile than log
transformations for compressing of gray-levels in an image, then, how is log
transformations advantageous over power-law transformations?
a. The log transformation compresses the dynamic range of images
b. The log transformations reverses the intensity levels in the images
c. All of the mentioned
d. None of the mentioned
Answer a
40. A typical Fourier Spectrum with spectrum value ranging from 0 to 106, which of the
following transformation is better to apply.
a. Log transformations
b. Power-law transformations
c. Negative transformations
d. None of the mentioned
Answer a
41. The power-law transformation is given as: s = crᵞ, c and ᵞ are positive constants, and
r is the gray-level of image before processing and s after processing. Then, for what
value of c and ᵞ does power-law transformation becomes identity transformation?
a. c = 1 and ᵞ < 1
b. c = 1 and ᵞ > 1
c. c = -1 and ᵞ = 0
d. c = ᵞ = 1
Answer d
42. Which of the following transformation is used cathode ray tube (CRT) devices?
a. Log transformations
b. Power-law transformations
c. Negative transformations
d. None of the mentioned
Answer b
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 21
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
a. The histogram that are concentrated on the dark side of gray scale
b. The histogram whose component are biased toward high side of gray scale
c. The histogram that is narrow and centered toward the middle of gray scale
d. The histogram that covers wide range of gray scale and the distribution of pixel
is approximately uniform
Answer c
48. A bright image will have what kind of histogram, when the histogram, h(rk) = nk, rk
the kth gray level and nk total pixels with gray level rk, is plotted nk versus rk?
a. The histogram that are concentrated on the dark side of gray scale
b. The histogram whose component are biased toward high side of gray scale
c. The histogram that is narrow and centered toward the middle of gray scale
d. The histogram that covers wide range of gray scale and the distribution of pixel
is approximately uniform
Answer b
49. The transformation s = T(r) producing a gray level s for each pixel value r of input
image. Then, if the T(r) is single valued in interval 0 ≤ r ≤ 1, what does it signifies?
a. It guarantees the existence of inverse transformation
b. It is needed to restrict producing of some inverted gray levels in output
c. It guarantees that the output gray level and the input gray level will be in same
range
d. All of the mentioned
Answer a
50. The transformation s = T(r) producing a gray level s for each pixel value r of input
image. Then, if the T(r) is monotonically increasing in interval 0 ≤ r ≤ 1, what does
it signifies?
a. It guarantees the existence of inverse transformation
b. It is needed to restrict producing of some inverted gray levels in output
c. It guarantees that the output gray level and the input gray level will be in same
range
d. All of the mentioned
Answer b
Unit 3
Image Transforms
2D-DFT, FFT, DCT, the KL Transform, Walsh / Hadamard
Transform, Haar Transform, slant Transform , Basics of wavelet
transform.
Answer c
10. DFT is applied to
a. Infinite sequences
b. Finite discrete sequences
c. Continuous infinite signals
d. Continuous finite sequences
Answer b
11. The circular convolution of two sequences in time domain is equivalent to
a. Multiplication of DFTs of two sequences
b. Summation of DFTs of two sequences
c. Difference of DFTs of two sequences
d. Square of multiplication of DFTs of two sequences
Answer a
12. Circular shift of an N point is equivalent to
a. Circular shift of its periodic extension and its vice versa
b. Linear shift of its periodic extension and its vice versa
c. Circular shift of its aperiodic extension and its vice versa
d. Linear shift of its aperiodic extension and its vice versa
Answer b
13. Padding of zeros increases the frequency resolution.
a. True
b. False
Answer b
14. The basic properties of DFT includes
1) Linearity 2) Periodicity 3) Circular symmetry 4) Summation
a. 1, 2 and 3 are correct
b. 1, 2 and 4 are correct
c. 1 and 3 are correct
d. All the four are correct
Answer a
15. Frequency selectivity characteristics of DFT refers to
Answer b
25. Forward and inverse Fourier transforms exist for the samples having values
a. integers
b. infinite
c. finite
d. discrete
Answer c
26. The greater, the values of continuous variables, the spectrum of Fourier transform
will be
a. contracted
b. expanded
c. discrete
d. continuous
Answer a
27. Product of two functions in spatial domain is what, in frequency domain
a. correlation
b. convolution
c. Fourier transform
d. fast Fourier transform
Answer b
28. The Fourier transform is named after French mathematician
a. joseph Fourier
b. john Fourier
c. sean Fourier
d. jay Fourier
Answer a
Unit 4
Image Coding and Compression
Image Coding Fundamentals, Image Compression Model,
fundamentals- redundancy: coding, interpixel, psychovisual, fidelity
criteria, Basic compression methods Error Free Compression - variable
length, bit plane, LZW arithmetic Lossless Predictive, Lossy
Compression- Lossy Predictive. Fundamentals of JPEG, MPEG,
fractals.
c. 1-(-1/c)
d. (1/c)
Answer a
5. Transforming the difference between adjacent pixels is called
a. mapping
b. image compression
c. image watermarking
d. image equalization
Answer a
6. The simple way to compression is removing
a. data
b. superfluous data
c. information
d. meaningful data
Answer b
7. Inserting data on to the images is called
a. image enhancement
b. image compression
c. image watermarking
d. image equalization
Answer c
8. Shannons theorem is also called
a. noiseless coding theorem
b. noisy coding theorem
c. coding theorem
d. noiseless theorem
Answer a
9. A codec is capable of
a. encoding
b. decoding
c. framing
d. Both a and b
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 31
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
Answer d
10. Encoder is used for
a. image enhancement
b. image compression
c. image decompression
d. image equalization
Answer b
11. If the pixels can not be reconstructed without error mapping is said to be
a. reversible
b. irreversible
c. temporal
d. facsimile
Answer b
12. Decoder is used for
a. image enhancement
b. image compression
c. image decompression
d. image equalization
Answer c
13. Replication of the pixels is called
a. coding redundancy
b. spatial redundancy
c. temporal redundancy
d. Both b and c
Answer d
14. Information ignored the human eye is the
a. coding redundancy
b. spatial redundancy
c. temporal redundancy
d. irrelevant info
Answer d
b. meaningful data
c. raw data
d. Both a and b
Answer a
21. In the image MxN, M is
a. rows
b. column
c. level
d. intensity
Answer a
22. In the image MxN, N is
a. rows
b. column
c. level
d. intensity
Answer b
23. HD television are
a. low definition
b. high definition
c. enhanced
d. low quality
Answer b
24. Inferior image is the image having
a. low definition
b. high definition
c. intensity
d. coordinates
Answer a
25. Histogram equalization refers to image
a. sampling
b. quantization
c. framing
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 34
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
d. normalization
Answer d
26. Histogram equalization make image intensity changes
a. low
b. high
c. visible
d. invisible
Answer c
27. Image with very poor quality is considered as
a. good
b. fair
c. bad
d. excellent
Answer c
28. DVD stands for
a. digital video disks
b. digital video data
c. digital versatile disks
d. decompressed video disks
Answer a
29. Digitizing the coordinates of the image is called
a. sampling
b. quantization
c. framing
d. Both a and b
Answer a
30. Source of the event itself called
a. zero-memory source
b. nonzero-memory source
c. zero source
d. memory source
Answer a
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 35
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
b. quantization
c. entropy
d. normalization
Answer c
37. Image with very high quality is considered as
a. good
b. fair
c. bad
d. excellent
Answer d
38. Range [0, L-1], where L is the
a. no of levels
b. length
c. no of intensity levels
d. low quality
Answer c
39. Compression is done for saving
a. storage
b. bandwidth
c. money
d. Both a and b
Answer d
40. System of symbols to represent event is called
a. storage
b. word
c. code
d. nibble
Answer c
41. Digitizing the image intensity amplitude is called
a. sampling
b. quantization
c. framing
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 37
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
d. Both a and b
Answer b
42. Compressed image can be recovered back by
a. image enhancement
b. image decompression
c. image contrast
d. image equalization
Answer b
43. Digital video is sequence of
a. pixels
b. matrix
c. frames
d. coordinates
Answer c
44. Image compression comprised of
a. encoder
b. decoder
c. frames
d. Both a and b
Answer d
45. Information is the
a. data
b. meaningful data
c. raw data
d. Both a and b
Answer b
46. Coding redundancy works on
a. pixels
b. matrix
c. intensity
d. coordinates
Answer c
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 38
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
Unit 5
Image Analysis
Segmentation: Point, line, Hough Transform, Edge detection, Boundary
detection and Thersholding, Region Based segmentation.
Representation& Description :Boundary representation by chain codes,
signature & skeleton Boundary descriptors, shape number, Fourier
descriptors ,Basics of Regional descriptor, boundary representation by
chain codes and B splines, Hough Transform, Morphological Image
Processing: Dilation, Erosion, Opening, Closing on Binary Images.
a. ramp
b. step
c. onset
d. edges
Answer d
5. Method in which images are input and attributes are output is called
a. low level processes
b. high level processes
c. mid level processes
d. edge level processes
Answer c
6. Computation of derivatives in segmentation is also called
a. spatial filtering
b. frequency filtering
c. low pass filtering
d. high pass filtering
Answer a
7. Model of lines through region is called
a. ramp edges
b. step edge
c. roof edges
d. thinness of edges
Answer c
8. Transition of intensity takes place between
a. adjacent pixels
b. near pixels
c. edge pixels
d. line pixels
Answer a
9. Averaging is analogous to
a. differentiation
b. derivation
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 42
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
c. addition
d. integration
Answer d
10. Response of derivative mask is zero at
a. sharp intensities
b. constant intensities
c. low intensities
d. high intensities
Answer b
11. Subdivision of the image depends upon the
a. problem
b. objects
c. image
d. partition
Answer a
12. One that is not a method of image segmentation is
a. area
b. line
c. point
d. edge
Answer d
13. Discontinuity approach of segmentation depends upon
a. low frequencies
b. smooth changes
c. abrupt changes
d. contrast
Answer c
14. On ramp and step second derivatives produce
a. single edge effect
b. single effect
c. double edge effect
d. double line effect
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 43
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
Answer c
15. Point detection is done using filter that is
a. Gaussian
b. laplacian
c. ideal
d. butterworth
Answer b
16. Second derivatives are zero at points on
a. ramp
b. step
c. constant intensity
d. edge
Answer a
17. Two regions are said to be adjacent if their union forms
a. connected set
b. boundaries
c. region
d. image
Answer a
18. 8 bit image has intensity levels of
a. 0
b. 128
c. 255
d. 256
Answer d
19. Sobel operators were introduced in
a. 1970
b. 1971
c. 1972
d. 1973
Answer a
20. Blurring attenuate the
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 44
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
a. pixels
b. points
c. cross gradient
d. intensity
Answer d
21. A line is viewed as
a. area
b. edge segment
c. point
d. edge
Answer b
22. Sobel is better than prewitt in image
a. sharpening
b. blurring
c. smoothing
d. contrast
Answer c
23. Intensity's local changes can be detected through
a. differentiation
b. derivation
c. addition
d. integration
Answer b
24. For line detection we assume that lines are
a. thin
b. thick
c. sharp
d. blur
Answer a
25. Example of similarity approach in image segmentation is
a. edge based segmentation
b. boundary based segmentation
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 45
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
Answer b
31. Points exceeding the threshold in output image are marked as
a. 0
b. 1
c. 11
d. x
Answer d
32. Example of discontinuity approach in image segmentation is
a. edge based segmentation
b. boundary based segmentation
c. region based segmentation
d. Both a and b
Answer d
33. First derivative approximation says that values of intensities at the onset must be
a. nonzero
b. zero
c. positive
d. negative
Answer a
34. Image segmentation is also based on
a. morphology
b. set theory
c. extraction
d. recognition
Answer a
35. Image whose principle features are edges is called
a. orthogonal
b. isolated
c. edge map
d. edge normal
Answer c
36. Vertical lines are angles at
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 47
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
a. 0
b. 30
c. 45
d. 90
Answer d
37. If R is the entire region of the image then union of all segmented parts should be
equal to
a. R
b. R'
c. Ri
d. Rn
Answer a
38. Mask's response to zero means
a. sum to zero
b. subtraction to zero
c. division to zero
d. multiplication to zero
Answer a
39. Lines in an image can be oriented at angle
a. 0
b. 90
c. 30
d. Both a and b
Answer d
40. Laplacian images need
a. contraction
b. expansion
c. scaling
d. enhancement
Answer c
41. For point detection we use
a. first derivative
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 48
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
b. second derivative
c. third derivative
d. Both a and b
Answer b
42. Textured inner region of the object produces
a. good boundary extraction
b. excellent boundary extraction
c. good boundary deletion
d. excellent boundary deletion
Answer a
43. If the standard deviation of the pixels is positive, then sub image is labeled as
a. black
b. green
c. white
d. red
Answer c
44. Thresholding gives the
a. large image
b. gray scale image
c. color image
d. binary image
Answer d
45. Marr hildreth method was introduced in
a. 1980
b. 1981
c. 1982
d. 1983
Answer a
46. Segmentation is a process of
a. low level processes
b. high level processes
c. mid level processes
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 49
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
Unit 6
Image restoration and reconstruction
Image Degradation Mode, Noise Models, and Restoration in Presence c
Noise in spatial Domain. Inverse Filtering, wiener filtering,
Introduction to Image reconstruction from projections applications of
Image Processing.
Answer b
5. Filter that replaces the pixel value with the medians of intensity levels is
a. arithmetic mean filter
b. geometric mean filter
c. median filter
d. sequence mean filter
Answer c
6. In geometric mean filters when alpha is equal to 1 then it works as
a. notch filter
b. bandpass filter
c. wiener filter
d. inverse filter
Answer d
7. In wiener filtering it is assumed that noise and image are
a. different
b. homogenous
c. correlated
d. uncorrelated
Answer d
8. EBCT scanners stands for
a. electrical beam computed tomography
b. electric beam computed tomography
c. electronic beam computed tomography
d. electron beam computed tomography
Answer d
9. PSF stands for
a. probability spread function
b. point spread function
c. probability spike function
d. point spike function
Answer b
10. Filter that performs opposite to band rejected filter is called
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 52
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
a. lowpass filter
b. bandpass filter
c. highpass filter
d. max filter
Answer b
11. Degradation can be estimated by
a. 2ways
b. 3ways
c. 4ways
d. 5ways
Answer b
12. The purpose of restoration is to gain
a. degraded image
b. original image
c. pixels
d. coordinates
Answer b
13. Power spectra and noise of under graded image must be known is a statement of
a. notch filter
b. band pass filter
c. wiener filter
d. max filter
Answer c
14. Contra harmonic mean filter produces
a. degraded image
b. original image
c. restored image
d. plane
Answer c
15. One that is not the type of a mean filter
a. arithmetic mean filter
b. geometric mean filter
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 53
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
Answer a
21. The inverse of image convolution is
a. image nonconvolution
b. image inconvolution
c. image deconvolution
d. image byconvolution
Answer c
22. Impulse is simulated by
a. black dot
b. gray dot
c. bright dot
d. sharp dot
Answer c
23. The approach to restoration is
a. inverse filtering
b. spike filtering
c. black filtering
d ranking
Answer a
24. Square of standard deviation is called
a. variance
b. noise
c. restoration
d. power
Answer a
25. CT stands for
a. computerized tomography
b. computed tomography
c. computerized terminology
d. computed terminology
Answer b
26. SNR in noise stands for
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 55
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
b. degradation
c. restoration
d. acquisition
Answer a
32. Minimum mean square error filter is also called
a. square error filter
b. most square error filter
c. least square error filter
d. error filter
Answer c
33. High frequency components are passed by
a. lowpass filter
b. bandpass filter
c. highpass filter
d. max filter
Answer c
34. One that is not a type of a noise is
a. Rayleigh noise
b. gamma noise
c. black noise
d. exponential noise
Answer c
35. Filter that replaces the pixel value with the minimum values of intensity levels is
a. max filter
b. geometric mean filter
c. median filter
d. min filter
Answer d
36. FFT stands for
a. fast Fourier transform
b. frequency Fourier transform
c. frequency fast transform
Prof. Vijay V. Chakole, Department of Electronics Engineering, KDKCE, Nagpur Page 57
VII SEMESTER ELECTRONICS E-I : Digital Image Processing (MCQs)
b. degradation
c. restoration
d. optimum restoration
Answer d
48. Salt and pepper noise can interchangeably be used with
a. Rayleigh noise
b. gamma noise
c. black noise
d. impulse
Answer d
49. Gaussian shape function has no
a. ones
b. zeros
c. pixels
d. coordinates
Answer b
50. Filter that replaces the pixel value with the maximum values of intensity levels is
a. max filter
b. geometric mean filter
c. median filter
d. min filter
Answer a
Text Books
1. Gonzalez and Woods, "Digital Image Processing", Pearson
Education,
2. Arthur Weeks Jr., "Fundamentals of Digital Intake Processing",
PHI.
3. S Jayaraman, “ Digital Image Processing” , Tata McGraw Hill
Publications .
4. A. K. Jain, "Fundamentals of Digital Image Processing"; Pearson
Education
Reference Book
1. Pratt William, "Digital Image Processing", John Wiley & Sons
2. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Image
Processing, Analysis and Machine Vision”, Second Edition,
Thomson Learning
3. Milan Sonka, Vaclav halvac , “Image Processing analysis &
Machine Vision”, Cenage Learning