2. Two-view geometry Epipolar geometry F-matrix comp. 3D reconstruction Structure comp.

3. C1C1 C2C2 l2l2  l1l1 e1e1 e2e2 Fundamental matrix (3x3 rank 2 matrix) 1.Computable from corresponding points 2.Simplifies matching 3.Allows to detect wrong matches 4.Related to calibration Underlying structure in set of matches for rigid scenes l2l2 C1C1 m1m1 L1L1 m2m2 L2L2 M C2C2 m1m1 m2m2 C1C1 C2C2 l2l2  l1l1 e1e1 e2e2 m1m1 L1L1 m2m2 L2L2 M l2l2 lT1lT1 Epipolar geometry Canonical representation:

4. The projective reconstruction theorem If a set of point correspondences in two views determine the fundamental matrix uniquely, then the scene and cameras may be reconstructed from these correspondences alone, and any two such reconstructions from these correspondences are projectively equivalent allows reconstruction from pair of uncalibrated images!

5. Objective Given two uncalibrated images compute (P M,P‘ M,{X Mi }) (i.e. within similarity of original scene and cameras) Algorithm (i)Compute projective reconstruction (P,P‘,{X i }) (a)Compute F from x i ↔x‘ i (b)Compute P,P‘ from F (c)Triangulate X i from x i ↔x‘ i (ii)Rectify reconstruction from projective to metric Direct method: compute H from control points Stratified method: (a)Affine reconstruction: compute  ∞ (b)Metric reconstruction: compute IAC 

6. Image information provided View relations and projective objects 3-space objects reconstruction ambiguity point correspondences F projective point correspondences including vanishing points F,H ∞ ∞∞ affine Points correspondences and internal camera calibration F,H ∞  ’ ∞∞∞∞ metric

7. Epipolar geometry: basic equation separate known from unknown (data) (unknowns) (linear)

8. the singularity constraint SVD from linearly computed F matrix (rank 3) Compute closest rank-2 approximation

10. the minimum case – 7 point correspondences one parameter family of solutions but F 1 + F 2 not automatically rank 2

11. F1F1 F2F2 F 33 F 7pts (obtain 1 or 3 solutions) (cubic equation) the minimum case – impose rank 2 Compute possible as eigenvalues of (only real solutions are potential solutions)

12. ~10000 ~100 1 ! Orders of magnitude difference Between column of data matrix  least-squares yields poor results the NOT normalized 8-point algorithm

13. Transform image to ~[-1,1]x[-1,1] (0,0) (700,500) (700,0) (0,500) (1,-1) (0,0) (1,1)(-1,1) (-1,-1) Least squares yields good results (Hartley, PAMI´97) the normalized 8-point algorithm

14. algebraic minimization possible to iteratively minimize algebraic distance subject to det F=0 (see book if interested)

15. Geometric distance Gold standard Sampson error Symmetric epipolar distance

16. Gold standard Maximum Likelihood Estimation (= least-squares for Gaussian noise) Parameterize: Initialize: normalized 8-point, (P,P‘) from F, reconstruct X i Minimize cost using Levenberg-Marquardt (preferably sparse LM, see book) (overparametrized)

17. Gold standard Alternative, minimal parametrization (with a=1) (note (x,y,1) and (x‘,y‘,1) are epipoles) problems: a=0  pick largest of a,b,c,d to fix epipole at infinity  pick largest of x,y,w and of x’,y’,w’ 4x3x3=36 parametrizations! reparametrize at every iteration, to be sure

18. Zhang&Loop’s approach CVIU’01

19. First-order geometric error (Sampson error) (one eq./point  JJ T scalar) (problem if some x is located at epipole) advantage: no subsidiary variables required

20. Symmetric epipolar error

21. Some experiments:

24. (for all points!) Residual error:

25. Recommendations: 1.Do not use unnormalized algorithms 2.Quick and easy to implement: 8-point normalized 3.Better: enforce rank-2 constraint during minimization 4.Best: Maximum Likelihood Estimation (minimal parameterization, sparse implementation)

26. Special case: Enforce constraints for optimal results: Pure translation (2dof), Planar motion (6dof), Calibrated case (5dof)

27. The envelope of epipolar lines What happens to an epipolar line if there is noise? Monte Carlo n =10 n =15 n =25 n =50

28. Other entities? Lines give no constraint for two view geometry (but will for three and more views) Curves and surfaces yield some constraints related to tangency

29. Automatic computation of F (i)Interest points (ii)Putative correspondences (iii)RANSAC (iv) Non-linear re-estimation of F (v)Guided matching (repeat (iv) and (v) until stable)

30. Extract feature points to relate images Required properties: –Well-defined (i.e. neigboring points should all be different) –Stable across views (i.e. same 3D point should be extracted as feature for neighboring viewpoints) Feature points

31. homogeneous edge corner M should have large eigenvalues (e.g.Harris&Stephens´88; Shi&Tomasi´94) Find points that differ as much as possible from all neighboring points Feature = local maxima (subpixel) of F( 1, 2 ) Feature points

32. Select strongest features (e.g. 1000/image) Feature points

33. Evaluate NCC for all features with similar coordinates Keep mutual best matches Still many wrong matches! ? Feature matching

34. 0.96-0.40-0.16-0.390.19 -0.050.75-0.470.510.72 -0.18-0.390.730.15-0.75 -0.270.490.160.790.21 0.080.50-0.450.280.99 1 5 2 4 3 15 2 4 3 Gives satisfying results for small image motions Feature example

35. Requirement to cope with larger variations between images –Translation, rotation, scaling –Foreshortening –Non-diffuse reflections –Illumination geometric transformations photometric changes Wide-baseline matching…

36. Wide baseline matching for two different region types (Tuytelaars and Van Gool BMVC 2000) Wide-baseline matching…

37. Step 1. Extract features Step 2. Compute a set of potential matches Step 3. do Step 3.1 select minimal sample (i.e. 7 matches) Step 3.2 compute solution(s) for F Step 3.3 determine inliers until  (#inliers,#samples)<95% #inliers90%80%70%60%50% #samples51335106382 Step 4. Compute F based on all inliers Step 5. Look for additional matches Step 6. Refine F based on all correct matches (generate hypothesis) (verify hypothesis) RANSAC

38. restrict search range to neighborhood of epipolar line (  1.5 pixels) relax disparity restriction (along epipolar line) Finding more matches

39. Degenerate cases –Planar scene –Pure rotation No unique solution –Remaining DOF filled by noise –Use simpler model (e.g. homography) Model selection (Torr et al., ICCV´98, Kanatani, Akaike) –Compare H and F according to expected residual error (compensate for model complexity) Degenerate cases:

40. Absence of sufficient features (no texture) Repeated structure ambiguity (Schaffalitzky and Zisserman, BMVC‘98) Robust matcher also finds Robust matcher also finds support for wrong hypothesis support for wrong hypothesis solution: detect repetition solution: detect repetition More problems:

41. geometric relations between two views is fully described by recovered 3x3 matrix F two-view geometry

42. Next class: image pair rectification reconstructing points and lines