2

F
7

75
9F

49

1E

A
Paper / Subject Code: 89343 / Image Processing and Machine Vision

FA

2F
83

79

70
1F

75
9F
1T01036 - T.E.(Electronics and Telecommunication )(SEM-VI)(Choice Base

49

1E

A
FA
F5

2F
83

79

70
Credit Grading System ) (R- 19) (C Scheme) / 89343 - Image Processing and

EC

75
F

E
1

94

1
Machine Vision

FA
5

3
56

70
F

F7
EC

1F
C7

9
QP CODE: 10039562 DATE: 15/12/2023

1E
39

4
F5

9
56

70
9E

F8

7
Duration: 3 hrs [Max Marks: 80]

EC

F
C7

49

1E
A3

9
F5

83

79
56

70
E
2F

F
7

49
A3
75

51

9
C

E
N.B. : (1) Question No 1 is Compulsory.

79
56
9E
FA

2F

CF

F8

9F
7
3
(2) Attempt any three questions out of the remaining five.

51
1E

E
A
7

3
6
E
FA

8
70

5
9
2

EC

1F

9F
(3) All questions carry equal marks.

7
A3
75
49

1E

F5

83
56
9E
A

2F
79

0
(4) Assume suitable data, if required, and state it clearly.

EC

1F
F
97

C7
3
75
9F

F5
94

6
E
A

F
83

70

75
9
2
7

EC
EF

A3
1F

5
F

C
7
9

01

56
9E
FA
F5

2F
3

79
1 Attempt any FOUR. [20]
8

C
7

C7
3
EC

5
F

49

6E
FA
A7
1

01

9E
5

79
a Explain Butterworth frequency domain filtering. 5
56

75
F

F8

2
F
7

3
EC

75
9F
C7

EC
A
51

01
b List edge models and explain any one in short. 5

FA

2F
83

9
56
9E

39
F

F7

97
C

5
C7

E
A3

FA
A7
1
c 5

39
E

4
For the following 2 images perform 1) P1 = A*B and 2) P2= max(A , B) while

1
5

79
6

0
E
2F

52
EF
5

7
9

Result = P1 - P2 which is a 4-bit unsigned image.

EC

1F

9F
C7

9
3
75

A7
94
A

01
F5

83
6
E
FA

2F

EF
75

7
9

1F

49
2 3 3 2 5 8
3
5
1E

9
C

E
A

01
7

79
56
E

A= 3 4 18 B= 3 2 3
FA

CF

F8
70

97
9
2

9F
7
A3
75

1
4 3 8 5 2 1
49

6E

94
F5

83
1

9E
A

F
79

F7
70

75

d True or False: Second order filter is better than first order filter in edge detection.
2

5
C

1F
F

3
5
9F

39
C

6E
A
7

F5
4

Justify.
A

2F
83

F8
70

5
9
7

C
EF

7
3
1F

5
F

51
e With example explain Distance measures.
49

6E
A
7
9

01

9E
A
F5

2F
3

CF
79

75
8

F
7

A3
EC

1F

5
9F

49

EC

6E
A7
1
5

F
3

2 a Explain Canny edge detection algorithm in detail steps with proper diagrams.
79

[10]
56

75
9
F

F8

52
EF
7

3
C

F
C7

EC
FA
A7
51

9
E

b Write brief notes on any two of the following [10]

83

9
56

70
9E

39
F

52
F7

F
C

1F

1. Thresholding
7

49

E
A3

FA
A7
39
C

01
5

79
56
9E

2. Fundamental steps in image processing.

F

52
EF
97
EC

1F

9F
C7
A3

A7
94

3. High boost filtering

01
F5

83
6
E
F

EF
75

97
9
2

F
3
5

9
C

94
A

01
A7

83
56
E
2F

CF

F7

97
9

3 a Apply 3x3 averaging filter and median filter on following image. Use mirror [10]
1F
EF

C7
3
75

39
6E

94
A

F5

padding.
E
A

F8

F7
75
9
2

C
F

1 4 0 1 3 1
3
5

51
1E

39
C

6E
A
A7

E
2F

F8
0

5
9

2 2 4 2 2 3
C
F
97

7
3
5

51
E

E
FA
7
4

01

56
9E
A

CF
79

1 0 1 0 1 0
2
F
7

7
A3
5
9F

EC

6E
A7
4

01

1 2 1 0 2 2
9

75
9
52
7

EF
97

3
9F

EC
FA
A7
94

2 5 3 1 2 5
3

70

39
F8

52
F7

F
49

FA
A7
1

1 1 4 2 3 0
9

01
F5

83

79

52
EF
97
EC

1F

A7
39

94

01
F5

F8

F7

EF
97
C

51

9
6E

94

01
83
CF

F7
75

97
1F

39562 Page 1 of 2
39
EC

6E

94
F5

F8

F7
75
39

EC

51

39
EC

56

CF

F8
39

C7

39EC756ECF51F839F7949701EFA752FA
51
6E
 39 EC 9F EF A3
EC F5 79 9E
75 1 4 97
A7
5 C7
6E
F8
3 01E 2 F 56
39 C 9F
7 F
A3 EC
EC F5 9 4 A 9E F5
75 1F 9 7 75
2F C 7 1F
6E 83 01 56 83
9 E A 3 E
CF F7
94 F 9 E C F
9F
79
C7 51
97
A7
5 C7 5 1F 49
F8 2

6 a
5 a
4 a
56 01 F 56 8 70
EC 39
F E A E 3 9

39562
F 3 C F 1E
F5 79 A 9 E F 7 9 FA
1F 49
70 7 5 C 75
51 4 9 75
83 2F F8 70
6E 9 1 A 6 3 1 2F
CF F7 EF 3 9
EC 9F E A3
Level
51 94 A7 E F 5 79 FA 9E Intensity
F8 97 52 C7 1F 49
70 7 5 C7
39 01 FA 56 83 2F 56
F7 E F 3 E C 9 F 1 E A
9 F 3 9
EC
0

51 94 A7 E C F5 79 A E
790

F8 97 52 1F 49 75 C7 F5
39 01 F 75
6E 839 7 01 2 F 56
1F
83
F7 EF A3
CF F7 EF A 3 EC 9F
94 A7 9E
C 5 9 4 A 9 E F 79
1 7 5
1

97 52 75 F 9 7 5 2 C7 1 F 49
1024

1. Log transformation
01 FA 6E 83 0 1 F 5 6 83 70
EF 3 C 9F E A3 E 9 1E

2. Co-occurrence Matrix
9 C

b Generate Haar Basis for N=4.

A7 EC F5 79 F A 9 E F F 7 FA
52 7 1F 49 7 5 C 51 94 75
2

FA 56 83 70 2F 75 F8 97
0
850

E C 9 F 1 A 6 3 9 1E 2F
39
EC F 7 94
EF 3 9E
EC
F F 79 FA
A3
51 A7
5 C 5 1 4 7
9E
75 F8 97 2F 7 56 F 9 70 5 C7

b Elaborate on the following (5 marks each)

6E 39 01 83 2F
3

E A 3 E 1 E
56
656

CF F7 F 9 E C 9F
F
A3
9
EC
51 94 A7 F5 79 A E

Explain Hit and Miss transform with example.

F8 97 52 C 1F 49 75 F5

Page 2 of 2
75 7 2 C7 1F
39 01 F 8 01 F 56
Desired Histogram

EF A3 6E 39 A 83
4

F7 CF F7 EF 3 EC 9F
329

9E

using 4 connectivity. Arrow indicates starting point.

94 A7
C 5 9 4 A 9E F 5 7
C

__________________________
97 52 7 5
1F 97 75 7 1 F

b Explain region growing algorithm with proper example.

01 FA 6E 83 01 2F 56 83

39EC756ECF51F839F7949701EFA752FA
EF 3 9 C 9F E A3 EC 9F
FA 9
5

A7 EC F5 79 E 79
1 4 7 F5
245

52 75 F8 97 5 2 C 7 1F 49
FA 6E 3 9 01 F A 56 8 3 7
39 C F5 F 7 E F 3 EC 9F
EC 94 A7 9E F5 79
C
6

75 1F 9 7 5 7 1 49
122

6E 83 0 1 2F 5 6
F8 70
CF 9F E A3 E 39 1E
51 79 FA 9 E CF F7 F
Find the Chain code, Shape no., and first difference for the following image
94
Paper / Subject Code: 89343 / Image Processing and Machine Vision

Describe the k-means algorithm with proper diagrams. Explain all the steps.
49 75 51
F8 7 2 C7 F 9
7
histogram equalization for it. The desired histogram is shown in figure below.

81

01 56 70
b A 3-bit 64x64 image with 8 intensities is described in following table. Perform

39 FA 83
F7 EF 3 EC 9 F 1E
94 A7 9E F 7 9 FA
97 5 C 75
51 4 9 75
01 2F
A 6
F8
3 70
1 2
EF 3 EC 9 F E

[10]
[10]
[10]
[10]
[10]
[10]
[10]

A7 9E F5 79 FA
52 C7 1F 49 75
FA 56 8 3 70 2F
39 EC 9F 1E A
EC F5 79 FA
75 1F 49 75
6E 83 70 2F
C 9F 1E A