Stereo Sebastian Thrun, Gary Bradski, Daniel Russakoff Stanford CS223B Computer Vision (with slides by James Rehg and.

Slides:



Advertisements
Similar presentations
Lecture 11: Two-view geometry
Advertisements

Stereo Vision Reading: Chapter 11
Gratuitous Picture US Naval Artillery Rangefinder from World War I (1918)!!
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Two-view geometry.
Lecture 8: Stereo.
Camera calibration and epipolar geometry
3D Computer Vision and Video Computing 3D Vision Topic 3 of Part II Stereo Vision CSc I6716 Spring 2011 Zhigang Zhu, City College of New York
Structure from motion.
Stanford CS223B Computer Vision, Winter 2005 Lecture 5: Stereo I Sebastian Thrun, Stanford Rick Szeliski, Microsoft Hendrik Dahlkamp and Dan Morris, Stanford.
Stanford CS223B Computer Vision, Winter 2005 Lecture 6: Stereo 2 Sebastian Thrun, Stanford Rick Szeliski, Microsoft Hendrik Dahlkamp and Dan Morris, Stanford.
Stanford CS223B Computer Vision, Winter 2007 Lecture 6 Advanced Stereo Professors Sebastian Thrun and Jana Košecká CAs: Vaibhav Vaish and David Stavens.
Computer Vision : CISC 4/689 Adaptation from: Prof. James M. Rehg, G.Tech.
Stanford CS223B Computer Vision, Winter 2006 Lecture 5 Stereo I
The Fundamental Matrix F
Epipolar geometry. (i)Correspondence geometry: Given an image point x in the first view, how does this constrain the position of the corresponding point.
Structure from motion. Multiple-view geometry questions Scene geometry (structure): Given 2D point matches in two or more images, where are the corresponding.
Uncalibrated Geometry & Stratification Sastry and Yang
Lecture 21: Multiple-view geometry and structure from motion
Stanford CS223B Computer Vision, Winter 2006 Lecture 6 Stereo II Professor Sebastian Thrun CAs: Dan Maynes-Aminzade, Mitul Saha, Greg Corrado Stereo.
CS 223b 1 More on stereo and correspondence. CS 223b 2 =?f g Mostpopular For each window, match to closest window on epipolar line in other image. (slides.
Computer Vision : CISC 4/689
3D Computer Vision and Video Computing 3D Vision Topic 4 of Part II Stereo Vision CSc I6716 Spring 2008 Zhigang Zhu, City College of New York
3D Computer Vision and Video Computing 3D Vision Lecture 15 Stereo Vision (II) CSC 59866CD Fall 2004 Zhigang Zhu, NAC 8/203A
CSc D Computer Vision / Ioannis Stamos 3-D Computer Vision CSc Stereo.
3D Computer Vision and Video Computing 3D Vision Lecture 14 Stereo Vision (I) CSC 59866CD Fall 2004 Zhigang Zhu, NAC 8/203A
Lec 21: Fundamental Matrix
CSE473/573 – Stereo Correspondence
Computer Vision : CISC 4/689 CREDITS Rasmussen, UBC (Jim Little), Seitz (U. of Wash.), Camps (Penn. State), UC, UMD (Jacobs), UNC, CUNY.
3-D Scene u u’u’ Study the mathematical relations between corresponding image points. “Corresponding” means originated from the same 3D point. Objective.
Epipolar Geometry and Stereo Vision Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 04/12/11 Many slides adapted from Lana Lazebnik,
Sebastian Thrun CS223B Computer Vision, Winter Stanford CS223B Computer Vision, Winter 2006 Lecture 4 Camera Calibration Professor Sebastian Thrun.
CSE 6367 Computer Vision Stereo Reconstruction Camera Coordinate Transformations “Everything should be made as simple as possible, but not simpler.” Albert.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
Automatic Camera Calibration
Lecture 11 Stereo Reconstruction I Lecture 11 Stereo Reconstruction I Mata kuliah: T Computer Vision Tahun: 2010.
Multi-view geometry.
Lecture 12 Stereo Reconstruction II Lecture 12 Stereo Reconstruction II Mata kuliah: T Computer Vision Tahun: 2010.
Geometric Camera Models and Camera Calibration
Stereo Vision Reading: Chapter 11 Stereo matching computes depth from two or more images Subproblems: –Calibrating camera positions. –Finding all corresponding.
Multiview Geometry and Stereopsis. Inputs: two images of a scene (taken from 2 viewpoints). Output: Depth map. Inputs: multiple images of a scene. Output:
Stereo Many slides adapted from Steve Seitz.
Computer Vision, Robert Pless
Announcements Project 3 due Thursday by 11:59pm Demos on Friday; signup on CMS Prelim to be distributed in class Friday, due Wednesday by the beginning.
Computer Vision Stereo Vision. Bahadir K. Gunturk2 Pinhole Camera.
Computer Vision Lecture #10 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical.
Camera Calibration Sebastian Thrun, Gary Bradski, Daniel Russakoff Stanford CS223B Computer Vision (with material from.
Bahadir K. Gunturk1 Phase Correlation Bahadir K. Gunturk2 Phase Correlation Take cross correlation Take inverse Fourier transform  Location of the impulse.
Two-view geometry. Epipolar Plane – plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections of the.
stereo Outline : Remind class of 3d geometry Introduction
Feature Matching. Feature Space Outlier Rejection.
Jochen Triesch, UC San Diego, 1 Stereo Outline: parallel camera axes convergent axes, epipolar geometry correspondence.
Solving for Stereo Correspondence Many slides drawn from Lana Lazebnik, UIUC.
Correspondence and Stereopsis Original notes by W. Correa. Figures from [Forsyth & Ponce] and [Trucco & Verri]
John Morris Stereo Vision (continued) Iolanthe returns to the Waitemata Harbour.
Geometry Reconstruction March 22, Fundamental Matrix An important problem: Determine the epipolar geometry. That is, the correspondence between.
Stereo March 8, 2007 Suggested Reading: Horn Chapter 13.
Stereo Matching Using Dynamic Programming
Lec 26: Fundamental Matrix CS4670 / 5670: Computer Vision Kavita Bala.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
CSE 185 Introduction to Computer Vision Stereo 2.
Multiview geometry ECE 847: Digital Image Processing Stan Birchfield Clemson University.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
© 2005 Yusuf Akgul Gebze Institute of Technology Department of Computer Engineering Computer Vision Stereo.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
CS4670 / 5670: Computer Vision Kavita Bala Lec 27: Stereo.
Two-view geometry Computer Vision Spring 2018, Lecture 10
Epipolar geometry.
Topic 7 of Part 2 Stereo Vision (II)
Computer Vision Stereo Vision.
Presentation transcript:

Stereo Sebastian Thrun, Gary Bradski, Daniel Russakoff Stanford CS223B Computer Vision (with slides by James Rehg and Zhigang Zhu) Stereo

Sebastian Thrun Stanford University CS223B Computer Vision Stereo Vision: Illustration

Sebastian Thrun Stanford University CS223B Computer Vision Stereo Vision: Outline n Basic Equations n Epipolar Geometry n Image Rectification n Reconstruction n Correspondence n (Active Range Imaging Techniques)

Sebastian Thrun Stanford University CS223B Computer Vision Pinhole Camera Model Image plane Focal length f Center of projection

Sebastian Thrun Stanford University CS223B Computer Vision Pinhole Camera Model Image plane

Sebastian Thrun Stanford University CS223B Computer Vision Pinhole Camera Model Image plane

Sebastian Thrun Stanford University CS223B Computer Vision Basic Stereo Derivations

Sebastian Thrun Stanford University CS223B Computer Vision Basic Stereo Derivations

Sebastian Thrun Stanford University CS223B Computer Vision What If…?

Sebastian Thrun Stanford University CS223B Computer Vision Epipolar Geometry p l p r P OlOl OrOr XlXl XrXr PlPl PrPr flfl frfr ZlZl YlYl ZrZr YrYr

Sebastian Thrun Stanford University CS223B Computer Vision Epipolar Geometry p l p r P OlOl OrOr elel erer PlPl PrPr Epipolar Plane Epipolar Lines Epipoles

Sebastian Thrun Stanford University CS223B Computer Vision Epipolar Geometry n Epipolar plane: plane going through point P and the centers of projection (COPs) of the two cameras n Epipoles: The image in one camera of the COP of the other n Epipolar Constraint: Corresponding points must lie on epipolar lines

Sebastian Thrun Stanford University CS223B Computer Vision Essential Matrix p l p r P OlOl OrOr elel erer PlPl PrPr Orthogonality T, P l, P l  T : Coordinate Transformation: Resolves to Essential Matrix

Sebastian Thrun Stanford University CS223B Computer Vision Essential Matrix p l p r P OlOl OrOr elel erer PlPl PrPr Projective Line:

Sebastian Thrun Stanford University CS223B Computer Vision Fundamental Matrix n Same as Essential Matrix in Camera Pixel Coordinates Pixel coordinates Intrinsic parameters

Sebastian Thrun Stanford University CS223B Computer Vision Computing F: The Eight-Point Algorithm n Input: n point correspondences ( n >= 8) –Construct homogeneous system Ax= 0 from x = (f 11,f 12,,f 13, f 21,f 22,f 23 f 31,f 32, f 33 ) : entries in F Each correspondence give one equation A is a nx9 matrix –Obtain estimate F^ by SVD of A: x (up to a scale) is column of V corresponding to the least singular value –Enforce singularity constraint: since Rank (F) = 2 Compute SVD of F: Set the smallest singular value to 0: D -> D’ Correct estimate of F : n Output: the estimate of the fundamental matrix F’ n Similarly we can compute E given intrinsic parameters

Sebastian Thrun Stanford University CS223B Computer Vision Recitification Idea: Align Epipolar Lines with Scan Lines. n Question: What type transformation?

Sebastian Thrun Stanford University CS223B Computer Vision Locating the Epipoles p l p r P OlOl OrOr elel erer PlPl PrPr n Input: Fundamental Matrix F –Find the SVD of F –The epipole e l is the column of V corresponding to the null singular value (as shown above) –The epipole e r is the column of U corresponding to the null singular value (similar treatment as for e l ) n Output: Epipole e l and e r e l lies on all the epipolar lines of the left image

Sebastian Thrun Stanford University CS223B Computer Vision Stereo Rectification (see Trucco) Stereo System with Parallel Optical Axes n Epipoles are at infinity n Horizontal epipolar lines p l p r P OlOl OrOr XlXl XrXr PlPl PrPr ZlZl YlYl ZrZr YrYr T

Sebastian Thrun Stanford University CS223B Computer Vision p l p r P OlOl OrOr PlPl PrPr Reconstruction (3-D): Idealized

Sebastian Thrun Stanford University CS223B Computer Vision p l p r P OlOl OrOr PlPl PrPr Reconstruction (3-D): Real See Trucco/Verri, pages

Sebastian Thrun Stanford University CS223B Computer Vision Correspondence Phantom points

Sebastian Thrun Stanford University CS223B Computer Vision Correspondence via Correlation Rectified images LeftRight scanline SSD error disparity (Same as max-correlation / max-cosine for normalized image patch)

Sebastian Thrun Stanford University CS223B Computer Vision Image Normalization n Even when the cameras are identical models, there can be differences in gain and sensitivity. n The cameras do not see exactly the same surfaces, so their overall light levels can differ. n For these reasons and more, it is a good idea to normalize the pixels in each window:

Sebastian Thrun Stanford University CS223B Computer Vision Images as Vectors LeftRight Each window is a vector in an m 2 dimensional vector space. Normalization makes them unit length.

Sebastian Thrun Stanford University CS223B Computer Vision Image Metrics (Normalized) Sum of Squared Differences Normalized Correlation

Sebastian Thrun Stanford University CS223B Computer Vision Correspondence Using Correlation LeftDisparity Map Images courtesy of Point Grey Research

Sebastian Thrun Stanford University CS223B Computer Vision LEFT IMAGE corner line structure Correspondence By Features

Sebastian Thrun Stanford University CS223B Computer Vision Correspondence By Features RIGHT IMAGE corner line structure n Search in the right image… the disparity (dx, dy) is the displacement when the similarity measure is maximum

Sebastian Thrun Stanford University CS223B Computer Vision Stereo Correspondences …… Left scanlineRight scanline

Sebastian Thrun Stanford University CS223B Computer Vision Stereo Correspondences …… Left scanlineRight scanline Match OcclusionDisocclusion

Sebastian Thrun Stanford University CS223B Computer Vision Search Over Correspondences Three cases: –Sequential – cost of match –Occluded – cost of no match –Disoccluded – cost of no match Left scanline Right scanline Occluded Pixels Disoccluded Pixels

Sebastian Thrun Stanford University CS223B Computer Vision Scan across grid computing optimal cost for each node given its upper-left neighbors. Backtrack from the terminal to get the optimal path. Occluded Pixels Left scanline Dis-occluded Pixels Right scanline Terminal Stereo Matching with Dynamic Programming

Sebastian Thrun Stanford University CS223B Computer Vision Stereo Matching with Dynamic Programming Dynamic programming yields the optimal path through grid. This is the best set of matches that satisfy the ordering constraint Occluded Pixels Left scanline Dis-occluded Pixels Right scanline Start End

Sebastian Thrun Stanford University CS223B Computer Vision Scan across grid computing optimal cost for each node given its upper-left neighbors. Backtrack from the terminal to get the optimal path. Occluded Pixels Left scanline Dis-occluded Pixels Right scanline Terminal Stereo Matching with Dynamic Programming

Sebastian Thrun Stanford University CS223B Computer Vision Scan across grid computing optimal cost for each node given its upper-left neighbors. Backtrack from the terminal to get the optimal path. Occluded Pixels Left scanline Dis-occluded Pixels Right scanline Terminal Stereo Matching with Dynamic Programming

Sebastian Thrun Stanford University CS223B Computer Vision Correspondence n It is fundamentally ambiguous, even with stereo constraints Ordering constraint……and its failure Figure from Forsyth & Ponce

Sebastian Thrun Stanford University CS223B Computer Vision A Last Word on Correspondences n Correspondens fail for smooth surfaces n There is currently no good solution to the correspondence problem

Sebastian Thrun Stanford University CS223B Computer Vision Summary Stereo Vision n Epipolar Geometry: Corresponding points lie on epipolar line n Essential/Fundamental matrix: Defines this line n Eight-Point Algorithm: Recovers Fundamental matrix n Rectification: Epipolar lines parallel to scanlines n Reconstruction: Minimize quadratic distance n Correspondence: –Minimize Sum of Squares over image correlation –Minimize Sum of Squares of feature characteristics n Many correspondences: Dynamic programming along scanlines (but can fail)

Sebastian Thrun Stanford University CS223B Computer Vision How can We Improve Stereo? By James Davis, Honda Research

Sebastian Thrun Stanford University CS223B Computer Vision rectified Active Stereo (Structured Light)

Sebastian Thrun Stanford University CS223B Computer Vision Structured Light: 3-D Result 3D Model3D Snapshot By James Davis, Honda Research

Sebastian Thrun Stanford University CS223B Computer Vision Time of Flight Sensor: Shutter

Sebastian Thrun Stanford University CS223B Computer Vision Time of Flight Sensor: Shutter

Sebastian Thrun Stanford University CS223B Computer Vision Time of Flight Sensor: Shutter

Sebastian Thrun Stanford University CS223B Computer Vision Time of Flight Sensor: Scanning

Sebastian Thrun Stanford University CS223B Computer Vision Time of Flight Sensor: Scanning

Sebastian Thrun Stanford University CS223B Computer Vision Time of Flight Sensor: Scanning Cleaned up…Raw data