A new General Weighted Least-Squares Algorithm for Approximate Joint Diagonalization
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...