Single-view geometry Odilon Redon, Cyclops, 1914.

Slides:



Advertisements
Similar presentations
Vanishing points  .
Advertisements

C280, Computer Vision Prof. Trevor Darrell Lecture 2: Image Formation.
Single-view Metrology and Camera Calibration
Computer vision: models, learning and inference
Two-View Geometry CS Sastry and Yang
Jan-Michael Frahm, Enrique Dunn Spring 2012
Two-view geometry.
Camera Calibration. Issues: what are intrinsic parameters of the camera? what is the camera matrix? (intrinsic+extrinsic) General strategy: view calibration.
Computer vision. Camera Calibration Camera Calibration ToolBox – Intrinsic parameters Focal length: The focal length in pixels is stored in the.
CSc D Computer Vision – Ioannis Stamos 3-D Computer Vision CSc Camera 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.
Single-view metrology
3D Geometry and Camera Calibration. 3D Coordinate Systems Right-handed vs. left-handedRight-handed vs. left-handed x yz x yz.
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.
Uncalibrated Geometry & Stratification Sastry and Yang
CS485/685 Computer Vision Prof. George Bebis
Uncalibrated Epipolar - Calibration
Camera model Relation between pixels and rays in space ?
Calibration Dorit Moshe.
Lecture 16: Single-view modeling, Part 2 CS6670: Computer Vision Noah Snavely.
Single-view geometry Odilon Redon, Cyclops, 1914.
Projected image of a cube. Classical Calibration.
Single-view Metrology and Camera Calibration Computer Vision Derek Hoiem, University of Illinois 02/26/15 1.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
CS 558 C OMPUTER V ISION Lecture IX: Dimensionality Reduction.
Sebastian Thrun CS223B Computer Vision, Winter Stanford CS223B Computer Vision, Winter 2006 Lecture 4 Camera Calibration Professor Sebastian Thrun.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
Projective Geometry and Single View Modeling CSE 455, Winter 2010 January 29, 2010 Ames Room.
776 Computer Vision Jan-Michael Frahm, Enrique Dunn Spring 2013.
Introduction à la vision artificielle III Jean Ponce
WP3 - 3D reprojection Goal: reproject 2D ball positions from both cameras into 3D space Inputs: – 2D ball positions estimated by WP2 – 2D table positions.
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.
© 2005 Yusuf Akgul Gebze Institute of Technology Department of Computer Engineering Computer Vision Geometric Camera Calibration.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
Single-view Metrology and Camera Calibration Computer Vision Derek Hoiem, University of Illinois 01/25/11 1.
Geometric Camera Models
Peripheral drift illusion. Multiple views Hartley and Zisserman Lowe stereo vision structure from motion optical flow.
Computer Vision : CISC 4/689 Going Back a little Cameras.ppt.
Single-view geometry Odilon Redon, Cyclops, 1914.
Ch. 3: Geometric Camera Calibration
CS-498 Computer Vision Week 7, Day 2 Camera Parameters Intrinsic Calibration  Linear  Radial Distortion (Extrinsic Calibration?) 1.
Two-view geometry. Epipolar Plane – plane containing baseline (1D family) Epipoles = intersections of baseline with image planes = projections of the.
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.
Calibration.
Single-view geometry Odilon Redon, Cyclops, 1914.
Camera Calibration Course web page: vision.cis.udel.edu/cv March 24, 2003  Lecture 17.
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
Computer vision: models, learning and inference
Geometric Model of Camera
Depth from disparity (x´,y´)=(x+D(x,y), y)
Digital Visual Effects, Spring 2007 Yung-Yu Chuang 2007/4/17
Epipolar geometry.
Camera Calibration class 9
Multiple View Geometry for Robotics
George Mason University
Projective geometry Readings
Two-view geometry.
Two-view geometry.
Multi-view geometry.
Single-view geometry Odilon Redon, Cyclops, 1914.
Camera Calibration from Planar Patterns
Presentation transcript:

Single-view geometry Odilon Redon, Cyclops, 1914

Our goal: Recovery of 3D structure Recovery of structure from one image is inherently ambiguous x X?

Our goal: Recovery of 3D structure Recovery of structure from one image is inherently ambiguous

Our goal: Recovery of 3D structure Recovery of structure from one image is inherently ambiguous

Ames Room

Our goal: Recovery of 3D structure We will need multi-view geometry

Recall: Pinhole camera model Principal axis: line from the camera center perpendicular to the image plane Normalized (camera) coordinate system: camera center is at the origin and the principal axis is the z-axis

Recall: Pinhole camera model

Principal point Principal point (p): point where principal axis intersects the image plane Normalized coordinate system: origin of the image is at the principal point Image coordinate system: origin is in the corner How to go from normalized coordinate system to image coordinate system? pxpx pypy

Principal point offset principal point: pxpx pypy

Principal point offset calibration matrix principal point:

Pixel coordinates m x pixels per meter in horizontal direction, m y pixels per meter in vertical direction Pixel size: pixels/m mpixels

Camera rotation and translation In general, the camera coordinate frame will be related to the world coordinate frame by a rotation and a translation coords. of point in camera frame coords. of camera center in world frame coords. of a point in world frame Conversion from world to camera coordinate system (in non-homogeneous coordinates):

Camera rotation and translation Note: C is the null space of the camera projection matrix (PC=0)

Camera parameters Intrinsic parameters Principal point coordinates Focal length Pixel magnification factors Skew (non-rectangular pixels) Radial distortion

Camera parameters Intrinsic parameters Principal point coordinates Focal length Pixel magnification factors Skew (non-rectangular pixels) Radial distortion Extrinsic parameters Rotation and translation relative to world coordinate system

Camera calibration Source: D. Hoiem

Camera calibration Given n points with known 3D coordinates X i and known image projections x i, estimate the camera parameters XiXi xixi

Camera calibration: Linear method Two linearly independent equations

Camera calibration: Linear method P has 11 degrees of freedom One 2D/3D correspondence gives us two linearly independent equations Homogeneous least squares: find p minimizing ||Ap|| 2 Solution given by eigenvector of A T A with smallest eigenvalue 6 correspondences needed for a minimal solution

Camera calibration: Linear method Note: for coplanar points that satisfy Π T X=0, we will get degenerate solutions (Π,0,0), (0,Π,0), or (0,0,Π)

Camera calibration: Linear method Advantages: easy to formulate and solve Disadvantages Doesn’t directly tell you camera parameters Doesn’t model radial distortion Can’t impose constraints, such as known focal length and orthogonality Non-linear methods are preferred Define error as squared distance between projected points and measured points Minimize error using Newton’s method or other non-linear optimization Source: D. Hoiem