MU Computer Engineering (Semester 8)
Computer Vision
December 2014
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


Answer any four of the following
1 (a) What is principle component analysis
5 M
1 (b) What is zero crossing edge detector
5 M
1 (c) Explain view class matching
5 M
1 (d) What is inverse perspective projection
5 M
1 (e) Discuss Significance of chain codes in object representation.
5 M

2 (a) Explain border tracking algorithm with suitable example
10 M
2 (b) Explain 'Thinning' and 'Thickening' with the help of suitable example
10 M

3 (a) What is control strategies? Discuss the two major form of Control (i.e. Hierarchical and Heterachical) strategies
10 M
3 (b) Explain hough transform with example mention all its merits and demerits
10 M

4 (a) Explain back tracking algorithm with suitable example
10 M
4 (b) Apply iterative and classical connected component labelling algorithm on following:
0 0 0 0 1 1 0
0 0 0 1 1 1 0
1 0 1 1 1 1 0
1 0 0 0 1 1 0
10 M

5 (a) Explain motion based. and rule based segmentation
10 M
5 (b) What is signature segmentation? Find the horizontal, vertical and diagonal signatures of the binary image segment shown below.
1 1   1 1
1 1   1 1
  1      
1 1     1
1     1 1
10 M

6 (a) Explain knowledge based vision. Explain different forms of knowledge representation used in computer vision.
10 M
6 (b) Explain Run length implementation algorithm with suitable example
10 M

7 (a) Give all the steps involve in recognition methodology and briefly explain each.
10 M
7 (b) Explain the following region growing algorithm with suitable example
i) Centroid Linkage
ii) Hybrid Linkage
iii) Single Linkage
10 M



More question papers from Computer Vision
SPONSORED ADVERTISEMENTS