Introduction Epipolar Geometry Calibration Methods Further Readings. Stereo Camera Calibration



Similar documents
Epipolar Geometry. Readings: See Sections 10.1 and 15.6 of Forsyth and Ponce. Right Image. Left Image. e(p ) Epipolar Lines. e(q ) q R.

EXPERIMENTAL EVALUATION OF RELATIVE POSE ESTIMATION ALGORITHMS

Wii Remote Calibration Using the Sensor Bar

Linear Algebra Review. Vectors

2-View Geometry. Mark Fiala Ryerson University

8. Linear least-squares

Least-Squares Intersection of Lines

Projective Reconstruction from Line Correspondences

An Efficient Solution to the Five-Point Relative Pose Problem

3 Orthogonal Vectors and Matrices

Optical Tracking Using Projective Invariant Marker Pattern Properties

Manifold Learning Examples PCA, LLE and ISOMAP

Epipolar Geometry and Visual Servoing

A Flexible New Technique for Camera Calibration

Projective Geometry. Projective Geometry

Nonlinear Iterative Partial Least Squares Method

Orthogonal Diagonalization of Symmetric Matrices

Geometric Camera Parameters

Camera geometry and image alignment

Chapter 6. Orthogonality

Support Vector Machine (SVM)

A QCQP Approach to Triangulation. Chris Aholt, Sameer Agarwal, and Rekha Thomas University of Washington 2 Google, Inc.

Lecture 5: Singular Value Decomposition SVD (1)

Similar matrices and Jordan form

P164 Tomographic Velocity Model Building Using Iterative Eigendecomposition

CS 534: Computer Vision 3D Model-based recognition

Linear Algebraic Equations, SVD, and the Pseudo-Inverse

Review Jeopardy. Blue vs. Orange. Review Jeopardy

Relating Vanishing Points to Catadioptric Camera Calibration

3D Scanner using Line Laser. 1. Introduction. 2. Theory

Recall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.

DESIGN & DEVELOPMENT OF AUTONOMOUS SYSTEM TO BUILD 3D MODEL FOR UNDERWATER OBJECTS USING STEREO VISION TECHNIQUE

Summary: Transformations. Lecture 14 Parameter Estimation Readings T&V Sec Parameter Estimation: Fitting Geometric Models

α = u v. In other words, Orthogonal Projection

The Geometry of Polynomial Division and Elimination

Subspace Analysis and Optimization for AAM Based Face Alignment

Applied Linear Algebra I Review page 1

Metrics on SO(3) and Inverse Kinematics

Introduction to Matrix Algebra

THE problem of visual servoing guiding a robot using

Systems of Linear Equations

Mehtap Ergüven Abstract of Ph.D. Dissertation for the degree of PhD of Engineering in Informatics

How To Analyze Ball Blur On A Ball Image

Numerical Methods I Solving Linear Systems: Sparse Matrices, Iterative Methods and Non-Square Systems

Geometry: Unit 1 Vocabulary TERM DEFINITION GEOMETRIC FIGURE. Cannot be defined by using other figures.

EPnP: An Accurate O(n) Solution to the PnP Problem

Inner Product Spaces and Orthogonality

Multiple View Geometry in Computer Vision

x = + x 2 + x

Segmentation of building models from dense 3D point-clouds

13 MATH FACTS a = The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

CS 5614: (Big) Data Management Systems. B. Aditya Prakash Lecture #18: Dimensionality Reduc7on

Geometric Constraints

LS.6 Solution Matrices

160 CHAPTER 4. VECTOR SPACES

Projective Geometry: A Short Introduction. Lecture Notes Edmond Boyer

Time Domain and Frequency Domain Techniques For Multi Shaker Time Waveform Replication

Lectures notes on orthogonal matrices (with exercises) Linear Algebra II - Spring 2004 by D. Klain

Geometry of Vectors. 1 Cartesian Coordinates. Carlo Tomasi

Object Recognition and Template Matching

Eigenvalues and Eigenvectors

1 Introduction to Matrices

1 Review of Least Squares Solutions to Overdetermined Systems

DATA ANALYSIS II. Matrix Algorithms

Terrain Traversability Analysis using Organized Point Cloud, Superpixel Surface Normals-based segmentation and PCA-based Classification

Recall that two vectors in are perpendicular or orthogonal provided that their dot

A new Optical Tracking System for Virtual and Augmented Reality Applications

MATH APPLIED MATRIX THEORY

Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections

Going Big in Data Dimensionality:

University of Lille I PC first year list of exercises n 7. Review

Solving Simultaneous Equations and Matrices

Math 215 HW #6 Solutions

Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013

Similarity and Diagonalization. Similar Matrices

5. Orthogonal matrices

Numerical Analysis Lecture Notes

Using Many Cameras as One

Computational Optical Imaging - Optique Numerique. -- Deconvolution --

Digital Image Increase

Singular Spectrum Analysis with Rssa

Linear Algebra: Determinants, Inverses, Rank

Linearly Independent Sets and Linearly Dependent Sets

Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components

(Quasi-)Newton methods

Background: State Estimation

Vector and Matrix Norms

Factor analysis. Angela Montanari

Partial Least Squares (PLS) Regression.

Numerical Analysis Lecture Notes

4.3 Least Squares Approximations

Solutions to Math 51 First Exam January 29, 2015

An Efficient Solution to the Five-Point Relative Pose Problem

Transcription:

Stereo Camera Calibration Stereo Camera Calibration Stereo Camera Calibration Stereo Camera Calibration 12.10.2004

Overview Introduction Summary /

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint Motivation 3D-Vision Problems Correspondence problem Reconstruction problem

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint Motivation 3D-Vision Problems Correspondence problem Reconstruction problem

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint How does depth perception work? High level process? Objects are matched... Low level process! Proof: Random Dot Images Problem: Matching the Dots

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Ambiguity of Correspondence Real Correspondence Just looking similar

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint World Point M corresponds to point m in Image Plane I

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint Ray CM has Image in I'

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint Corresponding Point in I' can be found...

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint The Points C, C' and M build a Plane. e is Image of C' and v.v.

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint The Epipolar Constraint m' has epipolar line too

Motivation Depth Perception Ambiguity of Correspondence The Epipolar Constraint Pencils of Epipolar Lines Different World Points can have different epipolar lines.

Basics The Essential Matrix The Fundamental Matrix Summary Perspective Projection Matrix There are normalized and unnormalized cameras Decomposition possible:

Basics The Essential Matrix The Fundamental Matrix Summary Camera Intrinsic Matrix Result of decomposition

Basics The Essential Matrix The Fundamental Matrix Summary Skew Symmetric Matrix Mapping from 3D-Vector to 3x3 antisymmetric Matrix

Basics The Essential Matrix The Fundamental Matrix Summary The Essential Matrix Mapping from Point to Line

Basics The Essential Matrix The Fundamental Matrix Summary Defining EG with Normalized Images Relation between camera coordinate systems Normalized Coordinates

Basics The Essential Matrix The Fundamental Matrix Summary Defining EG with Normalized Images

Basics The Essential Matrix The Fundamental Matrix Summary Defining EG with Normalized Images Coplanar

Basics The Essential Matrix The Fundamental Matrix Summary Defining EG with Normalized Images

Basics The Essential Matrix The Fundamental Matrix Summary Properties of E Determined completely by the transform between the cameras det(e)=0

Basics The Essential Matrix The Fundamental Matrix Summary The Fundamental Matrix Fundamental Matrix F must satisfy where A and A' are intrinsic Matrices of the two Cameras

Basics The Essential Matrix The Fundamental Matrix Summary Properties of F det(f)=0 because det(e)=0 F is of rank 2 F has 9 Parameters but 7DOF

Basics The Essential Matrix The Fundamental Matrix Summary Summary Stereo Vision is about point matching E and F map points in one image to lines in the other. F satisfies 7 DOF and has between two arbitrary images can be estimated by 7 point correspondences

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Calibration Basics Assumptions The full perspective projection model is used. Intrinsic and Extrinsic parameters of the Cameras are unknown. Rigid transformation between the two camera systems

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Equivalent Problems 2 Images by a moving camera at two different moments (static). 2 Images by a fixed camera at two different moments (single object,dynamic) 2 Images by 2 Cameras at the same time 2 Images by 2 Cameras (static)

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Definitions The Epipolar Equation can be written as linear homogeneous equation

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Definitions For n point matches

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Not that easy Noise Least-square methods are very sensitive to false matches Enforce rank 2 constraint or epipolar lines will "smear out" find closest rank 2 approximation of F

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Rank 2 Constraint

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Rank 2 Constraint Rank 3 Rank 2

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks 7 Point Algorithm In this case n=7 and rank(u 7 )=7 SVD 2 last columns of Y span the right null-space of U => F1 and F2

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks 7 Point Algorithm 1 Parameter family of matrices because F is homogenous Can have 1 or 3 Solutions!

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks 8 Point Algorithm(s) Usually more than 7 Matches Many Methods (see [1]) Linear Methods Nonlinear Methods Robust Methods

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Linear Methods Minimize epipolar Equation or better There is a trivial solution:

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Eigen Analysis Impose a constraint on norm of Get unconstrained problem through Lagrange multipliers

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Eigen Analysis - Minimizing First derivative = 0 deriving...

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Eigen Analysis - Back substitution There are 9 eigenvalues Back substituting the solution Solution is the Eigenvector of associated to the smallest Eigenvalue (smallest Singular Vector of )

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Problems with most linear methods The rank 2 constraint is not satisfied Minimized Quantity has no physical meaning High instability (in the numerical sense) => normalize Input Data!

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Iterative Linear Method Minimize the distances between points and corresponding epipolar lines Symmetrical Distance

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Iterative Linear Method - Weights Represent distances as weights Problem: Weights depend on F Solution: Set all weights to 1 Compute F Calculate new weights from F Repeat 'till satisfaction

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Iterative Linear Method - Can't get no... Pros: Easy to implement Minimizes Physical quantity Cons: Rank-2 constraint isn't satisfied No significant improvement[1] Better: Nonlinear Minimization in Parameter Space [1]

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Robust Methods - RANSAC Exploit heuristics Try to remove "outliers" RANdom SAmple Consensus

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Robust Methods - RANSAC Step 1. Extract features Step 2. Compute a set of potential matches Step 3. do Step 3.1 select minimal sample Step 3.2 compute solution(s) for F (verify hypothesis) Step 3.3 determine inliers until Γ(#inliers,#samples) 95% Step 4. Compute F based on all inliers Step 5. Look for additional matches Step 6. Refine F based on all correct matches (generate hypothesis)

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Robust Methods - RANSAC Propability that at least one random sample is free of outliers

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Experiments / Tricks Image Rectification [2]

Calibration Basics 7-Point-Algorithm >8-Point-Algorithm(s) Experiments/Tricks Experiments / Tricks Image Rectification [2] Demos online

" in Stereo Motion and Object Recognition" Many (if not all) algorithms Gang Xu and Zhengyou Zhang You don't want to buy it... Get it from the library... [1]

"Three-Dimensional Computer Vision - A Geometric Viewpoint" Olivier Faugeras Good Basics, Interesting Chapter about Edge-Detection. Many Images. [2]

"Multiple View Geometry in Computer Vision" Richard Hartley and Andrew Zisserman [3]

Web http://www.esat.kuleuven.ac.be/~pollefey/tutorial/node3.html http://www.cs.unc.edu/~blloyd/comp290-089/fmatrix/ (matlab functions) http://wwwsop.inria.fr/robotvis/personnel/zzhang/calibenv/calibenv.html (demo) http://www.vision.caltech.edu/bouguetj/calib_doc/ (matlab toolbox) [3]

That's it Thanks