ICA, kernel methods and nonnegativity: New paradigms for dynamical component analysis of fMRI data

  • Authors:
  • Peter Gruber;Anke Meyer-Bäse;Simon Foo;Fabian J. Theis

  • Affiliations:
  • Department of Electrical Engineering, Florida State University, Tallahassee, FL 32310-6046, USA and CMB, Institute for Bioinformatics and Systems Biology, Helmholtz Zentrum, Munchen, Germany;Department of Electrical Engineering, Florida State University, Tallahassee, FL 32310-6046, USA;Department of Electrical Engineering, Florida State University, Tallahassee, FL 32310-6046, USA;CMB, Institute for Bioinformatics and Systems Biology, Helmholtz Zentrum, Munchen, Germany

  • Venue:
  • Engineering Applications of Artificial Intelligence
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the last decades, functional magnetic resonance imaging (fMRI) has been introduced into clinical practice. As a consequence of this advanced noninvasive medical imaging technique, the analysis and visualization of medical image time-series data poses a new challenge to both research and medical application. But often, the model data for a regression or generalized linear model-based analysis are not available. Hence exploratory data-driven techniques, i.e. blind source separation (BSS) methods are very popular in functional nuclear magnetic resonance imaging (fMRI) data analysis since they are neither based on explicit signal models nor on a priori knowledge of the underlying physiological process. The independent component analysis (ICA) represents a main BSS method which searches for stochastically independent signals from the multivariate observations. In this paper, we introduce a new kernel-based nonlinear ICA method and compare it to standard BSS techniques. This kernel nonlinear ICA (kICA) overcomes the restrictions of linearity of the mixing process usually encountered with ICA. Dimension reduction is an important preprocessing step for this nonlinear technique and is performed in a novel way: a genetic algorithm is designed which determines the optimal number of basis vectors for a reduced-order feature space representation as an optimization problem of the condition number of the resulting basis. For the fMRI data, a comparative quantitative evaluation is performed between kICA with different kernels, nonnegative matrix factorization (NMF) and other BSS algorithms. The comparative results are evaluated by task-related activation maps, associated time courses and ROC study. The comparison is performed on fMRI data from experiments with 10 subjects. The external stimulus was a visual pattern presentation in a block design. The most important obtained results in this paper represent that kICA and sparse NMF (sNMF) are able to identify signal components with high correlation to the fMRI stimulus, and kICA with a Gaussian kernel is comparable to standard ICA algorithms and even more, it yields spatially focused results.