A new General Weighted Least-Squares Algorithm for Approximate Joint Diagonalization - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

A new General Weighted Least-Squares Algorithm for Approximate Joint Diagonalization

Christian Jutten
Reza Sameni
Cedric Gouy-Pailler

Résumé

Independent component analysis (ICA) and other blind source separation (BSS) methods are important processing tools for multi-channel processing of electroencephalographic data and have found numerous applications for brain-computer interfaces. A number of solutions to the BSS problem are achieved by approximate joint diagonalization (AJD) algorithms, thus the goodness of the solution depends on them. We present a new least-squares AJD algorithm with adaptive weighting on the separating vectors. We show that it has good properties while keeping the greatest generality among AJD algorithms; no constraint is imposed either on the input matrices or on the joint diagonalizer to be estimated. The new cost function allows interesting extensions that are now under consideration.
Fichier principal
Vignette du fichier
Congedo_2008_BCI_Workshop_II.pdf (709.77 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00324215 , version 1 (24-09-2008)

Identifiants

  • HAL Id : hal-00324215 , version 1

Citer

Marco Congedo, Christian Jutten, Reza Sameni, Cedric Gouy-Pailler. A new General Weighted Least-Squares Algorithm for Approximate Joint Diagonalization. BCI 2008 - 4th International Brain-Computer Interface Workshop and Training Course, Sep 2008, Graz, Austria. pp.98-103. ⟨hal-00324215⟩
531 Consultations
59 Téléchargements

Partager

Gmail Facebook X LinkedIn More