CS 395/495-26: Spring 2002 IBMR: Week 5B Finish Chapter 2: 3D Projective Geometry + Applications Jack Tumblin

Slides:



Advertisements
Similar presentations
CS 395/495-26: Spring 2004 IBMR: Singular Value Decomposition (SVD Review) Jack Tumblin
Advertisements

Chapter 28 – Part II Matrix Operations. Gaussian elimination Gaussian elimination LU factorization LU factorization Gaussian elimination with partial.
CS 221 Chapter 2 Excel. In Excel: A1 = 95 A2 = 95 A3 = 80 A4 = 0 =IF(A1
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’
Y.M. Hu, Assistant Professor, Department of Applied Physics, National University of Kaohsiung Matrix – Basic Definitions Chapter 3 Systems of Differential.
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.
Projective Geometry- 3D
Recovering metric and affine properties from images
Developing a Characterization of Business Intelligence Workloads for Sizing New Database Systems Ted J. Wasserman (IBM Corp. / Queen’s University) Pat.
Slides by Olga Sorkine, Tel Aviv University. 2 The plan today Singular Value Decomposition  Basic intuition  Formal definition  Applications.
2D Geometric Transformations
Recovering metric and affine properties from images
3D Geometry for Computer Graphics
The 2D Projective Plane Points and Lines.
Computer Graphics Recitation 6. 2 Last week - eigendecomposition A We want to learn how the transformation A works:
CS 395/495-26: Spring 2003 IBMR: Week 3 B Finish Conics, & SVD Review Jack Tumblin
Lecture 19 Quadratic Shapes and Symmetric Positive Definite Matrices Shang-Hua Teng.
CS 395/495-25: Spring 2003 IBMR: Week 6B R 3  R 2 and P 3  P 2 The Camera Matrix Jack Tumblin
Chapter 6  Chart Terminology  Chart Wizard  Moving Resizing Charts  Editing Charts  Formatting Charts.
Motion Analysis (contd.) Slides are from RPI Registration Class.
Geometric Modeling Surfaces Mortenson Chapter 6 and Angel Chapter 9.
CS 395/495-26: Spring 2004 IBMR: Projective 2D DLT Jack Tumblin
Projective 3D geometry. Singular Value Decomposition.
CS 395/495-26: Spring 2003 IBMR: Week 4A from Chapter 3: Point Correspondence and Direct Linear Transform (DLT) Jack Tumblin
Projective 3D geometry. Singular Value Decomposition.
Projective Geometry and Camera model Class 2
CS 395/495-25: Spring 2004 IBMR: The Fundamental Matrix The Fundamental Matrix Combines Two Cameras Jack Tumblin
CS 395/495-26: Spring 2003 IBMR: Week 3 A 2D Projective Geometry: Conics Measure Angles Jack Tumblin
CS 395/495-26: Spring 2003 IBMR: Week 5 A Back to Chapter 2: 3 -D Projective Geometry Jack Tumblin
3D Geometry for Computer Graphics
3D Geometry for Computer Graphics
Lecture 20 SVD and Its Applications Shang-Hua Teng.
CS 395/495-25: Spring 2003 IBMR: Week 8A Chapter 8... Epipolar Geometry: Two Cameras: Jack Tumblin
Transformations I CS5600Computer Graphics by Rich Riesenfeld 27 February 2002 Lecture Set 5.
Olga Sorkine’s slides Tel Aviv University. 2 Spectra and diagonalization A If A is symmetric, the eigenvectors are orthogonal (and there’s always an eigenbasis).
CS 395/495-25: Spring 2003 IBMR: Week 7A The Camera Matrix Continued... Jack Tumblin
Section 10.3 – The Inverse of a Matrix No Calculator.
How to find the inverse of a matrix
SVD(Singular Value Decomposition) and Its Applications
1 Matrix Math ©Anthony Steed Overview n To revise Vectors Matrices n New stuff Homogenous co-ordinates 3D transformations as matrices.
Pole/polar consider projective geometry again we may want to compute the tangents of a curve that pass through a point (e.g., visibility) let C be a conic.
Foundations of Computer Graphics (Fall 2012) CS 184, Lectures 13,14: Reviews Transforms, OpenGL
Matrices A matrix is a table or array of numbers arranged in rows and columns The order of a matrix is given by stating its dimensions. This is known as.
Projective 3D geometry class 4
Day x 5-10 minute quiz SVD demo review of metric rectification algorithm 1.build a 2x3 matrix A from orthog line pairs A = [L1M1, L1M2+L2M1, L2M2; L1’M1’,
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)
EIGENSYSTEMS, SVD, PCA Big Data Seminar, Dedi Gadot, December 14 th, 2014.
1 Overview Introduction to projective geometry 1 view geometry (calibration, …) 2-view geometry (stereo, motion, …) 3- and N-view geometry Autocalibration.
Uncalibrated reconstruction Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration.
3D Geometry for Computer Graphics Class 3. 2 Last week - eigendecomposition A We want to learn how the transformation A works:
Cornell CS465 Fall 2004 Lecture 9© 2004 Steve Marschner 1 3D Transformations CS 465 Lecture 9.
Parameter estimation class 5 Multiple View Geometry CPSC 689 Slides modified from Marc Pollefeys’ Comp
Computer Graphics Lecture 16 Fasih ur Rehman. Last Class Homogeneous transformations Types of Transformations – Linear Transformations – Affine Transformations.
Chapter 4 Section 1 Organizing Data into Matrices.
Final Outline Shang-Hua Teng. Problem 1: Multiple Choices 16 points There might be more than one correct answers; So you should try to mark them all.
1 Matrix Math ©Anthony Steed Overview n To revise Vectors Matrices.
Presentation Title.
Presentation Title.
Research of W.S. ( ) Title Journal Status
Vectors and the Geometry of Space
BUS 518 Innovative Education-- snaptutorial.com
Uncalibrated Geometry & Stratification
Using Matrices with Transformations
RM 2 7 +RM 2 4 RM 7 3 +RM 1 6 RM 5 2 +RM 2 4 RM 1 3 +RM5 2.
( ) ( ) ( ) ( ) Matrices Order of matrices
Section 3.3 – The Inverse of a Matrix
Group 1 Group 1 Group 1 Group 1 word word word word word word word word word word word word word word word word word word word word word word word.
Matrices and Determinants
Presentation Title Your information.
Practice Geometry Practice
Presentation transcript:

CS 395/495-26: Spring 2002 IBMR: Week 5B Finish Chapter 2: 3D Projective Geometry + Applications Jack Tumblin

IBMR-Related Seminars 3D Scanning for Cultural Heritage Applications 3D Scanning for Cultural Heritage Applications Holly Rushmeier, IBM TJ Watson 3D Scanning for Cultural Heritage Applications Friday May 16 3:00pm, Rm 381, CS Dept. no title yet... no title yet... Steve Marschner, Cornell University Friday May 23 3:00pm, Rm 381, CS Dept.

Quadrics Summary Quadrics are the ‘x 2 family’ in P 3 : –Point Quadric:x T Q x = 0 –Plane Quadric:  T Q*  = 0 Transformed Quadrics:Transformed Quadrics: –Point Quadric:Q’ = H -T Q H –Plane Quadric:Q*’ = H Q* H T Symmetric Q, Q* matrices:Symmetric Q, Q* matrices: –10 parameters but 9 DOF; 9 points or planes –(or less if degenerate…) –4x4 symmetric, so SVD(Q) = USU T Ellipsoid: 1 of 8 quadric types

Quadrics Summary SVD(Q) =USU T :SVD(Q) =USU T : – U columns are quadric’s axes –S diagonal elements: scale On U axes, write any quadric as: au bu 2 2 +cu d = 0On U axes, write any quadric as: au bu 2 2 +cu d = 0 Classify quadrics byClassify quadrics by –sign of a,b,c,d: (>0, 0, 0, 0, <0) Book’s method:Book’s method: –scale a,b,c,d to (+1, 0, –1) –classify by Q’s rank and (a+b+c+d) Ellipsoid: 1 of 8 quadric types

Quadrics Summary All Unruled Quadrics are Rank 4: (See page 55) BUT Some Rank 4 Jack!check this!!! quadrics are Ruled: and All degenerate quadrics (Rank<4) are Ruled (or Conic)

P 3 ’s Familiar Weirdnesses The plane at infinity:   = ( ) TThe plane at infinity:   = ( ) T (this is the 2D set of all…) ‘Ideal Points’ at infinity: d = p  = (x 1 x 2 x 3 0) T‘Ideal Points’ at infinity: d = p  = (x 1 x 2 x 3 0) T –(Also called ‘direction’ d in book) Parallel Planes intersect at a line within  Parallel Planes intersect at a line within   Parallel Lines intersect at a point within  Parallel Lines intersect at a point within   Any plane  intersects   at line l  (put  in P 2 )Any plane  intersects   at line l  (put  in P 2 ) x2x2x2x2 x1x1x1x1 x3x3x3x3 as x4  0, points (x 1,x 2,x 3,x 4 )  infinity 1/x 4 llll d

P 3 ’s Familiar Weirdnesses The plane at infinity:   = ( ) TThe plane at infinity:   = ( ) T Only H p ignores   (stays   for H S H A )Only H p ignores   (stays   for H S H A ) –Recall  ’ = H -T.  –Careful! H S, and H A will move points within   Both H P and   have 3DOFBoth H P and   have 3DOF –use one to find the other: Find   ’ in image space; use   in world-space to find H P Find directions in   with known angles in P 3Find directions in   with known angles in P 3

New Weirdness: Absolute Conic   WHY learn   ? Similar to C  for P 2 …WHY learn   ? Similar to C  for P 2 … –Angles from directions (d 1, d 2 ) or planes (  1,  2 ) –   has 3DOF for H P ;   has 5DOF for H A   Requires TWO equations:   Requires TWO equations:   :   is complex 2D Point Conic on the   plane (?!?!?!)   is complex 2D Point Conic on the   plane (?!?!?!) Recall plane at infinity   = [ 0, 0, 0, 1] T holds ‘directions’ d = [x 1, x 2, x 3, 0] TRecall plane at infinity   = [ 0, 0, 0, 1] T holds ‘directions’ d = [x 1, x 2, x 3, 0] T x x x 3 2 = 0, or ‘2D point conic where C = I’ x 4 = 0, or ‘all points are on   ’ x 4 = 0, or ‘all points are on   ’.

New Weirdness: Absolute Conic     is complex 2D Point Conic on the   plane   is complex 2D Point Conic on the   plane Only H A H P transforms   (stays   for H S )Only H A H P transforms   (stays   for H S ) All circles (in any  ) intersect   circular pts.All circles (in any  ) intersect   circular pts. –(recall: circular pts. hold 2 axes: x  i y) All spheres (in P 3 ) intersect   at all   pts.All spheres (in P 3 ) intersect   at all   pts. (not clear what this reveals to us) (not clear what this reveals to us) x x x 3 2 = 0, or ‘2D point conic where C = I’ x 4 = 0, or ‘all points are on   ’ x 4 = 0, or ‘all points are on   ’.

New Weirdness: Absolute Conic     measures angles between Directions (d 1,d 2 ) –World-space   is I 3x3 (ident. matrix) within   –Image-space   ’ is transformed (How? as part of   ?) –Euclidean world-space angle  is given by: –Directions d 1,d 2 are orthogonal iff d 1 T   ’ d 2 = 0 –?!?! What is   in P 3 ? Perhaps ? but…. –JACK!!!CHECK THIS!! (d 1 T   ’ d 2 ). (d 1 T   ’ d 1 ) (d 2 T   ’ d 2 ) cos(  ) = (do not change)

Absolute Dual Quadric Q*  Exact Dual to Absolute Conic   in plane   –Any conic in a plane = a degenerate quadric (even though plane   consists of all points at infinity)(even though plane   consists of all points at infinity) (even though conic   has no real points, all ‘outer limits’ of   )(even though conic   has no real points, all ‘outer limits’ of   ) Q*  is a Plane Quadric that matches   –Defined by tangent planes  (e.g.  T Q*   =0 ) –Conic   is on the ‘rim’ of quadric Q*  –In world space, Q*  = –Image space: 8DOF (?same as   ?) (up to similarity) (up to similarity)

Absolute Dual Quadric Q*  –In world space, Q*  =   = –Q*  always has infinity plane   as tangent Q*    = 0 and Q*  ’   ’ = 0 –Find angles between planes  1,  2 with Q*  :. –Can test for  planes  1,  2 :  1 T Q*  ’  2 = (  1 T Q*  ’  2 ). (  1 T Q*   1 ) (  2 T Q*   2 ) cos(  ) = 0001 End of Chapter 2. Now what?

Absolute Dual Quadric Q*  How can we find Q*  ’ ? –From  plane pairs (flatten, stack, null space…) How can we use it? –Transforms: “ Q*  fixed iff H is a similarity” means Changes Q*  to Q*  ’ unless H is only H p (Recall that Q*  ’ = H Q*  H T ) –THUS known Q*  ’ can solve for H A H P Q*  ’ is symmetric, use SVD... Q*  ’ is symmetric, use SVD...

What else can we DO in P 3 ? View Interpolation! for non-planar objects! Find H (or its parts:H S H A H P ): By  Plane Pairs (  1 T Q*   2 = 0)…By  Plane Pairs (  1 T Q*   2 = 0)… –Find Q*  by flatten/stack/null space method –Find H A H P from Q*   Q*’  relation (symmetric, so use SVD) Simpler: By Point (or Plane) CorrespondenceBy Point (or Plane) Correspondence –Can find full H (15DOF) in P 3 with 5 pts (planes) –Just extend the P 3 method (see Project 2)

But what can we DO in P 3 ? View Interpolation! for non-planar objects! Find H (or its parts:H S H A H P ): By Parallel Plane pairs (they intersect at  ’  )By Parallel Plane pairs (they intersect at  ’  ) –Find  ’  by flatten/stack/null space method, –Solve for H p using H P -T   =  ’  By  Direction Pairs ( d 1  ’  d 2 = 0 )…By  Direction Pairs ( d 1  ’  d 2 = 0 )… –Find  ’  from flatten/stack/null space method, –Find H A from     ’  relation –(symmetric, so use SVD…)

What can we DO in P 3 ? Open questions to ponder: –Can you do line-correspondence in P 2 ? in P 3 ? –How would you find angle between two lines whose intersection is NOT the origin? –Can you find H from known angles,   90º ? –How can we adapt P 2 ‘vanishing point’ methods to P 3 ? –How might you find H using twisted cubics? using the Screw Decomposition? –Given full 3D world-space positions for pixels (‘image+depth), what H matrix would you use to ‘move the camera to a new position’? –What happens to the image when you change the projective transformations H (bottom row)?

END