Gradient based Approximate Joint Diagonalization by Orthogonal Transforms

Mikael Sorensen (1) , Sylvie Icart (1) , Pierre Comon (1) , Luc Deneire (1)

1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SIGNAL

Approximate Joint Diagonalization (AJD) of a set of symmetric matrices by an orthogonal transform is a popular problem in Blind Source Separation (BSS). In this paper we propose a gradient based algorithm which maximizes the sum of squares of diagonal entries of all the transformed symmetric matrices. Our main contribution is to transform the orthogonality constrained optimization problem into an unconstrained problem. This transform is performed in two steps: First by parameterizing the orthogonal transform matrix by the matrix exponential of a skew-symmetric matrix. Second, by introducing an isomorphism between the vector space of skew-symmetric matrices and the Euclidean vector space of appropriate dimension. This transform is then applied to a gradient based algorithm called GAEX to perform joint diagonalization of a set of symmetric matrices.

Mots clés: Joint diagonalization; orthogonal transform; tensor

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

Mikael Sorensen, Sylvie Icart, Pierre Comon, Luc Deneire. Gradient based Approximate Joint Diagonalization by Orthogonal Transforms. 16th European Signal Processing Conference (Eusipco'08), Aug 2008, lausanne, Switzerland. pp.session L11-1. ⟨hal-00339522⟩