A Flexible New Technique for Camera Calibration Zhengyou Zhang Sung Huh CSPS 643 Individual Presentation 1 February 25, 2009 1.

Slides:



Advertisements
Similar presentations
Zhengyou Zhang Vision Technology Group Microsoft Research
Advertisements

Vanishing points  .
More on single-view geometry
Lecture 11: Two-view geometry
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.
Digital Camera and Computer Vision Laboratory Department of Computer Science and Information Engineering National Taiwan University, Taipei, Taiwan, R.O.C.
Computer vision: models, learning and inference
Two-View Geometry CS Sastry and Yang
Self-calibration.
Chapter 6 Feature-based alignment Advanced Computer Vision.
Camera Calibration. Issues: what are intrinsic parameters of the camera? what is the camera matrix? (intrinsic+extrinsic) General strategy: view calibration.
Fisheye Camera Calibration Arunkumar Byravan & Shai Revzen University of Pennsylvania.
Camera calibration and epipolar geometry
Structure from motion.
Active Calibration of Cameras: Theory and Implementation Anup Basu Sung Huh CPSC 643 Individual Presentation II March 4 th,
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
CS485/685 Computer Vision Prof. George Bebis
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Many slides and illustrations from J. Ponce
Calibration Dorit Moshe.
Previously Two view geometry: epipolar geometry Stereo vision: 3D reconstruction epipolar lines Baseline O O’ epipolar plane.
The Pinhole Camera Model
Camera Calibration from Planar Patterns Homework 2 Help SessionCS223bStanford University Mitul Saha (courtesy: Jean-Yves Bouguet, Intel)
CS223b, Jana Kosecka Rigid Body Motion and Image Formation.
Algorithm Evaluation and Error Analysis class 7 Multiple View Geometry Comp Marc Pollefeys.
Camera parameters Extrinisic parameters define location and orientation of camera reference frame with respect to world frame Intrinsic parameters define.
Automatic Camera Calibration
Computer vision: models, learning and inference
Introduction à la vision artificielle III Jean Ponce
Computing the Fundamental matrix Peter Praženica FMFI UK May 5, 2008.
Camera Geometry and Calibration Thanks to Martial Hebert.
Epipolar geometry The fundamental matrix and the tensor
© 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
Projective Geometry. Projection Vanishing lines m and n.
Projective geometry ECE 847: Digital Image Processing Stan Birchfield Clemson University.
Metrology 1.Perspective distortion. 2.Depth is lost.
Geometric Camera Models
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.
Affine Structure from Motion
1 Camera calibration based on arbitrary parallelograms 授課教授:連震杰 學生:鄭光位.
EECS 274 Computer Vision Geometric Camera Calibration.
Plane-based external camera calibration with accuracy measured by relative deflection angle Chunhui Cui , KingNgiNgan Journal Image Communication Volume.
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)
Computer vision: models, learning and inference M Ahad Multiple Cameras
MASKS © 2004 Invitation to 3D vision Uncalibrated Camera Chapter 6 Reconstruction from Two Uncalibrated Views Modified by L A Rønningen Oct 2008.
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.
Correspondence and Stereopsis. Introduction Disparity – Informally: difference between two pictures – Allows us to gain a strong sense of depth Stereopsis.
Calibration ECE 847: Digital Image Processing Stan Birchfield Clemson University.
Calibrating a single camera
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
Parameter estimation class 5
Two-view geometry Computer Vision Spring 2018, Lecture 10
Epipolar geometry.
Geometric Camera Models
Multiple View Geometry for Robotics
Uncalibrated Geometry & Stratification
Camera Calibration from Planar Patterns
The Pinhole Camera Model
Presentation transcript:

A Flexible New Technique for Camera Calibration Zhengyou Zhang Sung Huh CSPS 643 Individual Presentation 1 February 25,

Outline Introduction Equations and Constraints Calibration and Procedure Experimental Results Conclusion 2

Outline Introduction Equations and Constraints Calibration and Procedure Experimental Results Conclusion 3

Introduction Extract metric information from 2D images Much work has been done by photogrammetry and computer vision community ◦ Photogrammetric calibration ◦ Self-calibration 4

Photogrammetric Calibration (Three-dimensional reference object-based calibration) Observing a calibration object with known geometry in 3D space Can be done very efficiently Calibration object usually consists of two or three planes orthogonal to each other ◦ A plane undergoing a precisely known translation is also used Expensive calibration apparatus and elaborate setup required 5

Self-Calibration Do not use any calibration object Moving camera in static scene The rigidity of the scene provides constraints on camera’s internal parameters Correspondences b/w images are sufficient to recover both internal and external parameters ◦ Allow to reconstruct 3D structure up to a similarity Very flexible, but not mature ◦ Cannot always obtain reliable results due to many parameters to estimate 6

Other Techniques Vanishing points for orthogonal directions Calibration from pure rotation 7

New Technique from Author Focused on a desktop vision system (DVS) Considered flexibility, robustness, and low cost Only require the camera to observe a planar pattern shown at a few (minimum 2) different orientations ◦ Pattern can be printed and attached on planer surface ◦ Either camera or planar pattern can be moved by hand More flexible and robust than traditional techniques ◦ Easy setup ◦ Anyone can make calibration pattern 8

Outline Introduction Equations and Constraints Calibration and Procedure Experimental Results Conclusion 9

Notation 2D point, 3D point, Augmented Vector, Relationship b/w 3D point M and image projection m 10 (1)(1)

Notation s : extrinsic parameters that relates the world coord. system to the camera coord. System A : Camera intrinsic matrix ( u 0, v 0 ): coordinates of the principal point α, β : scale factors in image u and v axes γ : parameter describing the skew of the two image 11

Homography b/w the Model Plane and Its Image Assume the model plane is on Z = 0 Denote i th column of the rotation matrix R by r i Relation b/w model point M and image m H is homography and defined up to a scale factor 12 (2)(2)

Constraints on Intrinsic Parameters Let H be H = [ h 1 h 2 h 3 ] Homography has 8 degrees of freedom & 6 extrinsic parameters Two basic constraints on intrinsic parameter 13 (3)(3) (4)(4)

Geometric Interpretation Model plane described in camera coordinate system Model plane intersects the plane at infinity at a line 14

Geometric Interpretation x ∞ is circular point and satisfy, or a 2 + b 2 = 0 Two intersection points This point is invariant to Euclidean transformation 15

Geometric Interpretation Projection of x ∞ in the image plane Point is on the image of the absolute conic, described by A -T A -1 Setting zero on both real and imaginary parts yield two intrinsic parameter constraints 16

Outline Introduction Equations and Constraints Calibration and Procedure Experimental Results Conclusion 17

Calibration Analytical solution Nonlinear optimization technique based on the maximum-likelihood criterion 18

Closed-Form Solution Define B = A -T A -1 ≡ B is defined by 6D vector b 19 (5)(5) (6)(6)

Closed-Form Solution i th column of H = h i Following relation hold 20 (7)(7)

Closed-Form Solution Two fundamental constraints, from homography, become If observed n images of model plane V is 2n x 6 matrix Solution of Vb = 0 is the eigenvector of V T V associated w/ smallest eigenvalue Therefore, we can estimate b 21 (8)(8) (9)(9)

Closed-Form Solution If n ≥ 3, unique solution b defined up to a scale factor If n = 2, impose skewless constraint γ = 0 If n = 1, can only solve two camera intrinsic parameters, α and β, assuming u 0 and v 0 are known and γ = 0 22

Closed-Form Solution Estimate B up to scale factor, B = λA T A -1 B is symmetric matrix defined by b B in terms of intrinsic parameter is known Intrinsic parameters are then 23

Closed-Form Solution Calculating extrinsic parameter from Homography H = [h 1 h 2 h 3 ] = λA[r 1 r 2 t] R = [r 1 r 2 r 3 ] does not, in general, satisfy properties of a rotation matrix because of noise in data R can be obtained through singular value decomposition 24

Maximum-Likelihood Estimation Given n images of model plane with m points on model plane Assumption ◦ Corrupted Image points by independent and identically distributed noise Minimizing following function yield maximum likelihood estimate 25 ( 10 )

Maximum-Likelihood Estimation is the projection of point M j in image i R is parameterized by a vector of three parameters ◦ Parallel to the rotation axis and magnitude is equal to the rotation angle R and r are related by the Rodrigues formula Nonlinear minimization problem solved with Levenberg-Marquardt Algorithm Require initial guess 26

Calibration Procedure 1. Print a pattern and attach to a planar surface 2. Take few images of the model plane under different orientations 3. Detect feature points in the images 4. Estimate five intrinsic parameters and all the extrinsic parameters using the closed-form solution 5. Refine all parameters by obtaining maximum- likelihood estimate 27

Outline Introduction Equations and Constraints Calibration and Procedure Experimental Results Conclusion 28

Experimental Results Off-the-shelf PULNiX CCD camera w/ 6mm lense 640 x 480 image resolution 5 images at close range (set A) 5 images at larger distance (set B) Applied calibration algorithm on set A, set B and Set A+B 29

Experimental Result Angle b/w image axes 30

Experimental Result 31

Outline Introduction Equations and Constraints Calibration and Procedure Experimental Results Conclusion 32

Conclusion Technique only requires the camera to observe a planar pattern from different orientation Pattern could be anything, as long as the metric on the plane is known Good test result obtained from both computer simulation and real data Proposed technique gains considerable flexibility 33

Appendix Estimating Homography b/w the Model Plane and its Image Method based on a maximum-likelihood criterion (Other option available) Let M i and m i be the model and image point, respectively Assume m i is corrupted by Gaussian noise with mean 0 and covariance matrix Λ m i 34

Appendix Minimizing following function yield maximum-likelihood estimation of H where with = i th row of H 35

Appendix Assume for all i Problem become nonlinear least-squares one, i.e. Nonlinear minimization is conducted with Levenberg-Marquardt Algorithm that requires an initial guess with following procedure to obtain 36

Appendix Let Then (2) become n above equation with given n point and can be written in matrix equation as Lx = 0 L is 2n x 9 matrix x is define dup to a scale factor Solution of x L T L associated with the smallest eigenvalue 37

Appendix Elements of L ◦ Constant 1 ◦ Pixels ◦ World coordinates ◦ Multiplication of both 38

Possible Future Work Improving distortion parameter caused by lens distortion 39

Question? 40