Location of Repository

Voxel selection in fMRI data analysis based on sparse representation

By Yuanqiang Li, Praneeth Namburi, Zhuliang Yu, Cuntai Guan, Jianfeng Feng and Zhenghui Gu


Multivariate pattern analysis approaches toward detection of brain regions from fMRI data have been gaining attention recently. In this study, we introduce an iterative sparse-representation-based algorithm for detection of voxels in functional MRI (fMRI) data with task relevant information. In each iteration of the algorithm, a linear programming problem is solved and a sparse weight vector is subsequently obtained. The final weight vector is the mean of those obtained in all iterations. The characteristics of our algorithm are as follows: 1) the weight vector (output) is sparse; 2) the magnitude of each entry of the weight vector represents the significance of its corresponding variable or feature in a classification or regression problem; and 3) due to the convergence of this algorithm, a stable weight vector is obtained. To demonstrate the validity of our algorithm and illustrate its application, we apply the algorithm to the Pittsburgh Brain Activity Interpretation Competition 2007 functional fMRI dataset for selecting the voxels, which are the most relevant to the tasks of the subjects. Based on this dataset, the aforementioned characteristics of our algorithm are analyzed, and a comparison between our method with the univariate general-linear-model-based statistical parametric mapping is performed. Using our method, a combination of voxels are selected based on the principle of effective/sparse representation of a task. Data analysis results in this paper show that this combination of voxels is suitable for decoding tasks and demonstrate the effectiveness of our method

Topics: TK, RC0321
Publisher: IEEE
Year: 2009
OAI identifier: oai:wrap.warwick.ac.uk:2438

Suggested articles



  1. (1997). A comparative study of pattern detection algorithm and dynamical system approach using simulated spike trains,” doi
  2. (2000). A linear programming a pproach to novelty detection,”
  3. (2008). A sparse representation based algorithm for voxel selection in fMRI data analysis,” 14th Annual meeting of the Organization for Human Brain Mapping, doi
  4. (2005). A sparse support vector machine approach to region-based image categorization,” doi
  5. (2001). A variational method for learning sparse and overcomplete representations,” doi
  6. (2004). Analysis of Sparse representation and blind source separation,” doi
  7. (2001). Blind Source Separation by Sparse Decomposition,” doi
  8. (1999). Combining Support Vector and Mathematical Programming Methods for Classification,
  9. (2007). Cross-modal localization via sparsity,” doi
  10. (2005). Decoding the visual and subjective contents of the human brain,” doi
  11. (2003). Dimensionality reduction via sparse support vector machines,”
  12. Distributed and overlapping representations of faces and objects in ventral temporal cortex,” doi
  13. (2003). Functional magnetic resonance imaging (fMRI) brain reading: detecting and classifying distributed patterns of fMRI activity in human visual cortex,” doi
  14. (2003). Improved sparse approximation over quasi-incoherent dictionaries” doi
  15. (2000). Learning overcomplete representations,” doi
  16. (2001). Learning sparse image codes using a wavelet pyramid architecture,” doi
  17. (2004). Learning to decode cognitive states from brain images,” doi
  18. (1999). Linear Programs for Automatic Accuracy Control in Regression, doi
  19. (2007). Locality and low-dimensions in the prediction of natural experience from fMRI,”
  20. (2003). Maximal sparsity representation via l1 minimization,” the Proc.
  21. (2007). Pittsburgh Brain Activity Interpretation Competition
  22. (2009). Prediction and interpretation of distributed neural activity with sparse models,” doi
  23. (2006). Probability estimation for recoverability analysis of blind source separation based on sparse representation,” doi
  24. (1996). Regression selection and shrinkage via the LASSO,” doi
  25. (1998). Saunders.“Atomic decomposition by basis pursuit,” doi
  26. (1997). Sparse coding with an overcomplete basis set: a strategy employed by doi
  27. (2003). Sparse decompositions in unions of bases,” doi
  28. (1995). Statical parameter maps in functional imaging: a general linear approach,” doi
  29. (2006). Support Vector Machines for Dyadic Data,” doi
  30. (2006). Temporal and cross-subject probabilistic models for fMRI prediction task,”
  31. (2006). Underdetermined blind source separation based on sparse representation,” doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.