Reconstruction.

Slides:



Advertisements
Similar presentations
Epipolar Geometry.
Advertisements

The fundamental matrix F
Lecture 11: Two-view geometry
3D reconstruction.
Two-View Geometry CS Sastry and Yang
Jan-Michael Frahm, Enrique Dunn Spring 2012
Two-view geometry.
Lecture 8: Stereo.
Relations between image coordinates Given coordinates in one image, and the tranformation Between cameras, T = [R t], what are the image coordinates In.
Camera calibration and epipolar geometry
Structure from motion.
3D Geometry and Camera Calibration. 3D Coordinate Systems Right-handed vs. left-handedRight-handed vs. left-handed x yz x yz.
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
Lecture 20: Two-view geometry CS6670: Computer Vision Noah Snavely.
3D Computer Vision and Video Computing 3D Vision Lecture 14 Stereo Vision (I) CSC 59866CD Fall 2004 Zhigang Zhu, NAC 8/203A
Projected image of a cube. Classical Calibration.
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
Multiple View Geometry. THE GEOMETRY OF MULTIPLE VIEWS Reading: Chapter 10. Epipolar Geometry The Essential Matrix The Fundamental Matrix The Trifocal.
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.
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.
776 Computer Vision Jan-Michael Frahm, Enrique Dunn Spring 2013.
Automatic Camera Calibration
Computer vision: models, learning and inference
Lecture 11 Stereo Reconstruction I Lecture 11 Stereo Reconstruction I Mata kuliah: T Computer Vision Tahun: 2010.
Camera Geometry and Calibration Thanks to Martial Hebert.
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 : –
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
Lecture 04 22/11/2011 Shai Avidan הבהרה : החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Multiview Geometry and Stereopsis. Inputs: two images of a scene (taken from 2 viewpoints). Output: Depth map. Inputs: multiple images of a scene. Output:
Lec 22: Stereo CS4670 / 5670: Computer Vision Kavita Bala.
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.
Geometry of Multiple Views
Two-view geometry. Epipolar Plane – plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections of the.
Computer vision: models, learning and inference M Ahad Multiple Cameras
Single-view geometry Odilon Redon, Cyclops, 1914.
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.
Lec 26: Fundamental Matrix CS4670 / 5670: Computer Vision Kavita Bala.
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.
Calibrating a single camera
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
Epipolar Geometry and Stereo Vision
Undergrad HTAs / TAs Help me make the course better!
CS4670 / 5670: Computer Vision Kavita Bala Lec 27: Stereo.
Two-view geometry Computer Vision Spring 2018, Lecture 10
Epipolar geometry.
Structure from motion Input: Output: (Tomasi and Kanade)
Epipolar geometry continued
Two-view geometry.
Computer Graphics Recitation 12.
Estimating 2-view relationships
3D reconstruction class 11
Multiple View Geometry for Robotics
Uncalibrated Geometry & Stratification
Two-view geometry.
Two-view geometry.
Multi-view geometry.
Single-view geometry Odilon Redon, Cyclops, 1914.
The Pinhole Camera Model
Structure from motion Input: Output: (Tomasi and Kanade)
Presentation transcript:

Reconstruction

Perspective projection in rectified cameras For rectified cameras, correspondence problem is easier Only requires searching along a particular row.

Rectifying cameras Given two images from two cameras with known relationship, can we rectify them?

Rectifying cameras Can we rotate / translate cameras? Do we need to know the 3D structure of the world to do this?

Rotating cameras Assume K is identity Assume coordinate system at camera pinhole

Rotating cameras Assume K is identity Assume coordinate system at camera pinhole

Rotating cameras What happens if the camera is rotated?

Rotating cameras What happens if the camera is rotated? No need to know the 3D structure Rotation matrix Homogenous coordinates of mapped pixel Homogenous coordinates of original pixel

Rotating cameras

Rectifying cameras

Rectifying cameras

Rectifying cameras

Rectifying cameras

Perspective projection in rectified cameras For rectified cameras, correspondence problem is easier Only requires searching along a particular row.

Perspective projection in rectified cameras What about non-rectified cameras? Is there an equivalent? For rectified cameras, correspondence problem is easier Only requires searching along a particular row.

Epipolar constraint Reduces 2D search problem to search along a particular line: epipolar line

Epipolar constraint True in general! Given pixel (x,y) in one image, corresponding pixel in the other image must lie on a line Line function of (x,y) and parameters of camera These lines are called epipolar line

Epipolar geometry

Epipolar geometry - why? For a single camera, pixel in image plane must correspond to point somewhere along a ray

Epipolar geometry When viewed in second image, this ray looks like a line: epipolar line The epipolar line must pass through image of the first camera in the second image - epipole Epipole Epipolar line

Epipolar geometry Given an image point in one view, where is the corresponding point in the other view? ? epipolar line C C / baseline epipole A point in one view “generates” an epipolar line in the other view The corresponding point lies on this line

Epipolar line Epipolar constraint Reduces correspondence problem to 1D search along an epipolar line

Epipolar lines

Epipolar lines

Epipolar lines Epipole

Epipolar geometry continued Epipolar geometry is a consequence of the coplanarity of the camera centres and scene point X x x / C C / The camera centres, corresponding points and scene point lie in a single plane, known as the epipolar plane

Nomenclature X C C l/ x x e e right epipolar line left epipolar line x x / e / e C C / The epipolar line l/ is the image of the ray through x The epipole e is the point of intersection of the line joining the camera centres with the image plane this line is the baseline for a stereo rig, and the translation vector for a moving camera The epipole is the image of the centre of the other camera: e = PC/ , e/ = P/C

The epipolar pencil X e e / baseline As the position of the 3D point X varies, the epipolar planes “rotate” about the baseline. This family of planes is known as an epipolar pencil (a pencil is a one parameter family). All epipolar lines intersect at the epipole.

The epipolar pencil X e e / baseline As the position of the 3D point X varies, the epipolar planes “rotate” about the baseline. This family of planes is known as an epipolar pencil (a pencil is a one parameter family). All epipolar lines intersect at the epipole.

Epipolar geometry - the math Assume intrinsic parameters K are identity Assume world coordinate system is centered at 1st camera pinhole with Z along viewing direction

Epipolar geometry - the math Assume intrinsic parameters K are identity Assume world coordinate system is centered at 1st camera pinhole with Z along viewing direction

Epipolar geometry - the math Assume intrinsic parameters K are identity Assume world coordinate system is centered at 1st camera pinhole with Z along viewing direction

Epipolar geometry - the math Assume intrinsic parameters K are identity Assume world coordinate system is centered at 1st camera pinhole with Z along viewing direction

Epipolar geometry - the math Assume intrinsic parameters K are identity Assume world coordinate system is centered at 1st camera pinhole with Z along viewing direction

Epipolar geometry - the math

Epipolar geometry - the math Can we write this as matrix vector operations? Cross product can be written as a matrix

Epipolar geometry - the math Can we write this as matrix vector operations? Dot product can be written as a vector-vector times

Epipolar geometry - the math Can we write this as matrix vector operations? Dot product can be written as a vector-vector times

Epipolar geometry - the math

Epipolar geometry - the math Homogenous coordinates of point in image 2 Homogenous coordinates of point in image 1 Essential matrix

Epipolar constraint and epipolar lines Consider a known, fixed pixel in the first image What constraint does this place on the corresponding pixel? where What kind of equation is this?

Epipolar constraint and epipolar lines Consider a known, fixed pixel in the first image where Line!

Epipolar constraint: putting it all together If p is a pixel in first image and q is the corresponding pixel in the second image, then: qTEp = 0 E = [t]XR For fixed p, q must satisfy: qTl = 0, where l = Ep For fixed q, p must satisfy: lTp = 0 where lT = qTE, or l = Etq These are epipolar lines! Epipolar line in 2nd image Epipolar line in 1st image

Essential matrix and epipoles E = [t]XR Ep is an epipolar line in 2nd image All epipolar lines in second image pass through c2 c2 is epipole in 2nd image

Essential matrix and epipoles E = [t]XR ETq is an epipolar line in 1st image All epipolar lines in first image pass through c1 c1 is the epipole in 1st image

Epipolar geometry - the math We assumed that intrinsic parameters K are identity What if they are not?

Fundamental matrix

Fundamental matrix

Fundamental matrix

Fundamental matrix

Fundamental matrix Fundamental matrix

Fundamental matrix result

Properties of the Fundamental Matrix is the epipolar line associated with T 5 parameters

Properties of the Fundamental Matrix is the epipolar line associated with and All epipolar lines contain epipole T 5 parameters

Properties of the Fundamental Matrix is the epipolar line associated with and is rank 2 T Prove that F is rank 2. F

Why is F rank 2? F is a 3 x 3 matrix But there is a vector c1 and c2 such that Fc1 = 0 and FTc2 = 0

Estimating F If we don’t know K1, K2, R, or t, can we estimate F for two images? Yes, given enough correspondences

Estimating F – 8-point algorithm The fundamental matrix F is defined by for any pair of matches x and x’ in two images. Let x=(u,v,1)T and x’=(u’,v’,1)T, each match gives a linear equation

8-point algorithm In reality, instead of solving , we seek f to minimize , least eigenvector of .

8-point algorithm – Problem? F should have rank 2 To enforce that F is of rank 2, F is replaced by F’ that minimizes subject to the rank constraint. This is achieved by SVD. Let , where , let then is the solution. The problem is that the resulting often is ill-conditioned. In theory, should have one singular value equal to zero and the rest are non-zero. In practice, however, some of the non-zero singular values can become small relative to the larger ones. If more than eight corresponding points are used to construct , where the coordinates are only approximately correct, there may not be a well-defined singular value which can be identified as approximately zero. Consequently, the solution of the homogeneous linear system of equations may not be sufficiently accurate to be useful.

Recovering camera parameters from F / E Can we recover R and t between the cameras from F? No: K1 and K2 are in principle arbitrary matrices What if we knew K1 and K2 to be identity?

Recovering camera parameters from E t is a solution to ETx = 0 Can’t distinguish between t and ct for constant scalar c How do we recover R?

Recovering camera parameters from E We know E and t Consider taking SVD of E and [t]X

Recovering camera parameters from E t is a solution to ETx = 0 Can’t distinguish between t and ct for constant scalar c

8-point algorithm Pros: it is linear, easy to implement and fast Cons: susceptible to noise Degenerate: if points are on same plane Normalized 8-point algorithm: Hartley Position origin at centroid of image points Rescale coordinates so that center to farthest point is sqrt (2)

Discussion

Correspondence-free reconstruction Stereo algorithms depend on correspondences What if we don’t have correspondences? Photometric consistency Given a candidate 3D point project it into each camera If color matches, photometric consistent Optimize a candidate shape till it becomes consistent