Approximate Joint Diagonalization within the Riemannian Geometry Framework - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Approximate Joint Diagonalization within the Riemannian Geometry Framework

Abstract

We consider the approximate joint diagonalization problem (AJD) related to the well known blind source separation (BSS) problem within the Riemannian geometry framework. We define a new manifold named special polar manifold equivalent to the set of full rank matrices with a unit determinant of their Gram matrix. The Riemannian trust-region optimization algorithm allows us to define a new method to solve the AJD problem. This method is compared to previously published NoJOB and UWEDGE algorithms by means of simulations and shows comparable performances. This Riemannian optimization approach thus shows promising results. Since it is also very flexible, it can be easily extended to block AJD or joint BSS.
Fichier principal
Vignette du fichier
2016-eusipco-RAJD_Bouchard_Korczowski_Malick_Congedo.pdf (834.45 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01370052 , version 1 (21-09-2016)

Identifiers

Cite

Florent Bouchard, Louis Korczowski, Jérôme Malick, Marco Congedo. Approximate Joint Diagonalization within the Riemannian Geometry Framework. EUSIPCO 2016 - 24th European Signal Processing Conference, Aug 2016, Budapest, Hungary. pp.210-214, ⟨10.1109/EUSIPCO.2016.7760240⟩. ⟨hal-01370052⟩
270 View
285 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More