Blind source separation via generalized eigenvalue decomposition

  • Authors:
  • Lucas Parra;Paul Sajda

  • Affiliations:
  • Department of Biomedical Engineering, The City College of New York, New York, NY;Department of Biomedical Engineering, Columbia University, New York, NY

  • Venue:
  • The Journal of Machine Learning Research
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this short note we highlight the fact that linear blind source separation can be formulated as a generalized eigenvalue decomposition under the assumptions of non-Gaussian, non-stationary, or non-white independent sources. The solution for the unmixing matrix is given by the generalized eigenvectors that simultaneously diagonalize the covariance matrix of the observations and an additional symmetric matrix whose form depends upon the particular assumptions. The method critically determines the mixture coefficients and is therefore not robust to estimation errors. However it provides a rather general and unified solution that summarizes the conditions for successful blind source separation. To demonstrate the method, which can be implemented in two lines of matlab code, we present results for artificial mixtures of speech and real mixtures of electroencephalography (EEG) data, showing that the same sources are recovered under the various assumptions.