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.

Slides:



Advertisements
Similar presentations
Epipolar Geometry.
Advertisements

Lecture 11: Two-view geometry
3D reconstruction.
Two-View Geometry CS Sastry and Yang
Jan-Michael Frahm, Enrique Dunn Spring 2012
Two-view geometry.
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.
Lecture 8: Stereo.
Epipolar Geometry class 11 Multiple View Geometry Comp Marc Pollefeys.
Camera calibration and epipolar geometry
Computer Vision : CISC 4/689
Epipolar Geometry Class 7 Read notes Feature tracking run iterative L-K warp & upsample Tracking Good features Multi-scale Transl. Affine.
Lecture 11: Structure from motion, part 2 CS6670: Computer Vision Noah Snavely.
Epipolar geometry. (i)Correspondence geometry: Given an image point x in the first view, how does this constrain the position of the corresponding point.
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.
Lecture 20: Two-view geometry CS6670: Computer Vision Noah Snavely.
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
Scene planes and homographies. Homographies given the plane and vice versa.
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.
Epipolar geometry Class 5. Geometric Computer Vision course schedule (tentative) LectureExercise Sept 16Introduction- Sept 23Geometry & Camera modelCamera.
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,
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
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
Epipolar Geometry and Stereo Vision Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem 03/05/15 Many slides adapted from Lana Lazebnik,
Computer vision: models, learning and inference
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.
Epipolar Geometry and Stereo Vision Computer Vision ECE 5554 Virginia Tech Devi Parikh 10/15/13 These slides have been borrowed from Derek Hoiem and Kristen.
Multi-view geometry.
Geometry and Algebra of Multiple Views
Epipolar geometry The fundamental matrix and the tensor
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
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.
Epipolar geometry Epipolar Plane Baseline Epipoles Epipolar Lines
Lecture 04 22/11/2011 Shai Avidan הבהרה : החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Objects at infinity used in calibration
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 Course web page: vision.cis.udel.edu/~cv April 11, 2003  Lecture 21.
1 Formation et Analyse d’Images Session 7 Daniela Hall 25 November 2004.
Two-view geometry Epipolar geometry F-matrix comp. 3D reconstruction
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
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’,
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.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry Topics: Basics of projective geometry Points and hyperplanes in projective space Homography.
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.
CSE 185 Introduction to Computer Vision Stereo 2.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
Two-view geometry Computer Vision Spring 2018, Lecture 10
Epipolar geometry.
3D Photography: Epipolar geometry
Computer Graphics Recitation 12.
Reconstruction.
Two-view geometry.
Two-view geometry.
Multi-view geometry.
Presentation transcript:

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 9.2 Epipolar geometry HZ 9.1

Overview of 2-view geometry entering Part II of Hartley-Zisserman epipolar geometry –formalization of the structure between 2 views –used to extract depth information inherent in this stereo view how fundamental matrix F encodes epipolar geometry –the central structure in 2-view geometry is the fundamental matrix F: all of the camera and structure information is extracted directly or indirectly from F solving for F using point correspondences –8 point algorithm singularity constraint normalization –7 point algorithm how the fundamental matrix encodes the camera center and other camera information

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 9.2 Epipolar geometry HZ 9.1

Finding structure imagine two cameras (perhaps virtually by moving a single camera in time) camera centers c and c’ valid point correspondence (x,x’) we want to discover the 3D point X associated with this point correspondence finding X and finding c/c’ are the main goals of structure from motion we shall explore the geometric relationship between c,c’,x,x’,X

Epipolar geometry baseline = line cc’ between camera centers; demo: cardboard, 2 frames epipolar plane = any plane through the baseline –a pencil of planes epipole = intersection of baseline with image plane –equivalently, image of other camera center –this connection to camera center will be leveraged –crucial to computing structure and camera –note: may lie outside image epipolar line = intersection of an epipolar plane with an image plane –note: x has an associated epipolar plane (3 points define a plane), so an associated epipolar line –note: x’ lies on the epipolar line associated with x HZ

Epipolar lines we have seen that x’ lies on the x epipolar line, and x lies on the x’ epipolar line offers a mechanism to tie the two points together: if we can compute the epipolar line l’ associated with a point x, then we have a constraint on the position of x’ –l’. x’ = 0 (x’ lies on l’) –this tells us something about the companion x’ the fundamental matrix will build epipolar lines from points so it is valuable in determining structure epipolar line = image of cx line

Epipoles from epipolar lines epipolar lines are tied up with epipoles: epipole lies on every epipolar line notice how the epipole can be found from these epipolar lines this gives information about the other camera center

Fundamental matrix the fundamental matrix relates two images the fundamental matrix F of two images is a 3x3 matrix such that: –F: points  epipolar lines –Fx is the epipolar line (in image 2) associated with the point x (in image 1) –also vice versa using F t : x’ in image 2 => F t x’ in image 1 how do we interpret this? x is in a 2-space, Fx is in another 2-space corollary: x t Fx’ = 0 if (x,x’) are a corresponding pair (i.e., image points of the same 3D point X) –proof: x lies on Fx’ F as epipolar line generator F as correspondence checker HZ242

Computing F: basics we will use x t Fx’ = 0 constraints from a few point correspondences to solve for F each point pair (x,x’) defines a linear equation in F 8 pairs should be enough to solve for the 8 degrees of freedom in F (projective 3x3) SIFT will be used to gather point correspondences detailed algorithms below

Epipoles from F F yields information about the epipoles (on top of information about epipolar lines and point correspondences) let e = epipole of image 1 e’ = epipole of image 2 both are found as null spaces Fe = 0 F t e’ = 0 proof below

Interpretation of F consider the epipolar line l’ associated with x l’ = e’ x x’ –e’ and x’ lie on l’ so l’ = [e’] x x’ –skew-symmetric rep but x’ = Hx for some homography H –can be understood as point transfer off a plane, but not necessary so l’ = [e’] x Hx we know l’ = Fx, so: F = [e’] x H HZ243

Resulting properties of F F is rank 2 –[e’] x is rank 2, H is rank 3 –that is, F is singular and has 1d null space –adds a constraint that is very helpful in guiding the computation of F (see below) proof that Fe = 0: –Fe = ([e’] x H) e = [e’] x (H e) = e’ x (He) = e’ x e’ = 0 image of e is e’ –thus, the epipole e may be found as the null space of F

CLAPACK OpenCV has SVD too –download CLAPACK from and install CLAPACK following –generates lapack_LINUX.a and blas_LINUX.a optimize the BLAS for your machine (optional) see my Makefile see for documentationwww.netlib.org/lapack download the manual pages for ready access: e.g., once you discover through the search engine that ‘sgesv’ solves Ax=b for you, ‘man sgesv’ gives its parameters. read CLAPACK/readme for caveats of style differences in calling LAPACK from C, such as column-major simulation and call by reference parameters. sgesvd for SVD