Generation of three-dimensional random rotations in fitting and matching problems (Q638054): Difference between revisions
From MaRDI portal
Latest revision as of 11:16, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generation of three-dimensional random rotations in fitting and matching problems |
scientific article |
Statements
Generation of three-dimensional random rotations in fitting and matching problems (English)
0 references
8 September 2011
0 references
A Gibbs sampling algorithm is proposed for generating random 3D rotating matrices \(R\) (i.e., \(R\in SO(3)\)) with probability density proportional to \( \exp\{-{1\over 2}\| A-R\| ^2_F\}\), where \(\| \cdot\| _F\) is the Frobenius norm and \(A\) is some fixed matrix. In fact, the Euler angles are simulated for the deviation of \(R\) from the most probable matrix. An application to the analysis of protein molecule structures is presented.
0 references
Gibbs sampler
0 references
Markov chain Monte Carlo
0 references
random rotation matrix
0 references
Euler angles
0 references
algorithm
0 references
protein molecules
0 references
0 references
