Two-View Geometry CS Sastry and Yang

Slides:



Advertisements
Similar presentations
Single-view geometry Odilon Redon, Cyclops, 1914.
Advertisements

Epipolar Geometry.
Lecture 11: Two-view geometry
3D reconstruction.
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Two-view geometry.
Camera calibration and epipolar geometry
Structure from motion.
MASKS © 2004 Invitation to 3D vision Lecture 8 Segmentation of Dynamical Scenes.
Stereo and Epipolar geometry
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
Epipolar Geometry and the Fundamental Matrix F
Multiple-view Reconstruction from Points and Lines
3D reconstruction of cameras and structure x i = PX i x’ i = P’X i.
Uncalibrated Epipolar - Calibration
Previously Two view geometry: epipolar geometry Stereo vision: 3D reconstruction epipolar lines Baseline O O’ epipolar plane.
May 2004Stereo1 Introduction to Computer Vision CS / ECE 181B Tuesday, May 11, 2004  Multiple view geometry and stereo  Handout #6 available (check with.
Lec 21: Fundamental Matrix
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
Structure Computation. How to compute the position of a point in 3- space given its image in two views and the camera matrices of those two views Use.
CS 558 C OMPUTER V ISION Lecture IX: Dimensionality Reduction.
3-D Scene u u’u’ Study the mathematical relations between corresponding image points. “Corresponding” means originated from the same 3D point. Objective.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
776 Computer Vision Jan-Michael Frahm, Enrique Dunn Spring 2013.
Computer vision: models, learning and inference
Computing the Fundamental matrix Peter Praženica FMFI UK May 5, 2008.
Multi-view geometry.
Epipolar geometry The fundamental matrix and the tensor
1 Preview At least two views are required to access the depth of a scene point and in turn to reconstruct scene structure Multiple views can be obtained.
Projective cameras Motivation Elements of Projective Geometry Projective structure from motion Planches : –
Homogeneous Coordinates (Projective Space) Let be a point in Euclidean space Change to homogeneous coordinates: Defined up to scale: Can go back to non-homogeneous.
Metrology 1.Perspective distortion. 2.Depth is lost.
Multiview Geometry and Stereopsis. Inputs: two images of a scene (taken from 2 viewpoints). Output: Depth map. Inputs: multiple images of a scene. Output:
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.
Parameter estimation. 2D homography Given a set of (x i,x i ’), compute H (x i ’=Hx i ) 3D to 2D camera projection Given a set of (X i,x i ), compute.
Affine Structure from Motion
Single-view geometry Odilon Redon, Cyclops, 1914.
Raquel A. Romano 1 Scientific Computing Seminar May 12, 2004 Projective Geometry for Computer Vision Projective Geometry for Computer Vision Raquel A.
Two-view geometry. Epipolar Plane – plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections of the.
EECS 274 Computer Vision Affine Structure from Motion.
Feature Matching. Feature Space Outlier Rejection.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
Structure from Motion ECE 847: Digital Image Processing
MASKS © 2004 Invitation to 3D vision Uncalibrated Camera Chapter 6 Reconstruction from Two Uncalibrated Views Modified by L A Rønningen Oct 2008.
Reconstruction from Two Calibrated Views Two-View Geometry
Single-view geometry Odilon Redon, Cyclops, 1914.
Uncalibrated reconstruction Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration.
Stereo March 8, 2007 Suggested Reading: Horn Chapter 13.
Parameter estimation class 5 Multiple View Geometry CPSC 689 Slides modified from Marc Pollefeys’ Comp
Camera Calibration Course web page: vision.cis.udel.edu/cv March 24, 2003  Lecture 17.
Lec 26: Fundamental Matrix CS4670 / 5670: Computer Vision Kavita Bala.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
Calibrating a single camera
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
René Vidal and Xiaodong Fan Center for Imaging Science
Parameter estimation class 5
Epipolar geometry.
3D Photography: Epipolar geometry
Structure from motion Input: Output: (Tomasi and Kanade)
Estimating 2-view relationships
The Brightness Constraint
Uncalibrated Geometry & Stratification
George Mason University
Two-view geometry.
Two-view geometry.
Multi-view geometry.
Structure from motion Input: Output: (Tomasi and Kanade)
Presentation transcript:

Two-View Geometry CS 294-6 Sastry and Yang

General Formulation Given two views of the scene recover the unknown camera displacement and 3D scene structure MASKS © 2004 Invitation to 3D vision

Pinhole Camera Model 3D points Image points Perspective Projection Rigid Body Motion Rigid Body Motion + Projective projection MASKS © 2004 Invitation to 3D vision

Rigid Body Motion – Two views MASKS © 2004 Invitation to 3D vision

3D Structure and Motion Recovery Euclidean transformation measurements unknowns Find such Rotation and Translation and Depth that the reprojection error is minimized Two views ~ 200 points 6 unknowns – Motion 3 Rotation, 3 Translation - Structure 200x3 coordinates - (-) universal scale Difficult optimization problem MASKS © 2004 Invitation to 3D vision

Epipolar Geometry Algebraic Elimination of Depth Essential matrix Image correspondences Algebraic Elimination of Depth [Longuet-Higgins ’81]: Essential matrix MASKS © 2004 Invitation to 3D vision

Epipolar Geometry Epipolar lines Epipoles Image correspondences MASKS © 2004 Invitation to 3D vision

Characterization of the Essential Matrix Special 3x3 matrix Theorem 1a (Essential Matrix Characterization) A non-zero matrix is an essential matrix iff its SVD: satisfies: with and and MASKS © 2004 Invitation to 3D vision

Estimating the Essential Matrix Estimate Essential matrix Decompose Essential matrix into Given n pairs of image correspondences: Find such Rotation and Translation that the epipolar error is minimized Space of all Essential Matrices is 5 dimensional 3 Degrees of Freedom – Rotation 2 Degrees of Freedom – Translation (up to scale !) MASKS © 2004 Invitation to 3D vision

Pose Recovery from the Essential Matrix Theorem 1a (Pose Recovery) There are two relative poses with and corresponding to a non-zero matrix essential matrix. Twisted pair ambiguity MASKS © 2004 Invitation to 3D vision

Estimating Essential Matrix Denote Rewrite Collect constraints from all points MASKS © 2004 Invitation to 3D vision

Estimating Essential Matrix Solution Eigenvector associated with the smallest eigenvalue of if degenerate configuration Projection on to Essential Space Theorem 2a (Project to Essential Manifold) If the SVD of a matrix is given by then the essential matrix which minimizes the Frobenius distance is given by with MASKS © 2004 Invitation to 3D vision

Two view linear algorithm Solve the LLSE problem: followed by projection Project onto the essential manifold: SVD: E is 5 diml. sub. mnfld. in 8-point linear algorithm Recover the unknown pose: MASKS © 2004 Invitation to 3D vision

Pose Recovery There are exactly two pairs corresponding to each essential matrix . There are also two pairs corresponding to each essential matrix . Positive depth constraint - used to disambiguate the physically impossible solutions Translation has to be non-zero Points have to be in general position - degenerate configurations – planar points - quadratic surface Linear 8-point algorithm Nonlinear 5-point algorithms yield up to 10 solutions MASKS © 2004 Invitation to 3D vision

3D structure recovery Eliminate one of the scale’s Solve LLSE problem If the configuration is non-critical, the Euclidean structure of then points and motion of the camera can be reconstructed up to a universal scale. MASKS © 2004 Invitation to 3D vision

Example- Two views Point Feature Matching MASKS © 2004 Invitation to 3D vision

Example – Epipolar Geometry Camera Pose and Sparse Structure Recovery MASKS © 2004 Invitation to 3D vision

Epipolar Geometry – Planar Case Plane in first camera coordinate frame Image correspondences Planar homography Linear mapping relating two corresponding planar points in two views MASKS © 2004 Invitation to 3D vision

Decomposition of H Algebraic elimination of depth can be estimated linearly Normalization of Decomposition of H into 4 solutions MASKS © 2004 Invitation to 3D vision

Motion and pose recovery for planar scene Given at least 4 point correspondences Compute an approximation of the homography matrix As nullspace of Normalize the homography matrix Decompose the homography matrix Select two physically possible solutions imposing positive depth constraint the rows of are MASKS © 2004 Invitation to 3D vision

Example MASKS © 2004 Invitation to 3D vision

Special Rotation Case Two view related by rotation only Mapping to a reference view Mapping to a cylindrical surface MASKS © 2004 Invitation to 3D vision

Motion and Structure Recovery – Two Views Two views – general motion, general structure 1. Estimate essential matrix 2. Decompose the essential matrix 3. Impose positive depth constraint 4. Recover 3D structure Two views – general motion, planar structure 1. Estimate planar homography 2. Normalize and decompose H 3. Recover 3D structure and camera pose MASKS © 2004 Invitation to 3D vision