Download JNTUA B.Tech 4-2 R15 2019 April Regular 15A10801 Digital Image Processing Question Paper

FirstRanker's choice

Code: 15A10801

Time: 3 hours

--- Content provided by⁠ FirstRanker.com ---

FirstRanker.com

B.Tech IV Year II Semester (R15) Regular Examinations April 2019

DIGITAL IMAGE PROCESSING

(Electronics & Instrumentation Engineering)

Max. Marks: 70

--- Content provided by FirstRanker.com ---

PART - A

(Compulsory Question)

1. Answer the following: (10 X 02 = 20 Marks)

1. List out the various types of adjacency and its significance.
2. Draw the basic sensor arrangement and define how to transform illumination energy into digital images.

--- Content provided by​ FirstRanker.com ---

3. State the periodicity property of 2-D-DFT.
4. Write any two applications of hotelling transforms.
5. What is histogram? How to equalize the histogram?
6. State any two differences between image smoothing and image sharpening.
7. Mention the disadvantage of inverse filtering.

--- Content provided by‌ FirstRanker.com ---

8. Define edge linking with an example.
9. What is bit plane coding and what are its advantages?
10. List out the various image compression standards.

PART - B

(Answer all five units, 5 X 10 = 50 Marks)

--- Content provided by⁠ FirstRanker.com ---

UNIT - I

2. Elaborate on sampling and quantization of an image in brief.

OR

3. With suitable example, explain the spatial operations on an image and the geometric spatial transformation of an image.

UNIT - II

--- Content provided by‍ FirstRanker.com ---

4. Prove that both 2-D continuous and discrete Fourier transforms are linear operations.

OR

5. Consider an image form of size 2 X 2 and find the 2-D DCT of an image and verify the output after inverse DCT.

f(m, n) = 1 0 5 10

UNIT - III

--- Content provided by​ FirstRanker.com ---

6. Explain any four spatial operations performed on images for enhancement.

OR

7. Elaborate on different histogram techniques used to modify an image with a suitable example.

UNIT - IV

8. Explain the model of image degradation/restoration process and the restoration process using constrained least square error filter.

--- Content provided by​ FirstRanker.com ---

OR

9. With suitable example, elaborate on the threshold based segmentation methods.

UNIT - V

10. Consider certain images which are represented as (a, b, c, d, e, f) whose probabilities are {0.1, 0.4, 0.06, 0.1, 0.04, 0.3} using Huffman coding. Find its efficiency, redundancy and length of the code.

OR

--- Content provided by​ FirstRanker.com ---

11. State the advantages of transform coding and explain with suitable block diagram.

FirstRanker.com