Text Practice Mode
5
Rating visible after 3 or more votes
saving score / loading statistics ...
00:00
Multilinear principal component analysis (MPCA) is a mathematical procedure that uses multiple orthogonal transformations to convert a set of multidimensional objects into another set of multidimensional objects of lower dimensions. There is one orthogonal (linear) transformation for each dimension (mode); hence multilinear. This transformation aims to capture as high a variance as possible, accounting for as much of the variability in the data as possible, subject to the constraint of mode-wise orthogonality.
MPCA is a multilinear extension of principal component analysis (PCA). The major difference is that PCA needs to reshape a multidimensional object into a vector, while MPCA operates directly on multidimensional objects through mode-wise processing. For example, for 100x100 images, PCA operates on vectors of 10000x1 while MPCA operates on vectors of 100x1 in two modes. For the same amount of dimension reduction, PCA needs to estimate 49*(10000/(100*2)-1) times more parameters than MPCA. Thus, MPCA is more efficient and better conditioned in practice.
MPCA is a basic algorithm for dimension reduction via multilinear subspace learning. In wider scope, it belongs to tensor-based computation. Its origin can be traced back to the Tucker decomposition in 1960s and it is closely related to higher-order singular value decomposition, (HOSVD) and to the best rank-(R1, R2, ..., RN ) approximation of higher-order tensors.
MPCA is a multilinear extension of principal component analysis (PCA). The major difference is that PCA needs to reshape a multidimensional object into a vector, while MPCA operates directly on multidimensional objects through mode-wise processing. For example, for 100x100 images, PCA operates on vectors of 10000x1 while MPCA operates on vectors of 100x1 in two modes. For the same amount of dimension reduction, PCA needs to estimate 49*(10000/(100*2)-1) times more parameters than MPCA. Thus, MPCA is more efficient and better conditioned in practice.
MPCA is a basic algorithm for dimension reduction via multilinear subspace learning. In wider scope, it belongs to tensor-based computation. Its origin can be traced back to the Tucker decomposition in 1960s and it is closely related to higher-order singular value decomposition, (HOSVD) and to the best rank-(R1, R2, ..., RN ) approximation of higher-order tensors.
