2: Vanishing Points and Horizons. Applications of Projective Transformations

Total Page:16

File Type:pdf, Size:1020Kb

2: Vanishing Points and Horizons. Applications of Projective Transformations 2: Vanishing points and horizons. Applications of projective transformations. Lecture 1: Euclidean, similarity, affine and projective transformations. Homo- geneous coordinates and matrices. Coordinate frames. Perspective projection and its matrix representation. Lecture 2: Vanishing points. Horizons. Applications of projective transfor- mations. Lecture 3: Convexity of point-sets, convex hull and algorithms. Conics and quadrics, implicit and parametric forms, computation of intersections. Lecture 4: Bezier curves, B-splines. Tensor-product surfaces. 1 Recall: Perspective (central) projection — 3D to 2D 2.1 Y The camera model Mathematical ideal- ized camera 3D ¡ 2D X X y Image coordinates ¢¤£ x Camera frame ¥§¦©¨ (origin at optical x centre) O f ¨ Focal length , image plane is at Z . image Similar triangles plane ¥ £ ¦ ¢ Y y ¨ ¨ ¨ f where and are 3-vectors, with Z ¢£ ¥¦ ¨! , . Vanishing Points 2.2 2 Vanishing Points in 1D and 2D 2.3 x 1D image O Vanishing point Point at Infinity 1D world image plane vanishing point v horizon O line vanishing point parallel lines Ground plane All parallel lines meet at the same vanishing point 2.4 A line of 3D points isrepresented as -, ¨ Using the vanishing point of ()"+* #"$% '& its image is & (:"¤* . ;=< < /1032 #"$9 4576+8 (:"$> λ λ X( ) D @ GH = 0 ? < , @ H @ H >CB > < , * < >ED > A A I F > V O J. depends only on the direction * , not on & . Parallel lines have the same vanishing point. 3 The Homogeneous KMLON Projection Matrix 2.5 Y X X y x x ¨ O f F Z Choose P from now on. -, Q¢SRTT¢VUWT¢¤XT ¨ Homogeneous image coordinates correctly represent if GH ?@ H @ GH ?@ [\ _a` F ^ ^ ^ H @ ¥ H @ \ ` H ? G @ H @ \ ` ¢YR H @ ^ F ^ ^ H @ ¦ A I F U ced©fhgji ¢ I A Z ] b ^ ^ F ^ ¨ I A F X ¢ because then R U ¢ ¥ ¢ ¦ ¢P £k ¢¤X ¨ ¢VX ¨ Then perspective projection is a linear map, represented by a l§mMn projection matrix, from 3D to 2D. Vanishing points using homogeneous notation 2.6 * A line of points in 3D through the point & with direction is Qo & (poY* Z Writing this in homogeneous notation ? G @ H @ H @ H R ¥ Qo @ ? ? G ? G ? H G G F @ H @ H U ¥ Qo & & * * A A I A I A I I F F ^ ^ (vo ( Z Z ¥qXrQo o A I ¥tsuQo ?@ GH ¡ w Atxzy I In the limit o the point on the line is ^ So, homogeneous vectors with ¥qs{ represent points “at infinity”. Points at infinity are equivalent to directions 4 Vanishing points using homogeneous notation: Example 2.7 w The vanishing point of a line with direction * is the image of the point at ... [\ _a` ?@ GH F ^ ^ ^ \ ` @ H ? G \ ` @ H >CB ^ F ^ ^ * . A I ^ >|D A I ] b < ^ ^ F ^ > Exercise: Compute the vanishing points of lines on an ¥}¨ plane: n~ ¨ ¥ (1) parallel to the ¨ axis; (2) at to the axix; (3) parallel to the axis. ?@ GH @ H ?@ GH @ H A 1: I I 1 A y D = 0 GH @ 3 0 ? GH H ?@ x @ H Z @ 1 I 2 A I D 2 = 0 A 1 GH ?@ G ? H H @ 0 @ H X @ D = 0 Y 1 I 1 3: A I A Z The advantages of homogeneous notation ... 2.8 Jump you daft cat. There are two advantages of using homogeneous notation to represent perspective projection: 1. Non-linear projections equations are turned into linear equations. The tools of linear algebra can then be used. 2. Vanishing points are treated naturally, and awkward limiting procedures are then avoided. 5 Plane to Plane Projective Transformations 2.9 ? G @ H @ H ? G @ H @ H R ¥ @ H @ H @ H R ¢ H O @ @ H U Z ¥ U ¢ ' I Z=0 plane A ¥qX A I X ¢¤X Y ¥ts Choose the world coordinate system such that the world plane has zero ¨ co- lmpl ordinate. Then the lmn matrix reduces to a plane to plane projective transformation. ?@ GH @ H GH [\ _a` [\ _a` ?@ GH ?@ @ H ¥ H \ ` \ ` @ H @ @ H H \ ` \ ` @ H @ RR RU RQX Rs RR RU Rs R ¥ ¢ @ H @ H ¦ ^ UR UU UX U#s UR UU U#s U ¦ ¢ I A I A ] b ] b F A I F XR XU XX Xs XR XU Xs X ¢ This is the most general transformation between the world plane and image plane under imaging by a perspective camera. A projective transformation is also called a “homography” and a “collineation”. 6 Computing a projective transformation 2.10 G ? [ _ ? G H @ \ ` @ H H @ \ ` @ H H @ \ ` @ H ¢+ RR RU RX ¢YR R x ¢ UR UU UX ¢VU U Z I A A I ] b ¢+ XR XU XX ¢¤X x X ?@ GH @ H @ H O ¢YR ¢VU Z A y y I x ¢¤X x lml where is a non-singular homo- geneous matrix with EIGHT degrees of freedom. Each point correspondence gives two constraints ¢+ ¢+ RR¢©( RU£( RQX UR¢( UU£( UX R U ¢ £ XR XU XX XR XU XX ¢ ¢©( £( ¢ ¢( £( X X and multiplying out give two equations linear in the elements of XR XU XX RR RU RQX ¢ ¢( £( ¢©( £( XR XU XX UR UU UX £ ¢( £( ¢©( £( Simple Example 2.11 Q¢V1£ Suppose the correspondences Q¢£+ are known for four points (no three collinear), then is determined uniquely. (0,1) (1,1) (0,1) (2,1) H (0,0) (1,0) (0,0) (1,0) ^ ^ ^ ^ ¡ F ^ F ^ ¡ First correspondence Second correspondence ?@ GH [\ _a` ?@ GH ?@ GH ^ ^ @ H \ ` @ H @ H ?@ GH [\ _a` ?@ GH ?@ GH ¡ ¢ r £ ¢ @ H \ ` @ H @ H RR RU RX RQX ^ ^ r rh¢ h u A IP A IP A I ] b "R UR UU UX UX A I A I A I ] b r¤ rh¤¢r¤¢¤ h¤ ¦¥qr¤¢¤ F F XR XU XX XX ^©¨¡ª+« ^ RR% XRS( XX Whence UR§ RX UX Whence . 7 Simple example Continued 2.12 ^ F ^ F ^ ¡ RU¬ UU¬ XU­( XX Third correspondence gives and . F F F ¡ #® Fourth correspondence ? G [ _ ? G ? G @ H \ ` @ H @ H ^ ^ F @ H \ ` @ H @ H @ H \ ` @ H @ H XR XX XR XX ® ( ( F ^ ^ F s XU XX XU XX " ( ( A I A I A I ] b F F XR XU XX XRS( XU­( XX ¯ Take ratios ¯ 2 equations in 3 unknowns solve for ratio of matrix elements only. [ _ [ _ \ ` \ ` ^ ^ ^ ^ \ ` \ ` \ ` \ ` ® ® ^ F ^ ^ F ^ k " Z ] b ] b ^ °EF ^ °F ® ® Computational Algorithm 2.13 The equations, XR XU XX RR RU RQX ¢ ¢( £( ¢©( £( XR XU XX UR UU UX £ ¢( £( ¢©( £( can be rearranged as _ [ F ^ ^ ^ ° ° ° ¢ £ ¢ ¢ ¢ £ ¢ b9± ] ^ ^ ^ F ° ° ° g ¢ £ £ ¢ £ £ £ ± RRT RUW RX² URT UUW UX² XRT XUW XX³ where is the matrix written as a 9- vector. 8 continued ... 2.14 For 4 points, [\ _a` F ^ ^ ^ ° ° ° \ ` \ ` ¢YR£¦R ¢ ¢YR ¢ £¦R ¢ R R R \ ` ^ ^ ^ F ° ° ° \ ` \ ` ¢SR´£µR £¦ ¢YR £ £¦R £ R R R \ ` F ^ ^ ^ ° ° ° \ ` \ ` ¢VU £U ¢ ¢VU ¢ £U ¢ U U U \ ` ^ ^ ^ F ° ° ° \ ` \ ` U U U U ¢ £ £ ¢ £ £ £ U U U ± \ ` F ^ ^ ^ ° ° ° g \ ` \ ` X X X X ¢ £ ¢ ¢ ¢ £ ¢ X X X \ ` ^ ^ ^ F ° ° ° \ ` \ ` X X X X ¢ £ £ ¢ £ £ £ X X X F ^ ^ ^ ° ° ° s s s s ¢ £ ¢+ ¢ ¢+ £ ¢+ s s s ] b ^ ^ ^ F ° ° ° ¢¤s £¶s £ ¢+s £ £us £ s s s ± ± g · ¸mp¹ which has the form · , with a matrix. The solution is the (one dimensional) null space of · . If using many points, one can use least squares. Solution best found then using ± º»¡¼j½)¾ · ¼ SVD of · — ie Then is the column of corresponding to smallest singular value. (The smallest singular value would be zero of all the data were exact ...) Some Matlab 2.15 npoints = 4 (or 5 later -- 5th point is noisy) x = [0,1,0,1, 1.01]; y = [0,0,1,1, 0.99]; xd = [0,1,0,2, 2.01]; yd = [0,0,1,1, 1.01]; A = zeros(2*npoints,9); for i=1:npoints, A(2*i-1,:)= [x(i),y(i),1,0,0,0, -x(i)*xd(i),-xd(i)*y(i),-xd(i)]; A(2*i, :)= [0,0,0,x(i),y(i),1, -x(i)*yd(i),-yd(i)*y(i),-yd(i)]; end; if npoints==4 h = null(A); else [U,S,V] = svd(A); h=V(:,9); end; H=[h(1),h(2),h(3);h(4),h(5),h(6);h(7),h(8),h(9);]; With the 4 exact points ... Adding the fifth noisy point ... [\ _a` [\ _a` ^ °Á^ ^¡^À^À^ ^ ^À^¡^À^ ^ °Á^ ^À^¡^À^ °=^ ^À^À^À^ \ ` \ ` \ ` \ ` l¦®À~ ®¹¦~ ^ ^À^À^À^ F ^¡^À^À^ °Á^ ^À^¡^À^ °Á^ ^¡^À^¤F ^ ^ ^À^À^¤F Zz¿ Z Z Z¿ Z Z k k ¹À¹¡¹À¹ ] b ] b ^ ^À^À^À^ °Á^ F ^ °Á^ ^¡^ ^ °Á^ F ^ Z Z Z Z Z Z l ® l®À~ ~ l ~À~ lnÀn Z Z ¿ Z¿ Z Z Zz¿ 9 Example 1: Removing Perspective Distortion 2.16 Objective: Back project to world plane 1. Find Euclidean coordinates of four points on the flat object plane Q¢Ã#£¶ÃÄ . Q¢ £ à 2. Measure the corresponding image coordinates of these four points à . à à Q¢ £ Q¢ £ à 3. Compute from the four à . F F R Å¤Æ ¢+1£Ç 4. Euclidean coords of any image point are ¢£ . The image can be warped onto the world plane using . How? Moving the image plane 2.17 An image is the intersection of a plane with the cone of rays between points in 3-space and the optical centre. Any two such “images” (with the same optical centre) are related by a planar projective transformation. X x x As the camera is rotated the points of intersection of the rays with the image plane are related by a planar projective transformation. Image points and correspond to the same scene point . 10 Relationship in terms of rotations 2.18 U For corresponding points R and in two views 1 and 2, ?@ GH @ H [\ _a` ?@ GH ?@ GH F ^ ^ ^ @ H ¥ \ ` @ H @ H [ _ @ H \ ` @ H @ H ¥ ¥ @ H ^ F ^ ^ @ H R g ¦ ]=È b F ^ R U ¦ R ¦ U Z Z È A I È A I ] b ^ ^ F ^ F F g A I F Hence R Æ U U R R È È The cameras could have different focal lengths — so one can do all of this while rotationing and zooming.
Recommended publications
  • Projective Geometry: a Short Introduction
    Projective Geometry: A Short Introduction Lecture Notes Edmond Boyer Master MOSIG Introduction to Projective Geometry Contents 1 Introduction 2 1.1 Objective . .2 1.2 Historical Background . .3 1.3 Bibliography . .4 2 Projective Spaces 5 2.1 Definitions . .5 2.2 Properties . .8 2.3 The hyperplane at infinity . 12 3 The projective line 13 3.1 Introduction . 13 3.2 Projective transformation of P1 ................... 14 3.3 The cross-ratio . 14 4 The projective plane 17 4.1 Points and lines . 17 4.2 Line at infinity . 18 4.3 Homographies . 19 4.4 Conics . 20 4.5 Affine transformations . 22 4.6 Euclidean transformations . 22 4.7 Particular transformations . 24 4.8 Transformation hierarchy . 25 Grenoble Universities 1 Master MOSIG Introduction to Projective Geometry Chapter 1 Introduction 1.1 Objective The objective of this course is to give basic notions and intuitions on projective geometry. The interest of projective geometry arises in several visual comput- ing domains, in particular computer vision modelling and computer graphics. It provides a mathematical formalism to describe the geometry of cameras and the associated transformations, hence enabling the design of computational ap- proaches that manipulates 2D projections of 3D objects. In that respect, a fundamental aspect is the fact that objects at infinity can be represented and manipulated with projective geometry and this in contrast to the Euclidean geometry. This allows perspective deformations to be represented as projective transformations. Figure 1.1: Example of perspective deformation or 2D projective transforma- tion. Another argument is that Euclidean geometry is sometimes difficult to use in algorithms, with particular cases arising from non-generic situations (e.g.
    [Show full text]
  • Chapter 12 the Cross Ratio
    Chapter 12 The cross ratio Math 4520, Fall 2017 We have studied the collineations of a projective plane, the automorphisms of the underlying field, the linear functions of Affine geometry, etc. We have been led to these ideas by various problems at hand, but let us step back and take a look at one important point of view of the big picture. 12.1 Klein's Erlanger program In 1872, Felix Klein, one of the leading mathematicians and geometers of his day, in the city of Erlanger, took the following point of view as to what the role of geometry was in mathematics. This is from his \Recent trends in geometric research." Let there be given a manifold and in it a group of transforma- tions; it is our task to investigate those properties of a figure belonging to the manifold that are not changed by the transfor- mation of the group. So our purpose is clear. Choose the group of transformations that you are interested in, and then hunt for the \invariants" that are relevant. This search for invariants has proved very fruitful and useful since the time of Klein for many areas of mathematics, not just classical geometry. In some case the invariants have turned out to be simple polynomials or rational functions, such as the case with the cross ratio. In other cases the invariants were groups themselves, such as homology groups in the case of algebraic topology. 12.2 The projective line In Chapter 11 we saw that the collineations of a projective plane come in two \species," projectivities and field automorphisms.
    [Show full text]
  • Single View Geometry Camera Model & Orientation + Position Estimation
    Single View Geometry Camera model & Orientation + Position estimation What am I? Vanishing point Mapping from 3D to 2D Point & Line Goal: Homogeneous coordinates Point – represent coordinates in 2 dimensions with a 3-vector &x# &x# homogeneous coords $y! $ ! ''''''→$ ! %y" %$1"! The projective plane • Why do we need homogeneous coordinates? – represent points at infinity, homographies, perspective projection, multi-view relationships • What is the geometric intuition? – a point in the image is a ray in projective space y (sx,sy,s) (x,y,1) (0,0,0) z x image plane • Each point (x,y) on the plane is represented by a ray (sx,sy,s) – all points on the ray are equivalent: (x, y, 1) ≅ (sx, sy, s) Projective Lines Projective lines • What does a line in the image correspond to in projective space? • A line is a plane of rays through origin – all rays (x,y,z) satisfying: ax + by + cz = 0 ⎡x⎤ in vector notation : 0 a b c ⎢y⎥ = [ ]⎢ ⎥ ⎣⎢z⎦⎥ l p • A line is also represented as a homogeneous 3-vector l Line Representation • a line is • is the distance from the origin to the line • is the norm direction of the line • It can also be written as Example of Line Example of Line (2) 0.42*pi Homogeneous representation Line in Is represented by a point in : But correspondence of line to point is not unique We define set of equivalence class of vectors in R^3 - (0,0,0) As projective space Projective lines from two points Line passing through two points Two points: x Define a line l is the line passing two points Proof: Line passing through two points • More
    [Show full text]
  • 6. the Riemann Sphere It Is Sometimes Convenient to Add a Point at Infinity ∞ to the Usual Complex Plane to Get the Extended Complex Plane
    6. The Riemann sphere It is sometimes convenient to add a point at infinity 1 to the usual complex plane to get the extended complex plane. Definition 6.1. The extended complex plane, denoted P1, is simply the union of C and the point at infinity. It is somewhat curious that when we add points at infinity to the reals we add two points ±∞ but only only one point for the complex numbers. It is rare in geometry that things get easier as you increase the dimension. One very good way to understand the extended complex plane is to realise that P1 is naturally in bijection with the unit sphere: Definition 6.2. The Riemann sphere is the unit sphere in R3: 2 3 2 2 2 S = f (x; y; z) 2 R j x + y + z = 1 g: To make a correspondence with the sphere and the plane is simply to make a map (a real map not a function). We define a function 2 3 F : S − f(0; 0; 1)g −! C ⊂ R as follows. Pick a point q = (x; y; z) 2 S2, a point of the unit sphere, other than the north pole p = N = (0; 0; 1). Connect the point p to the point q by a line. This line will meet the plane z = 0, 2 f (x; y; 0) j (x; y) 2 R g in a unique point r. We then identify r with a point F (q) = x + iy 2 C in the usual way. F is called stereographic projection.
    [Show full text]
  • Euclidean Versus Projective Geometry
    Projective Geometry Projective Geometry Euclidean versus Projective Geometry n Euclidean geometry describes shapes “as they are” – Properties of objects that are unchanged by rigid motions » Lengths » Angles » Parallelism n Projective geometry describes objects “as they appear” – Lengths, angles, parallelism become “distorted” when we look at objects – Mathematical model for how images of the 3D world are formed. Projective Geometry Overview n Tools of algebraic geometry n Informal description of projective geometry in a plane n Descriptions of lines and points n Points at infinity and line at infinity n Projective transformations, projectivity matrix n Example of application n Special projectivities: affine transforms, similarities, Euclidean transforms n Cross-ratio invariance for points, lines, planes Projective Geometry Tools of Algebraic Geometry 1 n Plane passing through origin and perpendicular to vector n = (a,b,c) is locus of points x = ( x 1 , x 2 , x 3 ) such that n · x = 0 => a x1 + b x2 + c x3 = 0 n Plane through origin is completely defined by (a,b,c) x3 x = (x1, x2 , x3 ) x2 O x1 n = (a,b,c) Projective Geometry Tools of Algebraic Geometry 2 n A vector parallel to intersection of 2 planes ( a , b , c ) and (a',b',c') is obtained by cross-product (a'',b'',c'') = (a,b,c)´(a',b',c') (a'',b'',c'') O (a,b,c) (a',b',c') Projective Geometry Tools of Algebraic Geometry 3 n Plane passing through two points x and x’ is defined by (a,b,c) = x´ x' x = (x1, x2 , x3 ) x'= (x1 ', x2 ', x3 ') O (a,b,c) Projective Geometry Projective Geometry
    [Show full text]
  • 1 Affine and Projective Coordinate Notation 2 Transformations
    CS348a: Computer Graphics Handout #9 Geometric Modeling Original Handout #9 Stanford University Tuesday, 3 November 1992 Original Lecture #2: 6 October 1992 Topics: Coordinates and Transformations Scribe: Steve Farris 1 Affine and Projective Coordinate Notation Recall that we have chosen to denote the point with Cartesian coordinates (X,Y) in affine coordinates as (1;X,Y). Also, we denote the line with implicit equation a + bX + cY = 0as the triple of coefficients [a;b,c]. For example, the line Y = mX + r is denoted by [r;m,−1],or equivalently [−r;−m,1]. In three dimensions, points are denoted by (1;X,Y,Z) and planes are denoted by [a;b,c,d]. This transfer of dimension is natural for all dimensions. The geometry of the line — that is, of one dimension — is a little strange, in that hyper- planes are points. For example, the hyperplane with coefficients [3;7], which represents all solutions of the equation 3 + 7X = 0, is the same as the point X = −3/7, which we write in ( −3) coordinates as 1; 7 . 2 Transformations 2.1 Affine Transformations of a line Suppose F(X) := a + bX and G(X) := c + dX, and that we want to compose these functions. One way to write the two possible compositions is: G(F(X)) = c + d(a + bX)=(c + da)+bdX and F(G(X)) = a + b(c + d)X =(a + bc)+bdX. Note that it makes a difference which function we apply first, F or G. When writing the compositions above, we used prefix notation, that is, we wrote the func- tion on the left and its argument on the right.
    [Show full text]
  • Dirichlet Problem at Infinity for P-Harmonic Functions on Negatively
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Helsingin yliopiston digitaalinen arkisto Dirichlet problem at infinity for p-harmonic functions on negatively curved spaces Aleksi Vähäkangas Department of Mathematics and Statistics Faculty of Science University of Helsinki 2008 Academic dissertation To be presented for public examination with the permission of the Faculty of Science of the University of Helsinki in Auditorium XIII of the University Main Building on 13 December 2008 at 10 a.m. ISBN 978-952-92-4874-2 (pbk) Helsinki University Print ISBN 978-952-10-5170-8 (PDF) http://ethesis.helsinki.fi/ Helsinki 2008 Acknowledgements I am in greatly indebted to my advisor Ilkka Holopainen for his continual support and encouragement. His input into all aspects of writing this thesis has been invaluable to me. I would also like to thank the staff and students at Kumpula for many interesting discussions in mathematics. The financial support of the Academy of Finland and the Graduate School in Mathe- matical Analysis and Its Applications is gratefully acknowledged. Finally, I would like to thank my brother Antti for advice and help with this work and my parents Simo and Anna-Kaisa for support. Helsinki, September 2008 Aleksi Vähäkangas List of included articles This thesis consists of an introductory part and the following three articles: [A] A. Vähäkangas: Dirichlet problem at infinity for A-harmonic functions. Potential Anal. 27 (2007), 27–44. [B] I. Holopainen and A. Vähäkangas: Asymptotic Dirichlet problem on negatively curved spaces. Proceedings of the International Conference on Geometric Function Theory, Special Functions and Applications (ICGFT) (R.
    [Show full text]
  • Manifolds Without Conjugate Points
    MANIFOLDS WITHOUT CONJUGATE POINTS BY MARSTON MORSE AND GUSTAV A. HEDLUND 1. Introduction. If a closed two-dimensional Riemannian manifold M is homeomorphic to a sphere or to the projective plane and A is any point of M, there exists a geodesic passing through A with a point on it conjugate to A (cf., e.g., Myers [l, p. 48, Corollary 2])(l). There exists a closed two-dimen- sional Riemannian manifold of any other given topological type such that no geodesic on the manifold has on it two mutually conjugate points. The sim- plest examples of these are manifolds of vanishing Gaussian curvature in the case of the torus and the Klein bottle, and manifolds of constant negative curvature in the remaining cases. In all these particular examples the differ- ential equations defining the geodesies can be integrated and the properties in the large of the geodesies can be determined. In the case of the flat torus or flat Klein bottle the geodesies are either periodic or recurrent but not periodic. In the case of closed manifolds of constant negative curvature the behavior of the geodesies is much more complex, but among other types there exist transitive geodesies. In this paper our starting point will be the assumption that we have a closed two-dimensional Riemannian manifold M such that no geodesic on M has on it two mutually conjugate points. Our aim is to determine what prop- erties of M or of the geodesies on M must follow from this hypothesis. The possibility that M be homeomorphic to the sphere or to the projective plane is thereby eliminated and it is necessary to divide the possible closed mani- folds into two classes.
    [Show full text]
  • 4 Lines and Cross Ratios
    4 Lines and cross ratios At this stage of this monograph we enter a significant didactic problem. There are three concepts which are intimately related and which unfold their full power only if they play together. These concepts are performing calculations with geometric objects, determinants and determinant algebra and geometric incidence theorems. The reader may excuse that in a beginners book that makes only little assumptions on the pre-knowledge one has to introduce these concepts one after the other. Thereby we will sacrifice some mathe- matical beauty for clearness of exposition. Still we highly recommend to read the following chapters (at least) twice. In order to get an impression of the interplay of the different concepts. This and the next section is devoted to the relations of RP2 to calcula- tions in the underlying field R. For this we will first find methods to relate points in a projective plane to the coordinates over R. Then we will show that elementary operations like addition and multiplication can be mimicked in a purely geometric fashion. Finally we will use these facts to derive in- teresting statements about the structure of projective planes and projective transformations. 4.1 Coordinates on a line Assume that two distinct points [p] and [q] in R are given. How can we describe the set of all points on the line throughP these two points. It is clear that we can implicitly describe them by first calculating the homogeneous coordinates of the line through p and q and then selecting all points that are incident to this line.
    [Show full text]
  • Lecture 2.2 a Brief Introduction to Projective Geometry
    Lecture 1.3 Basic projective geometry Thomas Opsahl Motivation • For the pinhole camera, the correspondence between observed 3D points in the world and 2D points in the captured image is given by straight lines through a common point (pinhole) • This correspondence can be described by a mathematical model known as “the perspective camera model” or “the pinhole camera model” • This model can be used to describe the imaging geometry of many modern cameras, hence it plays a central part in computer vision 2 Motivation • Before we can study the perspective camera model in detail, we need to expand our mathematical toolbox • We need to be able to mathematically describe the position and orientation of the camera relative to the world coordinate frame • Also we need to get familiar with some basic elements of projective geometry, since this will make it MUCH easier to describe and work with the perspective camera model 3 Introduction • We have seen that the pose of a coordinate frame relative to a coordinate frame , denoted , can be represented as a homogeneous transformation in 2D rrA t AAR t 11 12 Bx AAξ = BB= A∈ B TB r21 r 22 tBx SE (2) 0 1 00 1 Introduction • We have seen that the pose of a coordinate frame relative to a coordinate frame , denoted , can be represented as a homogeneous transformation in 2D and 3D rrrA t 11 12 13 Bx AARt rrrA t AAξ T = BB = 21 22 23 By ∈ SE (3) BBA 0 1 rrr31 32 33 tBz 000 1 Introduction • And we have seen how they can transform points from one reference frame to another if we represent
    [Show full text]
  • A the Riemann Sphere
    MATH 132 (19F) (TA) A. Zhou Complex Analysis for Applications A THE RIEMANN SPHERE A.1 STEREOGRAPHIC PROJECTION The points of the complex plane can be (mostly) associated with points on the sphere. To make 2 2 2 2 3 this more precise, consider the unit sphere S = (x1; x2; x3) x1 + x2 + x3 = 1 sitting in R , and identify the plane x3 = 0 with the complex plane C via (x1; x2; 0) $ x1 + x2i. Let N = (0; 0; 1) denote the north pole of the unit sphere. Given a point P 2 S2 with P 6= N, we obtain a complex 3 number φN (P ) by intersecting line NP with C ⊂ R . Definition A.1.1: Stereographic projection 2 The map P 7! φN (P ) from S nfNg to C is stereographic projection through the north pole. This map is invertible, with inverse given by taking a complex number z, drawing the line through N and z, and taking the intersection point of this line with S2 that is not N. The inverse map is also called stereographic projection; it will be clear from context which direction is meant. 2 Given P = (x1; x2; x3) 2 S with P 6= N, the line NP has parametric form (tx1; tx2; tx3 + (1 − t)). This intersects C when tx3 + (1 − t) = 0, so t = 1=(1 − x3). (This is defined, because P 6= N means that x3 6= 1.) It thus follows that x1 x2 φN (P ) = + · i: (A.1) 1 − x3 1 − x3 −1 For the inverse map, let z = x + yi 2 C.
    [Show full text]
  • Projective Geometry
    REFLECTIONS Projective Geometry S Ramanan The following is a write-up of a talk that was presented at the TIFR as part of the Golden Jubilee celebrations of that Institute during 1996. Introduction For some reason not so well understood, mathematicians find it most difficult to communicate their joys and frustrations, their insights and experiences to the general public, indeed even to other fellow scientists! Perhaps this is due to the fact that mathematicians are trained to use very precise language, and so find it hard to simplify and state something not entirely correct. You mqst have heard of the gentleman who while he was drowning, exclaimed, "Oh! Lord, if You exist! Help me, if You can!" I am sure it was a mathematician. On the other hand, mathematics carries a certain mystique for most non-mathematicians. It is one subject to which nobody seems to have been neutral at school. Everyone says, "I loved mathematics at school", or "I hated it". Nobody says it was just one of those subjects. Let me leave it to psychologists to analyse why it is so and get on with my subject matter. With some concessions on your part for some resultant vagueness, I will try to communicate some ideas basic to the topic which I have been interested in for a considerable percentage of my professional life, namely, Projective Geometry. Perspective Mathematical theories are, by and large, off-shoots of applications and not precursors. Whatever the validity of such a general formulation, it is certainly true of Projective Geometry. The first seeds of this theory may be seen in the attempt to understand perspective in painting.
    [Show full text]