DOCSLIB.ORG

Robust Reorientation of 2D Shapes Using the Orientation Indicator Index

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Robust Reorientation of 2D Shapes Using the Orientation Indicator Index ROBUST REORIENTATION OF 2D SHAPES USING THE ORIENTATION INDICATOR INDEX Victor H. S. Ha∗ Jos´e M. F. Moura Digital Media Solutions Lab Department of ECE Samsung Information Systems America Carnegie Mellon University Irvine, CA 92612 Pittsburgh, PA 15213 {[email protected]} {[email protected]} ABSTRACT In section 2, we briefly review some of the past research efforts on shape reorientation. In section 3, we introduce Shape reorientation is a critical step in many image process- three orientation indicator indices that we use to remove the ing and computer vision applications such as registration, orientation ambiguity in the shape: the orientation indicator detection, identification, and classification. Shape reorien- index (OII), the variable-size window OII (∆-OII), and the tation is a needed step to restore the correct orientation of extended OII (X-OII). We illustrate the good performance a shape when its image is subject to an arbitrary rotation of these new measures of orientation with experimental ex- and reflection. In this paper, we present a robust method amples. Section 4 summarizes the paper. to determine the standard “normalized” orientation of two- dimensional (2D) shapes in a blind manner, i.e., without any other information other than the given input shape. We in- 2. SHAPE ORIENTATION troduce a set of orientation indicator indices (OII) that use low order central moments of the shape to monitor the ori- There are an extensive number of published efforts to deter- entational characteristics of the shape. Because these OII’s mine the orientation of shapes. A good set of existing tech- use only low (up to third) order moments, they are robust niques are reviewed in [3]; these techniques are shown to to noise and errors. We show with examples how we bring fail for some test shapes. The Shen-Ip symmetries detector consistently a given shape with an unknown arbitrary orien- [4] that survives these tests is concerned with the problem tation to its standard normalized orientation using the OII. of detecting both the reflectional and rotational symmetry axes of a shape. The algorithm requires the computation of many high order generalized complex (GC) moments of the 1. INTRODUCTION shapes. In [1], we introduce the concept of intrinsic shape of In image processing and computer vision applications, the an object as an invariant to the class of affine and permu- shapes of objects are obtained and analyzed for registration, tation distortions of a shape, and summarize a blind algo- detection, identification, and classification. Many research rithm to recover the intrinsic shape—BLAISER. The key efforts are directed to finding the correct orientation of the step in BLAISER is the reorientation of the shape, which is input shape prior to feeding it into such further processing. solved with the point-based reorientation algorithm (PRA). We have developed the point-based reorientation algo- The PRA provides a complete solution to the shape reori- rithm (PRA) [1] and the variable-size window orientation entation problem. The PRA is also an efficient algorithm indicator index (∆-OII) [2] that remove the orientational whose complexity is O(N log N) where N is the number ambiguity from any shape distorted by an arbitrary orien- of feature points (pixels) in the given shape (binary tem- tation. The two algorithms are combined in a complete plate of the object). In practice, the locations of the feature and efficient solution to the shape orientation problem, the points may be measured inaccurately due to the finite reso- PRA-∆-OII algorithm [2]. In this paper, we introduce the lution of the input device and background noise. The PRA extended OII (X-OII). This new OII is resilient to error may be sensitive to such disturbances. and noise, especially when there is an unexpectedly large In the next section, we introduce a set of orientation in- amount of error or noise added to the shape. dicator indices (OII) that are moment-based measures of the ∗The first author performed the work while at Carnegie Mellon Univer- shape orientation. We use these OII’s to develop a robust sity. This work was partially supported by ONR Grant #14-0-1-0593 shape orientation algorithm. 0-7803-8874-7/05/$20.00 ©2005 IEEEII - 777 ICASSP 2005 1 4000 3. ORIENTATION INDICATOR INDEX 0.8 0.6 3500 0.4 0.2 3000 0 We now introduce the orientation indicator index (OII) that Ŧ0.2 2500 Ŧ0.4 monitors the orientation of the shape. The OII uses a series Ŧ0.6 2000 Ŧ0.8 Ŧ1 1500 of low order central moments of the input shape. Moment- Ŧ1 Ŧ0.8 Ŧ0.6 Ŧ0.4 Ŧ0.2 0 0.2 0.4 0.6 0.8 1 0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 based techniques are more robust to errors than point-based (a) Test Shape X (b) OII plot of Test Shape techniques such as the PRA. The OII is computed from up 1 4000 0.8 to third order central moments of the shape. We have chosen 0.6 3500 0.4 0.2 3000 the third order moments because higher order moments are 0 Ŧ0.2 2500 generally more sensitive to noise and other sources of error. Ŧ0.4 Ŧ0.6 2000 We start in subsection 3.1 with a definition of the OII Ŧ0.8 Ŧ1 1500 Ŧ1 Ŧ0.8 Ŧ0.6 Ŧ0.4 Ŧ0.2 0 0.2 0.4 0.6 0.8 1 0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2 using the third order central moments. Then, in subsec- ◦ (c) Shape Rotated by 45 (d) OII plot of Rotated Shape tion 3.2, we introduce the ∆-OII, the variable-size window OII. Finally in subsection 3.3, we generalize the concept and introduce the extended orientation indicator index, X- Fig. 1. Examples of OII OII. We illustrate with examples how these OII’s apply to the shape orientation problem. other about the x–axis, their OII plots are identical. The second property requires a lengthy algebraic derivation 3.1. OII to prove. After the derivation, we find that the OII plot is a θ We represent a 2D shape X as the collection of x- and y- cosinusoidal function of the rotation angle with a period T π/ coordinates, (x, y), falling inside the shape. The represen- = 2.Thatis, tation can be either continuous or discrete. We define the 3 OIIofshapeX as OIIXθ = ρ cos (4θ − λ)+τ (4) 4 m2 m2 where OIIX = 30 + 03 (1) 2 (M1 − M3) 2 where mpq is the (p + q)th order central moment of X.If ρ = + M2 the shape X is rotated about its center of mass by an angle 4 2M2 θ,wedefine the OII of the rotated shape Xθ by λ =arctan M1 − M3 m2 m2 5M1 +3M3 OIIXθ = ¯ 30 +¯03 (2) τ = 8 where and N 2 2 3 M1 = m30 + m03 m¯ 30 = (cosθ · xk +sinθ · yk) (3) k=1 M2 =2(m21m30 − m12m03) 2 2 N M3 =2(m12m30 + m21m03)+3(m21 + m12). 3 m¯ 03 = ( − sin θ · xk +cosθ · yk) , k=1 The OII plot represented by Equation (4) has four peaks over the range θ ∈ [0, 2π), which of course simply confirms using the notation of a discrete shape representation consist- Properties 1 and 2. ing of N feature points. An OII plot is generated by rotating We illustrate the usage of the OII with simple examples. the shape by an angle θ and computing the OII at each ro- We first choose the test shape X to be the binary image of tated position over the rotation range of θ ∈ [0, 2π). From an airplane as shown in Fig. 1 (a). The test shape is rotated (1) and (2), we deduce the following properties of the OII. over the rotation range θ ∈ [0, 2π). At each rotated position, Property 1: The OII plot is periodic in θ with period T = the OII value is computed and plotted. The OII plot that π/ ∀ θ ∈ , π 2. That is OIIXθ = OIIX(θ+ π ) for [0 2 ). 2 results after the full rotation is shown in Fig. 1 (b). As we Property 2: The OII plot has four peaks in the rotation expect, the plot is a cosinusoidal function of the rotation range of θ ∈ [0, 2π). angle θ with a period T = π/2. Fig. 1 (c) shows the same Property 3: If two shapes differ from each other by a rota- test shape rotated by an angle π/4 rad. The OII plot of this tion angle of φ, their OII plots are circularly shifted versions rotated shape is shown in Fig. 1 (d). Observe that this plot of each other by the same angular displacement φ. is circularly shifted by the angle π/4 with respect to the OII Property 4: If two shapes are reflected versions of each plot shown in (b). II - 778 0.034 The reorientation of a shape is achieved by first gener- 0.033 ating the OII plot. According to (4), there exist four peaks 0.032 in the OII plot that represent four unique rotational orienta- 0.031 tions of the shape. We can bring any shape to one of its four 0.03 unique orientations by bringing any peak in its OII plot to 0.029 θ 0.028 the origin =0. 0 100 200 300 400 500 600 700 800 900 1000 There are two major weaknesses in the method described (a) Shape 1 (b) ∆-OII plot of (a) above.
Load more

Recommended publications
  • Molecular Symmetry
    Molecular Symmetry Symmetry helps us understand molecular structure, some chemical properties, and characteristics of physical properties (spectroscopy) – used with group theory to predict vibrational spectra for the identification of molecular shape, and as a tool for understanding electronic structure and bonding. Symmetrical : implies the species possesses a number of indistinguishable configurations. 1 Group Theory : mathematical treatment of symmetry. symmetry operation – an operation performed on an object which leaves it in a configuration that is indistinguishable from, and superimposable on, the original configuration. symmetry elements – the points, lines, or planes to which a symmetry operation is carried out. Element Operation Symbol Identity Identity E Symmetry plane Reflection in the plane σ Inversion center Inversion of a point x,y,z to -x,-y,-z i Proper axis Rotation by (360/n)° Cn 1. Rotation by (360/n)° Improper axis S 2. Reflection in plane perpendicular to rotation axis n Proper axes of rotation (C n) Rotation with respect to a line (axis of rotation). •Cn is a rotation of (360/n)°. •C2 = 180° rotation, C 3 = 120° rotation, C 4 = 90° rotation, C 5 = 72° rotation, C 6 = 60° rotation… •Each rotation brings you to an indistinguishable state from the original. However, rotation by 90° about the same axis does not give back the identical molecule. XeF 4 is square planar. Therefore H 2O does NOT possess It has four different C 2 axes. a C 4 symmetry axis. A C 4 axis out of the page is called the principle axis because it has the largest n . By convention, the principle axis is in the z-direction 2 3 Reflection through a planes of symmetry (mirror plane) If reflection of all parts of a molecule through a plane produced an indistinguishable configuration, the symmetry element is called a mirror plane or plane of symmetry .
    [Show full text]
  • (II) I Main Topics a Rotations Using a Stereonet B
    GG303 Lecture 11 9/4/01 1 ROTATIONS (II) I Main Topics A Rotations using a stereonet B Comments on rotations using stereonets and matrices C Uses of rotation in geology (and engineering) II II Rotations using a stereonet A Best uses 1 Rotation axis is vertical 2 Rotation axis is horizontal (e.g., to restore tilted beds) B Construction technique 1 Find orientation of rotation axis 2 Find angle of rotation and rotate pole to plane (or a linear feature) along a small circle perpendicular to the rotation axis. a For a horizontal rotation axis the small circle is vertical b For a vertical rotation axis the small circle is horizontal 3 WARNING: DON'T rotate a plane by rotating its dip direction vector; this doesn't work (see handout) IIIComments on rotations using stereonets and matrices Advantages Disadvantages Stereonets Good for visualization Relatively slow Can bring into field Need good stereonets, paper Matrices Speed and flexibility Computer really required to Good for multiple rotations cut down on errors A General comments about stereonets vs. rotation matrices 1 With stereonets, an object is usually considered to be rotated and the coordinate axes are held fixed. 2 With rotation matrices, an object is usually considered to be held fixed and the coordinate axes are rotated. B To return tilted bedding to horizontal choose a rotation axis that coincides with the direction of strike. The angle of rotation is the negative of the dip of the bedding (right-hand rule! ) if the bedding is to be rotated back to horizontal and positive if the axes are to be rotated to the plane of the tilted bedding.
    [Show full text]
  • Euler Quaternions
    Four different ways to represent rotation my head is spinning... The space of rotations SO( 3) = {R ∈ R3×3 | RRT = I,det(R) = +1} Special orthogonal group(3): Why det( R ) = ± 1 ? − = − Rotations preserve distance: Rp1 Rp2 p1 p2 Rotations preserve orientation: ( ) × ( ) = ( × ) Rp1 Rp2 R p1 p2 The space of rotations SO( 3) = {R ∈ R3×3 | RRT = I,det(R) = +1} Special orthogonal group(3): Why it’s a group: • Closed under multiplication: if ∈ ( ) then ∈ ( ) R1, R2 SO 3 R1R2 SO 3 • Has an identity: ∃ ∈ ( ) = I SO 3 s.t. IR1 R1 • Has a unique inverse… • Is associative… Why orthogonal: • vectors in matrix are orthogonal Why it’s special: det( R ) = + 1 , NOT det(R) = ±1 Right hand coordinate system Possible rotation representations You need at least three numbers to represent an arbitrary rotation in SO(3) (Euler theorem). Some three-number representations: • ZYZ Euler angles • ZYX Euler angles (roll, pitch, yaw) • Axis angle One four-number representation: • quaternions ZYZ Euler Angles φ = θ rzyz ψ φ − φ cos sin 0 To get from A to B: φ = φ φ Rz ( ) sin cos 0 1. Rotate φ about z axis 0 0 1 θ θ 2. Then rotate θ about y axis cos 0 sin θ = ψ Ry ( ) 0 1 0 3. Then rotate about z axis − sinθ 0 cosθ ψ − ψ cos sin 0 ψ = ψ ψ Rz ( ) sin cos 0 0 0 1 ZYZ Euler Angles φ θ ψ Remember that R z ( ) R y ( ) R z ( ) encode the desired rotation in the pre- rotation reference frame: φ = pre−rotation Rz ( ) Rpost−rotation Therefore, the sequence of rotations is concatentated as follows: (φ θ ψ ) = φ θ ψ Rzyz , , Rz ( )Ry ( )Rz ( ) φ − φ θ θ ψ − ψ cos sin 0 cos 0 sin cos sin 0 (φ θ ψ ) = φ φ ψ ψ Rzyz , , sin cos 0 0 1 0 sin cos 0 0 0 1− sinθ 0 cosθ 0 0 1 − − − cφ cθ cψ sφ sψ cφ cθ sψ sφ cψ cφ sθ (φ θ ψ ) = + − + Rzyz , , sφ cθ cψ cφ sψ sφ cθ sψ cφ cψ sφ sθ − sθ cψ sθ sψ cθ ZYX Euler Angles (roll, pitch, yaw) φ − φ cos sin 0 To get from A to B: φ = φ φ Rz ( ) sin cos 0 1.
    [Show full text]
  • The Structuring of Pattern Repeats in the Paracas Necropolis Embroideries
    University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Textile Society of America Symposium Proceedings Textile Society of America 1988 Orientation And Symmetry: The Structuring Of Pattern Repeats In The Paracas Necropolis Embroideries Mary Frame University of British Columbia Follow this and additional works at: https://digitalcommons.unl.edu/tsaconf Part of the Art and Design Commons Frame, Mary, "Orientation And Symmetry: The Structuring Of Pattern Repeats In The Paracas Necropolis Embroideries" (1988). Textile Society of America Symposium Proceedings. 637. https://digitalcommons.unl.edu/tsaconf/637 This Article is brought to you for free and open access by the Textile Society of America at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in Textile Society of America Symposium Proceedings by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. 136 RESEARCH-IN-PROGRESS REPORT ORIENTATION AND SYMMETRY: THE STRUCTURING OF PATTERN REPEATS IN THE PARACAS NECROPOLIS EMBROIDERIES MARY FRAME RESEARCH ASSOCIATE, INSTITUTE OF ANDEAN STUDIES 4611 Marine Drive West Vancouver, B.C. V7W 2P1 The most extensive Peruvian fabric remains come from the archeological site of Paracas Necropolis on the South Coast of Peru. Preserved by the dry desert conditions, this cache of 429 mummy bundles, excavated in 1926-27, provides an unparal- leled opportunity for comparing the range and nature of varia- tions in similar fabrics which are securely related in time and space. The bundles are thought to span the time period from 500-200 B.C. The most numerous and notable fabrics are embroideries: garments that have been classified as mantles, tunics, wrap- around skirts, loincloths, turbans and ponchos.
    [Show full text]
  • Rotation Matrix - Wikipedia, the Free Encyclopedia Page 1 of 22
    Rotation matrix - Wikipedia, the free encyclopedia Page 1 of 22 Rotation matrix From Wikipedia, the free encyclopedia In linear algebra, a rotation matrix is a matrix that is used to perform a rotation in Euclidean space. For example the matrix rotates points in the xy -Cartesian plane counterclockwise through an angle θ about the origin of the Cartesian coordinate system. To perform the rotation, the position of each point must be represented by a column vector v, containing the coordinates of the point. A rotated vector is obtained by using the matrix multiplication Rv (see below for details). In two and three dimensions, rotation matrices are among the simplest algebraic descriptions of rotations, and are used extensively for computations in geometry, physics, and computer graphics. Though most applications involve rotations in two or three dimensions, rotation matrices can be defined for n-dimensional space. Rotation matrices are always square, with real entries. Algebraically, a rotation matrix in n-dimensions is a n × n special orthogonal matrix, i.e. an orthogonal matrix whose determinant is 1: . The set of all rotation matrices forms a group, known as the rotation group or the special orthogonal group. It is a subset of the orthogonal group, which includes reflections and consists of all orthogonal matrices with determinant 1 or -1, and of the special linear group, which includes all volume-preserving transformations and consists of matrices with determinant 1. Contents 1 Rotations in two dimensions 1.1 Non-standard orientation
    [Show full text]
  • The Problem of Exterior Orientation in Photogrammetry
    T he Problem of Exterior Orientation in Photogrammetry*t GEORGE H. ROSENFIELD, Data Reduction A nalyst, RCA Service Co., Air Force Missile Test Center, Patrick Air Force Base, Fla. ABSTRACT: Increased interest in Analytical Photogrammetry has focused at­ tention upon a chaotic situation which complicates research and communication between photogrammetrists. The designation of the orientation parameters in a different manner by almost every investigator has resulted in the need for a universal non-ambiguous system which depicts the actual physical orientation of the photograph. This paper presents a discussion of the basic concepts in­ volved in the various systems in use, and recommends the adoption of a standard system within the basic framework of the Stockholm resolution of July 1956, concerning the sign convention to be used in Photogrammetry. 1. INTRODUCTION CHAOTIC situation exists within the science of Photogrammetry which complicates A research and communication between photogrammetrists. When the theoretician studies a technical paper, he finds the work unnecessarily laborious until he has first become familiar with the coordinate system, definitions, and rotations employed by the writer. \i\Then the skilled instrument operator sits down to a newstereoplotting instrument he finds the orienta­ tion procedure unnecessarily difficult until he be­ comes familiar with the positive direction of the translational and rotational motions. Thus it is that almost every individual has devised his own unique system of designating the exterior orienta­ tion of the photograph. In order to alleviate these complications, the VIII International Congress for Photogrammetry at Stockholm in July 1956, accepted a resolution on the sign convention to be used in photogrammetry.
    [Show full text]
  • A Guided Tour to the Plane-Based Geometric Algebra PGA
    A Guided Tour to the Plane-Based Geometric Algebra PGA Leo Dorst University of Amsterdam Version 1.15{ July 6, 2020 Planes are the primitive elements for the constructions of objects and oper- ators in Euclidean geometry. Triangulated meshes are built from them, and reflections in multiple planes are a mathematically pure way to construct Euclidean motions. A geometric algebra based on planes is therefore a natural choice to unify objects and operators for Euclidean geometry. The usual claims of `com- pleteness' of the GA approach leads us to hope that it might contain, in a single framework, all representations ever designed for Euclidean geometry - including normal vectors, directions as points at infinity, Pl¨ucker coordinates for lines, quaternions as 3D rotations around the origin, and dual quaternions for rigid body motions; and even spinors. This text provides a guided tour to this algebra of planes PGA. It indeed shows how all such computationally efficient methods are incorporated and related. We will see how the PGA elements naturally group into blocks of four coordinates in an implementation, and how this more complete under- standing of the embedding suggests some handy choices to avoid extraneous computations. In the unified PGA framework, one never switches between efficient representations for subtasks, and this obviously saves any time spent on data conversions. Relative to other treatments of PGA, this text is rather light on the mathematics. Where you see careful derivations, they involve the aspects of orientation and magnitude. These features have been neglected by authors focussing on the mathematical beauty of the projective nature of the algebra.
    [Show full text]
  • Euclidean Space - Wikipedia, the Free Encyclopedia Page 1 of 5
    Euclidean space - Wikipedia, the free encyclopedia Page 1 of 5 Euclidean space From Wikipedia, the free encyclopedia In mathematics, Euclidean space is the Euclidean plane and three-dimensional space of Euclidean geometry, as well as the generalizations of these notions to higher dimensions. The term “Euclidean” distinguishes these spaces from the curved spaces of non-Euclidean geometry and Einstein's general theory of relativity, and is named for the Greek mathematician Euclid of Alexandria. Classical Greek geometry defined the Euclidean plane and Euclidean three-dimensional space using certain postulates, while the other properties of these spaces were deduced as theorems. In modern mathematics, it is more common to define Euclidean space using Cartesian coordinates and the ideas of analytic geometry. This approach brings the tools of algebra and calculus to bear on questions of geometry, and Every point in three-dimensional has the advantage that it generalizes easily to Euclidean Euclidean space is determined by three spaces of more than three dimensions. coordinates. From the modern viewpoint, there is essentially only one Euclidean space of each dimension. In dimension one this is the real line; in dimension two it is the Cartesian plane; and in higher dimensions it is the real coordinate space with three or more real number coordinates. Thus a point in Euclidean space is a tuple of real numbers, and distances are defined using the Euclidean distance formula. Mathematicians often denote the n-dimensional Euclidean space by , or sometimes if they wish to emphasize its Euclidean nature. Euclidean spaces have finite dimension. Contents 1 Intuitive overview 2 Real coordinate space 3 Euclidean structure 4 Topology of Euclidean space 5 Generalizations 6 See also 7 References Intuitive overview One way to think of the Euclidean plane is as a set of points satisfying certain relationships, expressible in terms of distance and angle.
    [Show full text]
  • A Tutorial on Euler Angles and Quaternions
    A Tutorial on Euler Angles and Quaternions Moti Ben-Ari Department of Science Teaching Weizmann Institute of Science http://www.weizmann.ac.il/sci-tea/benari/ Version 2.0.1 c 2014–17 by Moti Ben-Ari. This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/ by-sa/3.0/ or send a letter to Creative Commons, 444 Castro Street, Suite 900, Mountain View, California, 94041, USA. Chapter 1 Introduction You sitting in an airplane at night, watching a movie displayed on the screen attached to the seat in front of you. The airplane gently banks to the left. You may feel the slight acceleration, but you won’t see any change in the position of the movie screen. Both you and the screen are in the same frame of reference, so unless you stand up or make another move, the position and orientation of the screen relative to your position and orientation won’t change. The same is not true with respect to your position and orientation relative to the frame of reference of the earth. The airplane is moving forward at a very high speed and the bank changes your orientation with respect to the earth. The transformation of coordinates (position and orientation) from one frame of reference is a fundamental operation in several areas: flight control of aircraft and rockets, move- ment of manipulators in robotics, and computer graphics. This tutorial introduces the mathematics of rotations using two formalisms: (1) Euler angles are the angles of rotation of a three-dimensional coordinate frame.
    [Show full text]
  • Rigid Motion – a Transformation That Preserves Distance and Angle Measure (The Shapes Are Congruent, Angles Are Congruent)
    REVIEW OF TRANSFORMATIONS GEOMETRY Rigid motion – A transformation that preserves distance and angle measure (the shapes are congruent, angles are congruent). Isometry – A transformation that preserves distance (the shapes are congruent). Direct Isometry – A transformation that preserves orientation, the order of the lettering (ABCD) in the figure and the image are the same, either both clockwise or both counterclockwise (the shapes are congruent). Opposite Isometry – A transformation that DOES NOT preserve orientation, the order of the lettering (ABCD) is reversed, either clockwise or counterclockwise becomes clockwise (the shapes are congruent). Composition of transformations – is a combination of 2 or more transformations. In a composition, you perform each transformation on the image of the preceding transformation. Example: rRx axis O,180 , the little circle tells us that this is a composition of transformations, we also execute the transformations from right to left (backwards). If you would like a visual of this information or if you would like to quiz yourself, go to http://www.mathsisfun.com/geometry/transformations.html. Line Reflection Point Reflection Translations (Shift) Rotations (Turn) Glide Reflection Dilations (Multiply) Rigid Motion Rigid Motion Rigid Motion Rigid Motion Rigid Motion Not a rigid motion Opposite isometry Direct isometry Direct isometry Direct isometry Opposite isometry NOT an isometry Reverse orientation Same orientation Same orientation Same orientation Reverse orientation Same orientation Properties preserved: Properties preserved: Properties preserved: Properties preserved: Properties preserved: Properties preserved: 1. Distance 1. Distance 1. Distance 1. Distance 1. Distance 1. Angle measure 2. Angle measure 2. Angle measure 2. Angle measure 2. Angle measure 2. Angle measure 2.
    [Show full text]
  • Working with 3D Rotations
    Working With 3D Rotations Stan Melax Graphics Software Engineer, Intel Human Brain is wired for Spatial Computation Which shape is the same: a) b) c) “I don’t need to ask A childhood IQ test question for directions” Translations Rotations Agenda ● Rotations and Matrices (hopefully review) ● Combining Rotations ● Matrix and Axis Angle ● Challenges of deep Space (of Rotations) ● Quaternions ● Applications Terminology Clarification Preferred usages of various terms: Linear Angular Object Pose Position (point) Orientation A change in Pose Translation (vector) Rotation Rate of change Linear Velocity Spin also: Direction specifies 2 DOF, Orientation specifies all 3 angular DOF. Rotations Trickier than Translations Translations Rotations a then b == b then a x then y != y then x (non-commutative) ● Programming with rotations also more challenging! 2D Rotation θ Rotate [1 0] by θ about origin 1,1 [ cos(θ) sin(θ) ] θ θ sin cos θ 1,0 2D Rotation θ Rotate [0 1] by θ about origin -1,1 0,1 sin θ [-sin(θ) cos(θ)] θ θ cos 2D Rotation of an arbitrary point Rotate about origin by θ = cos θ + sin θ 2D Rotation of an arbitrary point 푥 Rotate 푦 about origin by θ 푥′, 푦′ 푥′ = 푥 cos θ − 푦 sin θ 푦′ = 푥 sin θ + 푦 cos θ 푦 푥 2D Rotation Matrix 푥 Rotate 푦 about origin by θ 푥′, 푦′ 푥′ = 푥 cos θ − 푦 sin θ 푦′ = 푥 sin θ + 푦 cos θ 푦 푥′ cos θ − sin θ 푥 푥 = 푦′ sin θ cos θ 푦 cos θ − sin θ Matrix is rotation by θ sin θ cos θ 2D Orientation 풚 Yellow grid placed over first grid but at angle of θ cos θ − sin θ sin θ cos θ 풙 Columns of the matrix are the directions of the axes.
    [Show full text]
  • Closed-Form Solution of Absolute Orientation Using Unit Quaternions
    Berthold K. P. Horn Vol. 4, No. 4/April 1987/J. Opt. Soc. Am. A 629 Closed-form solution of absolute orientation using unit quaternions Berthold K. P. Horn Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, Hawaii 96720 Received August 6, 1986; accepted November 25, 1986 Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closed-form solution to the least-squares problem for three or more points. Currently various empirical, graphical, and numerical iterative methods are in use. Derivation of the solution is simplified by use of unit quaternions to represent rotation. I emphasize a symmetry property that a solution to this problem ought to possess. The best translational offset is the difference between the centroid of the coordinates in one system and the rotated and scaled centroid of the coordinates in the other system. The best scale is equal to the ratio of the root-mean-square deviations of the coordinates in the two systems from their respective centroids. These exact results are to be preferred to approximate methods based on measurements of a few selected points. The unit quaternion representing the best rotation is the eigenvector associated with the most positive eigenvalue of a symmetric 4 X 4 matrix. The elements of this matrix are combinations of sums of products of corresponding coordinates of the points. 1. INTRODUCTION I present a closed-form solution to the least-squares prob- lem in Sections 2 and 4 and show in Section 5 that it simpli- Suppose that we are given the coordinates of a number of fies greatly when only three points are used.
    [Show full text]