Computer Vision: Projection
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
CS 543: Computer Graphics Lecture 7 (Part I): Projection Emmanuel
CS 543: Computer Graphics Lecture 7 (Part I): Projection Emmanuel Agu 3D Viewing and View Volume n Recall: 3D viewing set up Projection Transformation n View volume can have different shapes (different looks) n Different types of projection: parallel, perspective, orthographic, etc n Important to control n Projection type: perspective or orthographic, etc. n Field of view and image aspect ratio n Near and far clipping planes Perspective Projection n Similar to real world n Characterized by object foreshortening n Objects appear larger if they are closer to camera n Need: n Projection center n Projection plane n Projection: Connecting the object to the projection center camera projection plane Projection? Projectors Object in 3 space Projected image VRP COP Orthographic Projection n No foreshortening effect – distance from camera does not matter n The projection center is at infinite n Projection calculation – just drop z coordinates Field of View n Determine how much of the world is taken into the picture n Larger field of view = smaller object projection size center of projection field of view (view angle) y y z q z x Near and Far Clipping Planes n Only objects between near and far planes are drawn n Near plane + far plane + field of view = Viewing Frustum Near plane Far plane y z x Viewing Frustrum n 3D counterpart of 2D world clip window n Objects outside the frustum are clipped Near plane Far plane y z x Viewing Frustum Projection Transformation n In OpenGL: n Set the matrix mode to GL_PROJECTION n Perspective projection: use • gluPerspective(fovy, -
An Analytical Introduction to Descriptive Geometry
An analytical introduction to Descriptive Geometry Adrian B. Biran, Technion { Faculty of Mechanical Engineering Ruben Lopez-Pulido, CEHINAV, Polytechnic University of Madrid, Model Basin, and Spanish Association of Naval Architects Avraham Banai Technion { Faculty of Mathematics Prepared for Elsevier (Butterworth-Heinemann), Oxford, UK Samples - August 2005 Contents Preface x 1 Geometric constructions 1 1.1 Introduction . 2 1.2 Drawing instruments . 2 1.3 A few geometric constructions . 2 1.3.1 Drawing parallels . 2 1.3.2 Dividing a segment into two . 2 1.3.3 Bisecting an angle . 2 1.3.4 Raising a perpendicular on a given segment . 2 1.3.5 Drawing a triangle given its three sides . 2 1.4 The intersection of two lines . 2 1.4.1 Introduction . 2 1.4.2 Examples from practice . 2 1.4.3 Situations to avoid . 2 1.5 Manual drawing and computer-aided drawing . 2 i ii CONTENTS 1.6 Exercises . 2 Notations 1 2 Introduction 3 2.1 How we see an object . 3 2.2 Central projection . 4 2.2.1 De¯nition . 4 2.2.2 Properties . 5 2.2.3 Vanishing points . 17 2.2.4 Conclusions . 20 2.3 Parallel projection . 23 2.3.1 De¯nition . 23 2.3.2 A few properties . 24 2.3.3 The concept of scale . 25 2.4 Orthographic projection . 27 2.4.1 De¯nition . 27 2.4.2 The projection of a right angle . 28 2.5 The two-sheet method of Monge . 36 2.6 Summary . 39 2.7 Examples . 43 2.8 Exercises . -
Scaling Algorithms and Tropical Methods in Numerical Matrix Analysis
Scaling Algorithms and Tropical Methods in Numerical Matrix Analysis: Application to the Optimal Assignment Problem and to the Accurate Computation of Eigenvalues Meisam Sharify To cite this version: Meisam Sharify. Scaling Algorithms and Tropical Methods in Numerical Matrix Analysis: Application to the Optimal Assignment Problem and to the Accurate Computation of Eigenvalues. Numerical Analysis [math.NA]. Ecole Polytechnique X, 2011. English. pastel-00643836 HAL Id: pastel-00643836 https://pastel.archives-ouvertes.fr/pastel-00643836 Submitted on 24 Nov 2011 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. Th`esepr´esent´eepour obtenir le titre de DOCTEUR DE L'ECOLE´ POLYTECHNIQUE Sp´ecialit´e: Math´ematiquesAppliqu´ees par Meisam Sharify Scaling Algorithms and Tropical Methods in Numerical Matrix Analysis: Application to the Optimal Assignment Problem and to the Accurate Computation of Eigenvalues Jury Marianne Akian Pr´esident du jury St´ephaneGaubert Directeur Laurence Grammont Examinateur Laura Grigori Examinateur Andrei Sobolevski Rapporteur Fran¸coiseTisseur Rapporteur Paul Van Dooren Examinateur September 2011 Abstract Tropical algebra, which can be considered as a relatively new field in Mathemat- ics, emerged in several branches of science such as optimization, synchronization of production and transportation, discrete event systems, optimal control, oper- ations research, etc. -
Viewing in 3D
Viewing in 3D Viewing in 3D Foley & Van Dam, Chapter 6 • Transformation Pipeline • Viewing Plane • Viewing Coordinate System • Projections • Orthographic • Perspective OpenGL Transformation Pipeline Viewing Coordinate System Homogeneous coordinates in World System zw world yw ModelViewModelView Matrix Matrix xw Tractor Viewing System Viewer Coordinates System ProjectionProjection Matrix Matrix Clip y Coordinates v Front- xv ClippingClipping Wheel System P0 zv ViewportViewport Transformation Transformation ne pla ing Window Coordinates View Specifying the Viewing Coordinates Specifying the Viewing Coordinates • Viewing Coordinates system, [xv, yv, zv], describes 3D objects with respect to a viewer zw y v P v xv •A viewing plane (projection plane) is set up N P0 zv perpendicular to zv and aligned with (xv,yv) yw xw ne pla ing • In order to specify a viewing plane we have View to specify: •P0=(x0,y0,z0) is the point where a camera is located •a vector N normal to the plane • P is a point to look-at •N=(P-P)/|P -P| is the view-plane normal vector •a viewing-up vector V 0 0 •V=zw is the view up vector, whose projection onto • a point on the viewing plane the view-plane is directed up Viewing Coordinate System Projections V u N z N ; x ; y z u x • Viewing 3D objects on a 2D display requires a v v V u N v v v mapping from 3D to 2D • The transformation M, from world-coordinate into viewing-coordinates is: • A projection is formed by the intersection of certain lines (projectors) with the view plane 1 2 3 ª x v x v x v 0 º ª 1 0 0 x 0 º « » « -
Implementation of Projections
CS488 Implementation of projections Luc RENAMBOT 1 3D Graphics • Convert a set of polygons in a 3D world into an image on a 2D screen • After theoretical view • Implementation 2 Transformations P(X,Y,Z) 3D Object Coordinates Modeling Transformation 3D World Coordinates Viewing Transformation 3D Camera Coordinates Projection Transformation 2D Screen Coordinates Window-to-Viewport Transformation 2D Image Coordinates P’(X’,Y’) 3 3D Rendering Pipeline 3D Geometric Primitives Modeling Transform into 3D world coordinate system Transformation Lighting Illuminate according to lighting and reflectance Viewing Transform into 3D camera coordinate system Transformation Projection Transform into 2D camera coordinate system Transformation Clipping Clip primitives outside camera’s view Scan Draw pixels (including texturing, hidden surface, etc.) Conversion Image 4 Orthographic Projection 5 Perspective Projection B F 6 Viewing Reference Coordinate system 7 Projection Reference Point Projection Reference Point (PRP) Center of Window (CW) View Reference Point (VRP) View-Plane Normal (VPN) 8 Implementation • Lots of Matrices • Orthographic matrix • Perspective matrix • 3D World → Normalize to the canonical view volume → Clip against canonical view volume → Project onto projection plane → Translate into viewport 9 Canonical View Volumes • Used because easy to clip against and calculate intersections • Strategies: convert view volumes into “easy” canonical view volumes • Transformations called Npar and Nper 10 Parallel Canonical Volume X or Y Defined by 6 planes -
Squaring the Circle in Panoramas
Squaring the Circle in Panoramas Lihi Zelnik-Manor1 Gabriele Peters2 Pietro Perona1 1. Department of Electrical Engineering 2. Informatik VII (Graphische Systeme) California Institute of Technology Universitat Dortmund Pasadena, CA 91125, USA Dortmund, Germany http://www.vision.caltech.edu/lihi/SquarePanorama.html Abstract and conveying the vivid visual impression of large panora- mas. Such mosaics are superior to panoramic pictures taken Pictures taken by a rotating camera cover the viewing with conventional fish-eye lenses in many respects: they sphere surrounding the center of rotation. Having a set of may span wider fields of view, they have unlimited reso- images registered and blended on the sphere what is left to lution, they make use of cheaper optics and they are not be done, in order to obtain a flat panorama, is projecting restricted to the projection geometry imposed by the lens. the spherical image onto a picture plane. This step is unfor- The geometry of single view point panoramas has long tunately not obvious – the surface of the sphere may not be been well understood [12, 21]. This has been used for mo- flattened onto a page without some form of distortion. The saicing of video sequences (e.g., [13, 20]) as well as for ob- objective of this paper is discussing the difficulties and op- taining super-resolution images (e.g., [6, 23]). By contrast portunities that are connected to the projection from view- when the point of view changes the mosaic is ‘impossible’ ing sphere to image plane. We first explore a number of al- unless the structure of the scene is very special. -
THESIS MULTIDIMENSIONAL SCALING: INFINITE METRIC MEASURE SPACES Submitted by Lara Kassab Department of Mathematics in Partial Fu
THESIS MULTIDIMENSIONAL SCALING: INFINITE METRIC MEASURE SPACES Submitted by Lara Kassab Department of Mathematics In partial fulfillment of the requirements For the Degree of Master of Science Colorado State University Fort Collins, Colorado Spring 2019 Master’s Committee: Advisor: Henry Adams Michael Kirby Bailey Fosdick Copyright by Lara Kassab 2019 All Rights Reserved ABSTRACT MULTIDIMENSIONAL SCALING: INFINITE METRIC MEASURE SPACES Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We study a notion of MDS on infinite metric measure spaces, along with its optimality properties and goodness of fit. This allows us to study the MDS embeddings of the geodesic circle S1 into Rm for all m, and to ask questions about the MDS embeddings of the geodesic n-spheres Sn into Rm. Furthermore, we address questions on convergence of MDS. For instance, if a sequence of metric measure spaces converges to a fixed metric measure space X, then in what sense do the MDS embeddings of these spaces converge to the MDS embedding of X? Convergence is understood when each metric space in the sequence has the same finite number of points, or when each metric space has a finite number of points tending to infinity. We are also interested in notions of convergence when each metric space in the sequence has an arbitrary (possibly infinite) number of points. ii ACKNOWLEDGEMENTS We would like to thank Henry Adams, Mark Blumstein, Bailey Fosdick, Michael Kirby, Henry Kvinge, Facundo Mémoli, Louis Scharf, the students in Michael Kirby’s Spring 2018 class, and the Pattern Analysis Laboratory at Colorado State University for their helpful conversations and support throughout this project. -
EX NIHILO – Dahlgren 1
EX NIHILO – Dahlgren 1 EX NIHILO: A STUDY OF CREATIVITY AND INTERDISCIPLINARY THOUGHT-SYMMETRY IN THE ARTS AND SCIENCES By DAVID F. DAHLGREN Integrated Studies Project submitted to Dr. Patricia Hughes-Fuller in partial fulfillment of the requirements for the degree of Master of Arts – Integrated Studies Athabasca, Alberta August, 2008 EX NIHILO – Dahlgren 2 Waterfall by M. C. Escher EX NIHILO – Dahlgren 3 Contents Page LIST OF ILLUSTRATIONS 4 INTRODUCTION 6 FORMS OF SIMILARITY 8 Surface Connections 9 Mechanistic or Syntagmatic Structure 9 Organic or Paradigmatic Structure 12 Melding Mechanical and Organic Structure 14 FORMS OF FEELING 16 Generative Idea 16 Traits 16 Background Control 17 Simulacrum Effect and Aura 18 The Science of Creativity 19 FORMS OF ART IN SCIENTIFIC THOUGHT 21 Interdisciplinary Concept Similarities 21 Concept Glossary 23 Art as an Aid to Communicating Concepts 27 Interdisciplinary Concept Translation 30 Literature to Science 30 Music to Science 33 Art to Science 35 Reversing the Process 38 Thought Energy 39 FORMS OF THOUGHT ENERGY 41 Zero Point Energy 41 Schools of Fish – Flocks of Birds 41 Encapsulating Aura in Language 42 Encapsulating Aura in Art Forms 50 FORMS OF INNER SPACE 53 Shapes of Sound 53 Soundscapes 54 Musical Topography 57 Drawing Inner Space 58 Exploring Inner Space 66 SUMMARY 70 REFERENCES 71 APPENDICES 78 EX NIHILO – Dahlgren 4 LIST OF ILLUSTRATIONS Page Fig. 1 - Hofstadter’s Lettering 8 Fig. 2 - Stravinsky by Picasso 9 Fig. 3 - Symphony No. 40 in G minor by Mozart 10 Fig. 4 - Bird Pattern – Alhambra palace 10 Fig. 5 - A Tree Graph of the Creative Process 11 Fig. -
Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms
Introduction 2.5D matrix multiplication 2.5D LU factorization Conclusion Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms Edgar Solomonik and James Demmel UC Berkeley September 1st, 2011 Edgar Solomonik and James Demmel 2.5D algorithms 1/ 36 Introduction 2.5D matrix multiplication 2.5D LU factorization Conclusion Outline Introduction Strong scaling 2.5D matrix multiplication Strong scaling matrix multiplication Performing faster at scale 2.5D LU factorization Communication-optimal LU without pivoting Communication-optimal LU with pivoting Conclusion Edgar Solomonik and James Demmel 2.5D algorithms 2/ 36 Introduction 2.5D matrix multiplication Strong scaling 2.5D LU factorization Conclusion Solving science problems faster Parallel computers can solve bigger problems I weak scaling Parallel computers can also solve a xed problem faster I strong scaling Obstacles to strong scaling I may increase relative cost of communication I may hurt load balance Edgar Solomonik and James Demmel 2.5D algorithms 3/ 36 Introduction 2.5D matrix multiplication Strong scaling 2.5D LU factorization Conclusion Achieving strong scaling How to reduce communication and maintain load balance? I reduce communication along the critical path Communicate less I avoid unnecessary communication Communicate smarter I know your network topology Edgar Solomonik and James Demmel 2.5D algorithms 4/ 36 Introduction 2.5D matrix multiplication Strong scaling matrix multiplication 2.5D LU factorization Performing faster at scale Conclusion -
Affine Transformations Foley, Et Al, Chapter 5.1-5.5
Reading Optional reading: Angel 4.1, 4.6-4.10 Angel, the rest of Chapter 4 Affine transformations Foley, et al, Chapter 5.1-5.5. David F. Rogers and J. Alan Adams, Mathematical Elements for Computer Graphics, 2nd Ed., McGraw-Hill, New York, Daniel Leventhal 1990, Chapter 2. Adapted from Brian Curless CSE 457 Autumn 2011 1 2 Linear Interpolation More Interpolation 3 4 1 Geometric transformations Vector representation Geometric transformations will map points in one We can represent a point, p = (x,y), in the plane or space to points in another: (x', y‘, z‘ ) = f (x, y, z). p=(x,y,z) in 3D space These transformations can be very simple, such as column vectors as scaling each coordinate, or complex, such as non-linear twists and bends. We'll focus on transformations that can be represented easily with matrix operations. as row vectors 5 6 Canonical axes Vector length and dot products 7 8 2 Vector cross products Inverse & Transpose 9 10 Two-dimensional Representation, cont. transformations We can represent a 2-D transformation M by a Here's all you get with a 2 x 2 transformation matrix matrix M: If p is a column vector, M goes on the left: So: We will develop some intimacy with the If p is a row vector, MT goes on the right: elements a, b, c, d… We will use column vectors. 11 12 3 Identity Scaling Suppose we choose a=d=1, b=c=0: Suppose we set b=c=0, but let a and d take on any positive value: Gives the identity matrix: Gives a scaling matrix: Provides differential (non-uniform) scaling in x and y: Doesn't move the points at all 1 2 12 x y 13 14 ______________ ____________ Suppose we keep b=c=0, but let either a or d go Now let's leave a=d=1 and experiment with b. -
1 Review of Inner Products 2 the Approximation Problem and Its Solution Via Orthogonality
Approximation in inner product spaces, and Fourier approximation Math 272, Spring 2018 Any typographical or other corrections about these notes are welcome. 1 Review of inner products An inner product space is a vector space V together with a choice of inner product. Recall that an inner product must be bilinear, symmetric, and positive definite. Since it is positive definite, the quantity h~u;~ui is never negative, and is never 0 unless ~v = ~0. Therefore its square root is well-defined; we define the norm of a vector ~u 2 V to be k~uk = ph~u;~ui: Observe that the norm of a vector is a nonnegative number, and the only vector with norm 0 is the zero vector ~0 itself. In an inner product space, we call two vectors ~u;~v orthogonal if h~u;~vi = 0. We will also write ~u ? ~v as a shorthand to mean that ~u;~v are orthogonal. Because an inner product must be bilinear and symmetry, we also obtain the following expression for the squared norm of a sum of two vectors, which is analogous the to law of cosines in plane geometry. k~u + ~vk2 = h~u + ~v; ~u + ~vi = h~u + ~v; ~ui + h~u + ~v;~vi = h~u;~ui + h~v; ~ui + h~u;~vi + h~v;~vi = k~uk2 + k~vk2 + 2 h~u;~vi : In particular, this gives the following version of the Pythagorean theorem for inner product spaces. Pythagorean theorem for inner products If ~u;~v are orthogonal vectors in an inner product space, then k~u + ~vk2 = k~uk2 + k~vk2: Proof. -
A Geometric Model of Allometric Scaling
1 Site model of allometric scaling and fractal distribution networks of organs Walton R. Gutierrez* Touro College, 27West 23rd Street, New York, NY 10010 *Electronic address: [email protected] At the basic geometric level, the distribution networks carrying vital materials in living organisms, and the units such as nephrons and alveoli, form a scaling structure named here the site model. This unified view of the allometry of the kidney and lung of mammals is in good agreement with existing data, and in some instances, improves the predictions of the previous fractal model of the lung. Allometric scaling of surfaces and volumes of relevant organ parts are derived from a few simple propositions about the collective characteristics of the sites. New hypotheses and predictions are formulated, some verified by the data, while others remain to be tested, such as the scaling of the number of capillaries and the site model description of other organs. I. INTRODUCTION Important Note (March, 2004): This article has been circulated in various forms since 2001. The present version was submitted to Physical Review E in October of 2003. After two rounds of reviews, a referee pointed out that aspects of the site model had already been discovered and proposed in a previous article by John Prothero (“Scaling of Organ Subunits in Adult Mammals and Birds: a Model” Comp. Biochem. Physiol. 113A.97-106.1996). Although modifications to this paper would be required, it still contains enough new elements of interest, such as (P3), (P4) and V, to merit circulation. The q-bio section of www.arxiv.org may provide such outlet.