1 Old summary of camera modelling 3 coordinate frame projection matrix decomposition intrinsic/extrinsic param.

Slides:



Advertisements
Similar presentations
Zhengyou Zhang Vision Technology Group Microsoft Research
Advertisements

3D Geometry for Computer Graphics
Lecture 11: Two-view geometry
1 A camera is modeled as a map from a space pt (X,Y,Z) to a pixel (u,v) by ‘homogeneous coordinates’ have been used to ‘treat’ translations ‘multiplicatively’
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
Solving Linear Systems (Numerical Recipes, Chap 2)
Camera Calibration. Issues: what are intrinsic parameters of the camera? what is the camera matrix? (intrinsic+extrinsic) General strategy: view calibration.
CSc D Computer Vision – Ioannis Stamos 3-D Computer Vision CSc Camera Calibration.
Camera calibration and epipolar geometry
Structure from motion.
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.
Math for CSLecture 41 Linear Least Squares Problem Over-determined systems Minimization problem: Least squares norm Normal Equations Singular Value Decomposition.
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
MASKS © 2004 Invitation to 3D vision Lecture 5 Introduction to Linear Algebra Shankar Sastry September 13 th, 2005.
Camera model Relation between pixels and rays in space ?
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Projective Geometry and Camera model Class 2
Cameras and Projections Dan Witzner Hansen Course web page:
3D Geometry for Computer Graphics
Ordinary least squares regression (OLS)
Camera Calibration from Planar Patterns Homework 2 Help SessionCS223bStanford University Mitul Saha (courtesy: Jean-Yves Bouguet, Intel)
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
1 Digital Images WorldCameraDigitizer Digital Image (i) What determines where the image of a 3D point appears on the 2D image? (ii) What determines how.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Computer vision: models, learning and inference
CHAPTER SIX Eigenvalues
Introduction à la vision artificielle III Jean Ponce
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
Square n-by-n Matrix.
Camera Geometry and Calibration Thanks to Martial Hebert.
© 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.
Course 12 Calibration. 1.Introduction In theoretic discussions, we have assumed: Camera is located at the origin of coordinate system of scene.
Geometric Models & Camera Calibration
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.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 4. Least squares.
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.
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)
Class 51 Multi-linear Systems and Invariant Theory in the Context of Computer Vision and Graphics Class 5: Self Calibration CS329 Stanford University Amnon.
1. Systems of Linear Equations and Matrices (8 Lectures) 1.1 Introduction to Systems of Linear Equations 1.2 Gaussian Elimination 1.3 Matrices and Matrix.
1 Overview Introduction to projective geometry 1 view geometry (calibration, …) 2-view geometry (stereo, motion, …) 3- and N-view geometry Autocalibration.
Single-view geometry Odilon Redon, Cyclops, 1914.
Uncalibrated reconstruction Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration.
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.
Calibration ECE 847: Digital Image Processing Stan Birchfield Clemson University.
Calibrating a single camera
Geometric Camera Calibration
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
One view geometry---camera modeling
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Depth from disparity (x´,y´)=(x+D(x,y), y)
Homogeneous Coordinates (Projective Space)
Parameter estimation class 5
Epipolar geometry.
Euclidean Inner Product on Rn
Some useful linear algebra
Uncalibrated Geometry & Stratification
Numerical Computation and Optimization
Camera Calibration from Planar Patterns
Presentation transcript:

1 Old summary of camera modelling 3 coordinate frame projection matrix decomposition intrinsic/extrinsic param

2 World coordinate frame: extrinsic parameters Finally, we should count properly...

3 ‘abstract’ camera: projection from P3 to P2 This is the most general camera model without considering optical distortion As lines are preserved so that it is a linear transformation and can be represented by a 3*4 matrix Math: central proj. Physics: pin-hole ‘new’ way of looking at ‘old’ modeling

4 11 d.o.f. Rank(P) = ? ker(P)=c row vectors, planes column vectors, directions principal plane: w=0 calibration, 6 pts decomposition by QR, K intrinsic (5). R, t, extrinsic (6) geometric interpretation of K, R, t (backward from u/x=v/y=f/z to P) internal parameters and absolute conic Properties of the 3*4 matrix P

5 It is the image of the absolute conic, prove it first! Point conic: The dual conic: What is the calibration matrix K?

6

7 Don’t forget: when the world is planar … A general plane homography!

8 Camera calibration Given Estimate C decompose C into intrinsic/extrinsic from image processing or by hand

9 Calibration set-up: 3D calibration object

10 The remaining pb is how to solve this ‘trivial’ system of equations!

11 Review of some basic numerical algorithms linear algebra: how to solve Ax=b? (non-linear optimisation) (statistics)

12 Linear algebra review Gaussian elimination LU decomposition orthogonal decomposition QR (Gram-Schmidt) SVD (the high(est)light of linear algebra!)

13 Solving (full rank) square matrix linear sys Ax =b = elimination = LU factorization 1. factor A into LU 2. solve Lc = b (lower triangular, forward substitution) 3. solve Ux=c (upper tri., backward substitution)

14 Solving for Least squares solution for Ax=b, min||Ax-b|| = pseudo-inverse x = (A^TA)-1(A^T A)b (theoretically, but not numerically) Numerically, QR does it well: as A^TA= R^TR, Orthogonal bases and Gram-Schmidt A = QR

15 Solving for homogeneous system Ax=o subject to ||x||=1, It is equivalent to min||Ax||, i.e. x^T A^T A x, the solution is the eigenvector of A^TA associated with the smallest eigenvalue Triangular systems not bad, but diagonal system is better! Diagonalization = eigen vectors => doable for symmtric matrices

16 SVD gives orthogonal bases for all subspaces row space: first Vs null space: last Vs col space: first Us null space of the trans : last Us A x = b, pseudo-inverse, x = A + b for both square system and least squares sol. Even better with homogeneous sys: A x =0, x = v_n ! You get everything with svd:

17 Linear methods of computing P p34=1 ||p||=1 ||p3||=1 Geometric interpretation of these constraints

18 Decomposition analytical by equating K(R,t)=P (QR (more exactly it is RQ))

19 1.Renormalise by c3 2.tz = c34 3.r3 = c3 4.u0 = c1^T c3 5.v0 = c2^T c3 6.alpha u 7.alpha v 8.…

20 Linear, but non-optimal, but we want optima, but non-linear, methods of computing P

21 How to solve this non-linear system of equations?

22 (Non-linear iterative optimisation) J d = r from vector F(x+d)=F(x)+J d minimize the square of y-F(x+d)=y-F(x)-J d = r – J d normal equation is J^T J d = J^T r (Gauss-Newton) (H+lambda I) d = J^T r (LM) Note: F is a vector of functions, i.e. min f=(y-F)^T(y-F)

23 Using a planar pattern Cf. the paper by Zhengyou Zhang (ICCV99), Sturm and Maybank (CVPR99) (Homework: read these papers.) Why? it is more convenient to have a planar calibration pattern than a 3D calibration object, so it’s very popular now for amateurs.

24 first estimate the plane homogrphies Hi from u and x, 1. How to estimate H? 2. Why one may not be sufficient? extract parameters from the plane homographies

25 Relationship between H and parameters: How to extract intrinsic parameters?

26 (How to extract intrinsic parameters?) The absolute conic in image The (transformed) absolute conic in the plane: The circular points of the Euclidean plane (i,1,0) and (-i,1,0) go thru this conic: two equations on K!

27 It turns the camera into an spherical one, or angular/direction sensor! Direction vector: Angle between two rays... What does the calibration give us? Normalised coordinates:

28 Summary of calibration 1.Get image-space points 2.Solve the linear system 3.Optimal sol. by non-linear method 4.Decomposition by RQ