Code No: R05321902 Set No.

1
III B.Tech Supplimentary Examinations, Aug/Sep 2008
DIGITAL IMAGE PROCESSING
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Distinguish between uniform sampling and non uniform sampling with respect
to Images.
(b) What are the advantages of non uniform sampling. [10+6]

2. Give the expressions for 1D and 2D kernels of Hadamard transform, also give the
transform expressions. [16]

3. Discuss following histogram techniques for Image enhancement.

(a) Histogram specification.

(b) Local enhancement. [16]

4. Distinguish between spatial domain techniques and frequency domain techniques

of Image enhancement. [16]

5. Show that the saturation component of the complement of a color image cannot be
computed from the saturation component of the input image alone. [16]

6. The white bars in the test pattern shown in figure 6b are 7 pixels wide and 210
pixels high. The separation between bars is17 pixels. What would this image look
like after application of

(a) A 9 × 9 min filter?

(b) A 5 × 5 min filter? [16]

Figure 6b
7. Answer the following from the given 3 X 3 image Assume that the Prewitt masks
are used to obtain Gx and Gy.
Show that the gradient
Computed by ∇f = mag(∇f)[G2x +G2y ]1/2 and ∇f = |Gx| + [Gy] give identical for
edges oriented in the horizontal and vertical directions.

1 of 2
Code No: R05321902 Set No. 1
Note: masks used to compute the gradient at point labeled Z5 .
∇f = mag(∇f)[G2x +G2y ]1/2 and ∇f = |Gx| + |Gy| give identical results for edges ori-
ented in the horizontal and vertical directions. [16]
Z1 Z2 Z3
Z4 Z5 Z6
Z7 Z8 Z9

8. (a) Draw and explain a general compression system model.

(b) Draw the relevant diagram for source encoder and source decoder. [8+8]

⋆⋆⋆⋆⋆

2 of 2
Code No: R05321902 Set No. 2
III B.Tech Supplimentary Examinations, Aug/Sep 2008
DIGITAL IMAGE PROCESSING
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Derive transformation matrices for

(a) Translation
(b) Scaling
(c) Rotation about X-axis. [16]

2. (a) Find Fourier transform 2 -D sinusoidal function n(x,y) = A sin(u0 x + v0 y)

(b) Obtain the spectrum in above case. [10+6]

3. Discuss and explain why the discrete histogram equalization technique will not in
general yield a flat histogram. [16]

4. Sketch perspective plot of an 2-D Ideal High pass filter transfer function and filter
cross section and explain its usefulness in Image enhancement. [16]

5. Explain in detail about the HIS and HSV color spaces. [16]

6. Explain about Adaptive, local noise reduction filter. [16]

7. Find the edge corresponding to the minimum cost path in the sub image shown
below. Where the numbers in the parentheses indicate intensity. Assume that the
lines start in the first column and ends in the last column. [16]

0 1 2
0 − − −
(2) (1) (0)
1 − − −
(1) (1) (7)
2 − − −
(6) (8) (2)

8. (a) Draw and explain a general compression system model.

(b) Draw the relevant diagram for source encoder and source decoder. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: R05321902 Set No. 3
III B.Tech Supplimentary Examinations, Aug/Sep 2008
DIGITAL IMAGE PROCESSING
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. A common measure of transmission for digital data is the baud rate, defined as the
number of bits transmitted per second. Generally, transmission is accomplished in
pockets consisting of starting bit, a byte of information, and a stop bit. Using this
approach, answer the following.
(a) How many minutes would it take to transmit a 512×512 image with 256 grey
levels at 300 baud?
(b) What would the time be at 9600 baud?
(c) Repeat
(a) and (b) for a 1024×1024 image 256 grey levels. [16]
2. With reference to FFT show that
(a) W2ux2M=WuxM
(b) Wu+MM=WuM
(c) Wu+M2M=-Wu2M. [16]
3. Discuss the following intensity transformations.
(a) Image negatives
(b) Contrast stretching
(c) Compression of dynamic range. [16]
4. Discuss the frequency domain techniques of Image enhancement in detail. [16]
5. What is NTSC color space? What is its advantage? Explain with its color compo-
nents. [16]
6. Explain the following:
(a) Gaussian noise
(b) Rayleigh noise. [16]
7. (a) Develop a general procedure for obtain the normal representation of a line
from its scope intercept equation y = ax + b
(b) Find the normal representation of the line y = -2x + 1. [16]
8. What is Error Free Compression? Explain about variable length coding. [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: R05321902 Set No. 4
III B.Tech Supplimentary Examinations, Aug/Sep 2008
DIGITAL IMAGE PROCESSING
(Electronics & Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. Derive transformation matrices for

(a) Rotation about X-axis

(b) Rotation about Y-axis
(c) Rotation about Z-axis. [16]

2. N log2N additions and 1/2 N log2N multiplications are needed to compute the FFT
of N points. How many additions and multiplications require to compute the 2- D
FFT of an NXN image. [16]

3. Discuss the concept of derivative filters? How they are used in Image enhancement?
[16]

4. Sketch perspective plot of an 2-D Ideal High pass filter transfer function and filter
cross section and explain its usefulness in Image enhancement. [16]

5. Draw and explain HIS triangle of the RBG color cube. [16]

6. Explain the following Order-Statistics Filters.

(a) Max and min filters

(b) Median filter
(c) Alpha-trimmed mean filter. [16]

7. A binary image contains straight lines oriented horizontally, vertically, at 450 and
at -450 give a set of 3×3 mask that can be used to detect 1-pixel-long brakes in
these lines.assume that the gray levels of lines is one and that the gray level of the
background is 0. [16]

8. (a) Draw and explain a general compression system model.

(b) Draw the relevant diagram for source encoder and source decoder. [8+8]

⋆⋆⋆⋆⋆

1 of 1