TOPICS
Search

Orthogonal Procrustes Problem


For real matrices A,B in R^(d×n), the orthogonal Procrustes problem is the least squares problem

 min_(R^TR=I)||RA-B||_F^2,
(1)

where ||·||_F is the Frobenius norm. On writing

 C=BA^T=USigmaV^T
(2)

as a singular value decomposition, expanding the squared Frobenius norm gives

 ||A||_F^2+||B||_F^2-2Tr(R^TC).
(3)

Maximizing the matrix trace therefore gives an optimizer

 R_*=UV^T
(4)

and minimum value

 ||A||_F^2+||B||_F^2-2sum_(i=1)^dsigma_i,
(5)

where sigma_i are the singular values of C. If C is a nonsingular matrix, the optimizer is unique; if it is a singular matrix, the optimizer need not be unique (Schönemann 1966).

For the constrained problem in which R must be a proper rotation, define

 D=diag(1,...,1,det(UV^T)).
(6)

Then R_*=UDV^T is a solution. Applied to centered point sets, this construction is the Kabsch algorithm.


See also

Frobenius Norm, Kabsch Algorithm, Least Squares Fitting, Orthogonal Matrix, Polar Decomposition, Singular Value Decomposition, Special Orthogonal Group

Explore with Wolfram|Alpha

References

Gower, J. C. and Dijksterhuis, G. B. Ch. 4 in Procrustes Problems. Oxford, England: Oxford University Press, 2004. https://doi.org/10.1093/acprof:oso/9780198510581.001.0001.Lawrence, J.; Bernal, J.; and Witzgall, C. "A Purely Algebraic Justification of the Kabsch-Umeyama Algorithm." J. Res. Natl. Inst. Stand. Technol. 124, 124028, 2019. https://doi.org/10.6028/jres.124.028.Schönemann, P. H. "A Generalized Solution of the Orthogonal Procrustes Problem." Psychometrika 31, 1-10, 1966. https://doi.org/10.1007/BF02289451.

Cite this as:

Weisstein, Eric W. "Orthogonal Procrustes Problem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/OrthogonalProcrustesProblem.html

Subject classifications