Camera from F Computing K from 1 image HZ8.8 IAC and K HZ8.5 Camera matrix from F HZ9.5 IAC HZ3.5-3.7, 8.5 Extracting camera parameters HZ6.2 Camera matrix.

Slides:



Advertisements
Similar presentations
Epipolar Geometry.
Advertisements

3D reconstruction.
Primitives Behaviour at infinity HZ 2.2 Projective DLT alg Invariants
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Jan-Michael Frahm, Enrique Dunn Spring 2012
Two-view geometry.
Epipolar Geometry class 11 Multiple View Geometry Comp Marc Pollefeys.
Camera calibration and epipolar geometry
Image alignment Image from
Structure from motion.
3.II.1. Representing Linear Maps with Matrices 3.II.2. Any Matrix Represents a Linear Map 3.II. Computing Linear Maps.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Robot Vision SS 2008 Matthias Rüther 1 ROBOT VISION Lesson 6: Shape from Stereo Matthias Rüther Slides partial courtesy of Marc Pollefeys Department of.
Epipolar Geometry Class 7 Read notes Feature tracking run iterative L-K warp & upsample Tracking Good features Multi-scale Transl. Affine.
3D reconstruction class 11
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
Lecture 21: Multiple-view geometry and structure from motion
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Multiple-view Reconstruction from Points and Lines
3D reconstruction of cameras and structure x i = PX i x’ i = P’X i.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
3D Geometry for Computer Graphics
Projected image of a cube. Classical Calibration.
Lec 21: Fundamental Matrix
Scene planes and homographies. Homographies given the plane and vice versa.
3-D Scene u u’u’ Study the mathematical relations between corresponding image points. “Corresponding” means originated from the same 3D point. Objective.
Two-view geometry diagram Camera from F Structure computation Alg 12.1, HZ318 7-point algorithm normalized 8-pt alg for F HZ 11.2 Fundamental matrix HZ.
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.
Automatic Camera Calibration
Projective geometry of 2-space DLT alg HZ 4.1 Rectification HZ 2.7 Hierarchy of maps Invariants HZ 2.4 Projective transform HZ 2.3 Behaviour at infinity.
Lecture 11 Stereo Reconstruction I Lecture 11 Stereo Reconstruction I Mata kuliah: T Computer Vision Tahun: 2010.
Computing the Fundamental matrix Peter Praženica FMFI UK May 5, 2008.
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.
© 2005 Yusuf Akgul Gebze Institute of Technology Department of Computer Engineering Computer Vision Geometric Camera Calibration.
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.
Chapter 2: Vector spaces
Pole/polar consider projective geometry again we may want to compute the tangents of a curve that pass through a point (e.g., visibility) let C be a conic.
视觉的三维运动理解 刘允才 上海交通大学 2002 年 11 月 16 日 Understanding 3D Motion from Images Yuncai Liu Shanghai Jiao Tong University November 16, 2002.
Lecture 04 22/11/2011 Shai Avidan הבהרה : החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Objects at infinity used in calibration
Matrices Matrices For grade 1, undergraduate students For grade 1, undergraduate students Made by Department of Math.,Anqing Teachers college.
Stereo Course web page: vision.cis.udel.edu/~cv April 11, 2003  Lecture 21.
Two-view geometry Epipolar geometry F-matrix comp. 3D reconstruction
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.
Computer Vision : CISC 4/689 Going Back a little Cameras.ppt.
Multi-linear Systems and Invariant Theory in the Context of Computer Vision and Graphics CS329 Amnon Shashua.
Ch. 3: Geometric Camera Calibration
Section 10.3 and Section 9.3 Systems of Equations and Inverses of Matrices.
Day x 5-10 minute quiz SVD demo review of metric rectification algorithm 1.build a 2x3 matrix A from orthog line pairs A = [L1M1, L1M2+L2M1, L2M2; L1’M1’,
Camera diagram Computing K from 1 image HZ8.8 IAC and K HZ8.5 Camera matrix from F HZ9.5 IAC HZ , 8.5 Extracting camera parameters HZ6.2 Camera matrix.
Two-view geometry. Epipolar Plane – plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections of the.
Matrices and linear transformations For grade 1, undergraduate students For grade 1, undergraduate students Made by Department of Math.,Anqing Teachers.
Multi-linear Systems and Invariant Theory
Computer vision: models, learning and inference M Ahad Multiple Cameras
Auto-calibration we have just calibrated using a calibration object –another calibration object is the Tsai grid of Figure 7.1 on HZ182, which can be used.
Determining 3D Structure and Motion of Man-made Objects from Corners.
EECS 274 Computer Vision Projective Structure from Motion.
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.
Epipolar geometry.
3D reconstruction class 11
Uncalibrated Geometry & Stratification
Presentation transcript:

Camera from F Computing K from 1 image HZ8.8 IAC and K HZ8.5 Camera matrix from F HZ9.5 IAC HZ , 8.5 Extracting camera parameters HZ6.2 Camera matrix HZ6.1 Calibration using Q* HZ19.3 Hartley 92

F does not uniquely identify a camera pair a fundamental matrix F relates two images, and therefore two cameras F already gives indirect information about the camera through the epipole (the null vector of F) we will now see that much fuller information about both cameras can be extracted from F, in particular the two camera matrices but a fundamental matrix does not uniquely identify two camera matrices Theorem: Let H be a homography of 3-space. The fundamental matrix associated with camera pair (P,P’) is the same as the fundamental matrix associated with camera pair (PH, P’H). Proof: if (x = PX, x’ = P’X) is a point correspondence in the 1 st camera system arising from 3d point X, then (x = (PH)(H -1 X), x’ = (P’H)(H -1 X)) is a point correspondence in the 2 nd camera system arising from 3d point H -1 X thus, upon finding F, we only know the camera matrix up to a homography analogous to affine rectification: extra work is required to remove this projective freedom and get to metric structure of the camera (stay tuned!) luckily this is the only degree of freedom: if two camera pairs have the same F, then they must differ by a homography (Thm 9.10) HZ254

F does not depend on world frame camera matrix depends on image frame and world frame, since x = PX is dependent on the image coordinates x and the world coordinates X but the above result is telling us that the fundamental matrix is independent of the world frame we are happy to relax to within a similarity of the truth, but we are relaxing to within a projectivity of the truth, which pleases us less –we will need calibration techniques –(these calibration techniques may be interpreted as ways of protecting the absolute conic) HZ253

Camera matrix from F let’s see what we can get from F we assume that the first camera matrix is always [I 0] –we can always normalize so that it is, using some homography we are solving for the “relative offset” of the 2 nd camera from the 1 st Lemma: F is fundamental matrix of camera pair (P,P’) iff P’ t FP is skew-symmetric. Proof: P’ t FP is skew-symmetric  X t (P’ t FP) X = 0 for all X  x’t F x = 0 where x’ = P’X and x = PX, the images of X  F is fundamental matrix of (P,P’) Theorem: The camera matrices associated with F may be chosen to be [I 0] and [SF e’] where –e’^t F = 0 (2 nd image epipole) –S = any skew-symmetric matrix –proof: just check that [SF e’]^t F [I 0] is skew-symmetric Corollary: The camera matrices associated with F may be chosen to be [I 0] and [[e’]x F e’]. –choose S = [e’]x to guarantee a rank 3 camera matrix P’ –see proof on 256 –ironic: to guarantee rank 3 P’ (necessary, so good), we force rank 2 M’ (a bit bad) HZ255-6

Pseudoinverse P + the camera matrix P is rectangular (3x4) so it does not have an inverse but we want to use the notion of inverse to talk about the preimage of an image point a rectangular matrix P has a pseudoinverse P + P + = (P t P) -1 P t –note that P t P is square –note that P + degenerates to P -1 when P is square and nonsingular x = A + b is the least-squares solution of Ax=b if A is full rank (Trefethen 81)

F from P two camera matrices do uniquely specify a fundamental matrix let P and P’ be two camera matrices, and e’ the epipole in the 2 nd image –note: e’ can be calculated as P’C (image of other camera center) the associated fundamental matrix of these 2 cameras: –F = [e’] x P’ P + –note: P’P + is the homography H in the earlier definition of F = [e’] x H –proof idea: epipolar line of x is built from the epipole e’ and the camera-2- image of a typical point of the camera-1-preimage of x (or P’ P + x) –proof: Fx = L’ = e’ x P’ (P + x) so F = [e’] x P’ P + note how the fundamental and camera matrices are independent of the actual contents of the image; only dependent on the camera setup HZ244