Sparsity and Independence: Balancing Two Objectives in Optimization for Source Separation with Application to fMRI Analysis

Abstract Because of its wide applicability in various disciplines, blind source separation (BSS), has been an active area of research. For a given dataset, BSS provides useful decompositions under minimum assumptions typically by making use of statistical properties—types of diversity—of the data. Two popular types of diversity that have proven useful for many applications are statistical independence and sparsity. Although many methods have been proposed for the solution of the BSS problem that take either the statistical independence or the sparsity of the data into account, there is no unified method that can take into account both types of diversity simultaneously. In this work, we provide a mathematical framework that enables direct control over the influence of these two types of diversity and apply the proposed framework to the development of an effective ICA algorithm that can jointly exploit independence and sparsity. In addition, due to its importance in biomedical applications, we propose a new model reproducibility framework for the evaluation of the proposed algorithm. Using simulated functional magnetic resonance imaging (fMRI) data, we study the trade-offs between the use of sparsity versus independence in terms of the separation accuracy and reproducibility of the algorithm and provide guidance on how to balance these two objectives in real world applications where the ground truth is not available.

[1]  D. Bertsekas The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

[2]  Terrence J. Sejnowski,et al.  An Information-Maximization Approach to Blind Separation and Blind Deconvolution , 1995, Neural Computation.

[3]  V. Calhoun,et al.  Multisubject Independent Component Analysis of fMRI: A Decade of Intrinsic Networks, Default Mode, and Neurodiagnostic Discovery , 2012, IEEE Reviews in Biomedical Engineering.

[4]  Mark W. Schmidt,et al.  Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches , 2007, ECML.

[5]  Andrew D. Back,et al.  A First Application of Independent Component Analysis to Extracting Structure from Stock Returns , 1997, Int. J. Neural Syst..

[6]  L. K. Hansen,et al.  The Quantitative Evaluation of Functional Neuroimaging Experiments: The NPAIRS Data Analysis Framework , 2000, NeuroImage.

[7]  Pierre Comon,et al.  Handbook of Blind Source Separation: Independent Component Analysis and Applications , 2010 .

[8]  Scott T. Rickard,et al.  Comparing Measures of Sparsity , 2008, IEEE Transactions on Information Theory.

[9]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[10]  Pascal Frossard,et al.  Dictionary Learning , 2011, IEEE Signal Processing Magazine.

[11]  Michael Zibulevsky,et al.  Underdetermined blind source separation using sparse representations , 2001, Signal Process..

[12]  Xiaochen Zhao,et al.  Blind Source Separation Based on Dictionary Learning: A Singularity-Aware Approach , 2014 .

[13]  Guillermo Sapiro,et al.  Online dictionary learning for sparse coding , 2009, ICML '09.

[14]  Tülay Adali,et al.  Independent Component Analysis by Entropy Bound Minimization , 2010, IEEE Transactions on Signal Processing.

[15]  S Makeig,et al.  Analysis of fMRI data by blind separation into independent spatial components , 1998, Human brain mapping.

[16]  Tulay Adali,et al.  Diversity in Independent Component and Vector Analyses , 2014 .

[17]  Vince D. Calhoun,et al.  SimTB, a simulation toolbox for fMRI data under a model of spatiotemporal separability , 2012, NeuroImage.

[18]  Terrence J. Sejnowski,et al.  The “independent components” of natural scenes are edge filters , 1997, Vision Research.

[19]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[20]  Pascal Frossard,et al.  Dictionary learning: What is the right representation for my signal? , 2011 .

[21]  Tülay Adalı,et al.  Diversity in Independent Component and Vector Analyses: Identifiability, algorithms, and applications in medical imaging , 2014, IEEE Signal Processing Magazine.

[22]  Honglak Lee,et al.  Efficient L1 Regularized Logistic Regression , 2006, AAAI.

[23]  Rémi Gribonval,et al.  A survey of Sparse Component Analysis for blind source separation: principles, perspectives, and new challenges , 2006, ESANN.

[24]  Te-Won Lee,et al.  Fast fixed-point independent vector analysis algorithms for convolutive blind source separation , 2007, Signal Process..

[25]  Barak A. Pearlmutter,et al.  Blind Source Separation by Sparse Decomposition in a Signal Dictionary , 2001, Neural Computation.

[26]  Erkki Oja,et al.  Independent component analysis: algorithms and applications , 2000, Neural Networks.

[27]  Aapo Hyvärinen,et al.  Fast and robust fixed-point algorithms for independent component analysis , 1999, IEEE Trans. Neural Networks.

[28]  Rémi Gribonval Sparse decomposition of stereo signals with Matching Pursuit and application to blind separation of more than two sources from a stereo mixture , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[29]  Vince D. Calhoun,et al.  Independent subspace analysis with prior information for fMRI data , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[30]  Ronald Phlypo,et al.  Independent vector analysis, the Kotz distribution, and performance bounds , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.