Summer School: Mathematical Methods in Robotics
|
|
- Kristina Barrett
- 6 years ago
- Views:
Transcription
1 Summer School: Mathematical Methods in Robotics Part IV: Projective Geometry Harald Löwe TU Braunschweig, Institute Computational Mathematics 2009/07/16 Löwe (TU Braunschweig) Math. robotics 2009/07/16 1 / 27
2 Projective Spaces and Homogeneous Coordinates Projective Spaces Definition The projective n space P n is the set of all 1 dimensional subspaces of R n+1. P n = Grass(1, n + 1) is a Grassmannian and, thus, is a homogenous manifold P n = SO(n + 1)/ O(n). Löwe (TU Braunschweig) Math. robotics 2009/07/16 2 / 27
3 Projective Spaces and Homogeneous Coordinates Geometric Objects Elements of P n are called points. A 2 dimensional subspace of R n+1 is called a line of P n. A point p P is on a line L iff p is a subspace of L. A plane of P n is a 3 dimensional subspace. An (n 1) dimensional subspace of P n is called a hyperplane. The join of two geometric objects X and Y of P n is defined as XY := X + Y. The intersection of two geometric objects X and Y of P n is defined as X Y. Join and intersection of geometric objects are geometric objects again. Löwe (TU Braunschweig) Math. robotics 2009/07/16 3 / 27
4 Projective Spaces and Homogeneous Coordinates Homogeneous Coordinates Every point p P n is a 1 dimensional subspace of R n+1. Choose a basis of R n+1 and write x 0 x 0 x 1 x 1 p =. x n := R. x n Notice: The x i s depend on the basis. homogeneous coordinates Löwe (TU Braunschweig) Math. robotics 2009/07/16 4 / 27
5 Projective Spaces and Homogeneous Coordinates Coordinates for Lines Let L be a line of P n, i.e. a 2 dimensional subspace of R n+1. Choose a basis {x, y} of L. W.r.t. a basis of R n+1, we may write L = [x y] = x 0 y 0 x 1 y 1. x n. y n. Löwe (TU Braunschweig) Math. robotics 2009/07/16 5 / 27
6 Projective Spaces and Homogeneous Coordinates Notice that [x y] = [x + λy y] for all λ. Using Gauß algorithm, we obtain e.g. x 0 y x 1 y x 2 y 2 = x 2 y 2 ; elements.... ξ η ξx 2 + ηy 2.. x n y n x n y n ξx n + ηy n This subspace is the graph of the linear function ( ) x 2 y 2 ( f L : R 2 R n 1 ξ ξ ; η.. η x n y n ) Löwe (TU Braunschweig) Math. robotics 2009/07/16 6 / 27
7 Projective Spaces and Homogeneous Coordinates Thus, locally at the line E 01 = span{e 0, e 1 }, we have a chart x 2 y 2 x 2 y 2.. R (n 1) 2... x n y n x n These are the Grassmann coordinates. The chart region equals the set of lines with trivial intersection with span{e 2,..., e n }. y n Löwe (TU Braunschweig) Math. robotics 2009/07/16 7 / 27
8 Embedding of the Euclidian Space Euclidian Spaces Let E n = R n be the n dimensional Euclidian space with its usual geometric objects (points, lines,... ). Embed E n into P n as usual: (We are writing row vectors now.) E P; x [1, x]. This embedding depends on the basis of R n+1! The image of a euclidian line u + Rv is contained in the projective line [ ] 1 u. 0 v Löwe (TU Braunschweig) Math. robotics 2009/07/16 8 / 27
9 Embedding of the Euclidian Space Löwe (TU Braunschweig) Math. robotics 2009/07/16 9 / 27
10 Embedding of the Euclidian Space Circles We start with the circle C : ξ1 2 + ξ2 2 = 1 in E2 (which is a quadric). Embedding E 2 into P 2 yields C : [1 ξ 1 ξ 2 ] with ξ1 2 + ξ2 2 = 1. In homogeneous coordinates, this equation reads x1 2 + x 2 2 = x 0 2. Choose e 0 = e 0 + e 2, e 1 = e 1, e 2 = e 0 e 2 as new basis. From (x 0 x 2 )(x 0 + x 2 ) + x1 2 = 0 obtain the equation x 2 1 4x 0 x 2 = 0. Go back to E 2 (equation x 0 = 1): C : ξ 2 = ξ1 2 /4. This is a parabola. Thus, a parabola is a projective circle with one point removed. Löwe (TU Braunschweig) Math. robotics 2009/07/16 10 / 27
11 Projective Transformations Projective Transformations Definition Let A GL(n + 1). Then the bijective map P n P n ; [x] [A x] is called projective transformation of P n. This yields an action of GL(n + 1) on P n. Two matrices A and B belong to the same projective transformation iff B = t A, t 0. Therefore, we may use homogeneous coordinates for matrices and put PGL(n) := {[A] A GL(n + 1)}. Löwe (TU Braunschweig) Math. robotics 2009/07/16 11 / 27
12 Projective Transformations Translations Look at the projective transformation x 0 a 1 0 : x 1 b 0 1 x 2 x 0 x 1 + x 0 a x 2 + x 0 b This corresponds to translations in E 2 (defined by x 0 = 1). Löwe (TU Braunschweig) Math. robotics 2009/07/16 12 / 27
13 Projective Transformations The Main Theorem of Projective Geometry Theorem Let ϕ : P n P n (n 2) be a bijective map which maps lines onto lines. Then there exists a matrix A GL(n + 1) such that ϕ([x]) = [A] [x] for all [x] P n. Löwe (TU Braunschweig) Math. robotics 2009/07/16 13 / 27
14 Projective Transformations Action of PGL(n) on the lines Let L be a line of P n, say L = [x y] for some x, y R n+1. If [A] PGL(n), then [A] maps the points [x] and [y] to [Ax] and [Ay], respectively. We derive that [A](L) = [Ax Ay]. Generalize this to higher dimensional geometric objects like planes or hyperplanes of P n. Löwe (TU Braunschweig) Math. robotics 2009/07/16 14 / 27
15 Plücker Coordinates Lines of E 3 Ususally, we describe a line L in space by a position vector p and a vector v in direction of L: L = p + R v. We may replace v by λv (i.e. v is a homogeneous vector ). We may replace p by p + µv but not by a multiple of p. Thus, p and v are different objects. Löwe (TU Braunschweig) Math. robotics 2009/07/16 15 / 27
16 Plücker Coordinates Lines of P 3 Try to obtain a better representation of lines in the projective 3 space. Consider a line [ x0 x L := 1 x 2 x 3 y 0 y 1 y 2 y 3 Since x and y are linearly independent, the rank of the matrix equals 2. Therefore, two of the column vectors are linearly independent, i.e. not all determinants ( ) ( ) ( ) x0 x l 01 = det 1 x0 x, l y 0 y 02 = det 2 x0 x ; l 1 y 0 y 03 = det 3 2 y 0 y 3 ( ) ( ) ( ) x2 x l 23 = det 3 x3 x, l y 2 y 31 = det 1 x1 x ; l 3 y 3 y 12 = det 2 1 y 1 y 2 vanish. ]. Löwe (TU Braunschweig) Math. robotics 2009/07/16 16 / 27
17 Plücker Coordinates Not all determinants ( ) xi x l ij = det j, (i, j) = (0, 1), (0, 2), (0, 3), (2, 3), (3, 1), (1, 2) vanish. y i It follows that y j γ(l) := [l 01, l 02, l 03, l 23, l 31, l 12 ] is an element of the projective 5 space P 5. Check that γ(l) doesn t depend on the particular choice of a basis {x, y} of L. Therefore, we obtain a map γ : L P 5, where L denotes the set of lines of P 3. This map is called Plücker map or Klein map. Löwe (TU Braunschweig) Math. robotics 2009/07/16 17 / 27
18 Plücker Coordinates Affine Lines Let L : p + R v be a line of E 3. Then L corresponds to the projective line [ ] 1 p1 p L = 2 p 3 0 v 1 v 2 v 3 We derive that its Plücker image equals γ(l) = [v 1, v 2, v 3, p 2 v 3 p 3 v 2, p 3 v 1 p 1 v 3, p 1 v 2 p 2 v 2 ]. Thus, γ(l) = [v, p v]. Löwe (TU Braunschweig) Math. robotics 2009/07/16 18 / 27
19 Plücker Coordinates Affine Lines Let L be an affine line and let x, y be two points on L. Then L corresponds to the projective line [ ] [ 1 x1 x L = 2 x 3 1 x1 x = 2 x 3 1 y 1 y 2 y 3 0 y 1 x 1 y 2 x 2 y 3 x 3 ] We derive that its Plücker image equals γ(l) = [y x, x (y x)] = [y x, x y]. Löwe (TU Braunschweig) Math. robotics 2009/07/16 19 / 27
20 Plücker Coordinates Lines At Infinity Let L be a line at infinity, i.e. a projective line which is contained in x 0 = 0. Then [ ] 0 x1 x L = 2 x 3 0 y 1 y 2 y 3 We determine the Plücker coordinates of L: γ(l) = [0, x y]. Löwe (TU Braunschweig) Math. robotics 2009/07/16 20 / 27
21 Plücker Coordinates An affine line L = p + Rv has Plücker coordinates γ(l) = [v, p v] = [x, y]. We compute the scalar product x y = v p v = 0. If L is a line at infinity, then its Plücker coordinates γ(l) = [x, y] satisfy x = 0 and, thus, x y = 0. Theorem If L is a line of P 3, then its Plücker coordinates γ(l) = [x, y] satisfy x y = x T y = 0. Löwe (TU Braunschweig) Math. robotics 2009/07/16 21 / 27
22 Plücker Coordinates The Klein Quadrik Definition The Klein quadric M 4 2 is the set of all points [x, y] P5 which fulfill x T y = x 1 y 1 + x 2 y 2 + x 3 y 3 = 0. M 4 2 is a projective quadric, i.e. a set of projective points satisfying some homogeneous quadratic equation. The Plücker map γ assigns to every line L L a point γ(l) M 4 2 on the Klein quadric. Löwe (TU Braunschweig) Math. robotics 2009/07/16 22 / 27
23 Plücker Coordinates Theorem γ : L M 4 2 is bijective, i.e. 1 Different lines have different Plücker coordinates. 2 Every point on the Klein quadric is a Plücker coordinate of some line. The points [0, y] correspond to a line at infinity [ ] 0 a L = with a b = y. 0 b We derive that L = γ 1 ([0, y]) = y. Computing γ 1 ([x, y]), x 0, x T y = 0, means to solve v = x and p v = y. This implies γ 1 ([x, y]) = x y x 2 + R x. Löwe (TU Braunschweig) Math. robotics 2009/07/16 23 / 27
24 Plücker Coordinates The Action of PGL(3) If L L contains x and y, then its Plücker coordinates are ( ) xi x l ij = det j = x i y j x j y i. Consider an element [a kl ] PGL(3). The new coordinates are x i = k a ikx k and y j = l a jly l. Consequently, the new Plücker coordinates are l y i y j ij = x i y j x j y i ( ) ( ) ( ) ( ) = a ik x k a jl y l a jl x l a ik y k = k,l k a ik a jl (x k y l x l y k ) = k,l l l a ik a jl l kl. k Löwe (TU Braunschweig) Math. robotics 2009/07/16 24 / 27
25 Plücker Coordinates The transformation [a kl ] of P 3 induces a linear transformation of Plücker coordinates: l ij = ( ) xk x a ik a jl l kl where l kl = det l. y k y l k,l Note: l lk = l kl, l kk = 0 l ij = (a i0 a j1 a i1 a j0 )l 01 + (a i0 a j2 a i2 a j0 )l 02 + (a i0 a j3 a i3 a j0 )l (a i2 a j3 a i3 a j2 )l 23 + (a i3 a j1 a i1 a j3 )l 31 + (a i1 a j2 a i2 a j1 )l 12 ( ) ai0 a = det i1 l a j0 a j1 We can read the (6 6) matrix C directly from the equations. Note that C is regular (all possible Plücker coordinats are linear combinations of the columns and there are 6 linearly independent Plücker coordinates). Löwe (TU Braunschweig) Math. robotics 2009/07/16 25 / 27
26 Plücker Coordinates Some Results Consider two elements L 1 = [x, y], L 2 = [u, v] M 4 2. L 1, L 2 generate a 1 dimensional projective subspace G of P 5. We have that L 1 L 2 G M 4 2. Moreover, if L 1, L 2 are skew lines, then G M 4 2 = {L 1, L 2 }. In particular, a flat line pencil is represented by a 1 dimensional projective subspace which is completely contained in M 4 2. Let E P 5 be a 2 dimensional projective subspace. Then E M 4 2 holds if and only if either E is a line pencil in P 3 or is the set of all lines in a plane of P 3. If E M 4 2 doesn t contain any 1 dimensional subspaces of P5, then E is a regulus. Löwe (TU Braunschweig) Math. robotics 2009/07/16 26 / 27
27 Plücker Coordinates We remark that a point [p 0 p] is an element of the line with Plücker coordinates [x, y] if and only if p T y = 0 and p o y + p x = 0. Moreover, a line with Plücker coordinates [x, y] is contained in the plane [u 0, u] if and only if u T x = 0 and u 0 x + u y = 0. Löwe (TU Braunschweig) Math. robotics 2009/07/16 27 / 27
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Projective 3D Geometry (Back to Chapter 2) Lecture 6 2 Singular Value Decomposition Given a
More informationAlgebraic Geometry of Segmentation and Tracking
Ma191b Winter 2017 Geometry of Neuroscience Geometry of lines in 3-space and Segmentation and Tracking This lecture is based on the papers: Reference: Marco Pellegrini, Ray shooting and lines in space.
More informationAlternative interpretation of the Plücker quadric s ambient space and its application
Alternative interpretation of the Plücker quadric s ambient space and its application Georg Nawratil Institute of Discrete Mathematics and Geometry Funded by FWF Project Grant No. P24927-N25 18th ICGG,
More informationThe Manifold of Planes that Intersect Four Straight Lines in Points of a Circle
Journal for Geometry and Graphics Volume 8 (2004), No. 1, 59 68. The Manifold of Planes that Intersect Four Straight Lines in Points of a Circle Hans-Peter Schröcker Institute of Discrete Mathematics and
More informationStewart Gough platforms with linear singularity surface
Stewart Gough platforms with linear singularity surface Georg Nawratil Institute of Discrete Mathematics and Geometry Differential Geometry and Geometric Structures 19th IEEE International Workshop on
More informationMaths for Signals and Systems Linear Algebra in Engineering. Some problems by Gilbert Strang
Maths for Signals and Systems Linear Algebra in Engineering Some problems by Gilbert Strang Problems. Consider u, v, w to be non-zero vectors in R 7. These vectors span a vector space. What are the possible
More informationConic Duality. yyye
Conic Linear Optimization and Appl. MS&E314 Lecture Note #02 1 Conic Duality Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More informationThe Manifold of Planes that Intersect Four Straight Lines in Points of a Circle
The Manifold of Planes that Intersect Four Straight Lines in Points of a Circle Hans-Peter Schröcker Institute of Discrete Mathematics and Geometry Vienna University of Technology March 7, 2004 Our topic
More informationColumn and row space of a matrix
Column and row space of a matrix Recall that we can consider matrices as concatenation of rows or columns. c c 2 c 3 A = r r 2 r 3 a a 2 a 3 a 2 a 22 a 23 a 3 a 32 a 33 The space spanned by columns of
More informationIntroduction to Geometric Algebra Lecture V
Introduction to Geometric Algebra Lecture V Leandro A. F. Fernandes laffernandes@inf.ufrgs.br Manuel M. Oliveira oliveira@inf.ufrgs.br Visgraf - Summer School in Computer Graphics - 2010 CG UFRGS Lecture
More informationChapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces
Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs
More informationProjective geometry for Computer Vision
Department of Computer Science and Engineering IIT Delhi NIT, Rourkela March 27, 2010 Overview Pin-hole camera Why projective geometry? Reconstruction Computer vision geometry: main problems Correspondence
More information3. The Simplex algorithmn The Simplex algorithmn 3.1 Forms of linear programs
11 3.1 Forms of linear programs... 12 3.2 Basic feasible solutions... 13 3.3 The geometry of linear programs... 14 3.4 Local search among basic feasible solutions... 15 3.5 Organization in tableaus...
More informationChapter 3. Quadric hypersurfaces. 3.1 Quadric hypersurfaces Denition.
Chapter 3 Quadric hypersurfaces 3.1 Quadric hypersurfaces. 3.1.1 Denition. Denition 1. In an n-dimensional ane space A; given an ane frame fo;! e i g: A quadric hypersurface in A is a set S consisting
More informationLower bounds on the barrier parameter of convex cones
of convex cones Université Grenoble 1 / CNRS June 20, 2012 / High Performance Optimization 2012, Delft Outline Logarithmically homogeneous barriers 1 Logarithmically homogeneous barriers Conic optimization
More informationEpipolar Geometry Prof. D. Stricker. With slides from A. Zisserman, S. Lazebnik, Seitz
Epipolar Geometry Prof. D. Stricker With slides from A. Zisserman, S. Lazebnik, Seitz 1 Outline 1. Short introduction: points and lines 2. Two views geometry: Epipolar geometry Relation point/line in two
More informationLECTURE 13, THURSDAY APRIL 1, 2004
LECTURE 13, THURSDAY APRIL 1, 2004 FRANZ LEMMERMEYER 1. Parametrizing Curves of Genus 0 As a special case of the theorem that curves of genus 0, in particular those with the maximal number of double points,
More informationPerspective projection and Transformations
Perspective projection and Transformations The pinhole camera The pinhole camera P = (X,,) p = (x,y) O λ = 0 Q λ = O λ = 1 Q λ = P =-1 Q λ X = 0 + λ X 0, 0 + λ 0, 0 + λ 0 = (λx, λ, λ) The pinhole camera
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 More on Single View Geometry Lecture 11 2 In Chapter 5 we introduced projection matrix (which
More informationAs a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9.
II.4 Surface Simplification 37 II.4 Surface Simplification In applications it is often necessary to simplify the data or its representation. One reason is measurement noise, which we would like to eliminate,
More informationA Transformation Based on the Cubic Parabola y = x 3
Journal for Geometry and Graphics Volume 10 (2006), No. 1, 15 21. A Transformation Based on the Cubic Parabola y = x 3 Eugeniusz Korczak ul. św. Rocha 6B m. 5, PL 61-142 Poznań, Poland email: ekorczak@math.put.poznan.pl
More informationDubna 2018: lines on cubic surfaces
Dubna 2018: lines on cubic surfaces Ivan Cheltsov 20th July 2018 Lecture 1: projective plane Complex plane Definition A line in C 2 is a subset that is given by ax + by + c = 0 for some complex numbers
More informationDon t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary?
Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary? Is the converse true? What happens in the classical special case?
More informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More informationHomotopy type of the complement. complex lines arrangements
On the homotopy type of the complement of complex lines arrangements Department of Geometry-Topology Institute of Mathematics, VAST, Hanoi Singapore December 15, 2008 Introduction Let A be an l-arrangement,
More informationBy taking products of coordinate charts, we obtain charts for the Cartesian product of manifolds. Hence the Cartesian product is a manifold.
1 Manifolds A manifold is a space which looks like R n at small scales (i.e. locally ), but which may be very different from this at large scales (i.e. globally ). In other words, manifolds are made by
More informationCS-9645 Introduction to Computer Vision Techniques Winter 2019
Table of Contents Projective Geometry... 1 Definitions...1 Axioms of Projective Geometry... Ideal Points...3 Geometric Interpretation... 3 Fundamental Transformations of Projective Geometry... 4 The D
More informationcalibrated coordinates Linear transformation pixel coordinates
1 calibrated coordinates Linear transformation pixel coordinates 2 Calibration with a rig Uncalibrated epipolar geometry Ambiguities in image formation Stratified reconstruction Autocalibration with partial
More informationTHE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS. Alekseí Yu. Chekunov. 1. Introduction
MATEMATIQKI VESNIK Corrected proof Available online 01.10.2016 originalni nauqni rad research paper THE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS Alekseí Yu. Chekunov Abstract. In this paper
More informationA Short Introduction to Projective Geometry
A Short Introduction to Projective Geometry Vector Spaces over Finite Fields We are interested only in vector spaces of finite dimension. To avoid a notational difficulty that will become apparent later,
More informationRectangular Coordinates in Space
Rectangular Coordinates in Space Philippe B. Laval KSU Today Philippe B. Laval (KSU) Rectangular Coordinates in Space Today 1 / 11 Introduction We quickly review one and two-dimensional spaces and then
More informationAlgebraic Curves in Structure From Motion
Algebraic Curves in Structure From Motion Jeremy Yirmeyahu Kaminski and Mina Teicher Bar-Ilan University, Department of Mathematics and Statistics, Ramat-Gan, Israel. E-mail: {kaminsj,teicher}@macs.biu.ac.il
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Structure Computation Lecture 18 March 22, 2005 2 3D Reconstruction The goal of 3D reconstruction
More informationInverse and Implicit functions
CHAPTER 3 Inverse and Implicit functions. Inverse Functions and Coordinate Changes Let U R d be a domain. Theorem. (Inverse function theorem). If ϕ : U R d is differentiable at a and Dϕ a is invertible,
More informationTHE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS. Alekseí Yu. Chekunov. 1. Introduction
MATEMATIČKI VESNIK MATEMATIQKI VESNIK 69, 1 (2017), 12 22 March 2017 research paper originalni nauqni rad THE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS Alekseí Yu. Chekunov Abstract. In this
More informationINTRODUCTION TO CLUSTER ALGEBRAS
INTRODUCTION TO CLUSTER ALGEBRAS NAN LI (MIT) Cluster algebras are a class of commutative ring, introduced in 000 by Fomin and Zelevinsky, originally to study Lusztig s dual canonical basis and total positivity.
More informationMULTIPLE VIEW GEOMETRY
Chapter 3 MULTIPLE VIEW GEOMETRY Anders Heyden and Marc Pollefeys 3.1 Introduction There exist intricate geometric relations between multiple views of a 3D scene. These relations are related to the camera
More informationHomogeneous coordinates, lines, screws and twists
Homogeneous coordinates, lines, screws and twists In lecture 1 of module 2, a brief mention was made of homogeneous coordinates, lines in R 3, screws and twists to describe the general motion of a rigid
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationRobot Vision: Projective Geometry
Robot Vision: Projective Geometry Ass.Prof. Friedrich Fraundorfer SS 2018 1 Learning goals Understand homogeneous coordinates Understand points, line, plane parameters and interpret them geometrically
More informationMATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.
MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the
More informationPerspective Mappings. Contents
Perspective Mappings David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy
More informationDefinition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.
Resolvable BIBDs Definition Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class. A partition of B into parallel classes (there must be r of them) is
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationPart II. Working and Playing with Geometry
Part II Working and Playing with Geometry 129 Need to play is the mother of all invention. Kristina Brenneman, Portland Tribune, 2005 So far we have prepared a solid basis for projective geometry with
More informationComputer Vision. 2. Projective Geometry in 3D. Lars Schmidt-Thieme
Computer Vision 2. Projective Geometry in 3D Lars Schmidt-Thieme Information Systems and Machine Learning Lab (ISMLL) Institute for Computer Science University of Hildesheim, Germany 1 / 26 Syllabus Mon.
More informationThe end of affine cameras
The end of affine cameras Affine SFM revisited Epipolar geometry Two-view structure from motion Multi-view structure from motion Planches : http://www.di.ens.fr/~ponce/geomvis/lect3.pptx http://www.di.ens.fr/~ponce/geomvis/lect3.pdf
More informationNumerical Optimization
Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y
More informationProjective spaces and Bézout s theorem
Projective spaces and Bézout s theorem êaû{0 Mijia Lai 5 \ laimijia@sjtu.edu.cn Outline 1. History 2. Projective spaces 3. Conics and cubics 4. Bézout s theorem and the resultant 5. Cayley-Bacharach theorem
More informationTwo distance-regular graphs
Two distance-regular graphs Andries E. Brouwer & Dmitrii V. Pasechnik June 11, 2011 Abstract We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B
More informationA COINCIDENCE BETWEEN GENUS 1 CURVES AND CANONICAL CURVES OF LOW DEGREE
A COINCIDENCE BETWEEN GENUS 1 CURVES AND CANONICAL CURVES OF LOW DEGREE AARON LANDESMAN 1. A COINCIDENCE IN DEGREES 3, 4, AND 5 Describing equations for the low degree canonical embeddings are a very classical
More information3D Computer Vision II. Reminder Projective Geometry, Transformations
3D Computer Vision II Reminder Projective Geometry, Transformations Nassir Navab" based on a course given at UNC by Marc Pollefeys & the book Multiple View Geometry by Hartley & Zisserman" October 21,
More informationAuto-calibration. Computer Vision II CSE 252B
Auto-calibration Computer Vision II CSE 252B 2D Affine Rectification Solve for planar projective transformation that maps line (back) to line at infinity Solve as a Householder matrix Euclidean Projective
More informationIntroduction to Computational Manifolds and Applications
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Foundations Prof. Jean Gallier jean@cis.upenn.edu Department
More informationPROJECTIVE CONVEXITY IN P 3 IMPLIES GRASSMANN CONVEXITY
PROJECTIVE CONVEXITY IN P 3 IMPLIES GRASSMANN CONVEXITY B. SHAPIRO Department of Mathematics, University of Stockholm S-10691, Sweden E-mail: shapiro@matematik.su.se M. SHAPIRO Department of Mathematics,
More informationGeometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation
Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation and the type of an object. Even simple scaling turns a
More informationLinear Systems of Conics
Synopsis for Tuesday, November 6 and Thursday, November 8 Linear Systems of Conics As we have already noted, the linear space of global sections Γ(2H) of the divisor 2H on P 2 consists of all the conics.
More informationChapter 4 Concepts from Geometry
Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining
More informationIntroduction to Geometric Algebra Lecture VI
Introduction to Geometric Algebra Lecture VI Leandro A. F. Fernandes laffernandes@inf.ufrgs.br Manuel M. Oliveira oliveira@inf.ufrgs.br Visgraf - Summer School in Computer Graphics - 2010 CG UFRGS Lecture
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More informationMath 2331 Linear Algebra
4.2 Null Spaces, Column Spaces, & Linear Transformations Math 233 Linear Algebra 4.2 Null Spaces, Column Spaces, & Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu
More informationRecent Results in Chain Geometry
Recent Results in Chain Geometry Hans Havlicek Institut für Geometrie, Technische Universität Wien Vienna, Austria Varna, August 2001 Part 1 Basic Concepts W. Benz. Vorlesungen über Geometrie der Algebren.
More informationRevision Problems for Examination 2 in Algebra 1
Centre for Mathematical Sciences Mathematics, Faculty of Science Revision Problems for Examination in Algebra. Let l be the line that passes through the point (5, 4, 4) and is at right angles to the plane
More informationPOLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if
POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :
More information1 Projective Geometry
CIS8, Machine Perception Review Problem - SPRING 26 Instructions. All coordinate systems are right handed. Projective Geometry Figure : Facade rectification. I took an image of a rectangular object, and
More informationLecture 6: Faces, Facets
IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny
More informationConvex Optimization - Chapter 1-2. Xiangru Lian August 28, 2015
Convex Optimization - Chapter 1-2 Xiangru Lian August 28, 2015 1 Mathematical optimization minimize f 0 (x) s.t. f j (x) 0, j=1,,m, (1) x S x. (x 1,,x n ). optimization variable. f 0. R n R. objective
More informationOrientation of manifolds - definition*
Bulletin of the Manifold Atlas - definition (2013) Orientation of manifolds - definition* MATTHIAS KRECK 1. Zero dimensional manifolds For zero dimensional manifolds an orientation is a map from the manifold
More information1 Affine and Projective Coordinate Notation
CS348a: Computer Graphics Handout #9 Geometric Modeling Original Handout #9 Stanford University Tuesday, 3 November 992 Original Lecture #2: 6 October 992 Topics: Coordinates and Transformations Scribe:
More informationLecture 3: Convex sets
Lecture 3: Convex sets Rajat Mittal IIT Kanpur We denote the set of real numbers as R. Most of the time we will be working with space R n and its elements will be called vectors. Remember that a subspace
More informationComputer Vision Projective Geometry and Calibration. Pinhole cameras
Computer Vision Projective Geometry and Calibration Professor Hager http://www.cs.jhu.edu/~hager Jason Corso http://www.cs.jhu.edu/~jcorso. Pinhole cameras Abstract camera model - box with a small hole
More informationMathematical Programming and Research Methods (Part II)
Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types
More informationVectors and the Geometry of Space
Vectors and the Geometry of Space In Figure 11.43, consider the line L through the point P(x 1, y 1, z 1 ) and parallel to the vector. The vector v is a direction vector for the line L, and a, b, and c
More informationLinear Optimization. Andongwisye John. November 17, Linkoping University. Andongwisye John (Linkoping University) November 17, / 25
Linear Optimization Andongwisye John Linkoping University November 17, 2016 Andongwisye John (Linkoping University) November 17, 2016 1 / 25 Overview 1 Egdes, One-Dimensional Faces, Adjacency of Extreme
More informationEpipolar Geometry and the Essential Matrix
Epipolar Geometry and the Essential Matrix Carlo Tomasi The epipolar geometry of a pair of cameras expresses the fundamental relationship between any two corresponding points in the two image planes, and
More informationPerspective Projection in Homogeneous Coordinates
Perspective Projection in Homogeneous Coordinates Carlo Tomasi If standard Cartesian coordinates are used, a rigid transformation takes the form X = R(X t) and the equations of perspective projection are
More informationThe Monge Point and the 3(n+1) Point Sphere of an n-simplex
Journal for Geometry and Graphics Volume 9 (2005), No. 1, 31 36. The Monge Point and the 3(n+1) Point Sphere of an n-simplex Ma lgorzata Buba-Brzozowa Department of Mathematics and Information Sciences,
More informationLine Based Estimation of Object Space Geometry and Camera Motion
Line Based Estimation of Object Space Geometry and Camera Motion Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio
More informationImplicit Matrix Representations of Rational Bézier Curves and Surfaces
Implicit Matrix Representations of Rational Bézier Curves and Surfaces Laurent Busé INRIA Sophia Antipolis, France Laurent.Buse@inria.fr GD/SPM Conference, Denver, USA November 11, 2013 Overall motivation
More informationOverview. By end of the week:
Overview By end of the week: - Know the basics of git - Make sure we can all compile and run a C++/ OpenGL program - Understand the OpenGL rendering pipeline - Understand how matrices are used for geometric
More informationGeometric structures on 2-orbifolds
Geometric structures on 2-orbifolds Section 1: Manifolds and differentiable structures S. Choi Department of Mathematical Science KAIST, Daejeon, South Korea 2010 Fall, Lectures at KAIST S. Choi (KAIST)
More informationComputer Graphics: Geometric Transformations
Computer Graphics: Geometric Transformations Geometric 2D transformations By: A. H. Abdul Hafez Abdul.hafez@hku.edu.tr, 1 Outlines 1. Basic 2D transformations 2. Matrix Representation of 2D transformations
More informationAlmost Curvature Continuous Fitting of B-Spline Surfaces
Journal for Geometry and Graphics Volume 2 (1998), No. 1, 33 43 Almost Curvature Continuous Fitting of B-Spline Surfaces Márta Szilvási-Nagy Department of Geometry, Mathematical Institute, Technical University
More informationThe Geometry Behind the Numerical Reconstruction of Two Photos
The Geometry Behind the Numerical Reconstruction of Two Photos Hellmuth Stachel stachel@dmg.tuwien.ac.at http://www.geometrie.tuwien.ac.at/stachel ICEGD 2007, The 2 nd Internat. Conf. on Eng g Graphics
More informationTechnische Universität München Zentrum Mathematik
Question 1. Incidence matrix with gaps Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 2016 www-m10.ma.tum.de/projektivegeometriess16
More informationMECH 576 Geometry in Mechanics
MECH 576 Geometry in Mechanics Collineation and Cross Ratio in Planar Projective Mapping November 9, 29 An Exercise Examine Fig.. It illustrates an exercise for freshmen at TU-Dresden wherein they must
More informationMath 355: Linear Algebra: Midterm 1 Colin Carroll June 25, 2011
Rice University, Summer 20 Math 355: Linear Algebra: Midterm Colin Carroll June 25, 20 I have adhered to the Rice honor code in completing this test. Signature: Name: Date: Time: Please read the following
More informationCHAPTER 5 SYSTEMS OF EQUATIONS. x y
page 1 of Section 5.1 CHAPTER 5 SYSTEMS OF EQUATIONS SECTION 5.1 GAUSSIAN ELIMINATION matrix form of a system of equations The system 2x + 3y + 4z 1 5x + y + 7z 2 can be written as Ax where b 2 3 4 A [
More informationComputer Vision I - Appearance-based Matching and Projective Geometry
Computer Vision I - Appearance-based Matching and Projective Geometry Carsten Rother 05/11/2015 Computer Vision I: Image Formation Process Roadmap for next four lectures Computer Vision I: Image Formation
More informationENTIRELY CIRCULAR QUARTICS IN THE PSEUDO-EUCLIDEAN PLANE
Acta Math. Hungar., 134 (4) (2012), 571 582 DOI: 10.1007/s10474-011-0174-3 First published online November 29, 2011 ENTIRELY CIRCULAR QUARTICS IN THE PSEUDO-EUCLIDEAN PLANE E. JURKIN and N. KOVAČEVIĆ Faculty
More informationHumanoid Robotics. Projective Geometry, Homogeneous Coordinates. (brief introduction) Maren Bennewitz
Humanoid Robotics Projective Geometry, Homogeneous Coordinates (brief introduction) Maren Bennewitz Motivation Cameras generate a projected image of the 3D world In Euclidian geometry, the math for describing
More informationInvariance of l and the Conic Dual to Circular Points C
Invariance of l and the Conic Dual to Circular Points C [ ] A t l = (0, 0, 1) is preserved under H = v iff H is an affinity: w [ ] l H l H A l l v 0 [ t 0 v! = = w w] 0 0 v = 0 1 1 C = diag(1, 1, 0) is
More informationADDITION LAW ON ELLIPTIC CURVES
ADDITION LAW ON ELLIPTIC CURVES JORDAN HISEL Abstract. This paper will explore projective spaces and elliptic curves. Addition on elliptic curves is rather unintuitive, but with a rigorous definition,
More informationConstrained Optimization and Lagrange Multipliers
Constrained Optimization and Lagrange Multipliers MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Fall 2011 Constrained Optimization In the previous section we found the local or absolute
More informationProjective geometry, camera models and calibration
Projective geometry, camera models and calibration Subhashis Banerjee Dept. Computer Science and Engineering IIT Delhi email: suban@cse.iitd.ac.in January 6, 2008 The main problems in computer vision Image
More informationReal Hypersurfaces of Complex Space Forms in Terms of Ricci -Tensor
TOKYO J. MATH. VOL. 25, NO. 2, 2002 Real Hypersurfaces of Complex Space Forms in Terms of Ricci -Tensor Tatsuyoshi HAMADA Fukuoka University (Communicated by K. Nakamula) Dedicated to Professor Koichi
More information2D Object Definition (1/3)
2D Object Definition (1/3) Lines and Polylines Lines drawn between ordered points to create more complex forms called polylines Same first and last point make closed polyline or polygon Can intersect itself
More informationTechnische Universität München Zentrum Mathematik
Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for
More informationDescriptive Geometry Meets Computer Vision The Geometry of Two Images (# 82)
Descriptive Geometry Meets Computer Vision The Geometry of Two Images (# 8) Hellmuth Stachel stachel@dmg.tuwien.ac.at http://www.geometrie.tuwien.ac.at/stachel th International Conference on Geometry and
More informationCOMP30019 Graphics and Interaction Kinematics
COMP30019 Graphics and Interaction Kinematics Department of Computing and Information Systems The Lecture outline Introduction Forward kinematics Inverse kinematics Kinematics I am robot (am I?) Forward
More information