Image Processing QB
Image Processing QB
TEXT BOOK:
1. Rafael C. Gonzales, Richard E. Woods, “Digital Image Processing”, Third Edition, Pearson
Education, 2010.
REFERENCES:
1. Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins, “Digital Image Processing Using
MATLAB”, Third Edition Tata McGraw Hill Pvt. Ltd., 2011.
2. Anil Jain K. “Fundamentals of Digital Image Processing”, PHI Learning Pvt. Ltd., 2011.
3. Willliam K Pratt, “Digital Image Processing”, John Willey, 2002.
4. Malay K. Pakhira, “Digital Image Processing and Pattern Recognition”, First Edition, PHI
Learning Pvt. Ltd., 2011.
5. http://eeweb.poly.edu/~onur/lectures/lectures.html.
6. http://www.caen.uiowa.edu/~dip/LECTURE/lecture.html
1. Define Image?
An image may be defined as two dimensional light intensity function f(x, y) where x and y denote
spatial co-ordinate and the amplitude or value of f at any point (x, y) is called intensity or grayscale or
brightness of the image at that point.
18. What are the applications of digital image processing systems ? AU NOV/DEC 2007
1. Medical Image applications 2. Satellite Imagery 3. Remote sensing
4.Automotives 5. Communications
27. Find the number of bits required to store a 256 X 256 image with 32 gray levels?
32 gray levels = 25 = 5 bits 256 * 256 * 5 = 327680 bits.
28. Write the expression to find the number of bits to store a digital image?
The number of bits required to store a digital image is b=M X N X k ,When M=N, this equation
becomes b=N^2k
40. When is fine sampling and coarse sampling used? (Apr/May 2017)
Fine sampling is required in the neighborhood of sharp gray level transitions while coarse sampling is
required in relatively smooth regions.
6. What is the purpose of image averaging? AU NOV/DEC 2007 , APR /MAY 2011
An important application of image averagingis in the field of astronomy, where imaging with
very low light levels is routine, causing sensor noise frequently to render single images virtually useless
for analysis.
1 if D (u , v ) D0
H (u , v )
0 if D (u, v ) D0
24. Name the different types of derivative filters? AU NOV/DEC 2009 ,2008
1. Perwitt operators
2. Roberts cross gradient operators
3. Sobel operators
25. Give transfer function and frequency response of a Gaussian lowpass filter.
The transfer function of a Gaussian lowpass filter of order n and with cut off frequency at a
distance D0 from the origin is, Where D(u , v) [(u M / 2) 2 (v N / 2) 2 ]1/ 2
2
( u , v ) / 2 D0 2
H (u , v) e D
26. Give transfer function and frequency response of a high pass filter.
The transfer function of a high pass filter of order n and with cut off frequency at a
distance D0 from the origin is, Where D(u , v) [(u M / 2) 2 (v N / 2) 2 ]1/ 2
0 if D (u, v) D0
H (u , v)
1 if D (u , v) D0
27. Give transfer function and frequency response of a Gaussian high pass filter.
The transfer function of a Gaussian lowpass filter of order n and with cut off frequency at a
distance D0 from the origin is, Where D(u , v) [(u M / 2) 2 (v N / 2) 2 ]1/ 2
2
( u , v ) / 2 D0 2
H (u , v) 1 e D
s=c*rγ
Map a narrow range of dark input values into a wider range of output values or vice versa
Varying γ gives a whole family of curves
29. If all the pixels in an image are shuffled, will there be any change in the histogram? Justify your
answer. (Apr/May 2017)
No, The histogram of a digital image with gray levels in the range [0, L-1] shows us the number of
occurrence of the gray levels and it is not concerned with the location of pixels.
30. Whether two different images can have same histogram? Justify your answer (Nov/Dec 2017)
The histogram of a digital image with gray levels in the range [0, L-1] shows us the number of occurrence
of the gray levels. Two different images can have the same histogram if the number of occurrence of the
gray level value remains the same in both the images. Example for an eight image there will be 256 levels
of gray level value and values ranging from 0 to 255.The number of occurrence of the gray level value
from 0 to 255 should remain the same.
31. For an eight bit image, write the expression for obtaining the negative of the input image.
(Nov/Dec 2017)
The negative of an image with gray levels in the range [0, 255] is obtained by using the negative
transformation, which is given by the expression. s = 256-1-r Where s is output pixel and r is input pixel
14. Which is the most frequent method to overcome the difficulty to formulate the spatial relocation
of pixels?
The point is the most frequent method, which are subsets of pixels whose location in the input
(distorted) and output (corrected) imaged is known precisely.
15. What are the three methods of estimating the degradation function?
1. Observation
2. Experimentation
3. Mathematical modeling.
17. Give the relation for guassian noise? AU MAY /JUNE 2013
Guassian noise: The PDF guassian random variable Z is given 1 2 2
p( z) e ( z ) / 2
2
Mean: a b / 4
Variance: b(4 )
2
4
Variance
decomposition of an image.
31. What is blur impulse response and noise levels? Blur impulse response:
This parameter is measured by isolating an image of a suspected object within a picture.
Noise levels: The noise of an observed image can be estimated by measuring the image covariance
over a region of constant background luminence.
33. Give the difference between Enhancement and Restoration? Apr/May 2017
S.No Image Enhancement Image Restoration
1. It gives better Visual representation It removes the effect of sensing
environment
2. No model required Mathematical model of degradation is
required
3. It is subjective process It is an objective process
4. Removal of image blur by applying a Enhancement technique is based
deblurrings function is considered a primarily on the pleasing aspects it
restoration technique. might present to the viewer. For
example: Contrast Stretching.
37. How the derivatives are obtained in edge detection during formulation?
The first derivative at any point in an image is obtained by using the magnitude of the gradient at
that point. Similarly the second derivatives are obtained by using the laplacian.
39. What are the two properties used for establishing similarity of edge pixels?
(1) The strength of the response of the gradient operator used to produce the edge pixel.
(2) The direction of the gradient.
41. Give the properties of the second derivative around an edge? MAY JUNE 2013
1. The sign of the second derivative can be used to determine whether an edge pixel lies on the
dark or light side of an edge.
2. It produces two values for every edge in an image.
3. An imaginary straightline joining the extreme positive and negative values of the second
derivative would cross zero near the midpoint of the edge.
45. Specify the steps involved in splitting and merging? MAY JUNE 2013
Split into 4 disjoint quadrants any region Ri for which P(Ri)=FALSE.
Merge any adjacent regions Rj and Rk for which P(RjURk)=TRUE.
Stop when no further merging or splitting is positive.
48. Which filter will be effective in minimizing the impact of salt and pepper noise in an
image?(Nov/Dec 2017)
Median filtering is a nonlinear operation used in image processing to reduce "salt and pepper" noise. The
median is calculated by first sorting all the pixel values from the surrounding neighborhood into
numerical order and then replacing the pixel being considered with the middle pixel value. (If the
neighboring pixel which is to be considered contains an even number of pixels, than the average of the
two middle pixel values is used.)
content, but the content of data to be compressed affects the compression ratio. Compression is
normally measured with the compression ratio.
15. What are the operations performed by error free compression? AU MAY /JUNE 2013
1) Devising an alternative representation of the image in which its interpixel redundant are reduced.
2) Coding the representation to eliminate coding redundancy
32.When a code is said to be prefix code? Mention one advantage of prefix code. (Nov/Dec 2017)
1. The Prefix Code is variable length source coding scheme where no code is the prefix of any other code.
2. The prefix code is a uniquely decodable code. given a complete and accurate sequence, a receiver can
identify each word without requiring a special marker between words.
3. But, the converse is not true i.e., all uniquely decodable codes
Run-length encoding (RLE) is one of the simplest data compression methods. The basic RLE principle is
that the run of characters is replaced with the number of the same characters and a single character.
Examples may be helpful to understand it better.
3. Hough Transform
4. Graph Searching
5. Dynamic Programming
6. Contour Following
12. Does the use of chain code compress the description information of an object
contour?(Apr/May 2017)
Chain codes are the most size-efficient representations of rasterised binary shapes and contours.
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. This continues until the encoder returns to the starting position, at
which point the blob has been completely described, and encoding continues with the next blob in
the image. This encoding method is particularly effective for images consisting of a reasonably
small number of large connected components.
The length of a boundary: the number of pixels along a boundary gives a rough approximation of
its length.
The shape number of a boundary is defined as the first difference of smallest magnitude.
The order n of a shape number is defined as the number of digits in its representation
6. The number of pixels with values above and below the mean
The Euler number is defined as the number of connected components minus the number of holes
Pattern class: a family of patterns sharing some common properties. – They are denoted by ω1 , ω2 ,…,
ωW, W being the number of classes.
20. Obtain the 4 directional chain code for the shape shown in the figure. The dot represents the
starting point. (Nov/Dec 2017)