1. Structure from images

2. Calibration

3. Review: Pinhole Camera

4. Review: Perspective Projection

5.  Points go to Points  Lines go to Lines  Planes go to whole image or Half-planes  Polygons go to Polygons

6. Review: Intrinsic Camera Parameters X Y Z C Image plane Focal plane M m u v

7. Review: Extrinsic Parameters X Y Z C Image plane Focal plane M m u v Z Y X By Rigid Body Transformation:

8. Alper Yilmaz, CAP5415, Fall 2004 8 Estimating Camera Parameters

9. Shape From Images

10. Perspective cues

13. Ames Room

14. Video

15. Recovering 3D from images  What cues in the image provide 3D information?

16.  Shading Visual cues Merle Norman Cosmetics, Los Angeles

17. Visual cues  Shading  Texture The Visual Cliff, by William Vandivert, 1960

18. Visual cues From The Art of Photography, Canon  Shading  Texture  Focus

19. Visual cues  Shading  Texture  Focus  Motion

20. Julesz: had huge impact because it showed that recognition not needed for stereo.

21. Shape From Multiple Views

22. Multi-View Geometry Relates 3D World Points Camera Centers Camera Orientations

23. Multi-View Geometry Relates 3D World Points Camera Centers Camera Orientations Camera Intrinsic Parameters Image Points

24. Stereo scene point optical center image plane

25. Stereo Basic Principle: Triangulation Gives reconstruction as intersection of two rays Requires –calibration –point correspondence

26. Stereo Constraints p p’ ? Given p in left image, where can the corresponding point p’ in right image be?

27. Stereo Constraints X1X1 Y1Y1 Z1Z1 O1O1 Image plane Focal plane M p p’ Y2Y2 X2X2 Z2Z2 O2O2 Epipolar Line Epipole

28. Epipolar Constraint

29. From Geometry to Algebra O O’ P p p’

30. From Geometry to Algebra O O’ P p p’

31. Linear Constraint: Should be able to express as matrix multiplication.

32. The Essential Matrix

33. Correspondence

34. Pin Hole Camera Model

35. Basic Stereo Derivations Derive expression for Z as a function of x 1, x 2, f and B

36. Basic Stereo Derivations

37. Disparity:

38. We can always achieve this geometry with image rectification  Image Reprojection  reproject image planes onto common plane parallel to line between optical centers (Seitz)

39. Rectification example

40. Correspondence: Epipolar constraint.

41. Correspondence Problem  Two classes of algorithms:  Correlation-based algorithms Produce a DENSE set of correspondences  Feature-based algorithms Produce a SPARSE set of correspondences

42. Correspondence: Photometric constraint  Same world point has same intensity in both images.  Lambertian fronto-parallel  Issues: Noise Specularity Foreshortening

43. Using these constraints we can use matching for stereo For each epipolar line For each pixel in the left image compare with every pixel on same epipolar line in right image pick pixel with minimum match cost This will never work, so: Improvement: match windows

44. Comparing Windows: =?f g Mostpopular For each window, match to closest window on epipolar line in other image.

45. It is closely related to the SSD: Maximize Cross correlation Minimize Sum of Squared Differences

46. Matching cost disparity LeftRight scanline Correspondence search Slide a window along the right scanline and compare contents of that window with the reference window in the left image Matching cost: SSD or normalized correlation

47. LeftRight scanline Correspondence search SSD

48. LeftRight scanline Correspondence search Norm. corr

49. Effect of window size W = 3W = 20 Smaller window +More detail – More noise Larger window +Smoother disparity maps – Less detail – Fails near boundaries

50. Stereo results Ground truthScene  Data from University of Tsukuba (Seitz)

51. Results with window correlation Window-based matching (best window size) Ground truth (Seitz)

52. Results with better method State of the art method Boykov et al., Fast Approximate Energy Minimization via Graph Cuts,Fast Approximate Energy Minimization via Graph Cuts International Conference on Computer Vision, September 1999. Ground truth (Seitz)

53. Failures of correspondence search Textureless surfaces Occlusions, repetition Non-Lambertian surfaces, specularities

54. How can we improve window-based matching?  So far, matches are independent for each point  What constraints or priors can we add?

55. Stereo constraints/priors Uniqueness  For any point in one image, there should be at most one matching point in the other image

56. Stereo constraints/priors Uniqueness  For any point in one image, there should be at most one matching point in the other image Ordering  Corresponding points should be in the same order in both views Ordering constraint doesn’t hold

57. Priors and constraints Uniqueness  For any point in one image, there should be at most one matching point in the other image Ordering  Corresponding points should be in the same order in both views Smoothness  We expect disparity values to change slowly (for the most part)

58. Stereo matching as energy minimization I1I1 I2I2 D Energy functions of this form can be minimized using graph cuts Y. Boykov, O. Veksler, and R. Zabih, Fast Approximate Energy Minimization via Graph Cuts, PAMI 2001Fast Approximate Energy Minimization via Graph Cuts W1(i )W1(i )W 2 (i+D(i )) D(i )D(i )

59. Examples breadtoyapple

60. Szeliski Active stereo with structured light  Project “structured” light patterns onto the object  simplifies the correspondence problem camera 2 camera 1 projector camera 1 projector Li Zhang’s one-shot stereo

61. Active stereo with structured light L. Zhang, B. Curless, and S. M. Seitz. Rapid Shape Acquisition Using Color Structured Light and Multi-pass Dynamic Programming. 3DPVT 2002Rapid Shape Acquisition Using Color Structured Light and Multi-pass Dynamic Programming.

62. Kinect https://www.youtube.com/watch?v=dTKlNGSH9Po

63. The third view can be used for verification Beyond two-view stereo