Firstranker's choice
Printed Pages: 02
Paper Id: 110811
--- Content provided by FirstRanker.com ---
Sub Code: NCS 801
Roll No.
B TECH
(SEM-VIII) THEORY EXAMINATION 2017-18
--- Content provided by FirstRanker.com ---
DIGITAL IMAGE PROCESSING
Time: 3 Hours
Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
--- Content provided by FirstRanker.com ---
1. Attempt all questions in brief. 2 x 10 = 20
- Define Image. What is range?
- What is meant by reflectance?
- What is meant by binary image, color image, grey-scale image?
- Explain Harmonic mean filter.
- What is contrast stretching?
- What do you mean by dilation and erosion?
- Explain counter predictive coding.
- List edge detection operators.
- Explain affine transform.
- Explain the concept of thresholding.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION B
2. Attempt any three of the following: 10 x 3 = 30
- What do you mean by digital image representation.
- Compare and contrast between linear spatial filtering and non linear spatial filtering.
- What is image restoration? Draw and explain the basic block diagram of the restoration process. Give two areas where restoration process can be applied?
- What do you understand by Hit-Miss Transform and why they are used explain in brief?
- Prove that prewitt and sobel operator act as a low pass and high pass filter.
--- Content provided by FirstRanker.com ---
SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
--- Content provided by FirstRanker.com ---
- Explain region based segmentation with an example.
- Explain intensity transformations in details. What would happen to the dynamic range of an image if all the slopes in the contrast stretched algorithm (l, m, n) are less than 1? Answer using illustration.
4. Attempt any one part of the following: 10 x 1 = 10
- Explain intensity transformations in details. What would happen to the dynamic range of an image if all the slopes in the contrast stretched algorithm (l, m, n) are less than 1? Answer using illustration.
- Explain the Hough Transforms to join the points. And also explain the problem of HT with their solutions. Given the four points in the x-y plane with the following coordinates (1,1), (2,2),(3,3), (4,4). Use Hough Transform to join these points.
--- Content provided by FirstRanker.com ---
5. Attempt any one part of the following: 10 x 1 = 10
- What is Histogram Equalization ?
- Explain Laplacian Filter.
6. Attempt any one part of the following: 10 x 1 = 10
- Explain opening and closingoperation for gra scale image processing.
- describe fundamental operations of morphological image processing.
--- Content provided by FirstRanker.com ---
7. Attempt any one part of the following: 10 x 1 = 10
- Write short note on following
- Region Extraction
- Image Registration
- Write short note on following
- Edge detection Algorithm
- Line detection Algorithm
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University