In this paper we apply the concept of the Clifford torus and the derived square torus maps to the study of disorientations in microstructures. First, we interpret the Clifford torus in terms of the more commonly used orientation representations (Rodrigues-Frank vectors, 3D stereographic vectors, and homochoric vectors) and show representations of the torus in those spaces. This leads to a simple graphical interpretation of the generation and meaning of the square torus maps. Then we apply this approach to the study of disorientations in polycrystalline materials (CSL boundaries in grain boundary engineered Nickel) as well as intervariant boundaries in martensitic and bainitic steels. We show that pre-computed theoretical square torus maps can be used to determine population fractions of specific boundaries.
more »
« less
Applications of the Clifford torus to material textures
This paper introduces a new 2D representation of the orientation distribution function for an arbitrary material texture. The approach is based on the isometric square torus mapping of the Clifford torus, which allows for points on the unit quaternion hypersphere (each corresponding to a 3D orientation) to be represented in a periodic 2D square map. The combination of three such orthogonal mappings into a single RGB (red–green–blue) image provides a compact periodic representation of any set of orientations. Square torus representations of five different orientation sampling methods are compared and analyzed in terms of the Rieszsenergies that quantify the uniformity of the samplings. The effect of crystallographic symmetry on the square torus map is analyzed in terms of the Rodrigues fundamental zones for the rotational symmetry groups. The paper concludes with example representations of important texture components in cubic and hexagonal materials. The new RGB representation provides a convenient and compact way of generating training data for the automated analysis of material textures by means of neural networks.
more »
« less
- Award ID(s):
- 2203378
- PAR ID:
- 10529570
- Publisher / Repository:
- International Union for Crystallography
- Date Published:
- Journal Name:
- Journal of Applied Crystallography
- Volume:
- 57
- Issue:
- 3
- ISSN:
- 1600-5767
- Page Range / eLocation ID:
- 638 to 648
- Subject(s) / Keyword(s):
- orientation distribution functions texture symmetry quaternions Clifford torus
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract In this paper we present a reconstruction technique for the reduction of unsteady flow data based on neural representations of time‐varying vector fields. Our approach is motivated by the large amount of data typically generated in numerical simulations, and in turn the types of data that domain scientists can generatein situthat are compact, yet useful, for post hoc analysis. One type of data commonly acquired during simulation are samples of the flow map, where a single sample is the result of integrating the underlying vector field for a specified time duration. In our work, we treat a collection of flow map samples for a single dataset as a meaningful, compact, and yet incomplete, representation of unsteady flow, and our central objective is to find a representation that enables us to best recover arbitrary flow map samples. To this end, we introduce a technique for learning implicit neural representations of time‐varying vector fields that are specifically optimized to reproduce flow map samples sparsely covering the spatiotemporal domain of the data. We show that, despite aggressive data reduction, our optimization problem — learning a function‐space neural network to reproduce flow map samples under a fixed integration scheme — leads to representations that demonstrate strong generalization, both in the field itself, and using the field to approximate the flow map. Through quantitative and qualitative analysis across different datasets we show that our approach is an improvement across a variety of data reduction methods, and across a variety of measures ranging from improved vector fields, flow maps, and features derived from the flow map.more » « less
-
The activity of the grid cell population in the medial entorhinal cortex (MEC) of the mammalian brain forms a vector representation of the self-position of the animal. Recurrent neural networks have been proposed to explain the properties of the grid cells by updating the neural activity vector based on the velocity input of the animal. In doing so, the grid cell system effectively performs path integration. In this paper, we investigate the algebraic, geometric, and topological properties of grid cells using recurrent network models. Algebraically, we study the Lie group and Lie algebra of the recurrent transformation as a representation of self-motion. Geometrically, we study the conformal isometry of the Lie group representation where the local displacement of the activity vector in the neural space is proportional to the local displacement of the agent in the 2D physical space. Topologically, the compact abelian Lie group representation automatically leads to the torus topology commonly assumed and observed in neuroscience. We then focus on a simple non-linear recurrent model that underlies the continuous attractor neural networks of grid cells. Our numerical experiments show that conformal isometry leads to hexagon periodic patterns in the grid cell responses and our model is capable of accurate path integration.more » « less
-
We propose a method for autonomously learning an object-centric representation of a continuous and high-dimensional environment that is suitable for planning. Such representations can immediately be transferred between tasks that share the same types of objects, resulting in agents that require fewer samples to learn a model of a new task. We first demonstrate our approach on a 2D crafting domain consisting of numerous objects where the agent learns a compact, lifted representation that generalises across objects. We then apply it to a series of Minecraft tasks to learn object-centric representations and object types---directly from pixel data---that can be leveraged to solve new tasks quickly. The resulting learned representations enable the use of a task-level planner, resulting in an agent capable of transferring learned representations to form complex, long-term plans.more » « less
-
Abstract Given an irreducible, end‐periodic homeomorphism of a surface with finitely many ends, all accumulated by genus, the mapping torus, , is the interior of a compact, irreducible, atoroidal 3‐manifold with incompressible boundary. Our main result is an upper bound on the infimal hyperbolic volume of in terms of the translation length of on the pants graph of . This builds on work of Brock and Agol in the finite‐type setting. We also construct a broad class of examples of irreducible, end‐periodic homeomorphisms and use them to show that our bound is asymptotically sharp.more » « less
An official website of the United States government

