End Sem Computer Vision
End Sem Computer Vision
6. (a) Explain the problem with Least Square Method and how RANSAC can overcome the same?
Also specify the early stopping criterion for RANSAC. [5M] co-4
(b) Compute the iteration required to achieve 99% chance of gating pure inlier and 16.67% of
outliers, considering the minimal sample size of 2. (5M] CO-4
7. Ilustrate the block matching method using 3-point search algorithm. [5M] C0-4
8. (a) Given two features of size 4 as f(4,1,24) and g(9,1,2,2), compute L1 and L2 norms and
comment. (3M] CO-5
f0.6 0.4 0.21
(b) Consider a 3x3 matrix 0.2 0.6 0 apply Sobel mask both in x and y direction at the
Lo.6 0.5 0.6]
center pixel. (2M] CO-5