Header logo is

Generation of three-dimensional random rotations in fitting and matching problems




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.

Author(s): Habeck, M.
Journal: Computational Statistics
Volume: 24
Number (issue): 4
Pages: 719-731
Year: 2009
Month: December
Day: 0

Department(s): Empirical Inference
Bibtex Type: Article (article)

Digital: 0
DOI: 0.1007/s00180-009-0156-x
Language: en
Organization: Max-Planck-Gesellschaft
School: Biologische Kybernetik

Links: PDF


  title = {Generation of three-dimensional random rotations in fitting and matching problems},
  author = {Habeck, M.},
  journal = {Computational Statistics},
  volume = {24},
  number = {4},
  pages = {719-731},
  organization = {Max-Planck-Gesellschaft},
  school = {Biologische Kybernetik},
  month = dec,
  year = {2009},
  month_numeric = {12}