You are on page 1of 5

# www.andhracolleges.

## Code No: M0403 Set No. 1

IV B.Tech I Semester Regular Examinations, November 2009
DIGITAL IMAGE PROCESSING
(Electronics & Communication Engineering)
Time: 3 hours Max Marks: 80

www.andhracolleges.com
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 512×512 image with 128 grey
levels at 300 baud?
(b) What would the time be at 9600 baud?
(c) Repeat
(a) and (b) for a 1024×1024 image 128 grey levels. [16]

## 2. (a) What is the usefulness of DCT in Image processing?

(b) Give the expressions for 1D and 2D DCT and explain. [6+10]

3. Show that a high pass filtered Image can obtained in the spatial domain as High
pass= Original - Low pass, for simplicity assume 3x3 filters. [16]

www.andhracolleges.com
4. Give the expression for 2-D Butterworth Low pass filter transfer function and sketch
it. Explain its usefulness in Image enhancement. [16]

5. What is NTSC color space? What is its advantage? Explain with its color compo-
nents. [16]

## (a) Gaussian noise

(b) Rayleigh noise. [16]

7. Answer the following from the given 3 X 3 image Assume that the Prewitt masks
are used to obtain Gx and Gy.
Computed by ∇f = mag(∇f)[G2x +G2y ]1/2 and ∇f = |Gx| + [Gy] give identical for
edges oriented in the horizontal and vertical directions.
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
USA-UK-Australia-Germany-France-NewZealand Universities List
1 of 2
www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

## Code No: M0403 Set No. 1

8. State and derive Shannon?s first theorem for a zero- memory source. [16]

?????

www.andhracolleges.com

www.andhracolleges.com
USA-UK-Australia-Germany-France-NewZealand Universities List
2 of 2
www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

## Code No: M0403 Set No. 2

IV B.Tech I Semester Regular Examinations, November 2009
DIGITAL IMAGE PROCESSING
(Electronics & Communication Engineering)
Time: 3 hours Max Marks: 80

www.andhracolleges.com
All Questions carry equal marks
?????

1. Show that the D4 distance between two points p and q is equal to the shortest
4-path between these points. Is this path unique? [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. 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 Low pass filter transfer function and filter
cross section and explain its usefulness in Image enhancement. [16]

5. Derive the CMY transformations to generate the complement of a color image. [16]

## (a) Max and min filters

(b) Median filter

www.andhracolleges.com
(c) Alpha-trimmed mean filter. [16]

## 7. (a) Write about Roberts edge Detector.

(b) Explain about Laplacian of a Gaussian (LoG) Detector. [8+8]

## (a) Lossy compression

(b) Lossy predictive coding. [8+8]

?????

USA-UK-Australia-Germany-France-NewZealand Universities List
1 of 1
www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

## Code No: M0403 Set No. 3

IV B.Tech I Semester Regular Examinations, November 2009
DIGITAL IMAGE PROCESSING
(Electronics & Communication Engineering)
Time: 3 hours Max Marks: 80

www.andhracolleges.com
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 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. Obtain Slant transform matrix for N=8. [16]

3. Show that a high pass filtered Image can obtained in the spatial domain as High
pass= Original - Low pass, for simplicity assume 3x3 filters. [16]

4. Sketch perspective plot of an 2-D Ideal Low pass filter transfer function and filter

www.andhracolleges.com
cross section and explain its usefulness in Image enhancement. [16]

5. Explain with a neat diagram how the gray levels are transformed to color. [16]

## 6. (a) What is Image degradation process ? Explain.

(b) explain image degradation models for continuous functions. [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]

?????

USA-UK-Australia-Germany-France-NewZealand Universities List
1 of 1
www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

## Code No: M0403 Set No. 4

IV B.Tech I Semester Regular Examinations, November 2009
DIGITAL IMAGE PROCESSING
(Electronics & Communication Engineering)
Time: 3 hours Max Marks: 80

www.andhracolleges.com
All Questions carry equal marks
?????

## 1. Discuss following terms w.r.t Image

(a) Sampling
(b) Quantization
(c) Relations between pixels
(d) Transformations. [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 limiting effect of repeatedly applying a 3X3 low pass spatial filter to a
digital Image. You may ignore the border effects. [16]

## 5. (a) Explain about YCbCr color space.

www.andhracolleges.com
(b) Explain about HSC color space. [8+8]

## 6. (a) What is Image degradation process ? Explain.

(b) explain image degradation models for continuous functions. [8+8]

7. The results obtained by a single through an image of some 2D- masks can also be
achieved by two passes using 1-D masks. The results of using a 3 × 3 smoothing
mask with coefficients 1/9 can also be obtained by passing through an image  the
1
mask [1 1 1]. The result of this pass is then followed by a pass of the mask.  1 .
1
The final result is then scaled by 1/9.show that the Sobel masks can be implemented
by one pass of a differencing mask of the form [-1 0 1] (or it’s vertical counterpart)
followed By a smoothing mask of the form [1 2 1] (or it’s vertical counterpart). [16]

## (a) Lossy compression

(b) Lossy predictive coding. [8+8]

?????