A survey on the computation of quaternions from rotation matrices

The parameterization of rotations is a central topic in many theoretical and applied fields such as rigid body mechanics, multibody dynamics, robotics, spacecraft attitude dynamics, navigation, 3D image processing, computer graphics, etc. Nowadays, the main alternative to the use of rotation matrices, to represent rotations in R3, is the use of Euler parameters arranged in quaternion form. Whereas the passage from a set of Euler parameters to the corresponding rotation matrix is unique and straightforward, the passage from a rotation matrix to its corresponding Euler parameters has been revealed to be somewhat tricky if numerical aspects are considered. Since the map from quaternions to 3x3 rotation matrices is a 2-to-1 covering map, this map cannot be smoothly inverted. As a consequence, it is erroneously assumed that all inversions should necessarily contain singularities that arise in the form of quotients where the divisor can be arbitrarily small. This misconception is herein clarified. This paper reviews the most representative methods available in the literature, including a comparative analysis of their computational costs and error performances. The presented analysis leads to the conclusion that Cayley's factorization, a little-known method used to compute the double quaternion representation of rotations in four dimensions from 4x4 rotation matrices, is the most robust method when particularized to three dimensionsPreprin

Technique for measuring the dielectric constant of thin materials

A practical technique for measuring the dielectric constant of vegetation leaves and similarly thin materials is presented. A rectangular section of the leaf is placed in the tranverse plane in a rectangular waveguide and the magnitude and phase of the reflection coefficient are measured over the desired frequency band using a vector network analyzer. By treating the leaf as an infinitesimally thin resistive sheet, an explicit expression for its dielectric constant is obtained in terms of the reflection coefficient. Because of the thin-sheet approximation, however, this approach is valid only at frequencies below 1.5 GHz. To extend the technique to higher frequencies, higher order approximations are derived and their accuracies are compared to the exact dielectric-slab solution. For a material whose thickness is 0.5 mm or less, the proposed technique was found to provide accurate values of its dielectric constant up to frequencies of 12 GHz or higher. The technique was used to measure the 8 to 12 GHz dielectric spectrum for vegetation leaves, teflon and rock samples

Solving the nearest rotation matrix problem in three and four dimensions with applications in robotics

Aplicat embargament des de la data de defensa fins ei 31/5/2022Since the map from quaternions to rotation matrices is a 2-to-1 covering map, this map cannot be smoothly inverted. As a consequence, it is sometimes erroneously assumed that all inversions should necessarily contain singularities that arise in the form of quotients where the divisor can be arbitrarily small. This misconception was clarified when we found a new division-free conversion method. This result triggered the research work presented in this thesis. At first glance, the matrix to quaternion conversion does not seem to be a relevant problem. Actually, most researchers consider it as a well-solved problem whose revision is not likely to provide any new insight in any area of practical interest. Nevertheless, we show in this thesis how solving the nearest rotation matrix problem in Frobenius norm can be reduced to a matrix to quaternion conversion. Many problems, such as hand-eye calibration, camera pose estimation, location recognition, image stitching etc. require finding the nearest proper orthogonal matrix to a given matrix. Thus, the matrix to quaternion conversion becomes of paramount importance. While a rotation in 3D can be represented using a quaternion, a rotation in 4D can be represented using a double quaternion. As a consequence, the computation of the nearest rotation matrix in 4D, using our approach, essentially follow the same steps as in the 3D case. Although the 4D case might seem of theoretical interest only, we show in this thesis its practical relevance thanks to a little known mapping between 3D displacements and 4D rotations. In this thesis we focus our attention in obtaining closed-form solutions, in particular those that only require the four basic arithmetic operations because they can easily be implemented on microcomputers with limited computational resources. Moreover, closed-form methods are preferable for at least two reasons: they provide the most meaningful answer because they permit analyzing the influence of each variable on the result; and their computational cost, in terms of arithmetic operations, is fixed and assessable beforehand. We have actually derived closed-form methods specifically tailored for solving the hand-eye calibration and the pointcloud registration problems which outperform all previous approaches.Dado que la función que aplica a cada cuaternión su matrix de rotación correspondiente es 2 a 1, la inversa de esta función no es diferenciable en todo su dominio. Por consiguiente, a veces se asume erróneamente que todas las inversiones deben contener necesariamente singularidades que surgen en forma de cocientes donde el divisor puede ser arbitrariamente pequeño. Esta idea errónea se aclaró cuando encontramos un nuevo método de conversión sin división. Este resultado desencadenó el trabajo de investigación presentado en esta tesis. A primera vista, la conversión de matriz a cuaternión no parece un problema relevante. En realidad, la mayoría de los investigadores lo consideran un problema bien resuelto cuya revisión no es probable que proporcione nuevos resultados en ningún área de interés práctico. Sin embargo, mostramos en esta tesis cómo la resolución del problema de la matriz de rotación más cercana según la norma de Frobenius se puede reducir a una conversión de matriz a cuaternión. Muchos problemas, como el de la calibración mano-cámara, el de la estimación de la pose de una cámara, el de la identificación de una ubicación, el del solapamiento de imágenes, etc. requieren encontrar la matriz de rotación más cercana a una matriz dada. Por lo tanto, la conversión de matriz a cuaternión se vuelve de suma importancia. Mientras que una rotación en 3D se puede representar mediante un cuaternión, una rotación en 4D se puede representar mediante un cuaternión doble. Como consecuencia, el cálculo de la matriz de rotación más cercana en 4D, utilizando nuestro enfoque, sigue esencialmente los mismos pasos que en el caso 3D. Aunque el caso 4D pueda parecer de interés teórico únicamente, mostramos en esta tesis su relevancia práctica gracias a una función poco conocida que relaciona desplazamientos en 3D con rotaciones en 4D. En esta tesis nos centramos en la obtención de soluciones de forma cerrada, en particular aquellas que solo requieren las cuatro operaciones aritméticas básicas porque se pueden implementar fácilmente en microcomputadores con recursos computacionales limitados. Además, los métodos de forma cerrada son preferibles por al menos dos razones: proporcionan la respuesta más significativa porque permiten analizar la influencia de cada variable en el resultado; y su costo computacional, en términos de operaciones aritméticas, es fijo y evaluable de antemano. De hecho, hemos derivado nuevos métodos de forma cerrada diseñados específicamente para resolver el problema de la calibración mano-cámara y el del registro de nubes de puntos cuya eficiencia supera la de todos los métodos anteriores.Postprint (published version

Singularity-free computation of quaternions from rotation matrices in E4 and E3

A real orthogonal matrix representing a rotation in E4 can be decomposed into the commutative product of a left-isoclinic and a right-isoclinic rotation matrix. The double quaternion representation of rotations in E4 follows directly from this decomposition. In this paper, it is shown how this decomposition can be performed without divisions. This avoids the common numerical issues attributed to the computation of quaternions from rotation matrices. The map from the 4×4 rotation matrices to the set of double unit quaternions is a 2-to-1 covering map. Thus, this map cannot be smoothly inverted. As a consequence, it is erroneously assumed that all inversions should necessarily contain singularities that arise in the form of quotients where the divisor can be arbitrarily small. This misconception is herein clari¿ed. When particularized to three dimensions, it is shown how the resulting formulation outperforms, from the numerical point of view, the celebrated Shepperd’s method.Peer ReviewedPostprint (author's final draft

On Cayley's factorization with an application to the orthonormalization of noisy rotation matrices

The final publication is available at link.springer.comA real orthogonal matrix representing a rotation in four dimensions can be decomposed into the commutative product of a left- and a right-isoclinic rotation matrix. This operation, known as Cayley's factorization, directly provides the double quaternion representation of rotations in four dimensions. This factorization can be performed without divisions, thus avoiding the common numerical issues attributed to the computation of quaternions from rotation matrices. In this paper, it is shown how this result is particularly useful, when particularized to three dimensions, to re-orthonormalize a noisy rotation matrix by converting it to quaternion form and then obtaining back the corresponding proper rotation matrix. This re-orthonormalization method is commonly implemented using the Shepperd-Markley method, but the method derived here is shown to outperform it by returning results closer to those obtained using the Singular Value Decomposition which are known to be optimal in terms of the Frobenius norm.Peer ReviewedPostprint (author's final draft

Radio wave propagation in the presence of a coastline

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/94987/1/rds4883.pd

Approximating displacements in R^3 by rotations in R^4 and its application to pointcloud registration

© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting /republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other worksNo proper norm exists to measure the distance between two object poses essentially because a general pose is defined by a rotation and a translation, and thus it involves magnitudes with different units. As a means to solve this dimensional-inhomogeneity problem, the concept of characteristic length has been put forward in the area of kinematics. The idea consists in scaling translations according to this characteristic length and then approximating the corresponding displacement defining the object pose in R^3 by a rotation in R^4, for which a norm exists. This paper sheds new light on this kind of approximations which permits simplifying optimization problem whose cost functions involve translations and rotations simultaneously. A good example of this kind of problems is the pointcloud registration problem in which the optimal rotation and translation between two sets of corresponding 3D point data, so that they are aligned/registered, have to be found. As a result, a simple closed-form formula for solving this problem is presented which is shown to be an attractive alternative to the previous approaches.Peer ReviewedPostprint (author's final draft

Reflectarray antenna based on grounded loop‐wire miniaturised‐element frequency selective surfaces

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/163804/1/mia2bf00289.pd

Effect of curvature on the backscattering from leaves

Using a model previously developed for the backscattering cross section of a planar leaf at X-band frequencies and above, the effect of leaf curvature is examined. For normal incidence on a rectangular section of a leaf curved in one and two dimensions, an integral expression for the backscattered field is evaluated numerically and by a stationary phase approximation, leading to a simple analytical expression for the cross section reduction produced by the curvature. Numerical results based on the two methods are virtually identical, and in excellent agreement with measured data for rectangular sections of coleus leaves applied to the surfaces of styrofoam cylinders and spheres of different radii

Field of a short dipole above a dielectric half‐space with rough interface

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/163837/1/mia2bf01553.pd