An Algebraic Method for Approximate Rank One Factorization of Rank Deficient Matrices

In this paper we consider the problem of finding approximate common rank one factors for a set of matrices. Instead of jointly diagonalizing the matrices, we perform calculations directly in the problem intrinsic domain: we present an algorithm, AROFAC, which searches the approximate linear span of the matrices using an indicator function for the rank one factors, finding specific single sources. We evaluate the feasibility of this approach by discussing simulations on generated data and a neurophysiological dataset. Note however that our contribution is intended to be mainly conceptual in nature. © 2012 Springer-Verlag.

[1]  K. Müller,et al.  Finding stationary subspaces in multivariate time series. , 2009, Physical review letters.

[2]  Klaus-Robert Müller,et al.  Machine learning for real-time single-trial EEG-analysis: From brain–computer interfacing to mental state monitoring , 2008, Journal of Neuroscience Methods.

[3]  Andreas Ziehe,et al.  Identifying interactions in mixed and noisy complex systems. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Joseph Tabrikian,et al.  Three-dimensional source localization in a waveguide , 1996, IEEE Trans. Signal Process..

[5]  Lieven De Lathauwer,et al.  A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization , 2006, SIAM J. Matrix Anal. Appl..

[6]  Bernhard Schölkopf,et al.  Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.

[7]  Alle-Jan van der Veen,et al.  Joint diagonalization via subspace fitting techniques , 2001, ICASSP.

[8]  Arie Yeredor,et al.  On using exact joint diagonalization for noniterative approximate joint diagonalization , 2005, IEEE Signal Processing Letters.

[9]  J. Nocedal.  Updating Quasi-Newton Matrices With Limited Storage , 1980 .

[10]  Antoine Souloumiac,et al.  Jacobi Angles for Simultaneous Diagonalization , 1996, SIAM J. Matrix Anal. Appl..

[11]  J. Cardoso,et al.  Blind beamforming for non-gaussian signals , 1993 .

[12]  Arie Yeredor,et al.  Non-orthogonal joint diagonalization in the least-squares sense with application in blind source separation , 2002, IEEE Trans. Signal Process..

[13]  Arogyaswami Paulraj,et al.  An analytical constant modulus algorithm , 1996, IEEE Trans. Signal Process..

[14]  Andreas Ziehe,et al.  Analyzing Coupled Brain Sources: Distinguishing True from Spurious Interaction , 2005, NIPS.

[15]  Klaus-Robert Müller,et al.  Temporal kernel CCA and its application in multimodal neuronal data analysis , 2010, Machine Learning.

[16]  Andreas Ziehe,et al.  A Fast Algorithm for Joint Diagonalization with Non-orthogonal Transformations and its Application to Blind Source Separation , 2004, J. Mach. Learn. Res..

[17]  Dinh Tuan Pham,et al.  Joint Approximate Diagonalization of Positive Definite Hermitian Matrices , 2000, SIAM J. Matrix Anal. Appl..

[18]  M. Hallett,et al.  Identifying true brain interaction from EEG data using the imaginary part of coherency , 2004, Clinical Neurophysiology.