Principled Neuro-Functional Connectivity Discovery

How can we reverse-engineer the brain connectivity, given the input stimulus, and the corresponding brain-activity measurements, for several experiments? We show how to solve the problem in a principled way, modeling the brain as a linear dynamical system (LDS), and solving the resulting “system identification” problem after imposing sparsity and non-negativity constraints on the appropriate matrices. These are reasonable assumptions in some applications, including magnetoencephalography (MEG). There are three contributions: (a) Proof : We prove that this simple condition resolves the ambiguity of similarity transformation in the LDS identification problem; (b) Algorithm: we propose an effective algorithm which further induces sparse connectivity in a principled way; and (c) Validation: our experiments on semi-synthetic (C. elegans), as well as real MEG data, show that our method recovers the neural connectivity, and it leads to interpretable results.

[1]  Fei-Fei Li,et al.  Exploring Functional Connectivities of the Human Brain using Multivariate Information Analysis , 2009, NIPS.

[2]  David Pfau,et al.  Robust learning of low-dimensional dynamics from large neural ensembles , 2013, NIPS.

[3]  Victoria Stodden,et al.  When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts? , 2003, NIPS.

[4]  Nikos D. Sidiropoulos,et al.  Good-enough brain model: challenges, algorithms and discoveries in multi-subject experiments , 2014, KDD.

[5]  S. Muthukumaraswamy High-frequency brain activity and muscle artifacts in MEG/EEG: a review and recommendations , 2013, Front. Hum. Neurosci..

[6]  Antonio J. Plaza,et al.  A Signal Processing Perspective on Hyperspectral Unmixing: Insights from Remote Sensing , 2014, IEEE Signal Processing Magazine.

[7]  Riitta Salmelin,et al.  Tracking neural coding of perceptual and semantic features of concrete nouns , 2012, NeuroImage.

[8]  S. Liberty,et al.  Linear Systems , 2010, Scientific Parallel Computing.

[9]  H. Kuhn The Hungarian method for the assignment problem , 1955 .

[10]  Stephen J. Roberts,et al.  Bayesian Independent Component Analysis with Prior Constraints: An Application in Biosignal Analysis , 2004, Deterministic and Statistical Methods in Machine Learning.

[11]  Hartwig R. Siebner,et al.  Infinite Relational Modeling of Functional Connectivity in Resting State fMRI , 2010, NIPS.

[12]  Nikos D. Sidiropoulos,et al.  Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition , 2014, IEEE Transactions on Signal Processing.

[13]  Alex Simpkins,et al.  System Identification: Theory for the User, 2nd Edition (Ljung, L.; 1999) [On the Shelf] , 2012, IEEE Robotics & Automation Magazine.

[14]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[15]  Lennart Ljung,et al.  System Identification: Theory for the User , 1987 .

[16]  Nikos D. Sidiropoulos,et al.  Blind Separation of Quasi-Stationary Sources: Exploiting Convex Geometry in Covariance Domain , 2015, IEEE Transactions on Signal Processing.

[17]  Lieven Vandenberghe,et al.  Interior-Point Method for Nuclear Norm Approximation with Application to System Identification , 2009, SIAM J. Matrix Anal. Appl..

[18]  Adam M. Packer,et al.  Inferring neural population dynamics from multiple partial recordings of the same neural circuit , 2013, NIPS.

[19]  Vangelis Sakkalis,et al.  Review of advanced techniques for the estimation of brain connectivity measured with EEG/MEG , 2011, Comput. Biol. Medicine.