Sunteți pe pagina 1din 6

# Set No.

## IV B.Tech I Semester Supplimentary Examinations, March 2009

DIGITAL IMAGE PROCESSING
(Electronics & Communication Engineering)
Time: 3 hours
Max Marks: 80
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. (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. What is high boost filtering? How it is different from high pass filtering, compare
these techniques.
[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. (a) What is meant by color Image smoothing? Explain.
(b) What is meant by color image Sharpening? Explain.

[8+8]

## 6. (a) What is the function of Inverse Filter

(b) Draw the Appropriate Diagram for Inverse Filter

[5+5+6]

## 7. (a) Explain about Sobel edge Detector.

(b) Explain about Laplacian of a Gaussian (LoG) Detector.
8. What is Error Free Compression? Explain about variable length coding.

[8+8]
[16]

1 of 1

Krishna Thota

Set No. 2

## IV B.Tech I Semester Supplimentary Examinations, March 2009

DIGITAL IMAGE PROCESSING
(Electronics & Communication Engineering)
Time: 3 hours
Max Marks: 80
All Questions carry equal marks

## 1. (a) Discuss in detail sampling and quantization of Images.

(b) Define spatial resolution? What is its effect on Image processing.

[10+6]

## 2. With mathematical expressions discuss Hotelling transform and explain how it is

useful in Image processing. How it is different from other transforms.
[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 Low pass filter transfer function and filter
cross section and explain its usefulness in Image enhancement.
[16]
5. Consider the following image composed of solid color squares for discussing your
answer, choose a gray scale consisting of eight shades of gray, 0 through 7, where 0
is black and 7 is white. Suppose that the image is converted to H S I color space,.
(a) Sketch the hue image.
(b) Sketch the saturation image.
(c) Sketch the intensity image.
Note : use specific numbers for the grade shades. shown in figure 5c.

[16]

Figure 5c
6. Explain about Iterative Nonlinear Restoration Using the Lucy-Richardson Algorithm.
[16]
1 of 2

Krishna Thota

Set No. 2

## Code No: R05410408

7. (a) Find the edge Detection using function edge
(b) Explain about Sobel edge Detector.

[8+8]

## 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

Krishna Thota

Set No. 3

## IV B.Tech I Semester Supplimentary Examinations, March 2009

DIGITAL IMAGE PROCESSING
(Electronics & Communication Engineering)
Time: 3 hours
Max Marks: 80
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
packets consisting of starting bit, a byte of information, and a stop bit. Using this
(a) How many minutes would it take to transmit a 512512 image with 128 grey
levels at 300 baud?
(b) What would the time be at 9600 baud?
(c) Repeat
(a) and (b) for a 10241024 image 128 grey levels.

[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 the following intensity transformations.

(a) Image negatives
(b) Contrast stretching
(c) Compression of dynamic range.

[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]

[16]

7. A binary image contains straight lines oriented horizontally, vertically, at 450 and
at -450 give a set of 33 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

Krishna Thota

Set No. 4

## IV B.Tech I Semester Supplimentary Examinations, March 2009

DIGITAL IMAGE PROCESSING
(Electronics & Communication Engineering)
Time: 3 hours
Max Marks: 80
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
(a) How many minutes would it take to transmit a 512512 image with 256 grey
levels at 300 baud?
(b) What would the time be at 9600 baud?
(c) Repeat
(a) and (b) for a 10241024 image 256 grey levels.

[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. (a) Discuss Image sharpening with high pass masks.

(b) Discuss Image sharpening with high boost filtering.

[8+8]

4. Give the expression for 2-D Butterworth High pass filter transfer function and
sketch it. Explain its usefulness in Image enhancement.
[16]
5. Consider the following image composed of solid color squares for discussing your
answer, choose a gray scale consisting of eight shades of gray, 0 through 7, where 0
is black and 7 is white. Suppose that the image is converted to H S I color space,.
(a) Sketch the hue image.
(b) Sketch the saturation image.
(c) Sketch the intensity image.
Note : use specific numbers for the grade shades. shown in figure 5c.

1 of 2

[16]

Krishna Thota

Set No. 4

Figure 5c

[16]

[16]

## 8. An 8 level image has the gray level distribution given in table.

rk
Pr (rk ) Code 1 L1 (rk ) Code 2 L2 (rk )
r0 = 0
0.19
000
3
11
2
r1 =1/7
0.25
001
3
01
2
r2 =1/7
0.21
010
3
10
2
r3 =3/7
0.10
011
3
001
3
r4 =4/7
0.08
100
3
0001
4
r5 =5/7
0.06
101
3
00001
5
r6 =6/7
0.03
110
3
000001
6
r7 =1
0.02
111
3
000000
6
(a) Construct the best B1 - code for the distribution.
(b) Construct the Huffman code for source symbol.

[16]

2 of 2

Krishna Thota