DOCSLIB.ORG

Projective Geometry for Computer Vision A

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Projective Geometry for Computer Vision A Projective Geometry for Computer Vision A Projective geometry is all geometry. Arthur Cayley (1821–1895) We are familiar with the concept and measurements of Euclidean geometry, which is a good approximation to the properties of a general physical space. However, when we con- sider the imaging process of a camera, the Euclidean geometry becomes insufficient since parallelism, lengths, and angles are no longer preserved in images. In this appendix, we will briefly survey some basic concepts and properties of projective geometry which are extensively used in computer vision. For further information, readers may refer to [1, 3, 7]. Euclidean geometry is actually a subset of the projective geometry, which is more gen- eral and least restrictive in the hierarchy of fundamental geometries. Just like Euclidean geometry, projective geometry exists in any number of dimensions, such as a line in one- dimensional projective space, denoted as P1, corresponds to 1D Euclidean space R1;the projective plane in P2 is analogous to 2D Euclidean plane; the three-dimensional projective space P3 is related to 3D Euclidean space. A.1 2D Projective Geometry A.1.1 Points and Lines In Euclidean space R2, a point can be denoted as x¯ =[x,y]T , a line passing through the point can be represented as l1x + l2y + l3 = 0 (A.1) If we multiply the same nonzero scalar w on both sides of (A.1), we have l1xw + l2yw + l3w = 0 (A.2) G. Wang, Q.M.J. Wu, Guide to Three Dimensional Structure and Motion Factorization, 183 Advances in Pattern Recognition, DOI 10.1007/978-0-85729-046-5, © Springer-Verlag London Limited 2011 184 A Projective Geometry for Computer Vision =[ ]T =[ ]T A Clearly, (A.1) and (A.2) represent the same line. Let x xw,yw,w , l l1,l2,l3 , then the line (A.2) is represented as xT l = lT x = 0 (A.3) where the line is represented by the vector l, and any point on the line is denoted by x. We call the 3-vector x the homogeneous coordinates of a point in P2, which represents the same point as inhomogeneous coordinates x¯ =[xw/w,yw/w]T =[x,y]T . Similarly, we call l the homogeneous representation of the line, since for any nonzero scalar k, l and kl represent the same line. From (A.3), we find that there is actually no difference between the representation of a line and the representation of a point. This is known as the duality principal. Given =[ ]T =[ ]T two lines l l1,l2,l3 and l l1,l2,l3 , their intersection defines a point that can be computed from x = l × l =[l]×l (A.4) where ‘×’ denotes the cross product of two vectors, ⎡ ⎤ 0 −t3 t2 ⎣ ⎦ [l]× = t3 0 −t1 −t2 t1 0 denotes the antisymmetric matrix of vector l. Similarly, a line passing through two points x and x can be computed from l = x × x =[x]×x =[x ]×x (A.5) Any point with homogeneous coordinates x =[x,y,0]T corresponds to a point at infin- ity, or ideal point. Whereas its corresponding inhomogeneous point x¯ =[x/0,y/0]T makes no sense. In space plane, all ideal points can be written as [x,y,0]T . The set of these points lies on a single line l∞, which is called the line at infinity. From (A.3), it is easy to obtain the coordinates of the line at infinity l∞ =[0, 0, 1]T . A.1.2 Conics and Duel Conics In Euclidean plane, the equation of a conic in inhomogeneous coordinates is written as ax2 + bxy + cy2 + dx + ey + f = 0 (A.6) If we adopt homogeneous coordinates and denote any point on the conic by x = T [x1,x2,x3] , then the conic (A.6) can be written as the following quadratic homogeneous expression. 2 + + 2 + + + = ax1 bx1x2 cx2 dx1x3 ex2x3 fx3 0 (A.7) A.1 2D Projective Geometry 185 Fig. A.1 A point conic (a) and its dual line conic (b). x is a point on the conic xT Cx = 0, l is a line tangent to C at point x which satisfies lT C∗l = 0 or in a matrix form as ⎡ ⎤ ⎡ ⎤ ab/2 d/2 x1 T ⎣ ⎦ ⎣ ⎦ x Cx=[x1,x2,x3] b/2 ce/2 x2 = 0 (A.8) d/2 e/2 f x3 where C is the conic coefficient matrix which is symmetric. A conic has five degrees of freedom since multiplying C by any nonzero scalar does not affect the above equation. Therefore, five points in P2 at a general position (no three points are collinear) can uniquely determine a conic. Generally, a conic matrix C is of full rank. In degenerate cases, it may degenerate to two lines when rank(C) = 2, or one repeated line when rank(C) = 1. The conic defined in (A.8) is defined by points in P2, which is usually termed as point conic. According to duality principal, we can obtain the dual line conic as ∗ lT C l = 0 (A.9) where the notation C∗ stands for the adjoint matrix of C. The dual conic is also called conic envelope, as shown in Fig. A.1, which is formulated by lines tangent to C. For conics (A.8) and (A.9), we have the following Results. Result A.1 The line l tangent to the non-degenerate conic C at point x is given by l = Cx. In duality, the tangent point x to the non-degenerate line conic C∗ at line l is given by x = C∗l. Result A.2 For non-degenerate conic C and its duality C∗, we have C∗ = C−1, and (C∗)∗ = C. The line conics may degenerate to two points when rank(C∗) = 2, or one repeated point when rank(C∗) = 1, and (C∗)∗ = C in degenerate cases. Any point x and a conic C define a line l = Cx, as shown in Fig. A.2. Then x and l forms a pole-polar relationship. The point x is called the pole of line l with respect to conic C, and the line l is called the polar of point x with respect to conic C. It is easy to verify the following Result. 186 A Projective Geometry for Computer Vision Fig. A.2 The pole-polar A relationship. The line l = Cx is the polar of point x with respect to conic C,andthe point x = C−1l is the pole of l with respect to conic C Result A.3 The polar line l = Cx intersects the conic C at two points x1 and x2, then the two lines l1 = x × x1 and l2 = x × x2 are tangent to the conic C. If the point x is on the conic, then the polar is the tangent line to C at x. Result A.4 Any two points x and y satisfying xT Cy = 0 are called conjugate points with respect to C. The set of all conjugate points of x forms the polar line l. If x is on the polar of x, then x is also on the polar of x since xT Cx = xT Cx = 0. In duality, two lines l and l are conjugate with respect to C if lT Cl = 0. Result A.5 There are a pair of conjugate ideal points ⎡ ⎤ ⎡ ⎤ 1 1 i = ⎣i⎦ , j = ⎣−i⎦ 0 0 on the line at infinity l∞. We call i and j the canonical forms of circular points. Essentially, the circular points are the intersection of any circle with the line at infinity. Thus three additional points can uniquely determine a circle, which is equivalent to the fact that five general points can uniquely determine a general conic. The dual of the circular point forms ∗ T T a degenerated line conic given by C∞ = ij + ji . A.1.3 2D Projective Transformation Two dimensional projective transformation is an invertible linear mapping H : P2 → P2 which is a 3 × 3 matrix. The transformation is also known as projectivity, or homography. T The mapping of a point x =[x1,x2,x3] can be written as ⎡ ⎤ ⎡ ⎤ ⎡ ⎤ x1 h11 h12 h13 x1 ⎣ ⎦ = ⎣ ⎦ ⎣ ⎦ x2 h21 h22 h23 x2 (A.10) x3 h31 h32 h33 x3 A.2 3D Projective Geometry 187 or more briefly as x = Hx. This is a homogeneous transformation which is defined up to scale. Thus there are only 8 degrees of freedom on H. Four pairs of corresponding points can uniquely determine the transformation if no three points are collinear. The transforma- tion (A.10) is defined by points. Result A.6 Under a point transformation x = Hx, a line l is transformed to l via − l = H 1l (A.11) A conic C is transformed to C via − − C = H T CH 1 (A.12) and a dual conic C∗ is transformed to C∗ via ∗ ∗ C = HC HT (A.13) All projective transformations form a group which is called projective linear group. There are some specializations or subgroups of the transformation, such as affine group, Euclidean group, and oriented Euclidean group. Different transformations have different geometric invariance and properties. For example, length and area are invariant under Euclidean transformation; parallelism and line at infinity are invariant under affine trans- formation; general projective transformation preserves concurrency, collinearity, and cross ratio. A.2 3D Projective Geometry A.2.1 Points, Lines, and Planes In 3D space P3, the homogeneous coordinates of a point is represented by a 4-vector T as X =[x1,x2,x3,x4] , which is defined up to a scale since X and sX (s = 0) repre- sent the same point.
Load more

Recommended publications
  • Globally Optimal Affine and Metric Upgrades in Stratified Autocalibration
    Globally Optimal Affine and Metric Upgrades in Stratified Autocalibration Manmohan Chandrakery Sameer Agarwalz David Kriegmany Serge Belongiey [email protected] [email protected] [email protected] [email protected] y University of California, San Diego z University of Washington, Seattle Abstract parameters of the cameras, which is commonly approached by estimating the dual image of the absolute conic (DIAC). We present a practical, stratified autocalibration algo- A variety of linear methods exist towards this end, how- rithm with theoretical guarantees of global optimality. Given ever, they are known to perform poorly in the presence of a projective reconstruction, the first stage of the algorithm noise [10]. Perhaps more significantly, most methods a pos- upgrades it to affine by estimating the position of the plane teriori impose the positive semidefiniteness of the DIAC, at infinity. The plane at infinity is computed by globally which might lead to a spurious calibration. Thus, it is im- minimizing a least squares formulation of the modulus con- portant to impose the positive semidefiniteness of the DIAC straints. In the second stage, the algorithm upgrades this within the optimization, not as a post-processing step. affine reconstruction to a metric one by globally minimizing This paper proposes global minimization algorithms for the infinite homography relation to compute the dual image both stages of stratified autocalibration that furnish theoreti- of the absolute conic (DIAC). The positive semidefiniteness cal certificates of optimality. That is, they return a solution at of the DIAC is explicitly enforced as part of the optimization most away from the global minimum, for arbitrarily small .
    [Show full text]
  • Affine Reflection Group Codes
    Affine Reflection Group Codes Terasan Niyomsataya1, Ali Miri1,2 and Monica Nevins2 School of Information Technology and Engineering (SITE)1 Department of Mathematics and Statistics2 University of Ottawa, Ottawa, Canada K1N 6N5 email: {tniyomsa,samiri}@site.uottawa.ca, [email protected] Abstract This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irreducible affine reflection groups of rank n ≥ 2, for varying stabilizer subgroups. Moreover, we use a detailed analysis of the geometry of affine reflection groups to produce an efficient decoding algorithm which is equivalent to the maximum-likelihood decoder. Its complexity depends only on the dimension of the vector space containing the codewords, and not on the number of codewords. We give several examples of the decoding algorithm, both to demonstrate its correctness and to show how, in small rank cases, it may be further streamlined by exploiting additional symmetries of the group. 1 1 Introduction Slepian [11] introduced group codes whose codewords represent a finite set of signals combining coding and modulation, for the Gaussian channel. A thorough survey of group codes can be found in [8]. The codewords lie on a sphere in n−dimensional Euclidean space Rn with equal nearest-neighbour distances. This gives congruent maximum-likelihood (ML) decoding regions, and hence equal error probability, for all codewords. Given a group G with a representation (action) on Rn, that is, an 1Keywords: Group codes, initial vector problem, decoding schemes, affine reflection groups 1 orthogonal n × n matrix Og for each g ∈ G, a group code generated from G is given by the set of all cg = Ogx0 (1) n for all g ∈ G where x0 = (x1, .
    [Show full text]
  • 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]
  • Robot 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 . Understand point, line, plane interactions geometrically . Analytical calculations with lines, points and planes . Understand the difference between Euclidean and projective space . Understand the properties of parallel lines and planes in projective space . Understand the concept of the line and plane at infinity 2 Outline . 1D projective geometry . 2D projective geometry ▫ Homogeneous coordinates ▫ Points, Lines ▫ Duality . 3D projective geometry ▫ Points, Lines, Planes ▫ Duality ▫ Plane at infinity 3 Literature . Multiple View Geometry in Computer Vision. Richard Hartley and Andrew Zisserman. Cambridge University Press, March 2004. Mundy, J.L. and Zisserman, A., Geometric Invariance in Computer Vision, Appendix: Projective Geometry for Machine Vision, MIT Press, Cambridge, MA, 1992 . Available online: www.cs.cmu.edu/~ph/869/papers/zisser-mundy.pdf 4 Motivation – Image formation [Source: Charles Gunn] 5 Motivation – Parallel lines [Source: Flickr] 6 Motivation – Epipolar constraint X world point epipolar plane x x’ x‘TEx=0 C T C’ R 7 Euclidean geometry vs. projective geometry Definitions: . Geometry is the teaching of points, lines, planes and their relationships and properties (angles) . Geometries are defined based on invariances (what is changing if you transform a configuration of points, lines etc.) . Geometric transformations
    [Show full text]
  • Arxiv:1702.00823V1 [Stat.OT] 2 Feb 2017
    Nonparametric Spherical Regression Using Diffeomorphic Mappings M. Rosenthala, W. Wub, E. Klassen,c, Anuj Srivastavab aNaval Surface Warfare Center, Panama City Division - X23, 110 Vernon Avenue, Panama City, FL 32407-7001 bDepartment of Statistics, Florida State University, Tallahassee, FL 32306 cDepartment of Mathematics, Florida State University, Tallahassee, FL 32306 Abstract Spherical regression explores relationships between variables on spherical domains. We develop a nonparametric model that uses a diffeomorphic map from a sphere to itself. The restriction of this mapping to diffeomorphisms is natural in several settings. The model is estimated in a penalized maximum-likelihood framework using gradient-based optimization. Towards that goal, we specify a first-order roughness penalty using the Jacobian of diffeomorphisms. We compare the prediction performance of the proposed model with state-of-the-art methods using simulated and real data involving cloud deformations, wind directions, and vector-cardiograms. This model is found to outperform others in capturing relationships between spherical variables. Keywords: Nonlinear; Nonparametric; Riemannian Geometry; Spherical Regression. 1. Introduction Spherical data arises naturally in a variety of settings. For instance, a random vector with unit norm constraint is naturally studied as a point on a unit sphere. The statistical analysis of such random variables was pioneered by Mardia and colleagues (1972; 2000), in the context of directional data. Common application areas where such data originates include geology, gaming, meteorology, computer vision, and bioinformatics. Examples from geographical domains include plate tectonics (McKenzie, 1957; Chang, 1986), animal migrations, and tracking of weather for- mations. As mobile devices become increasingly advanced and prevalent, an abundance of new spherical data is being collected in the form of geographical coordinates.
    [Show full text]
  • Arxiv:1910.10745V1 [Cond-Mat.Str-El] 23 Oct 2019 2.2 Symmetry-Protected Time Crystals
    A Brief History of Time Crystals Vedika Khemania,b,∗, Roderich Moessnerc, S. L. Sondhid aDepartment of Physics, Harvard University, Cambridge, Massachusetts 02138, USA bDepartment of Physics, Stanford University, Stanford, California 94305, USA cMax-Planck-Institut f¨urPhysik komplexer Systeme, 01187 Dresden, Germany dDepartment of Physics, Princeton University, Princeton, New Jersey 08544, USA Abstract The idea of breaking time-translation symmetry has fascinated humanity at least since ancient proposals of the per- petuum mobile. Unlike the breaking of other symmetries, such as spatial translation in a crystal or spin rotation in a magnet, time translation symmetry breaking (TTSB) has been tantalisingly elusive. We review this history up to recent developments which have shown that discrete TTSB does takes place in periodically driven (Floquet) systems in the presence of many-body localization (MBL). Such Floquet time-crystals represent a new paradigm in quantum statistical mechanics — that of an intrinsically out-of-equilibrium many-body phase of matter with no equilibrium counterpart. We include a compendium of the necessary background on the statistical mechanics of phase structure in many- body systems, before specializing to a detailed discussion of the nature, and diagnostics, of TTSB. In particular, we provide precise definitions that formalize the notion of a time-crystal as a stable, macroscopic, conservative clock — explaining both the need for a many-body system in the infinite volume limit, and for a lack of net energy absorption or dissipation. Our discussion emphasizes that TTSB in a time-crystal is accompanied by the breaking of a spatial symmetry — so that time-crystals exhibit a novel form of spatiotemporal order.
    [Show full text]
  • 2D and 3D Transformations, Homogeneous Coordinates Lecture 03
    2D and 3D Transformations, Homogeneous Coordinates Lecture 03 Patrick Karlsson [email protected] Centre for Image Analysis Uppsala University Computer Graphics November 6 2006 Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 1 / 23 Reading Instructions Chapters 4.1–4.9. Edward Angel. “Interactive Computer Graphics: A Top-down Approach with OpenGL”, Fourth Edition, Addison-Wesley, 2004. Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 2 / 23 Todays lecture ... in the pipeline Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 3 / 23 Scalars, points, and vectors Scalars α, β Real (or complex) numbers. Points P, Q Locations in space (but no size or shape). Vectors u, v Directions in space (magnitude but no position). Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 4 / 23 Mathematical spaces Scalar field A set of scalars obeying certain properties. New scalars can be formed through addition and multiplication. (Linear) Vector space Made up of scalars and vectors. New vectors can be created through scalar-vector multiplication, and vector-vector addition. Affine space An extended vector space that include points. This gives us additional operators, such as vector-point addition, and point-point subtraction. Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 5 / 23 Data types Polygon based objects Objects are described using polygons. A polygon is defined by its vertices (i.e., points). Transformations manipulate the vertices, thus manipulates the objects. Some examples in 2D Scalar α 1 float. Point P(x, y) 2 floats. Vector v(x, y) 2 floats. Matrix M 4 floats.
    [Show full text]
  • The Fractal Dimension of Product Sets
    THE FRACTAL DIMENSION OF PRODUCT SETS A PREPRINT Clayton Moore Williams Brigham Young University [email protected] Machiel van Frankenhuijsen Utah Valley University [email protected] February 26, 2021 ABSTRACT Using methods from nonstandard analysis, we define a nonstandard Minkowski dimension which exists for all bounded sets and which has the property that dim(A × B) = dim(A) + dim(B). That is, our new dimension is “product-summable”. To illustrate our theorem we generalize an example of Falconer’s1 to show that the standard upper Minkowski dimension, as well as the Hausdorff di- mension, are not product-summable. We also include a method for creating sets of arbitrary rational dimension. Introduction There are several notions of dimension used in fractal geometry, which coincide for many sets but have important, distinct properties. Indeed, determining the most proper notion of dimension has been a major problem in geometric measure theory from its inception, and debate over what it means for a set to be fractal has often reduced to debate over the propernotion of dimension. A classical example is the “Devil’s Staircase” set, which is intuitively fractal but which has integer Hausdorff dimension2. As Falconer notes in The Geometry of Fractal Sets3, the Hausdorff dimension is “undoubtedly, the most widely investigated and most widely used” notion of dimension. It can, however, be difficult to compute or even bound (from below) for many sets. For this reason one might want to work with the Minkowski dimension, for which one can often obtain explicit formulas. Moreover, the Minkowski dimension is computed using finite covers and hence has a series of useful identities which can be used in analysis.
    [Show full text]
  • Limits of Geometries
    Limits of Geometries Daryl Cooper, Jeffrey Danciger, and Anna Wienhard August 31, 2018 Abstract A geometric transition is a continuous path of geometric structures that changes type, mean- ing that the model geometry, i.e. the homogeneous space on which the structures are modeled, abruptly changes. In order to rigorously study transitions, one must define a notion of geometric limit at the level of homogeneous spaces, describing the basic process by which one homogeneous geometry may transform into another. We develop a general framework to describe transitions in the context that both geometries involved are represented as sub-geometries of a larger ambi- ent geometry. Specializing to the setting of real projective geometry, we classify the geometric limits of any sub-geometry whose structure group is a symmetric subgroup of the projective general linear group. As an application, we classify all limits of three-dimensional hyperbolic geometry inside of projective geometry, finding Euclidean, Nil, and Sol geometry among the 2 limits. We prove, however, that the other Thurston geometries, in particular H × R and SL^2 R, do not embed in any limit of hyperbolic geometry in this sense. 1 Introduction Following Felix Klein's Erlangen Program, a geometry is given by a pair (Y; H) of a Lie group H acting transitively by diffeomorphisms on a manifold Y . Given a manifold of the same dimension as Y , a geometric structure modeled on (Y; H) is a system of local coordinates in Y with transition maps in H. The study of deformation spaces of geometric structures on manifolds is a very rich mathematical subject, with a long history going back to Klein and Ehresmann, and more recently Thurston.
    [Show full text]
  • Feature Matching and Heat Flow in Centro-Affine Geometry
    Symmetry, Integrability and Geometry: Methods and Applications SIGMA 16 (2020), 093, 22 pages Feature Matching and Heat Flow in Centro-Affine Geometry Peter J. OLVER y, Changzheng QU z and Yun YANG x y School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA E-mail: [email protected] URL: http://www.math.umn.edu/~olver/ z School of Mathematics and Statistics, Ningbo University, Ningbo 315211, P.R. China E-mail: [email protected] x Department of Mathematics, Northeastern University, Shenyang, 110819, P.R. China E-mail: [email protected] Received April 02, 2020, in final form September 14, 2020; Published online September 29, 2020 https://doi.org/10.3842/SIGMA.2020.093 Abstract. In this paper, we study the differential invariants and the invariant heat flow in centro-affine geometry, proving that the latter is equivalent to the inviscid Burgers' equa- tion. Furthermore, we apply the centro-affine invariants to develop an invariant algorithm to match features of objects appearing in images. We show that the resulting algorithm com- pares favorably with the widely applied scale-invariant feature transform (SIFT), speeded up robust features (SURF), and affine-SIFT (ASIFT) methods. Key words: centro-affine geometry; equivariant moving frames; heat flow; inviscid Burgers' equation; differential invariant; edge matching 2020 Mathematics Subject Classification: 53A15; 53A55 1 Introduction The main objective in this paper is to study differential invariants and invariant curve flows { in particular the heat flow { in centro-affine geometry. In addition, we will present some basic applications to feature matching in camera images of three-dimensional objects, comparing our method with other popular algorithms.
    [Show full text]
  • The Projective Geometry of the Spacetime Yielded by Relativistic Positioning Systems and Relativistic Location Systems Jacques Rubin
    The projective geometry of the spacetime yielded by relativistic positioning systems and relativistic location systems Jacques Rubin To cite this version: Jacques Rubin. The projective geometry of the spacetime yielded by relativistic positioning systems and relativistic location systems. 2014. hal-00945515 HAL Id: hal-00945515 https://hal.inria.fr/hal-00945515 Submitted on 12 Feb 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The projective geometry of the spacetime yielded by relativistic positioning systems and relativistic location systems Jacques L. Rubin (email: [email protected]) Université de Nice–Sophia Antipolis, UFR Sciences Institut du Non-Linéaire de Nice, UMR7335 1361 route des Lucioles, F-06560 Valbonne, France (Dated: February 12, 2014) As well accepted now, current positioning systems such as GPS, Galileo, Beidou, etc. are not primary, relativistic systems. Nevertheless, genuine, relativistic and primary positioning systems have been proposed recently by Bahder, Coll et al. and Rovelli to remedy such prior defects. These new designs all have in common an equivariant conformal geometry featuring, as the most basic ingredient, the spacetime geometry. In a first step, we show how this conformal aspect can be the four-dimensional projective part of a larger five-dimensional geometry.
    [Show full text]
  • The Affine Group of a Lie Group
    THE AFFINE GROUP OF A LIE GROUP JOSEPH A. WOLF1 1. If G is a Lie group, then the group Aut(G) of all continuous auto- morphisms of G has a natural Lie group structure. This gives the semi- direct product A(G) = G-Aut(G) the structure of a Lie group. When G is a vector group R", A(G) is the ordinary affine group A(re). Follow- ing L. Auslander [l ] we will refer to A(G) as the affine group of G, and regard it as a transformation group on G by (g, a): h-^g-a(h) where g, hEG and aGAut(G) ; in the case of a vector group, this is the usual action on A(») on R". If B is a compact subgroup of A(n), then it is well known that B has a fixed point on R", i.e., that there is a point xGR" such that b(x)=x for every bEB. For A(ra) is contained in the general linear group GL(« + 1, R) in the usual fashion, and B (being compact) must be conjugate to a subgroup of the orthogonal group 0(w + l). This conjugation can be done leaving fixed the (« + 1, w + 1)-place matrix entries, and is thus possible by an element of k(n). This done, the translation-parts of elements of B must be zero, proving the assertion. L. Auslander [l] has extended this theorem to compact abelian subgroups of A(G) when G is connected, simply connected and nil- potent. We will give a further extension.
    [Show full text]