{|}~€€‚ƒ„~†‡€ˆ‰Š~‹€ŒŽ€€|‘~€’€“”Š~‰€{‰†~••”–‘€€—˜™šˆ€›

16/12/2024 CSE-AIML SEM-VI C SCHEME IMAGE & VP (DLOC II ) QP CODE: 10068538


63  661
 !"#$%&'('&$)'*+",$'-.
/ 0%%#*+%1(.%2-##3"#$%&'($'"%'4%2#-#*1&(&(54&6#
7 0,,3"#$%&'($81--.#3"1,*1-9$
: 0$$"*#$"&%1;,#<1%1=&4-#3"&-#<1(<$%1%#&%8,#1-,.
! >?@ABCDEF?ACGFABDCFG H/IJ
0 KLGCMBGNAECOFP@GNC
 QG@AR?SCT?RGDUF?VC
) W@N@ARXCY@PBFCZ?F[BDD@GNC
\ ]RVZX@GNCRGPC^LRGA@_RA@FGC
C
!/ 0 >ERACPFCSFLCVBRGC̀SCZF@GACFZB?RA@FGDaCbcZXR@GCRGSCAE?BBCZF@GAC HIJ
FZB?RA@FGDC@GCPBAR@X
 bcZXR@GC@GCPBAR@XCWdTCRGPCeGYB?DBCWdT HIJ
C
!7 0 bcZXR@GCf@DAFN?RVCbgLRX@_RA@FGhCbgLRX@_BCAEBCUFXXFi@GNCE@DAFN?RVhCjXFAC HIJ
AEBCeGZLACE@DAFN?RVkCA?RGDUF?VRA@FGCULG[A@FGCRGPCFLAZLACE@DAFN?RVCUF?C
AEBCl`ZZC@VRNBCN@YBGC̀BXFimC
C
nC oC oC oC oC oC oC oC oC oC
nC nC nC nC nC nC pC oC oC oC
pC pC pC pC pC pC nC lC lC oC
qC qC qC qC rC rC rC lC lC oC
qC qC qC qC rC rC rC lC lC oC
sC sC sC sC sC tC rC lC lC oC
sC sC sC sC sC rC rC lC lC oC
sC sC sC sC sC rC rC lC lC oC
sC sC sC sC sC rC rC lC lC oC
sC sC sC sC sC rC rC lC lC oC
 >ERACPFCSFLCLGPB?DARGPC̀SCeVRNBCOFVZ?BDD@FGaCW@UUB?BGA@RABC HIJ
`BAiBBGCMFDDSCRGPCMFDDXBDDC[FVZ?BDD@FGhC
C
!: 0 bcZXR@GCBPNBCPBAB[A@FGCLD@GNC]F`BXCRGPCj?Bi@AADCVRDu HIJ
 bcZXR@GCAEBCDZX@ACRGPCVB?NBCAB[EG@gLBC@GCPBAR@X HIJ
C
!v 0 bcZXR@GC@GCPBAR@XC]ER?ZBG@GNCU@XAB?D HIJ
 bcZXR@GC?BPLGPRG[SCRGPCU@PBX@ASC[?@AB?@RCi@AEC?BDZB[ACAFCeVRNBC HIJ
OFVZ?BDD@FG
C
!w >?@ABCDEF?ACGFABDCFGC H/IJ
0 x@PBFCd@XBCUF?VRADCRGPCRZZX@[RA@FGD
 fRPRVR?PCT?RGDUF?V
) eVRNBCDBNVBGARA@FG
\ yB@NE`FL?EFFPCZ?F[BDD@GN
zzzzzzzzzzzzzzzzzzzzzz

01231 œžŸ ¡¢£¤¤œž56 7£8¤¤œ

Ÿ ¡¢ 9ž9Ÿ¡¢£¤¤œžŸ ¡¢£¤¤
 E
4
2

52
6

YF

E6
X5
Paper / Subject Code: 37477 / Image & Video Processing (DLOC II)

7E

EX
47
25
6E
F4
May 29, 2024 02:30 pm - 05:30 pm 1T01876 - T.E. Computer Science and Engineering (Artificial

YF

E6
X5

5
7E
5Y
Intelligence and Machine Learning) (Choice Based) (R-19- ’C’ Scheme)SEMESTER - VI / 37477 - Image &

EX
47
25
6E
F4
52
Video Processing (DLOC II) QP CODE: 10056151

YF

E6
X5
E
Y
EX

7
Duration: 3hrs [Max Marks: 80]

7
5

5
6E
4

4
2

2
E6

YF
5

X5
7E
Y
X
47

5
E

5
E
4
2

2
YF

E6

YF
5

X5
E

Y
EX
N.B.: (1) Question No 1 is Compulsory.

47

47
25

5
6E
52

2
(2) Attempt any three questions out of the remaining five.

YF

E6

YF
X5

X5
7E
X
47
(3) All questions carry equal marks.

5
6E

5
E

6E
4
2

2
YF

E6

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

X5
7E

7E
5Y
47
25
E
F4

F4
2
6

E6
5

X5
E
5Y

Y
1 Attempt any FOUR [20]

7E
Y
7

7
5
6E

25
F4

6E
F4
52

4
52

YF
A Justify or Contradict: Every image has a unique histogram

X5
7E
Y
EX

7E
Y
X
5

5
E

5
4

6E
F4
2

2
E6

B Justify or Contradict: The zeroth (LSB) plane of the bit plane slicing contains

2
F

E6
5

X5
5Y
X

7E
5Y
X
47

7
E

E
high frequency information of the image.

E
4
2

2
YF

E6

E6

YF
5

6
5

X5
Y
X

E
X
47

7
25

C Justify or Contradict: Two fundamental characteristics of gray level values

47
25
E

25
E
4

6E
F

E6

YF
X5

E6

YF
X5

X5
5Y

7E
serve as the basis of segmentation algorithms for gray scale images.
47

47
6E

5
E

25
E
2

F4
2
YF

YF
5

6
X5
7E

D Justify or Contradict: Although run length coding is lossless, it may not always

X5
E
X

5Y
47

47
25
E

25
F4

6E
6

52
result in data compression.
F

YF
5

5
E
5Y

E
Y
X

7E
X

EX
7

7
5
6E

5
F4

E
F4
52

E What is meant by Unitary Transform

F4
52

52
E6

E6
7E
Y
EX

5Y
X

5Y
X
7
5

A Define i)4-adjacency ii) 8-adjacency iii)m-adjacency iv)City Block Distance

47
2 [10]
E
4

E
4
2

2
E6

52
F

E6

YF
5

E6

YF
5
5Y
EX

EX

EX
(D4) v) Chess Board Distance (D8) vi)Euclidean Distance (De). Find D4, D8,
47

7
5

25
4

4
2

2
YF

E6

E6

YF
5

E6
X5

X5
Dm, De distance between p & q. For Dm distance connectivity, set V={2,3,4 }
Y
X
47

7
25

47
25
E

5
6E
4

6E
2
F

E6

YF
X5

YF
X5

X5
5Y

2(p) 7E 4 5 3 4
47

47
6E

25
E

25
E
2

F4
5 3 2 4 5
F

F
5

6
X5
7E

X5
E
Y
EX

7E
Y

5Y
47
25

7 6 2 1 5
25
F4

E
F4
6

52
F

6
5

E6
5
E

E
Y

6 5 3 4 0
X

Y
X

EX
47

7
5
6E

5
E
F4

4
52

4 5 7 2(q) 6
52
YF

E6

YF

E6
7E

5Y
X

EX

B Explain any five video file formats. [10]

7
25

47
E

5
F4

4
2

2
6

YF
X5

E6

YF
5

X5
E
5Y

EX

3 A Derive Contrast Stretching Transformation function for given 4BPP image from [10]
47

47
6E

25
E
2

2
YF

E6

YF
5

6
X5

the adjoining diagram. Modify given image pixel values.

X5
EX

E
7

47
25

5
6E
4

6E
2
E6

YF

YF
X5

X5
E

7E
47

47
25
E

25
E

F4
F

6
5

5
E
5Y

7E
Y
EX

5Y
EX
47

25

F4
52

52
F

E6

E6
5
5Y

Y
X

EX
7

7
5
E
F4

4
52

52
E6

YF

E6
5Y
EX

EX
7

47
5
4
52

2
E6

E6

YF
X5
Y
EX
7

47
25

25
F4

E
E6

YF

6
X5

X5
7E
7

5
6E
F4

6E
F4
2
X5
7E
5Y

7E
5Y
E
F4

F4
52

52
E6
5Y
EX

5Y
EX
47

56151 Page 1 of 2
52

52
E6

YF

E6
EX

EX
47
25
E6

YF

E6

X525YF47E6EX525YF47E6EX525YF47E6EX525YF47E6E
X5
 E
4
2

52
6

YF

E6
X5
Paper / Subject Code: 37477 / Image & Video Processing (DLOC II)

7E

EX
47
25
6E
F4

YF

E6
X5

5
7E
5Y

EX
47
25
6E
F4
52

YF

E6
X5
B What is Image Transform? What is the significance of Image Transform? Write [10]

E
Y
EX

7
5

5
6E
4

4
2

2
E6
basis images of Walsh Hadamard Transform.

YF
5

X5
7E
Y
X
47

5
E

5
E
A Explain IGS (Improved Gray Scale Quantization) compression with an

4
4 [10]

2
YF

E6

YF
5

X5
E

Y
EX
47

47
25
example

5
6E
52

2
YF

E6

YF
X5

X5
7E
X
B Write derivation for Prewitt Edge detection operator. What is the advantage of a [10]

47
5
6E

5
E

6E
4
2

2
YF

E6

F
5

X5
7E
Prewitt operator? Compare Sobel & Prewitt edge operator.

7E
5Y
47
25
E
F4

F4
2
6

E6
5 A Explain Split & Merge Method to find region similarity. [10]

X5
E
5Y

Y
X

7E
Y
7

7
5
6E

25
F4

6E
F4
52
For the following given image, find a homogeneous region using the following

4
52

YF
X5
7E
Y
EX

7E
Y
X
5

5
Criteria max[f(x,y)]-min[f(x,y)]<=3

5
4

6E
F4
2

2
E6

2
F

E6
5

X5
5Y
X

7E
5Y
X
47

7
E

1 0 0 3 0 1 1 1

E
4

E
4
2

2
YF

E6

E6

YF
5

6
5

X5
Y
X

E
0 3 3 0 4 4 2 3

X
47

7
25

47
25
E

25
E
4

6E
F

E6

1 0 0 0 3 4 1 0

YF
X5

E6

YF
X5

X5
5Y

7E
47

47
6E

5
0 1 0 0 0 0 2 3
E

25
E
2

F4
2
YF

YF
5

6
X5
7E

X5
E
X

E
3 2 3 0 0 0 1 2

5Y
47

47
25
E

25
F4

6E
6

3 0 3 0 2 4 0 1

52
F

YF
5

5
E
5Y

E
Y
X

7E
X

EX
7

7
5

3 0 3 3 3 0 0 0
6E

5
F4

E
F4
52

F4
52

52
E6

E6
7E
Y
EX

0 2 3 0 2 3 1 0
5Y
X

5Y
X
7
5

47
E
4

E
4
2

B Perform Huffman Encoding on given data. Calculate average word-length, and

E6

[10]

52
F

E6

YF
5

E6

YF
5
5Y
EX

EX

EX
47

7
5

compression ratio.

25
4

4
2

2
YF

E6

E6

YF
5

E6
X5

X5
Y
X
47

7
25

47
25
E

5
6E
4

Character a b c d e f
6E
2
F

E6

YF
X5

YF
X5

X5
5Y

Frequency 5 7E9 12 13 16 45
47

47
6E

25
E

25
E
2

F4
F

F
5

6 A For a given 1D and 2D signal, apply the Walsh Transform to convert the signal [10]
X5
7E

X5
E
Y
EX

7E
Y

5Y
47
25

25
F4

E
F4

from spatial domain to frequency domain.

6

52
F

6
5

E6
5
E

E
Y
X

Y
X

EX
47

7
5
6E

5
E
F4

4
52

52
YF

1D signal x={5,8,4,2}
E6

YF

E6
7E

5Y
X

EX
7
25

47
E

5
F4

4
2

2
6

YF
X5

E6

YF
5

2 D Signal
X5
E
5Y

EX
47

47
6E

25
E
2

2
YF

E6

YF
5

0 1 2 1
X5

X5
EX

E
7

47
25

5
6E
4

6E
2
E6

1 2 3 2
YF

YF
X5

X5
E

7E
47

47
25
E

25
E

F4

2 3 4 3
F

6
5

5
E
5Y

7E
Y
EX

5Y
EX
47

y=
25

1 2 3 2
F4
52

52
F

E6

E6
5
5Y

Y
X

EX
7

7
5
E
F4

4
52

52
E6

B List and explain any four Zero Memory Operations with a diagram [10]
YF

E6
5Y
EX

EX
7

47
5
4

representation and equation. Also explain why are they called as Zero Memory
52

2
E6

E6

YF
X5
Y
EX
7

47
25

Operations
25
F4

E
E6

YF

6
X5

X5
7E
7

5
6E
F4

6E
F4
2
X5
7E
5Y

7E
5Y

_____________________
E
F4

F4
52

52
E6
5Y
EX

5Y
EX
47

56151 Page 2 of 2
52

52
E6

YF

E6
EX

EX
47
25
E6

YF

E6

X525YF47E6EX525YF47E6EX525YF47E6EX525YF47E6E
X5