14

15

16

17

18

19

a)
b)
a)

b)
a)

a)
b)
௦)
8)
b)

a)
b)

04000CS 463092001

3 2 1 )0(
2 0 2

1 1 1
(0) 1 0 1 2

Let the set of adjacency values used to define adjacency, V= {0, 1} and

کر ويم يم

compute the lengths of the shortest 4-, 8-, and m- path between p and 0. If a
particular path does not exist between these two points, explain why?
PART C

Answer any two full questions, each carries 9 marks.
Write short note on median filters.
Explain homomorphic filtering.
Define histogram. How histogram is generated for an image. Sketch the
histograms of dark image, light image, low-contrast image and high contrast
image.
How negative of an image is obtained?
Explain about smoothing frequency domain filters and sharpening frequency
domain filters.

PART D

Answer any two full questions, each carries 12 marks.
Explain the use of polygonal approximations to find boundary in an image.
How to detect isolated points in an image?
Give 3 X 3 masks to detect horizontal line and vertical line in an image.
Explain region based segmentation.
Explain edge detection techniques using first order and second order
derivatives.
Elucidate the use of chain codes to represent boundary in an image.
Explain about the following morphological operations:

a) Opening
b) Closing

Page 2 of 2

(4)
(5)
(6)

(3)
(9)

(6)
(3)
(3)
(6)
(6)

(6)
(6)