Generation of three-dimensional random rotations in fitting and matching problems
- 659 Downloads
An algorithm is developed to generate random rotations in three-dimensional space that follow a probability distribution arising in fitting and matching problems. The rotation matrices are orthogonally transformed into an optimal basis and then parameterized using Euler angles. The conditional distributions of the three Euler angles have a very simple form: the two azimuthal angles can be decoupled by sampling their sum and difference from a von Mises distribution; the cosine of the polar angle is exponentially distributed and thus straighforward to generate. Simulation results are shown and demonstrate the effectiveness of the method. The algorithm is compared to other methods for generating random rotations such as a random walk Metropolis scheme and a Gibbs sampling algorithm recently introduced by Green and Mardia. Finally, the algorithm is applied to a probabilistic version of the Procrustes problem of fitting two point sets and applied in the context of protein structure superposition.
KeywordsMarkov chain Monte Carlo Random rotation Euler angles Von Mises distribution Procrustes problem Nearest rotation matrix
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
- Chen MH, Shao QM, Ibrahim JG (2002) Monte Carlo Methods in Bayesian Computation. Springer Verlag, Inc., New YorkGoogle Scholar
- Higham NJ (1989) Matrix nearness problems and applications. In: Gover MJC, Barnett S (eds) Applications of matrix theory. Oxford University Press, Oxford, pp 1–27Google Scholar