Orthogonal Procrustes problem

The orthogonal Procrustes problem ^[1] is a matrix approximation problem in linear algebra. In its classical form, one is given two matrices $A$ and $B$ and asked to find an orthogonal matrix $R$ which most closely maps $A$ to $B$ . ^[2] Specifically,

R=\arg \min _{\Omega }\|\Omega A-B\|_{F}\quad \mathrm {subject\ to} \quad \Omega ^{T}\Omega =I,

where $\|\cdot \|_{F}$ denotes the Frobenius norm.

The name Procrustes refers to a bandit from Greek mythology who made his victims fit his bed by either stretching their limbs or cutting them off.

Solution

This problem was originally solved by Peter Schönemann in a 1964 thesis. The individual solution was later published. ^[3] A proof is also given in ^[4]

This problem is equivalent to finding the nearest orthogonal matrix to a given matrix $M=BA^{T}$ . To find this orthogonal matrix $R$ , one uses the singular value decomposition

M=U\Sigma V^{T}\,\!

to write

R=UV^{T}.\,\!

Proof

One proof depends on basic properties of the standard matrix inner product that induces the Frobenius norm:

{\begin{aligned}R&=\arg \min _{\Omega }||\Omega A-B\|_{F}^{2}\\&=\arg \min _{\Omega }\langle \Omega A-B,\Omega A-B\rangle \\&=\arg \min _{\Omega }\|A\|_{F}^{2}+\|B\|_{F}^{2}-2\langle \Omega A,B\rangle \\&=\arg \max _{\Omega }\langle \Omega ,BA^{T}\rangle \\&=\arg \max _{\Omega }\langle V^{T}\Omega ^{T}U,\Sigma \rangle \\&=U\left(\arg \max _{\Omega ^{'}}\langle \Omega ^{'},\Sigma \rangle \right)V^{T}\\&=UV^{T}.\end{aligned}}

Generalized/constrained Procrustes problems

There are a number of related problems to the classical orthogonal Procrustes problem. One might generalize it by seeking the closest matrix in which the columns are orthogonal, but not necessarily orthonormal. ^[5]

Alternately, one might constrain it by only allowing rotation matrices (i.e. orthogonal matrices with determinant 1, also known as special orthogonal matrices). In this case, one can write (using the above decomposition $M=U\Sigma V^{T}$ )

R=U\Sigma 'V^{T},\,\!

where $\Sigma '\,\!$ is a modified $\Sigma \,\!$ , with the smallest singular value replaced by $\operatorname {sign} (\det(UV^{T}))$ (+1 or -1), and the other singular values replaced by 1, so that the determinant of R is guaranteed to be positive. ^[6] For more information, see the Kabsch algorithm.

References

↑ Gower, J.C; Dijksterhuis, G.B. (2004), Procrustes Problems, Oxford University Press
↑ Hurley, J.R.; Cattell, R.B. (1962), "Producing direct rotation to test a hypothesized factor structure", Behavioral Science, 7 (2): 258–262, doi:10.1002/bs.3830070216
↑ Schönemann, P.H. (1966), "A generalized solution of the orthogonal Procrustes problem" (PDF), Psychometrika, 31: 1–10, doi:10.1007/BF02289451.
↑ Zhang, Z. (1998), A Flexible New Technique for Camera Calibration (PDF), Microsoft Research Technical Report, 71
↑ Everson, R (1997), Orthogonal, but not Orthonormal, Procrustes Problems (PDF)
↑ Eggert, DW; Lorusso, A; Fisher, RB (1997), "Estimating 3-D rigid body transformations: a comparison of four major algorithms", Machine Vision and Applications, 9 (5): 272–290, doi:10.1007/s001380050048

This article is issued from Wikipedia - version of the 8/10/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.

Orthogonal Procrustes problem

Solution

Proof

Generalized/constrained Procrustes problems

See also

References