Opening Distance Matrices and the Procrustes Problem
Distance Matrices and the Procrustes Problem
- Length
- 29 min
- Level
- Undergraduate
- Recorded
- MIT2019
Chapter 1 of 5: Before the lecture
The Procrustes problem asks for the orthogonal matrix that best maps one set of vectors onto another, with error measured in the Frobenius norm. Strang first closes an example on distance matrices: when the given distances violate the triangle inequality, the position matrix is not positive semidefinite, and no points exist. Three formulas for the Frobenius norm follow: the sum of squared entries, the trace of , and the sum of squared singular values. Orthogonal factors leave that norm unchanged, and the trace is invariant under transposition and cyclic permutation. From these identities and the singular value decomposition of , the optimal orthogonal matrix comes out as .
Your comment is kept while you sign up.Sign in
Strang finds the orthogonal that best aligns two vector sets: , from the SVD of .
The Procrustes problem asks for the orthogonal matrix that best maps one set of vectors onto another, with error measured in the Frobenius norm. Strang first closes an example on distance matrices: when the given distances violate the triangle inequality, the position matrix is not positive semidefinite, and no points exist. Three formulas for the Frobenius norm follow: the sum of squared entries, the trace of , and the sum of squared singular values. Orthogonal factors leave that norm unchanged, and the trace is invariant under transposition and cyclic permutation. From these identities and the singular value decomposition of , the optimal orthogonal matrix comes out as .
Alex Lenail
This lecture
Lecture 32 of 34 of Matrix Methods in Data Analysis, Signal Processing, and Machine Learning.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.