EPIPOLAR GEOMETRY WITH MANY DETAILS

Similar documents
Vision par ordinateur

Camera: optical system

Multiple View Geometry in Computer Vision

Lecture 5. Epipolar Geometry. Professor Silvio Savarese Computational Vision and Geometry Lab. 21-Jan-15. Lecture 5 - Silvio Savarese

CSE 252B: Computer Vision II

Camera calibration. Outline. Pinhole camera. Camera projection models. Nonlinear least square methods A camera calibration tool

CS4495/6495 Introduction to Computer Vision. 3D-L3 Fundamental matrix

CSE 252B: Computer Vision II

Parameterizing the Trifocal Tensor

Vision 3D articielle Session 2: Essential and fundamental matrices, their computation, RANSAC algorithm

LESSON 35: EIGENVALUES AND EIGENVECTORS APRIL 21, (1) We might also write v as v. Both notations refer to a vector.

Camera Calibration The purpose of camera calibration is to determine the intrinsic camera parameters (c 0,r 0 ), f, s x, s y, skew parameter (s =

Identifying second degree equations

Two-View Multibody Structure from Motion

Algorithms for Computing a Planar Homography from Conics in Correspondence

Method 1: Geometric Error Optimization

A Study of Kruppa s Equation for Camera Self-calibration

Statistical Geometry Processing Winter Semester 2011/2012

Trinocular Geometry Revisited

The Multibody Trifocal Tensor: Motion Segmentation from 3 Perspective Views

Lines and points. Lines and points

Linear Algebra & Geometry why is linear algebra useful in computer vision?

Eigenvectors and Eigenvalues 1

Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix

6.869 Advances in Computer Vision. Prof. Bill Freeman March 1, 2005

Mathematics 309 Conic sections and their applicationsn. Chapter 2. Quadric figures. ai,j x i x j + b i x i + c =0. 1. Coordinate changes

Geometric Modeling Summer Semester 2010 Mathematical Tools (1)

Camera Projection Model

PAijpam.eu EPIPOLAR GEOMETRY WITH A FUNDAMENTAL MATRIX IN CANONICAL FORM Georgi Hristov Georgiev 1, Vencislav Dakov Radulov 2

Computation of the Quadrifocal Tensor

A Practical Method for Decomposition of the Essential Matrix

Camera Models and Affine Multiple Views Geometry

MMJ1153 COMPUTATIONAL METHOD IN SOLID MECHANICS PRELIMINARIES TO FEM

Linear Algebra & Geometry why is linear algebra useful in computer vision?

Pose estimation from point and line correspondences

Robert Collins CSE486, Penn State. Lecture 25: Structure from Motion

Camera calibration by Zhang

Single view metrology

15. Eigenvalues, Eigenvectors

Motion estimation. Digital Visual Effects Yung-Yu Chuang. with slides by Michael Black and P. Anandan

Instance-level l recognition. Cordelia Schmid INRIA

Vector and Affine Math

Final Exam Due on Sunday 05/06

Demonstrate solution methods for systems of linear equations. Show that a system of equations can be represented in matrix-vector form.

Multiple View Geometry in Computer Vision

Interest Operators. All lectures are from posted research papers. Harris Corner Detector: the first and most basic interest operator

Instance-level l recognition. Cordelia Schmid & Josef Sivic INRIA

Background Mathematics (2/2) 1. David Barber

6.801/866. Affine Structure from Motion. T. Darrell

Augmented Reality VU Camera Registration. Prof. Vincent Lepetit

Some linear transformations on R 2 Math 130 Linear Algebra D Joyce, Fall 2013

Optimisation on Manifolds

Visual Object Recognition

M3: Multiple View Geometry

arxiv: v1 [hep-ph] 8 May 2013

Affine transformations. Brian Curless CSE 557 Fall 2014

First Order Equations

4.7. Newton s Method. Procedure for Newton s Method HISTORICAL BIOGRAPHY

Linear Algebra 2 More on determinants and Evalues Exercises and Thanksgiving Activities

COMPLEX ALGEBRAIC SURFACES CLASS 15

Instance-level recognition: Local invariant features. Cordelia Schmid INRIA, Grenoble

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros

Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction

Homework Notes Week 6

Lecture 20: Quantization and Rate-Distortion

INF Introduction to classifiction Anne Solberg Based on Chapter 2 ( ) in Duda and Hart: Pattern Classification

Singular Value Decomposition

Sparse Levenberg-Marquardt algorithm.

Reading. 4. Affine transformations. Required: Watt, Section 1.1. Further reading:

VECTORS IN THREE DIMENSIONS

6. Vector Random Variables

LU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU

Induced Planar Homologies in Epipolar Geometry

Mathematics. Mathematics 2. hsn.uk.net. Higher HSN22000

Outline. Linear Algebra for Computer Vision

Basic Math for

6.4 graphs OF logarithmic FUnCTIOnS

Cubic and quartic functions

Eigenvalues and Eigenvectors

Chapter 1. Perspective Geometry. 1.1 Shifting Perspective The Geometric Perspective

Visual SLAM Tutorial: Bundle Adjustment

Affine transformations

Instance-level recognition: Local invariant features. Cordelia Schmid INRIA, Grenoble

Math Computation Test 1 September 26 th, 2016 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge!

LECTURE 7. Least Squares and Variants. Optimization Models EE 127 / EE 227AT. Outline. Least Squares. Notes. Notes. Notes. Notes.

3D from Photographs: Camera Calibration. Dr Francesco Banterle

D u f f x h f y k. Applying this theorem a second time, we have. f xx h f yx k h f xy h f yy k k. f xx h 2 2 f xy hk f yy k 2

Linear Algebra Review. Fei-Fei Li

Factor Analysis. Qian-Li Xue

Handout for Adequacy of Solutions Chapter SET ONE The solution to Make a small change in the right hand side vector of the equations

Review: critical point or equivalently f a,

CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.

6. Linear transformations. Consider the function. f : R 2 R 2 which sends (x, y) (x, y)

A new constrained parameter estimator: experiments in fundamental matrix computation

Least Squares with Examples in Signal Processing 1. 2 Overdetermined equations. 1 Notation. The sum of squares of x is denoted by x 2 2, i.e.

Scalar functions of several variables (Sect. 14.1)

Chapter 3 Numerical Methods

1 HOMOGENEOUS TRANSFORMATIONS

Name: Student ID: Math 314 (Calculus of Several Variables) Exam 3 May 24 28, Instructions:

Transcription:

EPIPOLAR GEOMERY WIH MANY DEAILS

hank ou for the slides. he come mostl from the following source. Marc Pollefes U. of North Carolina

hree questions: (i) Correspondence geometr: Given an image point in the first view, how does this constrain the position of the corresponding point in the second image? (ii) Camera geometr (motion): Given a set of corresponding image points { i i }, i,,n, what are the cameras P and P for the two views? (iii) Scene geometr (structure): Given corresponding image points i i and cameras P, P, what is the position of (their pre-image) X in space?

he epipolar geometr C,C,, and X are coplanar

he epipolar geometr What if onl C,C, are known?

he epipolar geometr All points on π project on l and l

he epipolar geometr Famil of planes π and lines l and l Intersection in e and e

he epipolar geometr epipoles e,e intersection of baseline with image plane projection of projection center in other image vanishing point of camera motion direction an epipolar plane plane containing baseline (-D famil) an epipolar line intersection of epipolar plane with image (alwas come in corresponding pairs)

Eample: converging cameras

Eample: motion parallel with image plane

Eample: forward motion e e

he fundamental matri F algebraic representation of epipolar geometr a l' we will see that mapping is (singular) correlation (i.e. projective mapping from points to lines) represented b the fundamental matri F

he fundamental matri F geometric derivation ' H π [ e' ] Hπ F l' e' ' mapping from -D to -D famil (rank )

he fundamental matri F algebraic derivation ( λ) P λc X + + ( + P P I) l P'C P' P + P + X( λ) F [ ] + e' P' P (note: doesn t work for CC F0)

he fundamental matri F correspondence condition he fundamental matri satisfies the condition that for an pair of corresponding points in the two images ' F 0 ( ' l' 0)

he fundamental matri F F is the unique 33 rank matri that satisfies F0 for all (i) ranspose: if F is fundamental matri for (P,P ), then F is fundamental matri for (P,P) (ii) Epipolar lines: l F & lf (iii) Epipoles: on all epipolar lines, thus e F0, e F0, similarl Fe0 (iv) F has 7 d.o.f., i.e. 33-(homogeneous)-(rank) (v) F is a correlation, projective mapping from a point to a line l F (not a proper correlation, i.e. not invertible)

Epipolar line homograph for e, for e, 3 for homograph of a line from e to e

he epipolar line geometr l,l epipolar lines, k line not through e l F[k] l and smmetricall lf [k ] l l l k k e e' l Fk (pick ke, since e e 0) F[ e] l l F [ e' ] l' l'

Fundamental matri for pure translation

Fundamental matri for pure translation

Fundamental matri for pure translation [ e' ] H [ ] F e' ( H K RK) eample: e' (,0,0) F 0 0 0 0 0 0-0 ' F 0 ' PX ' P' X K[I 0]X K - K[I t] Z ( X,Y,Z) - K /Z ' + Kt/Z motion starts at and moves towards e, faster depending on Z pure translation: F onl d.o.f., [e] 0 auto-epipolar

General motion [ e' ] H 0 [ e' ] ˆ 0 ' ' ' K'RK - + K' t/z

Projective transformation and invariance Derivation based purel on projective concepts ˆ H, ˆ' H' ' Fˆ PX ( )( - PH H X) Pˆ Xˆ ( )( - P' H H X) Pˆ' Xˆ H' - FH - F invariant to transformations of projective 3-space ' P' X ( P, P' ) a F F a ( P,P' ) canonical form P [I 0] P' [M m] unique not unique [ m] M F

Projective ambiguit of cameras given F previous slide: at least projective ambiguit this slide: not more! ~ ~ Show that if F is same for (P,P ) and (P,P ), there eists a projective transformation H so that ~ ~ PHP and P HP lemma: H P' H ~ P [I 0] P' [A a] P [I 0] P ~ ' F [ a] A [ ~ a] A ~ ~ A ~ a ka k A + av ( ) rank [A ~ ~ a] af a[] a A 0 ~ af ~ a ka a A ~ a A ~ a ka ~ - A 0 ka ~ - A av [ ] [ ] [ ] ( ) ( ) k I 0 k v k [A a] k I k v 0 k [ k ( A - av ) ka] P ~ ' (-57, ok)

Canonical cameras given F F matri corresponds to P,P iff P FP is skew-smmetric ( X P' FPX 0, X) F matri, S skew-smmetric matri P [I 0] P' [SF e'] [SF e'] (fund.matrif) F[I 0] F S F e' F 0 0 F S 0 F 0 0 Possible choice: P [I 0] P' [[e'] F e'] Canonical representation: P [I 0] P' [[e'] F + e' v λe']

he essential matri ~fundamental matri for calibrated cameras (remove K) E ˆ ' [ t] R R[R t] Eˆ 0 - - ( ˆ K ; ˆ' K ' ) E K' FK 5 d.o.f. (3 for R; for t up to scale) E is essential matri if and onl if two singularvalues are equal (and third0) E Udiag(,,0)V

Four possible reconstructions from E (onl one solution where points is in front of both cameras)

Epipolar geometr: basic equation ' F 0 ' f + ' f + ' f3 + ' f + ' f + ' f3 + f3 + f3 + f33 0 separate known from unknown [ ', ', ', ', ', ',,,][ f, f, f, f, f, f, f, f, f ] 0 (data) 3 3 3 3 33 (unknowns) (linear) ' ' ' ' ' ' M M M M M M M M ' n n ' n n ' n ' n n ' n n ' n n n M f 0 Af 0

0 33 3 3 3 3 f f f f f f f f f n n n n n n n n n n n n M M M M M M M M M ~0000 ~0000 ~0000 ~0000 ~00 ~00 ~00 ~00! Orders of magnitude difference Between column of data matri least-squares ields poor results the NO normalized 8-point algorithm

the normalized 8-point algorithm ransform image to ~[-,][-,] (0,500) (700,500) 700 0 500 (-,) (0,0) (,) (0,0) (700,0) (-,-) (,-) Least squares ields good results (Hartle, PAMI 97)

the singularit constraint 0 F e' 0 Fe 0 detf F rank 3 3 3 3 V U σ V U σ U σ V V σ σ σ U F + + SVD from linearl computed F matri (rank 3) V U σ U σ V V 0 σ σ U F' + F min F- F' Compute closest rank- approimation

the minimum case 7 point correspondences 0 f ' ' ' ' ' ' ' ' ' ' ' ' 7 7 7 7 7 7 7 7 7 7 7 7 M M M M M M M M M ( ) 99 7 77 V,0,0,...,σ diag σ A U 9 9 8 0 V ] A[V ( ) 8 [00000000] V e.g.v...7 0, λf ) (F + i i i one parameter famil of solutions but F +λf not automaticall rank

the minimum case impose rank σ 3 (obtain or 3 solutions) F 7pts F F F 3 det( F + λf ) a 3λ + aλ + aλ + a0 0 (cubic equation) - det( F + λf ) det F det(f F + λi) 0 - F F Compute possible λ as eigenvalues of (onl real solutions are potential solutions)

Gold standard Maimum Likelihood Estimation (, ˆ ) d( ', ˆ' ) d i i + i i i ( least-squares for Gaussian noise) subject to ˆ' Fˆ 0 Initialize: normalized 8-point, (P,P ) from F, reconstruct X i Parameterize: P [I 0],P' [M t],x i ˆ PX, ˆ i i i P' X Minimize cost using Levenberg-Marquardt (preferabl sparse LM, see book) i (overparametrized)

Gold standard Alternative, minimal parametrization (with a) (note (,,) and (,,) are epipoles) problems: a0 pick largest of a,b,c,d to fi epipole at infinit pick largest of,,w and of,,w 43336 parametrizations! reparametrize at ever iteration, to be sure

First-order geometric error (Sampson error) ( ) e JJ e e e JJ (one eq./point JJ scalar) e ' F 0 e i ' F0 0 ( ' F) + ( ' F) + ( F) ( ) F JJ + e e JJ ( ' F) + ( ' F) + ( F) + ( F) ' F (problem if some is located at epipole) advantage: no subsidiar variables required

Smmetric epipolar error ( F ) d( ',, F ' ) d i i + i i ' F + ( ' F) + ( ) ( F) + ( F) ' F i

Some eperiments:

Some eperiments:

Some eperiments:

Some eperiments: Residual error: ( F ) d( ',, F ' ) d i i + i (for all points!) i i

Recommendations:. Do not use unnormalized algorithms. Quick and eas to implement: 8-point normalized 3. Better: enforce rank- constraint during minimization 4. Best: Maimum Likelihood Estimation (minimal parameterization, sparse implementation)

Feature points Etract feature points to relate images Required properties: Well-defined (i.e. neigboring points should all be different) Stable across views (i.e. same 3D point should be etracted as feature for neighboring viewpoints)

Degenerate cases: Degenerate cases Planar scene Pure rotation No unique solution Remaining DOF filled b noise Use simpler model (e.g. homograph) Model selection (orr et al., ICCV 98, Kanatani, Akaike) Compare H and F according to epected residual error (compensate for model compleit)

More problems: Absence of sufficient features (no teture) Repeated structure ambiguit Robust matcher also finds support for wrong hpothesis solution: detect repetition (Schaffalitzk and Zisserman, BMVC 98)

two-view geometr geometric relations between two views is full described b recovered 33 matri F

Image pair rectification simplif stereo matching b warping the images Appl projective transformation so that epipolar lines correspond to horizontal scanlines e e map epipole e to (,0,0) tr to minimize image distortion problem when epipole in (or close to) the image

Planar rectification (standard approach) ~ image size (calibrated) Bring two views to standard stereo setup (moves epipole to ) (not possible when in/close to image) Distortion minimization (uncalibrated)