Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Voxel selection in fMRI data analysis based on sparse representation

Tools
- Tools
+ Tools

Li, Yuanqiang, Namburi, Praneeth, Yu, Zhuliang, Guan, Cuntai, Feng, Jianfeng and Gu, Zhenghui. (2009) Voxel selection in fMRI data analysis based on sparse representation. IEEE Transactions on Biomedical Engineering, Vol.56 (No.10). pp. 2439-2451. ISSN 0018-9294

[img]
Preview
PDF
WRAP_Voxel_selection.pdf - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Download (793Kb)
Official URL: http://dx.doi.org/10.1109/TBME.2009.2025866

Abstract

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.

Item Type: Journal Article
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
R Medicine > RC Internal medicine > RC0321 Neuroscience. Biological psychiatry. Neuropsychiatry
Divisions: Faculty of Science > Centre for Scientific Computing
Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Magnetic resonance imaging -- Research, Volumetric analysis, Mappings (Mathematics), Medical statistics -- Research
Journal or Publication Title: IEEE Transactions on Biomedical Engineering
Publisher: IEEE
ISSN: 0018-9294
Date: October 2009
Volume: Vol.56
Number: No.10
Page Range: pp. 2439-2451
Identification Number: 10.1109/TBME.2009.2025866
Status: Peer Reviewed
Access rights to Published version: Open Access
References: [1] Y. Kamitani, F. Tong, “Decoding the visual and subjective contents of the human brain,” Nature Neuroscience 8(5), 679-685, 2005. [2] K. J. Friston, P. Jezzard, R. Turner, “Analysis of Functional MRI time series,” Human Brain Mapping, vol. 1, pp. 153-171, 1994. [3] K. J. Friston, A. P. Holmes, J. B. Poline, et al, “Analysis of fMRI time-series revisited,” NeuroImage, vol. 2, pp. 45-53, 1995. [4] K. J. Friston, A. P. Holmes, K. Worsley, J. B. Poline, et al, “Statical parameter maps in functional imaging: a general linear approach,” Human Brain Mapping, vol. 2, pp. 189-210, 1995. [5] D. D. Cox, R. L. Savoy, “Functional magnetic resonance imaging (fMRI) brain reading: detecting and classifying distributed patterns of fMRI activity in human visual cortex,” Neuroimage 19, 261-270, 2003. [6] T. M. Mitchell, R. Hutchinson, R. S. Niculescu, F. Pereira, X. Wang, M. Just, S. Newman, “Learning to decode cognitive states from brain images,” Machine Learning 57, 145-175, 2004. [7] Haxby, J. V., Gobbini, M. I., Furey, M. L., Ishai, A., Schouten, J. L., Pietrini, P., “Distributed and overlapping representations of faces and objects in ventral temporal cortex,” Science 293, 2425-2430. [8] A. Battle, G. Chechik, D. Koller, “Temporal and cross-subject probabilistic models for fMRI prediction task,” Advances in Neural Information Processing Systems 19, pp. 146-153. Cambridge, MA: MIT Press, 2006. [9] F. Meyer, G. J. Stephens, “Locality and low-dimensions in the prediction of natural experience from fMRI,” Proceedings of the Twenty First Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2007. [10] S. Chen, D. L. Donoho & M. A. Saunders.“Atomic decomposition by basis pursuit,” SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 33-61, 1998. [11] B. A. Olshausen, P. Sallee, & M. S. Lewicki, “Learning sparse image codes using a wavelet pyramid architecture,” Advances in Neural Information Processing Systems 13, pp. 887-893. Cambridge, MA: MIT Press, 2001. [12] B. A. Olshausen, & D. J. Field, “Sparse coding with an overcomplete basis set: a strategy employed by V1?” Vision Research, Vol. 37, pp. 3311-3325, 1997. [13] M. S. Lewicki, & T. J. Sejnowski, “Learning overcomplete representations,” Neural Computation Vol. 12(2), pp. 337-365, 2000. [14] R. Gribonval, M. Nielsen, “Sparse decompositions in unions of bases,” IEEE Trans. Inf. Th., Vol. 49, No. 12, pp 3320-3325, 2003. [15] J. A. Tropp, A. C. Gilbert, S. Muthukrishnan and M. J. Strauss, “Improved sparse approximation over quasi-incoherent dictionaries” Proceedings of the 2003 IEEE International Conference on Image Processing, Barcelona, September 2003. [16] D. L. Donoho, & M. Elad, “Maximal sparsity representation via l1 minimization,” the Proc. Nat. Aca. Sci. vol. 100, pp. 2197-2202, 2003. [17] M. Girolami, “A variational method for learning sparse and overcomplete representations,” Neural Computation, Vol. 13(11), pp. 2517-1532, 2001. [18] Y. Q. Li, A. Cichocki and S. Amari, “Analysis of Sparse representation and blind source separation,” Neural Computation, vol. 16, pp. 1193-1234, 2004. [19] Y. Li, S. I. Amari, A. Cichocki, C. Guan, “ Probability estimation for recoverability analysis of blind source separation based on sparse representation,” IEEE Trans. On Information Theory, vol. 52, no. 7, 2006. [20] Y. Li, S. I. Amari, A. Cichocki, D. W. C. Ho and S. Xie, “Underdetermined blind source separation based on sparse representation,” IEEE Trans. on Signal Processing, vol. 54, no.2, pp. 423-437, 2006. [21] E. Kidron, Y.Y. Schechner, M. Elad, “Cross-modal localization via sparsity,” IEEE Transactions on Signal Processing, Vol. 55, no. 4, pp. 1390 - 1404, 2007. [22] M. Zibulevsky, & B. A. Pearlmutter, “Blind Source Separation by Sparse Decomposition,” Neural Computations, vol. 13(4), pp.863-882, 2001. [23] J. Bi, P. Bennett, M. Embrechts, C. M. Breneman, M. Song, “Dimensionality reduction via sparse support vector machines,” Journal of Machine Learning Research, vol. 3, pp. 1229-1243, 2003. [24] J. Bi, Y. Chen and J. Wang, “A sparse support vector machine approach to region-based image categorization,” Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition (CVPR’05), 2005. [25] J. Zhu, S. Rosset, T. Hastie, R. Tibshirani, “1-norm support vector machines,” Neural Information Processing Systems, 2003. [26] A. J. Smola, B. Scholkopf, and G. Gatsch, Linear Programs for Automatic Accuracy Control in Regression, Proc. International Conference of Artificial Neural Networks, Berlin, Springer, 1999. [27] K. P. Bennett, Combining Support Vector and Mathematical Programming Methods for Classification, B. Scholkopf, C. Burges and A. Smola, editors, Advances in Kernel Methods C Support Vector Machines, pp. 307C326, 1999. [28] C. Campbell, K. P. Bennett, “A linear programming a pproach to novelty detection,” Neural Information Processing Systems, vol. 13, pp. 395-401, 2000. [29] R. Tibshirani, R., “Regression selection and shrinkage via the LASSO,” Journal of the Royal Statistical Society, Series B (Methodological) 58(1), 267-288, 1996. [30] S. Hochreiter, K. Obermayer, “Support Vector Machines for Dyadic Data,” Neural Computation 18(6), 1472-1510, 2006. [31] M. K. Carroll, G. A. Cecchi, I. Rish, R. Garg, A. R. Rao, “Prediction and interpretation of distributed neural activity with sparse models,” NeuroImage, vol. 44(1), 112-122, 2009. [32] Y. Li, P. Namburi, C. Guan, J. Feng, “A sparse representation based algorithm for voxel selection in fMRI data analysis,” 14th Annual meeting of the Organization for Human Brain Mapping, 2008. 6, Melbourne, Australia. [33] I. V. Tetko, A. E. P. Villa, “A comparative study of pattern detection algorithm and dynamical system approach using simulated spike trains,” Lecture Notes in Computer Science, vol. 1327, pp. 37-42, 1997. [34] Schneider, W., Siegle, G. Pittsburgh Brain Activity Interpretation Competition 2007 Guide Book: Interpreting subject-driven actions and sensory experience in a rigorously characterized virtual world. http://www.braincompetition.org
URI: http://wrap.warwick.ac.uk/id/eprint/2438

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us