[go: up one dir, main page]
Scribd
Upload
136 views5 pages

Ip MCQ3

This document contains 30 multiple choice questions related to image processing concepts like run length encoding, edge detection, Huffman coding, JPEG, morphological operations, segmentation, and compression techniques. The questions cover topics such as derivatives and edge detection, Huffman coding properties, intensity levels in images, parts of arithmetic coding, morphological operations like erosion and dilation, and lossy vs. lossless compression methods.

Uploaded by

Jitendra Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
136 views5 pages

Ip MCQ3

This document contains 30 multiple choice questions related to image processing concepts like run length encoding, edge detection, Huffman coding, JPEG, morphological operations, segmentation, and compression techniques. The questions cover topics such as derivatives and edge detection, Huffman coding properties, intensity levels in images, parts of arithmetic coding, morphological operations like erosion and dilation, and lossy vs. lossless compression methods.

Uploaded by

Jitendra Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 5

Q1. Consider a 3 x 3 greyscale image of 4 bits with L = 0 – 15.

H(x)= 6 6 6
11 1
1 4 4
The RLE representation is given as:-
A. 6 3 1 4 4 2
B. 1 3 6 4 4 2
C. 4 3 6 4 1 2
D. 1 0 6 6 4 2
Ans a

Q2. First derivative in image segmentation produces


a) thin edges
b) thick edges
c) fine edges
d) rough edges
ans b

Q3. Which of the following is true about Huffman Coding?


(A) Huffman coding may become lossy in some cases
(B) Huffman Codes may not be optimal lossless codes in some cases
(C) In Huffman coding, no code is prefix of any other code.
(D) All of the above
Ans c

Q4. How many bits may be required for encoding the message ‘mississippi using Huffman coding
method’?
A. 0.7
B. 1.7
C. 1.9
D. 2.5
Ans c

Q5. Canny edge detection algorithm is based on


a) step edge
b) ideal model
c) real model
d) smoothing model
ans a

Q6. What is boundary extraction ?


A. First, erode image A by SE, then make set difference between A and the erosion.
B. First, close image A by SE, then make set difference between A and the closing.
C. First, dilate image A by SE, then make set difference between A and the dilation.
D. None of the above.
Ans a

Q7. What is the expanded form of JPEG?


a) Joint Photographs Expansion Group
b) Joint Photographic Expansion Group
c) Joint Photographic Experts Group
d) Joint Photographic Expended Group

ans c
Q8. In a 4 bit image how many maximum intensity levels can be there
A. 15
B. 20
C. 16
D. 256
Ans c
Q9.How many parts does arithmetic coding technique has
A. 3
B. 2
C. 5
D. 4
Ans b

Q10. For point detection we use


a) second derivative
b) first derivative
c) third derivative
d) Both b and c
ans d

Q11. The resolution of the image (16X16) is


a) 160
b) 256
c) 128
d) 144
and b

Q 12. First and second derivatives can be computed using


a) frequency filters
b) low pass
c) high pass
d) spatial filters
ans d

Q 13. Example of similarity approach in image segmentation is


a) edge based segmentation
b) region based segmentation
c) boundary based segmentation
d) Both a and b

ans b
Q 14. Pixels where intensity changes abruptly are called
a) line pixels
b) area pixels
c) edge pixels
d) point pixels
ans c

Q 15. Regions of the image must be


a) disjoint
b) joint
c) connected
d) overlapped
ans a

Q16. In morphological operations, SE is viewed as


a) low pass filter
b) correlation mask
c) convolution mask
d) high pass filter
ans c

Q17. Erosion followed by dilation is called


a) translation
b) blurring
c) closing
d) opening
ans d
Q18. Hit-or-miss transformation is used for shape
a) detection
b) removal
c) compression
d) decompression
ans a
Q19. Dilation is used for
a) translation
b) compression
c) detection
d) bridging gaps
ans d

Q20. Thresholding gives the


a) large image
b) binary image
c) color image
d) gray scale image
ans b

Q21. Which step of image processing deals with assigning a label to an object based on its
descriptors.
a) morphological processing
b) object recognition
c) segmentation
d) representation and description
Q22. Watershed algorithm belongs to
a) image enhancement
b) Object recognition
c) compression
d) segmentation
ans b

Q23. Types of data redundancy are


a) 2
b) 3
c) 1
d) 4
ans b
Q24. Replication of the pixels is called
a) spatial redundancy
b) coding redundancy
c) both a and d
d) temporal redundancy
ans c

Q25. In PXQ, Q is no. of


a) intensity values
b) rows
c) coordinates
d) columns
ans d

Q26. Which of the following algorithms is the best approach for solving for Huffman codes?
a) exhaustive search
b) brute force algorithm
c) greedy algorithm
d) divide and conquer algorithm
ans c

Q27. Which of the following is not a lossy compression technique?


a. JPEG
b. Arithmetic coding
c. MPEG
d. FFT
ans b

Q28. Coding redundancy works on


a) pixels
b) matrix
c) coordinates
d) intensity
ans d
Q 29. A chain code algorithm is
A. Lossless algorithm for color images.
B. Lossless algorithm for monochrome images.
C. Lossy algorithm for monochrome images.
D. Lossless algorithm for greyscale images.
Ans b

Q30. Which one of the following is not true about arithmetic coding algorithm.
A. It is a lossy data compression technique.
B. It uses stream based encoding
C. It is a variable length encoding technique.
D. All are correct.
Ans a

You might also like