You are on page 1of 4

Code.

No: 36061
R05 SET-1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III .B.TECH II SEM SUPPLEMENTARY EXAMINATIONS FEBRUARY - 2010
DIGITAL IMAGE PROCESSING
(ELECTRONICS & COMPUTER ENGINEERING)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---

1. Explain following relations between pixels.


a) Neighbors of pixels
b) Connectivity of pixels
c) Labeling of connected components. [16]

2.a) Discuss the dynamic rang compression property w.r.t 2D-DFT.


b) State and prove separability property of 2D – DFT. [16]

3. Discuss following techniques for Image enhancement


a) Histogram specification.
b) Local enhancement. [16]

4.a) What are the basic properties of frequency domain with respect to the image
processing.
b) Define the terms:
(i) Impulse function of strength a
(ii) Impulse function shifting property. [16]

5.a) Describe the techniques used for color image smoothing?


b) What is the need of graylevel slicing in color images. [8+8]

6. Explain the following order-Statistics Filters.


a) Max and min filters
b) Median filter.
c) Midpoint filter. [16]

7.a) Explain about Prewitt edge Detector.


b) Explain about Sobel edge Detector. [8+8]

8.a) Distinguish between lossy and losslen compression techniques?


b) Explain lossy predictive coding with a neat block diagram. [8+8]

******
Code.No: 36061
R05 SET-2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III .B.TECH II SEM SUPPLEMENTARY EXAMINATIONS FEBRUARY - 2010
DIGITAL IMAGE PROCESSING
(ELECTRONICS & COMPUTER ENGINEERING)
Time: 3hours 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
packets 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 X 512 image with 128
gray levels at 300 baud?
b) What would the time be at 9600 baud?
c) Repeat
(a) and (b) for a 1024 X 1024 image 128 gray levels. [16]

2. State and prove following properties of 2D-DFT


a) Rotation
b) Distributivity. [10+6]

3. Discuss following techniques for Image enhancement.


a) Image subtraction.
b) Image averaging. [16]

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

5.a) What is Pseudocolor? What is the use of Pseudocolor?


b) What is meant by Intensity slicing? Explain the technique behind it. [8+8]

6. Explain the following:


a) Unconstrained Restoration.
b) Constrained Restoration. [8+8]

7.a) Write about Roberts edge Detector.


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

8.a) What is meant by Predictive differential quantizing.


b) Explain Contour tracing and coding. [8+8]

******
Code.No: 36061
R05 SET-3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III .B.TECH II SEM SUPPLEMENTARY EXAMINATIONS FEBRUARY - 2010
DIGITAL IMAGE PROCESSING
(ELECTRONICS & COMPUTER ENGINEERING)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---

1. Consider the image segment shown below.


3 1 2 1(q )
2 2 0 2
1 2 1 1
( p )1 0 1 2
a) Let V = {0, 1} and compute the D4, D8 and Dm distances between p and
q.
b) Repeat for V = {1, 2} [16]

2. Obtain Slant transform matrix for N = 8. [16]

3. Discuss Image smoothing with the following


a) Low pass spatial filtering
b) Median filtering. [16]

4.a) State and explain convolution theorem and correlation theorem.


b) What is successive doubling and how it is used to formulae Fast Fourier transform. [16]

5. Explain the following:


a) Color transformation.
b) Spatial processing. [16]

6. Explain the following two basic types of noise models.


a) Noise in the Spatial domain
b) Noise in the Frequency domain. [8+8]

7. Explain about the Hough Transform Line Detection and Linking. [16]

8.a) What are the various image file formats?


b) Explain Lempel-Zev-Welch coding technique. [8+8]

******
Code.No: 36061
R05 SET-4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III .B.TECH II SEM SUPPLEMENTARY EXAMINATIONS FEBRUARY - 2010
DIGITAL IMAGE PROCESSING
(ELECTRONICS & COMPUTER ENGINEERING)
Time: 3hours Max.Marks:80
Answer any FIVE questions
All questions carry equal marks
---

1. Explain following relations between pixels.


a) Relations, Equivalence and Transitive closures of pixels.
b) Concept of distance measures between pixels. [8+8]

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.a) Give the algorithm for histogram equalization.


b) What is the histogram distribution for high contrast, low contrast images? [8+8]

4. What is unsharp marking? Distinguish between High-Boost-Filtering and High-


frequency Emphasis filtering with respect to image enhancement? [16]

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

6. What are the effects of Diagonalization on the degradation model? Explain. [16]

7. Explain about line detection and edge detection gray level discontinuities in a
digital image. [16]

8. Explain about the following:


a) Lossy compression.
b) Lossy predictive coding. [8+8]

******

You might also like