Self-calibration.

Slides:



Advertisements
Similar presentations
More on single-view geometry
Advertisements

3D reconstruction.
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
Jan-Michael Frahm, Enrique Dunn Spring 2012
Two-view geometry.
Camera calibration and epipolar geometry
Structure from motion.
Self-calibration and multi-view geometry Class 10 Read Chapter 6 and 3.2.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
3D reconstruction class 11
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
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
3D reconstruction of cameras and structure x i = PX i x’ i = P’X i.
Many slides and illustrations from J. Ponce
Self-calibration Class 21 Multiple View Geometry Comp Marc Pollefeys.
Uncalibrated Epipolar - Calibration
CAU Kiel DAGM 2001-Tutorial on Visual-Geometric 3-D Scene Reconstruction 1 The plan for today Leftovers and from last time Camera matrix Part A) Notation,
Multiple View Geometry
Multiple View Geometry
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Self-calibration Class 13 Read Chapter 6. Assignment 3 Collect potential matches from all algorithms for all pairs Matlab ASCII format, exchange data.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Previously Two view geometry: epipolar geometry Stereo vision: 3D reconstruction epipolar lines Baseline O O’ epipolar plane.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Epipolar geometry Class 5. Geometric Computer Vision course schedule (tentative) LectureExercise Sept 16Introduction- Sept 23Geometry & Camera modelCamera.
Multi-view geometry. Multi-view geometry problems Structure: Given projections of the same 3D point in two or more images, compute the 3D coordinates.
Automatic Camera Calibration
875: Recent Advances in Geometric Computer Vision & Recognition Jan-Michael Frahm Fall 2011.
Multi-view geometry.
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.
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.
Objects at infinity used in calibration
3D Reconstruction Jeff Boody. Goals ● Reconstruct 3D models from a sequence of at least two images ● No prior knowledge of the camera or scene ● Use the.
Robot Vision SS 2007 Matthias Rüther 1 ROBOT VISION Lesson 6a: Shape from Stereo, short summary Matthias Rüther Slides partial courtesy of Marc Pollefeys.
Geometric Camera Models
Two-view geometry Epipolar geometry F-matrix comp. 3D reconstruction
© 2005 Martin Bujňák, Martin Bujňák Supervisor : RNDr.
HONGIK UNIVERSITY School of Radio Science & Communication Engineering Visual Information Processing Lab Hong-Ik University School of Radio Science & Communication.
December 12 th, 2001C. Geyer/K. Daniilidis GRASP Laboratory Slide 1 Structure and Motion from Uncalibrated Catadioptric Views Christopher Geyer and Kostas.
Affine Structure from Motion
1 Camera calibration based on arbitrary parallelograms 授課教授:連震杰 學生:鄭光位.
A Flexible New Technique for Camera Calibration Zhengyou Zhang Sung Huh CSPS 643 Individual Presentation 1 February 25,
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.
3D reconstruction from uncalibrated images
Class 51 Multi-linear Systems and Invariant Theory in the Context of Computer Vision and Graphics Class 5: Self Calibration CS329 Stanford University Amnon.
776 Computer Vision Jan-Michael Frahm & Enrique Dunn Spring 2013.
Vision Sensors for Stereo and Motion Joshua Gluckman Polytechnic University.
Auto-calibration we have just calibrated using a calibration object –another calibration object is the Tsai grid of Figure 7.1 on HZ182, which can be used.
MASKS © 2004 Invitation to 3D vision Uncalibrated Camera Chapter 6 Reconstruction from Two Uncalibrated Views Modified by L A Rønningen Oct 2008.
Uncalibrated reconstruction Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration.
Structure from motion Multi-view geometry Affine structure from motion Projective structure from motion Planches : –
Projective cameras The end of projective SFM Euclidean upgrades Line geometry Purely projective cameras Présentations mercredi 26 mai de 9h30 à midi, salle.
EECS 274 Computer Vision Projective Structure from Motion.
Projective 2D geometry course 2 Multiple View Geometry Comp Marc Pollefeys.
Calibration ECE 847: Digital Image Processing Stan Birchfield Clemson University.
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
More on single-view geometry class 10
3D reconstruction class 11
Camera Calibration class 9
Uncalibrated Geometry & Stratification
Two-view geometry.
Two-view geometry.
Presentation transcript:

Self-calibration

Outline Introduction Self-calibration Dual Absolute Quadric Critical Motion Sequences

Motivation Avoid explicit calibration procedure Complex procedure Need for calibration object Need to maintain calibration

Motivation Allow flexible acquisition No prior calibration necessary Possibility to vary intrinsics Use archive footage

Example

Projective ambiguity Reconstruction from uncalibrated images  projective ambiguity on reconstruction

Stratification of geometry Projective Affine Metric 15 DOF 7 DOF absolute conic angles, rel.dist. 12 DOF plane at infinity parallelism More general More structure

Constraints ? Scene constraints Camera extrinsics constraints Parallellism, vanishing points, horizon, ... Distances, positions, angles, ... Unknown scene  no constraints Camera extrinsics constraints Pose, orientation, ... Unknown camera motion  no constraints Camera intrinsics constraints Focal length, principal point, aspect ratio & skew Perspective camera model too general  some constraints

Euclidean projection matrix Factorization of Euclidean projection matrix Intrinsics: (camera geometry) Extrinsics: (camera motion) Note: every projection matrix can be factorized, but only meaningful for euclidean projection matrices

Constraints on intrinsic parameters Constant e.g. fixed camera: Known e.g. rectangular pixels: square pixels: principal point known:

Self-calibration Upgrade from projective structure to metric structure using constraints on intrinsic camera parameters Constant intrinsics Some known intrinsics, others varying Constraints on intrincs and restricted motion (e.g. pure translation, pure rotation, planar motion) (Faugeras et al. ECCV´92, Hartley´93, Triggs´97, Pollefeys et al. PAMI´98, ...) (Heyden&Astrom CVPR´97, Pollefeys et al. ICCV´98,...) (Moons et al.´94, Hartley ´94, Armstrong ECCV´96, ...)

A counting argument To go from projective (15DOF) to metric (7DOF) at least 8 constraints are needed Minimal sequence length should satisfy Independent of algorithm Assumes general motion (i.e. not critical)

Self-calibration: conceptual algorithm Given projective structure and motion {Pj,Mi}, then the metric structure and motion can be obtained as {PjT-1,TMi}, with criterium expressing constraints function extracting intrinsics from projection matrix

Outline Introduction Self-calibration Dual Absolute Quadric Critical Motion Sequences

Conics & Quadrics conics quadrics transformations projection

The Absolute Conic  is a specific imaginary conic on , for metric frame or Remember, the absolute conic is fixed under H if, and only if, H is a similarity transformation Image related to intrinsics

The Absolute Dual Quadric (Triggs CVPR´97) Degenerate dual quadric * Encodes both absolute conic  and    * for metric frame:

Absolute Dual Quadric and Self-calibration Eliminate extrinsics from equation Equivalent to projection of dual quadric Abs.Dual Quadric also exists in projective world Transforming world so that reduces ambiguity to metric

Absolute Dual Quadric and Self-calibration Projection equation: * * projection constraints Translate constraints on K through projection equation to constraints on * Absolute conic = calibration object which is always present but can only be observed through constraints on the intrinsics

Constraints on * m 2m m-1 condition constraint type #constraints Zero skew quadratic m Principal point linear 2m Zero skew (& p.p.) Fixed aspect ratio (& p.p.& Skew) m-1 Known aspect ratio (& p.p.& Skew) Focal length (& p.p. & Skew)

(Pollefeys et al.,ICCV´98/IJCV´99) Linear algorithm (Pollefeys et al.,ICCV´98/IJCV´99) Assume everything known, except focal length Yields 4 constraint per image Note that rank-3 constraint is not enforced

Linear algorithm revisited (Pollefeys et al., ECCV‘02) Weighted linear equations assumptions

Projective to metric Compute T from using eigenvalue decomposition of and then obtain metric reconstruction as

Alternatives: (Dual) image of absolute conic Equivalent to Absolute Dual Quadric Practical when H can be computed first Pure rotation (Hartley’94, Agapito et al.’98,’99) Vanishing points, pure translations, modulus constraint, …

Note that in the absence of skew the IAC can be more practical than the DIAC!

Kruppa equations Limit equations to epipolar geometry Only 2 independent equations per pair But independent of plane at infinity

Refinement Metric bundle adjustment Enforce constraints or priors on intrinsics during minimization (this is „self-calibration“ for photogrammetrist)

Outline Introduction Self-calibration Dual Absolute Quadric Critical Motion Sequences

Critical motion sequences (Sturm, CVPR´97, Kahl, ICCV´99, Pollefeys,PhD´99) Self-calibration depends on camera motion Motion sequence is not always general enough Critical Motion Sequences have more than one potential absolute conic satisfying all constraints Possible to derive classification of CMS

Critical motion sequences: constant intrinsic parameters Most important cases for constant intrinsics Critical motion type ambiguity pure translation affine transformation (5DOF) pure rotation arbitrary position for  (3DOF) orbital motion proj.distortion along rot. axis (2DOF) planar motion scaling axis  plane (1DOF) Note relation between critical motion sequences and restricted motion algorithms

Critical motion sequences: varying focal length Most important cases for varying focal length (other parameters known) Critical motion type ambiguity pure rotation arbitrary position for  (3DOF) forward motion proj.distortion along opt. axis (2DOF) translation and rot. about opt. axis scaling optical axis (1DOF) hyperbolic and/or elliptic motion one extra solution

Critical motion sequences: algorithm dependent Additional critical motion sequences can exist for some specific algorithms when not all constraints are enforced (e.g. not imposing rank 3 constraint) Kruppa equations/linear algorithm: fixating a point Some spheres also project to circles located in the image and hence satisfy all the linear/kruppa self-calibration constraints

Non-ambiguous new views for CMS (Pollefeys,ICCV´01) restrict motion of virtual camera to CMS use (wrong) computed camera parameters