DOEACC Society 2006 DOEACC B Level BE8 Digital Image Processing ( ) - Question Paper

BE8-R3: DIGITAL IMAGE PROCESSING
NOTE:
Time: three Hours Total Marks: 100
1.
a) discuss the role of knowledge base in image processing?
b) What do you mean by the term representation in the situation of image processing?
c) What do you mean by linear operator to the images?
d) provide the formula for Butterworth lowpass filters and discuss various variables in it.
e) How can we perform the conversion of image in RGB color model into CMY model?
f) provide 3 texture properties, which can be derived from first-order statistics.
g) What is LZW encoding? provide its applications.
(7´4)
2.
a) What do you mean by compression of an image? Compare lossless and lossy
compressions with examples.
b) What is Run Length Encoding (RLE)? discuss with an example.
c) explain Huffman coding Algorithm.
d) What is Arithmetic coding? Compare Arithmetic coding with Huffman coding.
e) provide basic encoding method for transform based image compression.
(3+3+4+4+4)
3.
a) What is algebraic representation of a digital color image?
b) provide RGB color model. explain the conversion of RGB color space onto YUV, YIQ, and
YCrCb Space and compare them.
c) What is syntactic texture description? provide an algorithm for shape chain grammar texture
generation.
d) How can a texture classification issue be transformed into a graph recognition
problem?
(2+6+6+4)
4.
a) explain minimum mean square fault filtering.
b) Compare minimum mean square fault filtering with inverse filtering.
c) What is gray-level interpolation? provide 1 scheme for gray-level interpolation.
(8+4+6)
5.
a) What do you mean by ‘opening’ and ‘closing’? discuss every of them with examples.
b) What is non-uniform sampling and non-uniform quantization? provide specific applications.
c) provide 1 specific scheme for content-based image retrieval.
BE8-R3 Page one of two January, 2006
1. ans ques. one and any 4 ques. from two to 7.
2. Parts of the identical ques. should be answered together and in the identical
sequence.
(6+6+6)
BE8-R3 Page two of two January, 2006
6.
a) Develop an algorithm for converting a one-pixel-thick m-path to a 4-path.
b) Show that the boundary of the region is a closed path.
c) provide a three x three mask for performing unsharp masking in a single pass through an image.
d) elaborate the basic steps in frequency domain filtering?
(6+4+4+4)
7.
a) explain various coding systems described by JPEG standard.
b) discuss region splitting and merging with an example.
c) Suppose that a digital image is subjected to histogram equalization. Show that a second
pass of histogram equalization will produce exactly the identical outcome as the 1st pass.
d) explain the limiting effect of repeatedly applying three x three lowpass spatial filter to a digital
image. You may ignore border effects.
(6+4+4+4)
BE8-R3 Page three of two January, 2006

Earning:   Approval pending.