2
USN Time: 3 hrs. i: la. Seventh Semester B.E. Degree Examination, Dec.2013/Jan.2ol4 lmage Processing 06F,,C7s6 (05 Marks) Max. Marks:100 ,,,,,,,, ,.. . With a neat block diagram, describe various components used in general purpose image processing system. (08 Marks) Briefly.explain the principle of image formation in Human eye. (08 Marks) Let p dnd q be the pixels at coordinates (5, 5) and (10, 15) respectively. Find out which distance',,rneasure gives the minimum distance between the pixels.. . " ,,, (04 Marks) Explain the pfbeess of image sampling and quantization in arq;lallmage formationlro rvru.t r; Explain: i) False contouring. iil Checkerboard pattern. (05 Marks) Consider the image se€m€nt shown in Fig.Q2(c). Let V : {2, 3,4}, compute the length of shortest 4-, 8- and m- path between p and q. If any particular path does not exist between Note: Answer FIVEfull questions, selecting at least TWO questionsfrom each part. PART _ A b. c. o o o o () ox Jh 6 'oo I troo .= 6l (d<f, eil otr -c 92 ()= o: oo) cdO OE ootr a6 E(o 'Ea o!3 o. 6. tra. oj 6E !o 5.e >'q co0 o= 90 =o VL o- )4 J c'i 0 o z o b. c. b. c. these two points, explain 3 a. Consider a2 x 2transform matrix A and the image U. given below: ^ i[f ;] 2a. b. 4a. 5a. (q) (p) Calculate the transformed image V and the basis images. Check the image U using basis images and transformed image V. (10 Marks) Define Haar,transform. Find Haar matrix for N : 8 and explain how it is constructed. State its propertids. (10 Marks) Explaiuthe importance of discrete cosine transform with its equations and properties. f rrl tl Ll U=t I Lr 2) 1r,,, (08 Marks) Write a short note on KL transform. : (06 Marks) Prove that Hadamard transform is a fast transform. (06 Marks) .PART-B . ii Consider 8-level grey scale image of size 8 x 8 shown in Fig.Q5(a). Show histogram of t]le image. Compute equalized hist and display graphically. t"*u*"'"' ., 4 t',, 2 0 0 I t) 4,, 2 2 2 a J ::1 4 a -) 0 4 ''r""' . ::, 1 2 U J 4' 0 I 1 0 0 1 I 0 0 I 2 a J a J 2 I 0 0 4 5 1 ., a -) 5 4 0 0 2 7 7 2 0 0 1 2 6 6 2 1 0 0 4 5 a J 1 J 5 4 0 0 1 2 J a J 2 1 0 0 1 1 0 0 1 0 I of2 Fig.Qs(a) www.pediawikiblog.com For More Question Papers Visit - www.pediawikiblog.com For More Question Papers Visit - www.pediawikiblog.com

Image Processing Jan 2014

Embed Size (px)

Citation preview

Page 1: Image Processing Jan 2014

USN

Time: 3 hrs.

i:

la.

Seventh Semester B.E. Degree Examination, Dec.2013/Jan.2ol4

lmage Processing

06F,,C7s6

(05 Marks)

Max. Marks:100

,,,,,,,,

,..

.

With a neat block diagram, describe various components used in general purpose imageprocessing system. (08 Marks)

Briefly.explain the principle of image formation in Human eye. (08 Marks)Let p dnd q be the pixels at coordinates (5, 5) and (10, 15) respectively. Find out whichdistance',,rneasure gives the minimum distance between the pixels.. . " ,,, (04 Marks)

Explain the pfbeess of image sampling and quantization in arq;lallmage formationlro rvru.t r;

Explain: i) False contouring. iil Checkerboard pattern. (05 Marks)Consider the image se€m€nt shown in Fig.Q2(c). Let V : {2, 3,4}, compute the length ofshortest 4-, 8- and m- path between p and q. If any particular path does not exist between

Note: Answer FIVEfull questions, selectingat least TWO questionsfrom each part.

PART _ A

b.c.

ooo

o()

ox

Jh6'oo

I

troo.= 6l(d<f,

eilotr-c 92

()=

o:

oo)cdOOEootr

a6

E(o

'Eao!3

o. 6.tra.oj

6E!o5.e>'qco0o=90

=oVLo-)4

J c'i

0oz

o

b.

c.

b.

c.

these two points, explain

3 a. Consider a2 x 2transform matrix A and the image U. given below:

^ i[f ;]

2a.

b.

4a.

5a.

(q)

(p)

Calculate the transformed image V and the basis images. Check the image U using basisimages and transformed image V. (10 Marks)Define Haar,transform. Find Haar matrix for N : 8 and explain how it is constructed. Stateits propertids. (10 Marks)

Explaiuthe importance of discrete cosine transform with its equations and properties.

f rrltl LlU=t I

Lr 2)

1r,,, (08 Marks)Write a short note on KL transform. : (06 Marks)Prove that Hadamard transform is a fast transform. (06 Marks)

.PART-B . ii

Consider 8-level grey scale image of size 8 x 8 shown in Fig.Q5(a). Show histogram of t]leimage. Compute equalized hist and display graphically. t"*u*"'"'

., 4 t',, 2 0

0 I t) 4,, 2

2 2 aJ

::14

a-) 0 4 ''r""' . ::,

1 2 U J 4'

0 I 1 0 0 1 I 0

0 I 2 aJ

aJ 2 I 0

0 4 51., a

-) 5 4 0

0 2 7 7 2 0

0 1 2 6 6 2 1 0

0 4 5aJ 1J 5 4 0

0 1 2 J aJ 2 1 0

0 1 1 0 0 1 0

I of2

Fig.Qs(a)

www.pediawikiblog.com

For More Question Papers Visit - www.pediawikiblog.com

For More Question Papers Visit - www.pediawikiblog.com

Page 2: Image Processing Jan 2014

068C756

5 b. Using the second derivative, develop a Laplacian mask for image sharpening. (06 Marks)

c. Exptrain in brief any point processing technique implemented in image processing. (04 Marks)

6 a. Discuss the characteristics of high boost filter for both frequency and spatial domain.

Explain how high boost filtering increases the enhancement of the image..:=

(l0lv[a*s),hf -j::'

= ':r::

Wilh the help of block diagram, explain homomorphic filters for image enhancemerl-. _ '

flO1YlaflOlVlarks)dT." .::

tain different image degradation models. flh* (06 Marhsltll ull.l9r9lrt llilaBE us$r4Lr4Lrull lll\r\rvrr. *qf\ " \""in in brief, the inverse filtering approach and its limitations. .E#ft6in how the

lirfri*l&ns can be overcome using Wiener filtering. (10 Marks)

c. WhdSffifu order statistics filter? Explain any one such filter. . fu (04 Marks)

"%- =

\"", .*d38 a. Explain thffi}{pwing color models: .ffi\#

i) RG_B co6*:$del *wii) HSI color nio@= ,..t - (10 Marks)

. - ..' ^^#sff, tlDf gOIOf mOge:: (rr, lvrarrs,

b. Write steps involve=?Ifuonverting colors from HSI to,,$GB. (05 Marks)

c. Explain pseudo color @ge processing in brief. ;.- '' (05 Marks)='*,* *#-J**{ffiuw'

ptwsE

&\\$

2 of2

www.pediawikiblog.com

For More Question Papers Visit - www.pediawikiblog.com

For More Question Papers Visit - www.pediawikiblog.com