Introduction à la vision artificielle III Jean Ponce

Slides:



Advertisements
Similar presentations
Camera Calibration.
Advertisements

Single-view geometry Odilon Redon, Cyclops, 1914.
3D reconstruction.
Robot Vision SS 2005 Matthias Rüther 1 ROBOT VISION Lesson 3: Projective Geometry Matthias Rüther Slides courtesy of Marc Pollefeys Department of Computer.
Computer vision: models, learning and inference
Two-View Geometry CS Sastry and Yang
Two-view geometry.
Camera Calibration. Issues: what are intrinsic parameters of the camera? what is the camera matrix? (intrinsic+extrinsic) General strategy: view calibration.
Camera calibration and epipolar geometry
Camera Models A camera is a mapping between the 3D world and a 2D image The principal camera of interest is central projection.
Structure from motion.
1 Old summary of camera modelling 3 coordinate frame projection matrix decomposition intrinsic/extrinsic param.
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
1 Basic geometric concepts to understand Affine, Euclidean geometries (inhomogeneous coordinates) projective geometry (homogeneous coordinates) plane at.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Used slides/content with permission from
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
3D reconstruction of cameras and structure x i = PX i x’ i = P’X i.
Many slides and illustrations from J. Ponce
Bases géométriques de l’informatique – Part deux Jean Ponce “Hauts du DI” Web:
Single-view geometry Odilon Redon, Cyclops, 1914.
Projected image of a cube. Classical Calibration.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
Instance-level recognition I. - Camera geometry and image alignment Josef Sivic INRIA, WILLOW, ENS/INRIA/CNRS UMR 8548 Laboratoire.
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.
Projective Geometry and Camera Models
Euclidean cameras and strong (Euclidean) calibration Intrinsic and extrinsic parameters Linear least-squares methods Linear calibration Degenerate point.
Camera Geometry and Calibration Thanks to Martial Hebert.
Multi-view geometry.
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.
Projective Geometry. Projection Vanishing lines m and n.
Camera Model & Camera 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:
Geometric Camera Models
Vision Review: Image Formation Course web page: September 10, 2002.
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.
Lecture 03 15/11/2011 Shai Avidan הבהרה : החומר המחייב הוא החומר הנלמד בכיתה ולא זה המופיע / לא מופיע במצגת.
Class 61 Multi-linear Systems and Invariant Theory in the Context of Computer Vision and Graphics Class 6: Duality and Shape Tensors CS329 Stanford University.
Geometry of Multiple Views
Affine Structure from Motion
Single-view geometry Odilon Redon, Cyclops, 1914.
Ch. 3: Geometric Camera Calibration
A Flexible New Technique for Camera Calibration Zhengyou Zhang Sung Huh CSPS 643 Individual Presentation 1 February 25,
EECS 274 Computer Vision Geometric Camera Calibration.
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.
1 Chapter 2: Geometric Camera Models Objective: Formulate the geometrical relationships between image and scene measurements Scene: a 3-D function, g(x,y,z)
Reconnaissance d’objets et vision artificielle Jean Ponce Equipe-projet WILLOW ENS/INRIA/CNRS UMR 8548 Laboratoire.
Single-view geometry Odilon Redon, Cyclops, 1914.
Structure from motion Multi-view geometry Affine structure from motion Projective structure from motion Planches : –
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.
GEOMETRIC CAMERA CALIBRATION The Calibration Problem Least-Squares Techniques Linear Calibration from Points Reading: Chapter 3.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
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
Geometric Camera Calibration
Parameter estimation class 5
Epipolar geometry.
Geometric Camera Models
Camera Calibration class 9
Two-view geometry.
Two-view geometry.
Multi-view geometry.
Single-view geometry Odilon Redon, Cyclops, 1914.
Presentation transcript:

Introduction à la vision artificielle III Jean Ponce

Camera geometry and calibration II Intrinsic and extrinsic parameters Strong (Euclidean) calibration Degenerate configurations What about affine cameras?

Explicit Form of the Projection Matrix Note: M is only defined up to scale in this setting!!

Theorem (Faugeras, 1993)

Observations: is the equation of a plane of normal direction a 1 From the projection equation, it is also the plane defined by: u = 0 Similarly: (a 2,b 2 ) describes the plane defined by: v = 0 (a 3,b 3 ) describes the plane defined by:  That is the plane passing through the pinhole (z = 0) Geometric Interpretation Projection equation:

u v a3a3 C Geometric Interpretation: The rows of the projection matrix describe the three planes defined by the image coordinate system a1a1 a2a2

p P Other useful geometric properties Q: Given an image point p, what is the direction of the corresponding ray in space? A: Q: Can we compute the position of the camera center  ? A:

Linear Camera Calibration

Linear Systems A A x xb b = = Square system: unique solution Gaussian elimination Rectangular system ?? underconstrained: infinity of solutions Minimize |Ax-b| 2 overconstrained: no solution

How do you solve overconstrained linear equations ??

Homogeneous Linear Systems A A x x0 0 = = Square system: unique solution: 0 unless Det(A)=0 Rectangular system ?? 0 is always a solution Minimize |Ax| under the constraint |x| =1 2 2

How do you solve overconstrained homogeneous linear equations ?? The solution is e. 1 E(x)-E(e 1 ) = x T (U T U)x-e 1 T (U T U)e 1 = 1  … + q  q > 1 (  … +  q 2 -1)=0

Example: Line Fitting Problem: minimize with respect to (a,b,d). Minimize E with respect to d: Minimize E with respect to a,b: where Done !! n

Note: Matrix of second moments of inertia Axis of least inertia

Linear Camera Calibration

Once M is known, you still got to recover the intrinsic and extrinsic parameters !!! This is a decomposition problem, not an estimation problem. Intrinsic parameters Extrinsic parameters 

Degenerate Point Configurations Are there other solutions besides M ?? Coplanar points: ( λ, μ, ν ) = ( π,0,0 ) or ( 0, π,0 ) or ( 0,0, π ) Points lying on the intersection curve of two quadric surfaces = straight line + twisted cubic Does not happen for 6 or more random points!

Analytical Photogrammetry Non-Linear Least-Squares Methods Newton Gauss-Newton Levenberg-Marquardt Iterative, quadratically convergent in favorable situations