Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

Wahba's problem

From Wikipedia, the free encyclopedia

In applied mathematics, Wahba's problem, first posed by Grace Wahba in 1965, seeks to find a rotation matrix (special orthogonal matrix) between two coordinate systems from a set of (weighted) vector observations. Solutions to Wahba's problem are often used in satellite attitude determination utilising sensors such as magnetometers and multi-antenna GPS receivers. The cost function that Wahba's problem seeks to minimise is as follows:

for

where is the k-th 3-vector measurement in the reference frame, is the corresponding k-th 3-vector measurement in the body frame and is a 3 by 3 rotation matrix between the coordinate frames.[1] is an optional set of weights for each observation.

A number of solutions to the problem have appeared in literature, notably Davenport's q-method,[2] QUEST and methods based on the singular value decomposition (SVD). Several methods for solving Wahba's problem are discussed by Markley and Mortari.

This is an alternative formulation of the orthogonal Procrustes problem (consider all the vectors multiplied by the square-roots of the corresponding weights as columns of two matrices with N columns to obtain the alternative formulation). A compact and elegant derivation can be found in Appel (2015).[3]

Solution via SVD

[edit]

One solution can be found using a singular value decomposition (SVD).

1. Obtain a matrix as follows:

2. Find the singular value decomposition of

3. The rotation matrix is simply:

where

Geometric interpretation using quaternion circles

[edit]

A geometric interpretation of Wahba’s problem using unit quaternions was presented by Liu, et. al (2026)[4]

For unit vector observations, each correspondence defines a circle of admissible quaternions, called a ''quaternion circle''. To see this, choose any unit quaternion whose rotation maps to . Every other rotation satisfying this correspondence is obtained by subsequently rotating about . With scalar-first quaternions and Hamilton multiplication , its quaternion can therefore be written as Quaternion multiplication preserves norms, and . Thus and are orthonormal vectors in , and the complete set of admissible quaternions is a greate circle due to 2-to-1 ampping from quaternion to rotation.

For mutually consistent observations, the solution lies at the common intersection of these circles. Two correspondences with non-collinear source vectors determine a unique rotation, represented by two antipodal intersection points. With measurement noise, the circles need not have a common intersection[4].

The same geometry gives a linear least-squares formulation. Let the rows of form an orthonormal basis for the orthogonal complement of and . Therefore, each exact correspondence is then equivalent towhich surprisingly is a classical linear formulation with unit-norm constraints.

Notes

[edit]
  1. ↑ The rotation in the problem's definition transforms the body frame to the reference frame. Most publications define rotation in the reverse direction, i.e. from the reference to the body frame which amounts to .
  2. ↑ "Davenport's Q-method (Finding an orientation matching a set of point samples)". Mathematics Stack Exchange. Retrieved 2020-07-23.
  3. ↑ Appel, M. "Robust Spoofing Detection and Mitigation based on Direction of Arrival Estimation" (PDF). Ion GNSS+ 2015. 28.
  4. 1 2 Liu, Yinlong; Huang, Tianyu; Yang, Zhi-Xin (2026). "Linearly Solving Robust Rotation Estimation". IEEE Transactions on Pattern Analysis and Machine Intelligence. 48 (10): 13305–13322. doi:10.1109/TPAMI.2026.3707470. ISSN 1939-3539.

References

[edit]

See also

[edit]