Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE (2000) The protein data bank. Nucleic Acids Res 28: 235–242
Chen MH, Shao QM, Ibrahim JG (2002) Monte Carlo Methods in Bayesian Computation. Springer Verlag, Inc., New York
Choi KN, Carcassoni M, Hancock ER (2002) Recovering facial pose with the EM algorithm. Pattern Recognit 35: 2073–2093
Devroye L (1986) Non-uniform random variate generation. Springer, New York
Geman S, Geman D (1984) Stochastic relaxation, gibbs distributions, and the Bayesian restoration of images. IEEE Trans PAMI 6(6): 721–741
Green PJ, Mardia KV (2006) Bayesian alignment using hierarchical models, with applications in protein bioinformatics. Biometrika 93: 235–254
Hartigan J (1964) Invariant prior distributions. Ann Math Stat 35: 836–845
Higham NJ (1989) Matrix nearness problems and applications. In: Gover MJC, Barnett S (eds) Applications of matrix theory. Oxford University Press, Oxford, pp 1–27
Horn RA, Johnson CR (1991) Topics in matrix analysis. Cambridge University Press, Cambridge
Kabsch W (1976) A solution for the best rotation to relate two sets of vectors. Acta Cryst A 32: 922–923
MacKay DJC (2003) Information theory, inference, and learning algorithms. Cambridge University Press, Cambridge
Miles RE (1965) On random rotations in R 3. Biometrika 52: 636–639
Theobald DL, Wuttke DS (2006) Empirical Bayes hierarchical models for regularizing maximum likelihood estimation in the matrix Gaussian Procrustes problem. Proc Natl Acad Sci USA 103: 18,521–18,527
Open Access
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Habeck, M. Generation of three-dimensional random rotations in fitting and matching problems. Comput Stat 24, 719–731 (2009). https://doi.org/10.1007/s00180-009-0156-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00180-009-0156-x