Approximate Joint Singular Value Decomposition of an Asymmetric Rectangular Matrix Set

Marco Congedo (1) , Ronald Phlypo (1) , Dinh-Tuan Pham (2)

1 GIPSA-VIBS - GIPSA - Vision and Brain Signal Processing
2 IMAG - Institut d'Informatique et de Mathématiques Appliquées de Grenoble

The singular value decomposition C = U*Lambda*transpose(V) is among the most useful and widespread tools in linear algebra. Often in engineering a multitude of matrices with common latent structure are available. Suppose we have a set of K matrices {C1, ..., Ck, ... CK} for which we wish to find two orthogonal matrices U and V such that all products transpose(U)*Ck*V are as close as possible to rectangular diagonal form. We show that the problem can be solved efficiently by iterating either power iterations followed by an orthogonalization process or Givens rotations. The two proposed algorithms can be seen as a generalization of approximate joint diagonalization (AJD) algorithms to the bilinear orthogonal forms. Indeed, if the input matrices are symmetric and U=V, the optimization problem reduces to that of orthogonal AJD. The effectiveness of the algorithms is shown with numerical simulations and the analysis of a large database of 84 electroencephalographic recordings. The proposed algorithms open the road to new applications of the blind source separation framework, of which we give some example for electroencephalographic data.

Mots clés: Bilinear orthogonal approximate joint diagonalization; givens rotations; Jacobi iterations; Lödwin orthogonalization; power iteration; singular value decomposition

Domaines: Traitement du signal et de l'image [eess.SP]; Traitement du signal et de l'image [eess.SP]

Marco Congedo, Ronald Phlypo, Dinh-Tuan Pham. Approximate Joint Singular Value Decomposition of an Asymmetric Rectangular Matrix Set. IEEE Transactions on Signal Processing, 2011, 59 (1), pp.415-424. ⟨10.1109/TSP.2010.2087018⟩. ⟨hal-00559251⟩