Image Processing (IP) MCQ's




Question 1 :
What is the effect of equalizing an already equalized histogram?


  1. Number grey levels reduced
  2. No Change on histogram
  3. Number grey levels increased
  4. New grey levels gets added
  

Question 2 :
If pixels are reconstructed without error_it is called _____________compression


  1. coordinates wise
  2. non-reversible
  3. reversible
  4. pixel wise
  

Question 3 :
When the human eye does not respond with equal sensitivity to all visual information


  1. Spatial redundancy
  2. Psychovisual redundancy
  3. Coding redundancy
  4. Temporal redundancy
  

Question 4 :
In neighborhood operation for spatial filtering if a square mask of size n*n is used it is restricted that the center of mask must be at a distance ≥ (n – 1)/2 pixels from border of image, what happens to the resultant image?


  1. The resultant image will be of same size as original image
  2. The resultant image will be a little larger size than original image
  3. The resultant image will be a little smaller size than original image
  4. The resultant image will be smooth near the border
  

Question 5 :
Fully containment of the Structuring element in an image is required in


  1. opening
  2. closing
  3. erosion
  4. dilation
  

Question 6 :
Thresholding function in contrast stretching creates


  1. binary image
  2. high quality image
  3. enhanced image
  4. low quality image
  

Question 7 :
The D8 distance is also called


  1. Manhattan distance
  2. City block distance
  3. Chessboard distance
  4. Euclidean distance
  

Question 8 :
If component of histogram are concentrated on the lower (towards zero) side of the gray scale then it is a histogram of


  1. Dark Image
  2. Bright Image
  3. Low constrast image
  4. High constrast image
  

Question 9 :
Structuring element runs over image's


  1. rows
  2. columns
  3. edges
  4. every element
  

Question 10 :
Which of the following techniques is based on the Fourier transform?


  1. spectral
  2. topological
  3. statistical
  4. structural
  

Question 11 :
All the pixels at Euclidean distance of r from given pixel P form


  1. A circle centered at P
  2. A square centered at P
  3. A triangle centered at P
  4. A rectangle centered at P
  

Question 12 :
Wavelet series equation is the sum of _________________


  1. scaling and detail
  2. row and col inverse
  3. spatial and frequency mean
  4. row andsummation detail along column
  

Question 13 :
The transform which possess the multi-resolution property in an image is:


  1. Fast Fourier Transform (FFT)
  2. Discrete Cosine Transform (DCT)
  3. Short Term Fourier Transform (STFT)
  4. Wavelet Transform
  

Question 14 :
Structuring element is also called


  1. pixels
  2. lines
  3. subimage
  4. noise
  

Question 15 :
The error in the image due to low tonal resolution is called


  1. Checker board effect
  2. False contouring
  3. Quantization error
  4. Blurring effect
  

Question 16 :
Method generating a processed image having specified histogram is called


  1. histogram enhancement
  2. histogram normalization
  3. histogram equalization
  4. histogram matching
  

Question 17 :
On decompression of file, which technique retrieved exact image without any loss of information


  1. Huffman coding
  2. Improved grey scale quantization
  3. JPEG
  4. Vector quantization
  

Question 18 :
The basic idea behind Huffman coding is to


  1. compress data by using fewer bits to encode more frequently occuring pixels
  2. expand data by using fewer bits to encode more frequently occuring pixels
  3. compress data by using fewer bits to encode fewer frequently occuring pixels
  4. compress data by using more bits to encode more frequently occuring pixels
  

Question 19 :
Given image ‘I’ and structuring element ‘s’ , boundary (I) given as


  1. I – (I ө s)
  2. I + (I ө s)
  3. (I ө s) - I
  4. (I ө s) + I
  

Question 20 :
Which one of the following is not a limitation of the basic high pass filter


  1. It may produce negative response
  2. It may produce response greater than L-1
  3. It destroys all the constant gray level regions
  4. It generates blurring effect
  

Question 21 :
DIT-FFT stands for


  1. Discrete In Time Fast Fourier Transform
  2. Decompose In Time Fast Fourier Transform
  3. Divide In Time Fast Fourier Transform
  4. Decimation In Time Fast Fourier Transform
  

Question 22 :
Example of an isotropic filter is


  1. Robert
  2. Sobel
  3. Laplacian
  4. Prewitt
  

Question 23 :
Given A={(1,0), (1,1), (1,2), (0,3), (1,3), (2,3), (3,3), (1,4)} and B={(0,0), (1,0)} Result of A eroded B will be


  1. {(0,3), (1,3), (2,3)}
  2. {(1,3), (2,3), (3,3)}
  3. {(0,0), (1,3), (2,3)}
  4. {(0,3), (2,3), (3,3)}
  

Question 24 :
Choose lossless statistical method example


  1. Run length encoding
  2. Huffman Encoding
  3. Jpeg
  4. Improved Gray Scale Quantization
  

Question 25 :
Given two pixels P(5,2) and Q(4,7), the D4 distance between them is


  1. 5
  2. 6
  3. 5.099
  4. 1
  
Pages