## Image-Processing

 Question 1
If the frame buffer has 8 bits per pixel and 8 bits are allocated for each of the R, G, B components, what would be the size of the lookup table?
 A 24 bytes B 1024 bytes C 768 bytes D 256 bytes
Image-Processing       ISRO CS 2013
Question 1 Explanation:
Given data,
Frame buffer =8 bits per pixel
Each component(R,G,B)= 8 bits Question 2
From the given data below :
a b b a a b b a a b
which one of the following is not a word in the dictionary created by LZ-coding (the initial words are a, b)?
 A a b B b b C b a D b a a b E None of the above
Image-Processing       LZ-Coding       UGC NET CS 2017 Jan- paper-3
Question 2 Explanation:
Lempel–Ziv–Welch is a universal lossless data compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch
abbaabbaab
⇒ Dictionary created by L2 - coding will contain words:
a | b | ba | ab | baa | b
b - already present in dictionary
So the words are a, b, ba, ab, baa.
⇒ Hence ‘B’ and ‘D’ both are not present in the dictionary.
Note: (B) and (D) is correct answers
 Question 3
Which of the following is used for the boundary representation of an image object?
 A Quad Tree B Projections C Run length coding D Chain codes
Image-Processing       Chain-Codes       UGC NET CS 2016 July- paper-3
Question 3 Explanation:
→ Chain codes is used for the boundary representation of an image object.

→ A chain code is a lossless compression algorithm for monochrome images. The basic principle of chain codes is to separately encode each connected component, or "blob", in the image.

→ For each such region, a point on the boundary is selected and its coordinates are transmitted. The encoder then moves along the boundary of the region and, at each step, transmits a symbol representing the direction of this movement.

 Question 4
Which of the following is not used in standard JPEG image compression?
 A Huffman coding B Run length encoding C Zig-zag scan D K-L Transform
Image-Processing       Image-Compression       UGC NET CS 2016 Aug- paper-3
Question 4 Explanation:
→ Huffman coding, Run length encoding and ZIg-zag scan is used to compress the image.
K-L Transform is a representation of a stochastic process as an infinite linear combination of orthogonal functions, analogous to a Fourier series representation of a function on a bounded interval. The transformation is also known as Hotelling transform and eigenvector transform, and is closely related to principal component analysis (PCA) technique widely used in image processing and in data analysis in many fields.
 Question 5
If the histogram of an image is clustered towards origin on X-axis of a histogram plot then it indicates that the image is ______.
 A Dark B Good contrast C Bright D Very low contrast
Image-Processing       Histogram       UGC NET CS 2016 Aug- paper-3
Question 5 Explanation:
→ If the histogram of an image is clustered towards origin on X-axis of a histogram plot then it indicates that the image is dark.
→ An image histogram is a type of histogram that acts as a graphical representation of the tonal distribution in a digital image. It plots the number of pixels for each tonal value. By looking at the histogram for a specific image a viewer will be able to judge the entire tonal distribution at a glance.
→ The histogram for a very dark image will have the majority of its data points on the left side and center of the graph. Conversely, the histogram for a very bright image with few dark areas and/or shadows will have most of its data points on the right side and center of the graph.
 Question 6
Blind image deconvolution is ____________.
 A Combination of blur identification and image restoration B Combination of segmentation and classification C Combination of blur and non-blur image D None of the above
Image-Processing       deconvolution       UGC NET CS 2015 Dec - paper-3
Question 6 Explanation:
Blind deconvolution: a deconvolution technique that permits recovery of the target scene from a single or set of "blurred" images in the presence of a poorly determined or unknown point spread function (PSF). Any blurred image can be given as input to blind deconvolution algorithm, it can deblur the image.
 Question 7 The Laplacian of an image at all points (x, y) can be implemented by convolving the image with spatial mask. Which of the following can be used as the spatial mask ?
 A only S1 B only S2 C Both S1 and S2 D None of these
Image-Processing       convolution       UGC NET CS 2014 Dec - paper-3
 Question 8
Given a simple image of size 10 × 10 whose histogram models the symbol probabilities and is given by The first order estimate of image entropy is maximum when
 A a = 0, b = 0, c = 0, d = 1 B a =1/2, b =1/2, c = 0, d = 0 C a =1/3, b =1/3, c =1/3, d = 0 D a =1/4, b =1/4, c =1/4, d =1/4
Image-Processing       Entropy       UGC NET CS 2014 Dec - paper-3
 Question 9
A Butterworth lowpass filter of order n, with a cutoff frequency at distance D0 from the origin, has the transfer function H(u, v) given by
 A B C D Image-Processing       Filters       UGC NET CS 2014 Dec - paper-3
There are 9 questions to complete.