_.

------~
[ REY IS ED caJRSE:
A:W1938-06.
00·:,.~~
( 3 Houcs ) ( Total Marks : 100

N.ll, (I) question 110.1 is compulsory ..... ;

; (2) . attempt any 4 questiollsfrom .the remaining sixquestiom: .. ' I
(3) assume suitable additional data if required ,state & justif;! the assumptions ma?,~:.
(4) figures to the right indicate marks ...

Q.1. State TRUE or FALSE and justify (Answer any ~EVEN) ..•. [il)
a) F
Histogram·is a Unique Representation of an image .. l, .-
on, "
~ b)T· :~hetotal range ?f intensity levels human visual system can ,di)crimi~at~
, . sImultaneously IS rather small compared to the total adapjaU9J} range.] .
c) :' I· Second pass of Histogram Equalization will produce exactly (1e same . result·.
. as the tirst pass. ' .... , ..
d) r:= Reduction in gray levels produces 'blocky effect' (che;kelboard patterrl) in
the imllgc ... , .I
1ge .
C I T The princi pal fu net ion ot' !TIedion filter is to forel.: pt1'I1lSwith distinct
intensities to be more like their neighbors.
l) F All ~mngocompressioll teelllliqllcs aro invertible.'.
g) F Poorly illuminated imogc.:s call be cosily scgmcn:cd.
h) Computation of discrete convolution in transfo:rn domain is more efficient
(hlln ill spatial domain.

(}.2. a) What information can be obtained from Histogram of an image? (04)

b) A 16 level image is given below:
.,
/' is
18 Jf6 98
713 6.'
12
5'10
10
10
12
'4J.,512 4
15 7
I 14 1--'-
.,
po

i) Prepare the histogram oflhe image.

Perform Histogram Equalization on the given image. (12}
ii) For continuous image Histogram Ca,IJbe perfectiy equal!ze~ but it
: Classe may not be so for the digital image. justify. (04)
i. B. Rood;
2314802 : n
Q.3. a) Explain operation and application of each of the following. I
:nd Floor,'
Give3x3 mask wherever applicable: (08]
Iway Statld
13 I i) low pass filter (iv) horizontaLlil)£' ,',::ection , .
ii) median filter
iii) Laplacian
. "" :
b) Given below is SxS image. Operate on the central 3x3 pixels by low pass & high pm tilter
masks & obtain 3x3 images as outputs .. ,

6 5 12 12 Jl
I 4 ~I 2 _ I 3 ]0 9-1
10 15 4 10 61

~_.I~
g~.;--~~
U:;ing these outputs verify original image= lowpass output + Highp:J.ss output. In case of
discrepancy explain the reasons. (12]
[ '!URN OVER
 I'
COO/I 938-TV -9090-{)6. 2

Q ,I· a), Generate Huffman Code for the given image source. Calculate Entropy'ofthe ;
sOlirce. average length of the code generated & the compression ratio achieved compared .to standard
binary encoding, . [12] ,

b) . Consider an 8ilixelline of gray-scale data, { 12,12.13,13,IO,13,57,54}, which has been

uni forml)' , quan\ized
\
with 6-bit accuracy. Construct its 3-bit IGS code. ; . loa]

Q'-..'. a) Explain following methods of image segmentation by giving appropriate

illustrations: ' ' " . I, [8]
i) region growing (ii) splitting & merging.

b) Assume that the edge in the gray level image starts in the tirs~ column and l~nds in the last
column. Find the cost of all possible edges,and sketch them. Find the edg.:: corresponding to /
l1l,illil1llll1l co~r path:
!t

[12) :,

a) Write 8><8hnr!' mntrix & show bUllerlly dingrnm to compute Hnrr coc,mcionts of a ,
sequence of length n=-8. [5] .1
11)
Write walsh mntrix & compute wnlsh coefficients of the following :2x2 image:
[5]

4 .. /
I,
.1.""

Compute hadamard Transform for the sequen~e f=( 1 023 4 I J 1 r. [5]

d) Explain how Transform encoding helps in achieving Irl1age Compression. [5]

" ..

Q,7. Write short notes on any THREE offollowing':--

i) Homomorphic Filtering
ii) Connectivity of pixels
jii) Discrete Cosine Transform
iv) Hough Transform
v) Compression using LZW method. , [201

".;
I
, I:(t
"
 \

/ i
I, I Pro I~:!

ion. 5080-06.
€ l ec&:~ ru' )( D.I2 c. '2. () •••5845
(REVISED COURSE)

[j: MA6E r·)Rcct5::Cl/'leD .-- : 100·,

LB. (1) Question No, 1 is compulsory.

'.: . (2) Attempt any four questions from the remaining six questions .
l~:i.-

j :'
. I,

~11..
~I ,,;
(3)

Answer the following questions (any four) -

(a) Explain why Brightness Discriminations
,
(3 Hours)slate & ju:;tify IIw assumpli
Assume suitable additional data if required.

is poor al Lth" level 01 Illumination. c".J<€

~~~
20

,h: (b) Explain convolution in the spatial and the frequency domain. Derive the relalions"i
alwee
J! ' the two domain ..
;t" (c) Compare between Contract Strotching and Hislogralll Equaljzation.
;n, (d) Explain the role and, natura of image lidilily criteria in image compression.
(e) A 2-dimensional OFT can be obtained u:.;inU iJ 1-dilnensionai C;:"i" algorithm twice, Explain.

i':) Delino "Image" as a two-d,imensional array ancl 51ate v,n;;: I:. ,Il:;>;!' (lY Gray Lovel Distribution. 8
('..,) Call 'vori<.lbie-Iengtll coding procedure be used to cornprc:;:.; Iri$!'.J\)'drn oQunlised image with 2° 8
Gray levels 7 ,Explain.
(c; LoVi pass filter is a smoothing filter. Justify. 4

[
.. '

!I 3, (n) Suppose that 8 x 8 Pixel P image represented by 4 oits/pixel hns loilowing gray level distribution. 12.
v
.. . :~
17
X16
17
.11
U7
y.;
;1-'
Gray I Levels
J:
4a

:i

Modily the above Histogram such that the desired Jislrlbuli''':11 is d:; lollows-
-.
X
8);
6/-,
10
/7/j12
9X 6.
oj,'
11 .
rx-I i,/ 0
2 /7

, ,.
.• 1 _.

Draw Original specifiod and modified histograili.

, (b) 8
Why? Fourier transform and the irequency domain 100ls iJ.1~ :;u u~uful for image enhancement.
With tl10 help neat block diagram explain the Bnsic of filterin9 ill the frequency domain.

.. :;
':'.: (<I) Give the
What reasons
is the of shifting
difference the Hadamard
between origin, and Walsh~ Hndamurd
~ aJeQ....
~nsform 7 Is ~0.n'IQ...
the Hademardl 5
'., ".: I
. '~".' matrix orthogonal? ,
",(I' 5
(b) If the kernel of an image transform is separable and symmetric, the transform can be expressed
in matrix form. Explain. '
(c) Write Kernel matrix of size 4 (four) and application uf SI,w! and I Iail( Transform, for the given
5
i/nngtl f(x,y), find the Slant and .,Hanr Transform rilalm. ,

3
Ir 44 46 6

lI
, . i G

';>"~J f(x,y) = 2
2 3
6 5 2
~ ]'
,

G
.': :5.··. r (0) Doloet tl10 boundary and segment of tl10 givLln illl~VLl us/nu ur,l~h Illoorutical approach. I\lso draw
tho grapl1 (or tl10 glvan Imago .
, .
.....
.... \..... \:.

, 1~';~.::! "
:.> 7 :!
I
I [' 57 1 o2 ]
Explain tlia LJu!llc principia:; 01 dotocling tl10 (ollowlll!-j III 1/11.1\101-
(i) Point
(ii) L1nos
I
I : (iii)
Edgos
I
. (iv) Region Spliting
(c) Describo how Hough tansform is used for boundary shape detecti
i '"""" '
1_.
'I c'5
\../~I'r 153'
Con.5000·YM·S845-06.

c. (~) Explain the Origin 0(' data redundant.:y in digitul irnayu$. ! 10';" tll.!:;\.: I"v<.JuCldCJClci(;)s
uru reduced?
(0) Explain the basic principles of transform coding for irn:lVu C:Ul1lpl~ssion. "'ustr.Jte tllC same with
the help of OFT and OCT..
(c) Construcl the IGS code of lite' given gray IOV01 f.l:l :
Gray lovel·- 75,1.05,98,175,200, 1:30,210,220
Decode tho received IGS code 0111.

7. Write short notes on any four of the following ;- 20 Ii ".;. ,

(a) Median filtering;. j
l
.';.
','
(b) Connectivity of Pixels.
(cl Zo'oming of a digital image.
(d) Uniform and non uniform sampling.
(e) Predictive coding. '
(I) Fast Hadamard Transform.

'. y
!
"

!: