1 / 35

Stereopsis

Stereopsis. Mark Twain at Pool Table", no date, UCR Museum of Photography. Woman getting eye exam during immigration procedure at Ellis Island, c. 1905 - 1920 , UCR Museum of Phography. P. Q. P’=Q’. O. Why Stereo Vision?. 2D images project 3D points into 2D: .

kathleen
Download Presentation

Stereopsis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Stereopsis

  2. Mark Twain at Pool Table", no date, UCR Museum of Photography

  3. Woman getting eye exam during immigration procedure at Ellis Island, c. 1905 - 1920, UCR Museum of Phography

  4. P Q P’=Q’ O Why Stereo Vision? • 2D images project 3D points into 2D: • 3D Points on the same viewing line have the same 2D image: • 2D imaging results in depth information loss

  5. Stereo • Assumes (two) cameras. • Known positions. • Recover depth.

  6. Recovering Depth Information: P Q P’1 P’2=Q’2 Q’1 O2 O1 Depth can be recovered with two images and triangulation.

  7. Finding Correspondences: Q P P’1 P’2 Q’2 Q’1 O2 O1

  8. Finding Correspondences:

  9. 3D Reconstruction P P’1 P’2 O2 O1 We must solve the correspondence problem first!

  10. epipolar line epipolar line epipolar plane Stereo correspondence • Determine Pixel Correspondence • Pairs of points that correspond to same scene point • Epipolar Constraint • Reduces correspondence problem to 1D search along conjugateepipolar lines (Seitz)

  11. Simplest Case • Image planes of cameras are parallel. • Focal points are at same height. • Focal lengths same. • Then, epipolar lines are horizontal scan lines.

  12. T Epipolar Geometryfor Parallel Cameras f f Or Ol el er P Epipoles are at infinite Epipolar lines are parallel to the baseline

  13. We can always achieve this geometry with image rectification • Image Reprojection • reproject image planes onto common plane parallel to line between optical centers • Notice, only focal point of camera really matters (Seitz)

  14. Let’s discuss reconstruction with this geometry before correspondence, because it’s much easier. blackboard P Z Disparity: xl xr f pl pr Ol Or T Then given Z, we can compute X and Y. T is the stereo baseline d measures the difference in retinal position between corresponding points

  15. Correspondence: What should we match? • Objects? • Edges? • Pixels? • Collections of pixels?

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

  17. Correspondence: Epipolar constraint.

  18. Correspondence Problem • Two classes of algorithms: • Correlation-based algorithms • Produce a DENSE set of correspondences • Feature-based algorithms • Produce a SPARSE set of correspondences

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

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

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

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

  23. W = 3 W = 20 Window size • Effect of window size • Better results with adaptive window • T. Kanade and M. Okutomi,A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment,, Proc. International Conference on Robotics and Automation, 1991. • D. Scharstein and R. Szeliski. Stereo matching with nonlinear diffusion. International Journal of Computer Vision, 28(2):155-174, July 1998 (Seitz)

  24. Stereo results • Data from University of Tsukuba Scene Ground truth (Seitz)

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

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

  27. Ordering constraint • Usually, order of points in two images is same. • Is this always true?

  28. This enables dynamic programming. • If we match pixel i in image 1 to pixel j in image 2, no matches that follow will affect which are the best preceding matches. • Example with pixels (a la Cox et al.).

  29. Other constraints • Smoothness: disparity usually doesn’t change too quickly. • Unfortunately, this makes the problem 2D again. • Solved with a host of graph algorithms, Markov Random Fields, Belief Propagation, …. • Uniqueness constraint (each feature can at most have one match • Occlusion and disparity are connected.

  30. Feature-based Methods • Conceptually very similar to Correlation-based methods, but: • They only search for correspondences of a sparse set of image features. • Correspondences are given by the most similar feature pairs. • Similarity measure must be adapted to the type of feature used.

  31. Feature-based Methods: • Features most commonly used: • Corners • Similarity measured in terms of: • surrounding gray values (SSD, Cross-correlation) • location • Edges, Lines • Similarity measured in terms of: • orientation • contrast • coordinates of edge or line’s midpoint • length of line

  32. Example: Comparing lines • ll and lr: line lengths • ql and qr: line orientations • (xl,yl) and (xr,yr): midpoints • cl and cr: average contrast along lines • wlwqwmwc : weights controlling influence The more similar the lines, the larger S is!

  33. Summary • First, we understand constraints that make the problem solvable. • Some are hard, like epipolar constraint. • Ordering isn’t a hard constraint, but most useful when treated like one. • Some are soft, like pixel intensities are similar, disparities usually change slowly. • Then we find optimization method. • Which ones we can use depend on which constraints we pick.

More Related