Elementary Matrix Representation of Some Commonly Used Geometric Transformations in Computer Graphics and Its Applications

Total Page:16

File Type:pdf, Size:1020Kb

Elementary Matrix Representation of Some Commonly Used Geometric Transformations in Computer Graphics and Its Applications Elementary Matrix Representation of Some Commonly Used Geometric Transformations in Computer Graphics and Its Applications The Authors1 anonymous Abstract By using an extension of Desargues theorem, and the extended Desarguesian configuration thereof, the analytical definition for the stereohomology geometric transformation in projective geometry is proposed in this work. A series of such commonly used geometric transformations in computer graphics as central projection, parallel projection, centrosymmetry, reflection and translation transformation, which can be included in stereohomology, are thus analytically defined from this point of view. It has been proved that, the transformation matrices of stereohomologyare actually equivalent to the existing concept in numerical analysis: elementary matrices. Based on the meaning of elementary matrices in projective geometry thus obtained, a novel approach of 3D reconstructing objects from multiple views is proposed together with some of the concepts, principles and rules for its applications in computer graphics. Keywords: Elementary matrix; Homogeneous coordinates; Desargues theorem; Perspective projection; 3D reconstruction; Projective geometry. 1. Introduction for example, central projection, and parallel projection, are ac- tually defined in Euclidean space by using the concepts of mea- As is well known that, such geometric transformations as trans- sure or distance directly or implicitly which will be inapplicable lation transformation, perspective projection in computergraph- in projective space. ics, can be represented as square transformation matrices only Second, conventionally, the geometric transformation ma- through the homogeneous coordinate representation. trices can also be established for perspective projection, trans- Yet it is surprising to see that presently there is no rigor- lation transformation and so forth, based on homogeneous co- ous definition for the geometric transformations represented by ordinates representation in special reference coordinate system- square matrices based on homogeneous coordinates. Ideally,a s. While mainly due to the limitations of the traditional rep- geometric transformation and its transformation matrix, should resentations, there is actually no simple and straightforward be defined and identified reference coordinate system indepen- reference-coordinate-system independent method for transfor- dently, while the conventional representation method and the mation matrix establishing. definitions in computer graphics, at least for geometric trans- Since most of the geometric transformations can be repre- formation matrices, are not in such a way. sented by square transformation matrices only through homo- Actually, the conventionaldefinitions for the commonlyused geneous coordinates, an improved representation for geometric geometric transformations and their transformation matrices, transformations better be based on homogeneouscoordinates in are not perfect, or even not theoretically rigorous in the fol- projective space. lowing two aspects: For geometric transformations which can be represented by First, by using homogeneous coordinates, we assume that square matrices, we have the following conclusion: the geometric transformations are defined in projective space not in Euclidean space. As we know, in most of the curren- Theorem 0. The different transformation matrices in different t computer graphics textbooks, the geometric transformations, reference coordinate systems of the same geometric transfor- mation are similar matrices. T ∗Corresponding author. Tel.:+xxxxxx/Fax.:+xxxxxxx Proof. Suppose a geometric transformation 0 in projective s- Email address: anonymous (The Authors ) pace, which transforms an arbitrary point or hyperplane X into 1Corresponding author is anonymous. Y; and the homogeneous coordinates of X and Y in reference Preprint submitted to Computer Graphics Forum June 16, 2011 Elementary Matrix Representation of Some Commonly Used Geometric Transformations 2 coordinate systems (I) and (II) are (x), (x)′,(y), (y)′ respec- 2.2. Definition of stereohomology tively; and the coordinate transformation matrix from the ref- Definition 2 (Generalized projective transformation). If the rank erence coordinate system (I)to(II) is a nonsingular matrix T, of the n+1 dimensional coefficient matrix (ti, j) of the following = = i.e., (x)′ T(x), (y)′ T(y); Suppose the transformation matri- transformation in n dimensional projective space is equal to or ces of T0 in different reference coordinate systems (I) and(II) greater than n, then the transformation in projective space is = = are A and B respectively, i.e., (y) A(x), (y)′ B(x)′;. Then called a generalized projective transformation ( 0 , ρ R): we have: ∈ = + + + ρx1′ t1,1 x1 t1,2x2 t1,n+1 xn+1 = = = 1 ··· (y)′ T (y) T A (x) TAT− (x)′ (1) = + + + ρx2′ t2,1 x1 t2,2x2 t2,n+1 xn+1 ··· (3) Since X is arbitrary, then B = TAT 1, B and A are similar to − . .. each other. . = + + + ρxn′ +1 tn+1,1 x1 tn+1,2x2 tn+1,n+1 xn+1 Theorem 0 indicates that, in order to define a geometric ··· transformation reference coordinate system independently, we Definition 3 (invariant point). In projective space, if the homo- can take advantage of the inherentcharacteristics of the geomet- geneous coordinate vector of a point is an eigenvector of a gen- ric transformation matrix, i.e., properties of the transformation eralized projective transformation T , then the pointis called an matrix regarding eigen value(s), eigenvector(s), and the geo- invariant point of T . metric meanings thereof. Definition 4 (General Invariant hyperplane). Suppose X is any Unless otherwise specified, the current work will be dis- π R point in hyperplane , if its corresponding point X′ through a cussed only in the real field: , and a geometric transforma- generalized projective transformation matrix T , is also in π, tions will be a point (not hyperplane) transformation discussed then π is a general invariant hyperplane of T . in one reference coordinate system. Therefore, T can be used to represent both a transformation and the transformation ma- Definition 5 (Invariant hyperplane). Suppose X is any point in trix thereof. Symbols like (s), (x),(x)i,(π) and so on, represent the general invariant hyperplane π of T , if X’s corresponding the homogeneous coordinate column vectors for the point S , X, point X′ coincides with X, then π is an invariant hyperplane of Xi, and hyperplane π and so on, respectively. T . Definition 6 (null vector). If a generalized projective transfor- 2. Stereohomology mation T is singular, then there exists a point, denoted as X, of which the homogeneous coordinate vector, (x), will be trans- 2.1. Extension of Desargues theorem & Desarguesian configu- formed into (0, , 0)⊤, to which there is no corresponding ge- ration ometric point in··· projective space, such a column homogeneous Theorem 1 (Extended Desargues theorem [1, 2]). In n- dimen- coordinate (x) is called a null vector for T . sional projective space (2 6 n Z+), if the homogeneous coor- ∈ Lemma 1 (existence of “stereohomology center”). In n- dimen- dinate vectors of the n+1 points X1, X2, ..., Xn, Xn+1, are linearly independent, any n homogeneous coordinate vectors of the n+1 sional projective space, if a generalized projective transforma- tion T has an invariant hyperplane π, then there exists a unique points Y1, Y2, ..., Yn, Yn+1, are also linearly independent, and there exists a fixed point S, the homogeneous coordinate vector fixed point, which is collinear with any point and its image point T T of which is linearly dependent to those of any two of the corre- through ; and when is nonsingular, the fixed point is an in- variant point of T ; when T is singular, the fixed point is the sponding point pairs: Xi and Yi, ( i = 1, , n+1). Then the ··· 2 null vector of T . rank of the homogeneous coordinate vectors of the Cn+1 inter- section points of line pairs XiX j and YiY j, which will here be Proof. Denote the generalized projective transformation matrix def defined as S i j =S ji == XiX j YiY j (i , j, i, j = 1, , n + 1), as T , and its invariant hyperplane as π. Suppose the homoge- should be n. ∩ ··· neous coordinate vector of any point X (denote its correspond- ing point through T as Y) can be linearly expressed by that of Proof. See [1]. an arbitrary invariant point H π(ρ (h)=T (h), 0 , ρ R is ∈ H · H ∈ Similar to the Desargues theorem and its inverse, the inverse the eigenvalue for all the points in π ) and that of a fixed point < of Theorem 1 also is true. C π as: (x) = (h) + ω (c) ω R (4) + · ∈ Definition 1 (Extended Desarguesian configuration). If 2n therefore, Y’s homogeneous coordinate can be: 3 points, X , X , , X , X , S , Y , Y , , Y , Y , meet 1 2 ··· n n+1 1 2 ··· n n+1 the constraints in both Theorem 1 and its inverse, then the con- (y) =T (x) = ρ (h) + ω T (c) · H · · · figuration that consists of all these points is an Extended Desar- ρ R, and ω R (5) guesian configuration, denoted as H ∈ ∈ From “Eq.(5) Eq.(4) ρH ”, we have: X1 X2 Xn Xn+1-S -Y1Y2 Yn Yn+1 (2) − × ··· ··· (y) ρ (x) = ω (T (c) ρ (c)) − H · · · − H · Elementary Matrix Representation of Some Commonly Used Geometric Transformations 3 which indicates that there exist a unique fixed point, denoted as S below(the uniqueness can be proved through proof by contra- 1 diction): a1∆1 b1∆2 c1∆3 d1∆4 − = (s) T (c) ρH (c), · − · a2∆1 b2∆2 c2∆3 d2∆4 which is collinear to X and the corresponding Y. (6) Since any line through S is transformed into itself, then S is × a ∆ b ∆ c ∆ d ∆ 3 1 3 2 3 3 3 4 an invariant point when T is nonsingular or S is the null vector when T is singular ( S < π in this case). a4∆1 b4∆2 c4∆3 d4∆4 Definition 7 (Stereohomology). In n- dimensional projective The square transformation matrix of stereohomologyshould space, a generalized projective transformation is called a stere- be obtained via more simple and direct method rather than that ohomology, if (1) the coefficient matrix thereof has a stereoho- in (Eq.(6)) from the coordinate information of an Extended De- mology hyperplane (denoted as π ), the homogeneous coordi- sarguesian Configuration.
Recommended publications
  • EXAM QUESTIONS (Part Two)
    Created by T. Madas MATRICES EXAM QUESTIONS (Part Two) Created by T. Madas Created by T. Madas Question 1 (**) Find the eigenvalues and the corresponding eigenvectors of the following 2× 2 matrix. 7 6 A = . 6 2 2 3 λ= −2, u = α , λ=11, u = β −3 2 Question 2 (**) A transformation in three dimensional space is defined by the following 3× 3 matrix, where x is a scalar constant. 2− 2 4 C =5x − 2 2 . −1 3 x Show that C is non singular for all values of x . FP1-N , proof Created by T. Madas Created by T. Madas Question 3 (**) The 2× 2 matrix A is given below. 1 8 A = . 8− 11 a) Find the eigenvalues of A . b) Determine an eigenvector for each of the corresponding eigenvalues of A . c) Find a 2× 2 matrix P , so that λ1 0 PT AP = , 0 λ2 where λ1 and λ2 are the eigenvalues of A , with λ1< λ 2 . 1 2 1 2 5 5 λ1= −15, λ 2 = 5 , u= , v = , P = − 2 1 − 2 1 5 5 Created by T. Madas Created by T. Madas Question 4 (**) Describe fully the transformation given by the following 3× 3 matrix. 0.28− 0.96 0 0.96 0.28 0 . 0 0 1 rotation in the z axis, anticlockwise, by arcsin() 0.96 Question 5 (**) A transformation in three dimensional space is defined by the following 3× 3 matrix, where k is a scalar constant. 1− 2 k A = k 2 0 . 2 3 1 Show that the transformation defined by A can be inverted for all values of k .
    [Show full text]
  • Two-Dimensional Geometric Transformations
    Two-Dimensional Geometric Transformations 1 Basic Two-Dimensional Geometric Transformations 2 Matrix Representations and Homogeneous Coordinates 3 Inverse Transformations 4 Two-Dimensional Composite Transformations 5 Other Two-Dimensional Transformations 6 Raster Methods for Geometric Transformations 7 OpenGL Raster Transformations 8 Transformations between Two-Dimensional Coordinate Systems 9 OpenGL Functions for Two-Dimensional Geometric Transformations 10 OpenGL Geometric-Transformation o far, we have seen how we can describe a scene in Programming Examples S 11 Summary terms of graphics primitives, such as line segments and fill areas, and the attributes associated with these primitives. Also, we have explored the scan-line algorithms for displaying output primitives on a raster device. Now, we take a look at transformation operations that we can apply to objects to reposition or resize them. These operations are also used in the viewing routines that convert a world-coordinate scene description to a display for an output device. In addition, they are used in a variety of other applications, such as computer-aided design (CAD) and computer animation. An architect, for example, creates a layout by arranging the orientation and size of the component parts of a design, and a computer animator develops a video sequence by moving the “camera” position or the objects in a scene along specified paths. Operations that are applied to the geometric description of an object to change its position, orientation, or size are called geometric transformations. Sometimes geometric transformations are also referred to as modeling transformations, but some graphics packages make a From Chapter 7 of Computer Graphics with OpenGL®, Fourth Edition, Donald Hearn, M.
    [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]
  • Geometric Transformation Techniques for Digital I~Iages: a Survey
    GEOMETRIC TRANSFORMATION TECHNIQUES FOR DIGITAL I~IAGES: A SURVEY George Walberg Department of Computer Science Columbia University New York, NY 10027 [email protected] December 1988 Technical Report CUCS-390-88 ABSTRACT This survey presents a wide collection of algorithms for the geometric transformation of digital images. Efficient image transformation algorithms are critically important to the remote sensing, medical imaging, computer vision, and computer graphics communities. We review the growth of this field and compare all the described algorithms. Since this subject is interdisci­ plinary, emphasis is placed on the unification of the terminology, motivation, and contributions of each technique to yield a single coherent framework. This paper attempts to serve a dual role as a survey and a tutorial. It is comprehensive in scope and detailed in style. The primary focus centers on the three components that comprise all geometric transformations: spatial transformations, resampling, and antialiasing. In addition, considerable attention is directed to the dramatic progress made in the development of separable algorithms. The text is supplemented with numerous examples and an extensive bibliography. This work was supponed in part by NSF grant CDR-84-21402. 6.5.1 Pyramids 68 6.5.2 Summed-Area Tables 70 6.6 FREQUENCY CLAMPING 71 6.7 ANTIALIASED LINES AND TEXT 71 6.8 DISCUSSION 72 SECTION 7 SEPARABLE GEOMETRIC TRANSFORMATION ALGORITHMS 7.1 INTRODUCTION 73 7.1.1 Forward Mapping 73 7.1.2 Inverse Mapping 73 7.1.3 Separable Mapping 74 7.2 2-PASS TRANSFORMS 75 7.2.1 Catmull and Smith, 1980 75 7.2.1.1 First Pass 75 7.2.1.2 Second Pass 75 7.2.1.3 2-Pass Algorithm 77 7.2.1.4 An Example: Rotation 77 7.2.1.5 Bottleneck Problem 78 7.2.1.6 Foldover Problem 79 7.2.2 Fraser, Schowengerdt, and Briggs, 1985 80 7.2.3 Fant, 1986 81 7.2.4 Smith, 1987 82 7.3 ROTATION 83 7.3.1 Braccini and Marino, 1980 83 7.3.2 Weiman, 1980 84 7.3.3 Paeth, 1986/ Tanaka.
    [Show full text]
  • Transformation Groups in Non-Riemannian Geometry Charles Frances
    Transformation groups in non-Riemannian geometry Charles Frances To cite this version: Charles Frances. Transformation groups in non-Riemannian geometry. Sophus Lie and Felix Klein: The Erlangen Program and Its Impact in Mathematics and Physics, European Mathematical Society Publishing House, pp.191-216, 2015, 10.4171/148-1/7. hal-03195050 HAL Id: hal-03195050 https://hal.archives-ouvertes.fr/hal-03195050 Submitted on 10 Apr 2021 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. Transformation groups in non-Riemannian geometry Charles Frances Laboratoire de Math´ematiques,Universit´eParis-Sud 91405 ORSAY Cedex, France email: [email protected] 2000 Mathematics Subject Classification: 22F50, 53C05, 53C10, 53C50. Keywords: Transformation groups, rigid geometric structures, Cartan geometries. Contents 1 Introduction . 2 2 Rigid geometric structures . 5 2.1 Cartan geometries . 5 2.1.1 Classical examples of Cartan geometries . 7 2.1.2 Rigidity of Cartan geometries . 8 2.2 G-structures . 9 3 The conformal group of a Riemannian manifold . 12 3.1 The theorem of Obata and Ferrand . 12 3.2 Ideas of the proof of the Ferrand-Obata theorem . 13 3.3 Generalizations to rank one parabolic geometries .
    [Show full text]
  • Geometric Transformation of Finite Element Methods: Theory and Applications
    GEOMETRIC TRANSFORMATION OF FINITE ELEMENT METHODS: THEORY AND APPLICATIONS MICHAEL HOLST AND MARTIN LICHT Abstract. We present a new technique to apply finite element methods to partial differential equations over curved domains. A change of variables along a coordinate transformation satisfying only low regularity assumptions can translate a Poisson problem over a curved physical domain to a Poisson prob- lem over a polyhedral parametric domain. This greatly simplifies both the geo- metric setting and the practical implementation, at the cost of having globally rough non-trivial coefficients and data in the parametric Poisson problem. Our main result is that a recently developed broken Bramble-Hilbert lemma is key in harnessing regularity in the physical problem to prove higher-order finite el- ement convergence rates for the parametric problem. Numerical experiments are given which confirm the predictions of our theory. 1. Introduction The computational theory of partial differential equations has been in a paradoxi- cal situation from its very inception: partial differential equations over domains with curved boundaries are of theoretical and practical interest, but numerical methods are generally conceived only for polyhedral domains. Overcoming this geomet- ric gap continues to inspire much ongoing research in computational mathematics for treating partial differential equations with geometric features. Computational methods for partial differential equations over curved domains commonly adhere to the philosophy of approximating the physical domain of the partial differential equation by a parametric domain. We mention isoparametric finite element meth- ods [2], surface finite element methods [10, 8, 3], or isogeometric analysis [14] as examples, which describe the parametric domain by a polyhedral mesh whose cells are piecewise distorted to approximate the physical domain closely or exactly.
    [Show full text]
  • MATH 9 HOMEWORK ASSIGNMENT GIVEN on FEBRUARY 3, 2019. CIRCLE INVERSION Circle Inversion Circle Inversion (Or Simply Inversion) I
    MATH 9 HOMEWORK ASSIGNMENT GIVEN ON FEBRUARY 3, 2019. CIRCLE INVERSION Circle inversion Circle inversion (or simply inversion) is a geometric transformation of the plane. One can think of the inversion as of reflection with respect to a circle which is analogous to a reflection with respect to a straight line. See wikipedia article on Inversive geometry. Definition of inversion Definition. Given a circle S with the center at point O and having a radius R consider the transformation of the plane taking each point P to a point P 0 such that (i) the image P 0 belongs to a ray OP (ii) the distance jOP 0j satisfies jOP j · jOP 0j = R2. Remark. Strictly speaking the inversion is the transformation not of the whole plane but a plane without point O. The point O does not have an image. It is convenient to think of an “infinitely remote" point O0 added to a euclidian plane so that O and O0 are mapped to each other by the inversion. Basic properties of inversion We formulated and proved some basic properties of the inversion. The most important properties are that the inversion • maps circles and straight lines onto circles and straight lines • preserves angles These properties are stated as homework problems below. Try to prove them indepen- dently. In the following we denote the center of inversion as O, the circle of inversion as S and we use prime to denote the images of various objects under inversion. Classwork Problems The properties presented in problems 1-3 are almost obvious.
    [Show full text]
  • Geometric Transformations
    Chapter 4 Geometric transformations • geometric transformations deal with “moving pixels around” !Fig. 4.1 Fig. 4.1: Some examples for geometric transformations: Rotations, mirroring, distortion, map projection. – shift – rotation – scaling – other distortions • Note: pixels of a digital image must be in a regular (Cartesian, equidistant) grid – i.e., pixel coordinates must be integer 22 Chapter 4. Geometric transformations • BUT: transformation might cause pixels to end up in a different grid – non-integer pixel coordinates !Fig. 4.2 Fig. 4.2: Pixels of rotated image (red) are between the positions of the original pixels (blue) – in other words, they have non-integer pixel coordinates. ) interpolation needed to get new pixels in a new regular grid with integer coordinates ) Geometric transformation of digital images = two separate operations: 1. spatial transformation: rotation, shift, scaling etc. 2. grey-level interpolation: f (x;y) : input image (original image) g(x;y) : output image (resulting image after transformation) x,y: integers (pixel coordinates) g(x;y) = f (x0;y0) = f (a(x;y);b(x;y)) (4.1) i.e., x0 = a(x;y) (4.2) y0 = b(x;y) (4.3) 4.1 Grey level interpolation “Grey level” = pixel value There are two ways to solve the interpolation problem: 1. forward-mapping approach (pixel carry-over): V0.9.93, April 19, 2017 page 23 Melsheimer/Spreen Digital Image Processing Summer 2017 • if a pixel from input image f maps to non-integer coordinates (between four integer pixel positions): divide its grey-level among these four pixels !Fig. 4.3 Fig. 4.3: Pixel carry-over (from Castleman, 1996, Fig.
    [Show full text]
  • Article Which He Wrote for the five-Volume Entsik- Lopedia Elementarnoy Matematiki
    A CURIOUS GEOMETRIC TRANSFORMATION NIKOLAI IVANOV BELUHOV Abstract. An expansion is a little-known geometric transformation which maps directed circles to directed circles. We explore the applications of ex- pansion to the solution of various problems in geometry by elementary means. In his book Geometricheskie Preobrazovaniya, Isaac Moiseevich Yaglom de- scribes one curious geometric transformation called expansion 1. A few years after coming across this transformation, the author of the present paper was rather surprised to discover that it leads to quite appealing geometrical solutions of a number of problems otherwise very difficult to treat by elementary means. Most of these originated in Japanese sangaku – wooden votive tablets which Japanese mathematicians of the Edo period painted with the beautiful and extraordinary theorems they discovered and then hung in Buddhist temples and Shinto shrines. Researching the available literature prior to compiling this paper brought an- other surprise: that expansion was not mentioned in almost any other books on geometry. Only two references were uncovered – one more book by I. M. Ya- glom [7] and an encyclopedia article which he wrote for the five-volume Entsik- lopedia Elementarnoy Matematiki. Therefore, we begin our presentation with an informal introduction to expan- sion and the geometry of cycles and rays. 1. Introduction We call an oriented circle a cycle. Whenever a circle k of radius R is oriented positively (i.e., counterclockwise), we label the resulting cycle k+ and say that it is of radius R. Whenever k is oriented negatively (i.e., clockwise), we label the resulting cycle k− and say that it is of radius R.
    [Show full text]
  • Lecture 5 Geometric Transformations and Image Registration
    Lecture 5 Geometric Transformations and Image Registration Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2014 Lin ZHANG, SSE, 2014 Contents • Transforming points •Hierarchy of geometric transformations • Applying geometric transformations to images •Image registration Lin ZHANG, SSE, 2014 Transforming Points •Geometric transformations modify the spatial relationship between pixels in an image •The images can be shifted, rotated, or stretched in a variety of ways •Geometric transformations can be used to •create thumbnail views • change digital video resolution • correct distortions caused by viewing geometry • align multiple images of the same scene Lin ZHANG, SSE, 2014 Transforming Points Suppose (w, z) and (x, y) are two spatial coordinate systems input space output space A geometric transformation T that maps the input space to output space (,x yTwz ) ( ,) T is called a forward transformation or forward mapping (,)wz T1 (,) xy T-1 is called a inverse transformation or inverse mapping Lin ZHANG, SSE, 2014 Transforming Points z (,x yTwz ) ( ,) y (,)wz T1 (,) xy w x Lin ZHANG, SSE, 2014 Transforming Points An example (,xy ) T ( wz ,) ( w /2,/2) z (,)wz T1 (,) xy (2,2) x y Lin ZHANG, SSE, 2014 Contents • Transforming points •Hierarchy of geometric transformations • Applying geometric transformations to images •Image Registration Lin ZHANG, SSE, 2014 Hierarchy of Geometric Transformations • Class I: Isometry transformation If only rotation and translation are considered xx' cos sin t 1 ' y sin cos yt2 In homogeneous
    [Show full text]
  • 17.Matrices and Matrix Transformations (SC)
    17. MATRICES AND MATRIX TRANSFORMATIONS MATRICES ⎛ 2 1 3 0 ⎞ A matrix is a rectangular array of numbers (or M = ⎜ 5 7 −6 8 ⎟ 3 × 4 symbols) enclosed in brackets either curved or ⎜ ⎟ ⎜ 9 −2 6 −3 ⎟ square. The constituents of a matrix are called entries ⎝ ⎠ or elements. A matrix is usually named by a letter for ⎛ 4 5 7 ⎞ convenience. Some examples are shown below. ⎜ −2 3 6 ⎟ N = ⎜ ⎟ 4 × 3 ⎜ −7 1 0 ⎟ æö314 ⎝⎜ 9 −5 8 ⎠⎟ X = ç÷ èø270- Note that the orders 3 × 4 and 4 × 3 are NOT the æö31426- same. A = ç÷ èø00105- Row matrices ⎡ a b ⎤ F = ⎢ ⎥ ⎣ c d ⎦ If a matrix is composed only of one row, then it is called a row matrix (regardless of its number of ⎡ 4 1 2 ⎤ elements). The matrices �, � and � are row matrices, ⎢ ⎥ Y = ⎢ 3 −1 5 ⎥ ⎢ 6 −2 10 ⎥ J = ()413 L =(30- 42) ⎣ ⎦ K = 21 ⎛ 1 0 ⎞ () I = ⎝⎜ 0 1 ⎠⎟ Column matrices Rows and Columns If a matrix is composed of only one column, then it is called a column matrix (regardless of the number of The elements of a matrix are arranged in rows and elements). The matrices �, � and � are column columns. Elements that are written from left to right matrices. (horizontally) are called rows. Elements that are written from top to bottom (vertically) are called ⎛ ⎞ columns. The first row is called ‘row 1’, the second ⎛ ⎞ 6 4 ⎜ ⎟ ‘row 2’, and so on. The first column is called ⎛ 1 ⎞ ⎜ ⎟ 7 P = ⎜ ⎟ Q = 0 R=⎜ ⎟ ‘column 1, the second ‘column 2’, and so on.
    [Show full text]
  • Activity 1 Isometries of the Plane We Will Investigate Transformations Of
    Making Mathematical Connections Activity 1 6/3/2002 Activity 1 Isometries of the Plane We will investigate transformations of the plane that preserve distance. These transformations will take the entire plane onto a "copy" of itself. For this activity you will need to draw a scalene triangle on a two transparencies so that you have two "identical" triangles. Here's a definition. Definition: A one-to-one, onto function f from the plane to the plane is called an isometry of the plane if, for any two points P and Q, the segment PQ is congruent to the segment fPfQ()(). 1. Give an explanation of the meaning of congruent as used above. Try to be precise. 2. Using your transparencies, experiment to find ways to move a triangle from one location to another. How many types of isometries of the plane can you identify? Is there one that is a combination of two others? What properties of your triangles are preserved by the isometries? 3. Consider an isometry of the plane as a function from the plane to itself. Craft a careful definition for each type of isometry of the plane. 4. Is there a type of transformation of the plane that is not an isometry but preserves some of the same properties preserved by isometries? Making Mathematical Connections Activity 1 6/3/2002 Teacher's Notes for Activity 1 • Allot a 50-minute class period for this activity. • Students should work in groups of three or four. • The idea of congruent triangles on transparency sheets is to give the students the image of a transformation taking the entire plane to itself.
    [Show full text]