Scribd
Upload
133 views2 pages

PEC IT 601D CA3 Suggestion

The document contains a practice exam for an Image Processing course. It includes 17 multiple choice and short answer questions covering various topics in digital image processing including pixels, image formation, sampling and quantization, image operations like addition and subtraction, filtering, transforms like Fourier and Haar, and principles of region-based image analysis. It also includes two image processing examples asking students to perform tasks like finding shortest paths and applying histogram equalization.

Uploaded by

realaryaroy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
133 views2 pages

PEC IT 601D CA3 Suggestion

The document contains a practice exam for an Image Processing course. It includes 17 multiple choice and short answer questions covering various topics in digital image processing including pixels, image formation, sampling and quantization, image operations like addition and subtraction, filtering, transforms like Fourier and Haar, and principles of region-based image analysis. It also includes two image processing examples asking students to perform tasks like finding shortest paths and applying histogram equalization.

Uploaded by

realaryaroy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

TECHNO INTERNATIONAL - BATANAGAR

CA 3 Suggestion, Even Semester, 2023


Image Processing
(PEC IT 601D)

1. Pixel is (a) Smallest Building block of a picture (b) Largest Building block of a picture
(c) Simple Building block of a picture (d) Short Building block of a picture

2. Reflectance [r(x,y)] lies between (a) 0 ⩽ r(x,y) ) ⩽ 1, (b) 0 ⩽ r(x,y) ) ⩽ infinity,

(c) 1 ⩽ r(x,y) ) ⩽ infinity, (d) 0 < r(x,y) ) < 1,

3. 8-neighbours is the union of ----------------?


4. At what points, a continuous image is digitized?
5. ________ represents the transition between image function's continuous values and its
digital equivalent.
6. Which of the following is not a correct example of Image Multiplication?
7. What is the real-world application of image subtraction?
8. What is meant by Region of Interest (ROI) operations?
9. Explain the term ‘path’, ‘region’, and ‘boundary’ in the aspects of digital images.

10. Define 4- adjacency, 8-adjacency, and m-adjacency in the aspects of a digital image.

11. Explain (i) 4-Connectivity, (ii) 8-Connectivity, and (iii) Diagonal-Connectivity of pixels
in the digital image with suitable figures.

12. What is Digital Image Processing? Explain the Image Formation Model.

13. Define Sampling & Quantization.

14. (a) Consider the image segment shown.


Let V = {0,1}. Compute the lengths of the shortest 4-, 8- and m-path between p and q. If
a particular path does not exist between these two points explain why.
3 1 2 1(q)
0 2 0 2
1 2 1 1
(p)1 0 1 2
(b) Consider the image segment shown.
TECHNO INTERNATIONAL - BATANAGAR

Let V = {1,2}. Compute the lengths of the shortest 4-, 8- and m-path between p and q. If
a particular path does not exist between these two points explain why.
3 1 2 1(q)
0 2 0 2
1 2 1 1
(p)1 0 1 2

15. (a) Perform Histogram Equalization for an 8 x 8 image shown below?

Grey 0 1 2 3 4 5 6 7
Levels
No. Of 9 8 11 4 10 15 4 3
Pixels

(b) Perform Histogram Equalization for the following image shown below?
1 2 1 1 1
2 5 3 5 2
2 5 5 5 2
2 5 3 5 2
1 1 1 2 1

16. Define Smoothing of Linear Filters. How many types of linear filters are there and discuss
all the linear filters. Why median filter is better than the mean filter? Write advantages of
Median filter?
17. Write short notes on the below topics.
1. Haar transform
2. Fourier Transform
3. 2-D Fourier Transform
4. FFT Algorithm
5. Principle Component Analysis

You might also like