Day x: Infinity DLT alg HZ 4.1 Rectification HZ 2.7 Hierarchy of maps Invariants HZ 2.4 Projective transform HZ 2.3 Behaviour at infinity Primitives pt/line/conic.

Slides:



Advertisements
Similar presentations
Invariants (continued).
Advertisements

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’
3D reconstruction.
Primitives Behaviour at infinity HZ 2.2 Projective DLT alg Invariants
Conics DLT alg HZ 4.1 Rectification HZ 2.7 Hierarchy of maps Invariants HZ 2.4 Projective transform HZ 2.3 Behaviour at infinity Primitives pt/line/conic.
Recovery of affine and metric properties from images in 2D Projective space Ko Dae-Won.
Projective Geometry- 3D
Recovering metric and affine properties from images
Recovering metric and affine properties from images
Multiple View Geometry Projective Geometry & Transformations of 2D Vladimir Nedović Intelligent Systems Lab Amsterdam (ISLA) Informatics Institute,
The 2D Projective Plane Points and Lines.
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
Projective 2D & 3D geometry course 2
Projective 2D geometry (cont’) course 3
Projective geometry- 2D Acknowledgements Marc Pollefeys: for allowing the use of his excellent slides on this topic
Projective geometry Slides from Steve Seitz and Daniel DeMenthon
3D reconstruction of cameras and structure x i = PX i x’ i = P’X i.
Multiple View Geometry
Projective 2D geometry Appunti basati sulla parte iniziale del testo
Multiple View Geometry Marc Pollefeys University of North Carolina at Chapel Hill Modified by Philippos Mordohai.
3D photography Marc Pollefeys Fall 2007
Projective Geometry and Camera model Class 2
6/28/2015©Zachary Wartell Homogenous Coordinates and Projective Geometry (Crudely Speaking) Revision 1.2 Copyright Zachary Wartell, University of North.
3D photography Marc Pollefeys Fall 2004 / Comp Tue & Thu 9:30-10:45
Projective 2D geometry course 2 Multiple View Geometry Comp Marc Pollefeys.
Project Geometry Jiecai He (Jake)
Automatic Camera Calibration
Solving Systems of Linear Equations by Graphing
Projective geometry of 2-space DLT alg HZ 4.1 Rectification HZ 2.7 Hierarchy of maps Invariants HZ 2.4 Projective transform HZ 2.3 Behaviour at infinity.
I can solve systems of equations by graphing and analyze special systems.
Projective Geometry and Geometric Invariance in Computer Vision Babak N. Araabi Electrical and Computer Eng. Dept. University of Tehran Workshop on image.
Robot Vision SS 2008 Matthias Rüther 1 ROBOT VISION Lesson 2: Projective Geometry Matthias Rüther Slides courtesy of Marc Pollefeys Department of Computer.
Day 1 how do we represent the shape around us? course outline motivation for gathering geometry from multiple images –our eyes are two views –structure.
3.1: Solving Linear Systems by Graphing Group 4.  Get two variables, (x,y), to correctly come out of two equations  ax+by=c  dx+ey=f  Check whether.
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.
Projective Geometry. Projection Vanishing lines m and n.
SOLVING SYSTEMS OF LINEAR EQUATIONS AND INEQUALITIES.
6-1B Solving Linear Systems by Graphing Warm-up (IN) Learning Objective: to solve a system of 2 linear equations graphically Given the equations: 1.Which.
Projective geometry ECE 847: Digital Image Processing Stan Birchfield Clemson University.
Structure from Motion Course web page: vision.cis.udel.edu/~cv April 25, 2003  Lecture 26.
Objects at infinity used in calibration
Single View Geometry Course web page: vision.cis.udel.edu/cv April 9, 2003  Lecture 20.
1. Put in slope-intercept form: 3x – 4y = Graph the line: y = -1/2 x + 3.
7-1 Graphing Systems of Equations SWBAT: 1) Solve systems of linear equations by graphing 2) Determine whether a system of linear equations is consistent.
Computer Vision cmput 499/615
Chapter 7 Graphs, Functions, and Linear Systems. 7.1 Graphing and Functions.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Affine Transformations.
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’,
Camera diagram Computing K from 1 image HZ8.8 IAC and K HZ8.5 Camera matrix from F HZ9.5 IAC HZ , 8.5 Extracting camera parameters HZ6.2 Camera matrix.
Various camera configurations Single point of fixation where optical axes intersect Optical axes parallel (fixation at infinity) General case.
Projective Geometry Hu Zhan Yi. Entities At Infinity The ordinary space in which we lie is Euclidean space. The parallel lines usually do not intersect.
Warm-up 4-1. x – y = 33x + y = 52y = 6 – x x + y = 5x – 2y = 43x – 2y = 6 Graphs:
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.
1 Overview Introduction to projective geometry 1 view geometry (calibration, …) 2-view geometry (stereo, motion, …) 3- and N-view geometry Autocalibration.
Chapter 3 – Linear Systems 3-1 Solving Systems Using Tables and Graphs.
Projective 2D geometry (cont’) course 3 Multiple View Geometry Modified from Marc Pollefeys’s slides.
4. Affine transformations. Reading Required:  Watt, Section 1.1. Further reading:  Foley, et al, Chapter  David F. Rogers and J. Alan Adams,
Projective 2D geometry course 2 Multiple View Geometry Comp Marc Pollefeys.
Projective geometry ECE 847: Digital Image Processing Stan Birchfield Clemson University.
Calibration ECE 847: Digital Image Processing Stan Birchfield Clemson University.
Projective geometry ECE 847: Digital Image Processing Stan Birchfield
7.1 Solving Systems of Equations by Graphing
Homogeneous Coordinates (Projective Space)
CS Visual Recognition Projective Geometry Projective Geometry is a mathematical framework describing image formation by perspective camera. Under.
Solutions to Systems of Equations
Solve Systems of Equations
Reconstruction.
9.6 Solving Systems of Equations by Graphing
System of Linear Equations:
Presentation transcript:

Day x: Infinity DLT alg HZ 4.1 Rectification HZ 2.7 Hierarchy of maps Invariants HZ 2.4 Projective transform HZ 2.3 Behaviour at infinity Primitives pt/line/conic HZ 2.2

Ideal points points at infinity now have a natural representation: set w = 0 –(x,y,0) represents the point at infinity in the direction (x,y) points at infinity (x,y,0) are called ideal points –no different in treatment than finite points all one happy family (finite and infinite points) –in a projective transform (linear map of projective space), points at infinity can be mapped to finite points, which is exactly what happens in photography intersection of parallel lines is consistent (not a special case) –e.g., x=1 and x=2

Line at infinity all of the ideal points in 2-space combine to form the line at infinity it is the line (0,0,1) –after all, it contains all the points (x,y,0) (0,0,1). (x,y,0) = 0 HZ28 the line at infinity is often mapped to a finite line in the act of photography finding the line at infinity in the image is crucial to removal of distortion (rectification) Exercise: where does the line (a,b,c) meet the line at infinity? take 2 minutes to discuss in pairs

Answer to exercise line (a,b,c) meets line (0,0,1) at the point (b,-a,0) [apply the intersection rule] –this encodes its tangent vector or direction –recall that (a,b) is the normal of the line ax+by+c = 0

Circular points two special points at infinity are the circular points (1,i,0) and (1,-i,0) they are also crucial in rectification (getting true measurements from an image) every circle contains the circular points –proof: a circle has the implicit representation (x-aw)^2 + (y-bw)^2 – r^2w^2 = 0: the circular points satisfy this equation –also note that setting w=0 in this equation yields x^2+y^2=0; w=0 and the circular points are the solutions of this equation explains why circle is defined by 3 points, rather than 5 explains why 2 circles have 2 intersections, not 4 HZ5, HZ52

Finding the line at infinity the line at infinity can be mapped to a finite line in an image, which is one of the sources of distortion in the image vanishing line = imaged line at infinity let’s find it; good example is Houckgeest image (FL206) we shall intersect the images of parallel lines to find vanishing points (imaged points at infinity) prerequisite: 2 pairs of identified parallel lines in the image, the 1 st pair not parallel to the 2 nd pair 2 minute exercise: develop an algorithm to find the vanishing line and answer ‘how many cross products are required’? HZ50

Translate into projective geometry: how many cross products?

Algorithm for vanishing line 1.mark 2 points on 1 st parallel line, say P1 and P2 2.mark 2 points on 2 nd parallel line, say Q1 and Q2 3.parallel lines are L=P1xP2 and M=Q1xQ2 4.a point A on the vanishing line = LxM (intersection) 5.find another point B on the vanishing line using the same approach with a 2 nd pair of parallel lines (not parallel to the 1 st pair) 6.vanishing line = AxB (join) 7.2 to get lines, 1 to get intersection, 3 more for B, 1 for join = 7

Removal of projective distortion now map vanishing line (L1,L2,L3) to (0,0,1), using the projective transformation represented by the matrix M = [1,0,0; 0,1,0; L1,L2,L3] to map points (see below for relationship of line transformation and point transformation) –actually any affine transformation can be added to this projective transform (H_a M) –HZ49 motivates an understanding of projective transforms

HW1 See handout. This homework has a dual purpose: it is a warmup for building metric reconstructions in 3D (we will do it in 2D) and it is an exploration of some of the key ideas of projective geometry through implementation. suggested warmup: input lines and intersect (the first stage of affine rectification) –does not require an image –allows you to develop your functions for projective geometry (either C functions or C++ class) –allows you to explore OpenGL mouse reading 1.affine rectification: implement algorithm described above (and Example 2.18 HZ50) to find a vanishing line and map it to the line at infinity (0,0,1) in order to affinely rectify an image should work with any image use image of Figure 2.13 for preliminary testing (available at my website) 2.metric rectification: move circular points to their proper position using Algorithm of Example 2.26 (described in detail next lecture); advise delaying start until Monday 3.Prove that if a projective transform fixes the circular points, then it must be a similarity. [we proved the other direction]