Improved sparse decomposition based on a smoothed L0 norm using a Laplacian kernel to select features from fMRI data

A semi-supervised classification RBM with an improved fMRI representation algorithm

BACKGROUND AND OBJECTIVE

Training an effective and robust supervised learning classifier is not easy due to the limitations of acquiring and labeling considerable human functional magnetic resonance imaging (fMRI) data. Semi-supervised learning uses unlabeled data for feature learning and combines them into labeled data to build better classification models.

METHODS

Since no premises or assumptions are required, a restricted Boltzmann machine (RBM) is suitable for learning data representation of neuroimages. In our study, an improved fMRI representation algorithm with a hybrid L1/L2 regularization method (HRBM) was proposed to optimize the original model for sparsity. Different from common semi-supervised classification models that treat feature learning and classification as two separate training steps, we then constructed a new semi-supervised classification RBM based on a joint training algorithm with HRBM, named Semi-HRBM. This joint training algorithm jointly trains the objective function of feature learning and classification process, so that the learned features can effectively represent the original fMRI data and adapt to the classification tasks.

RESULTS

This study uses fMRI data to identify categories of visual stimuli. In the fMRI data classification task under four visual stimuli (house, face, car, and cat), our HRBM has satisfactory feature representation capabilities and better performance for multiple classification tasks. Taking the supervised RBM (sup-RBM) as an example, our Semi-HRBM classification model improves the average accuracy of the four-classification task by 7.68%, and improves the average F1 score of each visual stimulus task by 8.90%. In addition, the generalization ability of the model was also improved.

CONCLUSION

This research might contribute to enrich solutions for insufficiently labeled neuroimaging samples, which could help to identify complex brain states under different stimuli or tasks.

A Fast Sparse Recovery Algorithm for Compressed Sensing Using Approximate l₀ Norm and Modified Newton Method

In this paper, we propose a fast sparse recovery algorithm based on the approximate l₀ norm (FAL0), which is helpful in improving the practicability of the compressed sensing theory. We adopt a simple function that is continuous and differentiable to approximate the l₀ norm. With the aim of minimizing the l₀ norm, we derive a sparse recovery algorithm using the modified Newton method. In addition, we neglect the zero elements in the process of computing, which greatly reduces the amount of computation. In a computer simulation experiment, we test the image denoising and signal recovery performance of the different sparse recovery algorithms. The results show that the convergence rate of this method is faster, and it achieves nearly the same accuracy as other algorithms, improving the signal recovery efficiency under the same conditions.

Improved Application of Sparse Representation Classifier in fMRI-based Brain State Decoding

Multivariate pattern analysis techniques have been widely applied to decode brain states using functional magnetic resonance imaging (fMRI). Among various multivariate pattern analysis methods, sparse representation classifier (SRC) exhibit state-of-the-art classification performance for image classification. However, SRC has rarely been applied to fMRI-based decoding. This study aimed to investigate the feasibility of SRC in fMRI-based decoding and how to improve the performance of SRC. In this study, two SRC variants were proposed to improve SRC. We performed experimental tests on real fMRI data to compare the performance of SRC, the non-negative SRC (NSRC), two SRC variants, and the support vector machine (SVM). The results of the real fMRI experiments showed that the two SRC variants and NSRC exhibited much better classification performance than the SRC. Moreover, the performance of the second SRC variant is the best among the five classifiers.

Brain State Decoding Based on fMRI Using Semisupervised Sparse Representation Classifications

Multivariate classification techniques have been widely applied to decode brain states using functional magnetic resonance imaging (fMRI). Due to variabilities in fMRI data and the limitation of the collection of human fMRI data, it is not easy to train an efficient and robust supervised-learning classifier for fMRI data. Among various classification techniques, sparse representation classifier (SRC) exhibits a state-of-the-art classification performance in image classification. However, SRC has rarely been applied to fMRI-based decoding. This study aimed to improve SRC using unlabeled testing samples to allow it to be effectively applied to fMRI-based decoding. We proposed a semisupervised-learning SRC with an average coefficient (semiSRC-AVE) method that performed the classification using the average coefficient of each class instead of the reconstruction error and selectively updated the training dataset using new testing data with high confidence to improve the performance of SRC. Simulated and real fMRI experiments were performed to investigate the feasibility and robustness of semiSRC-AVE. The results of the simulated and real fMRI experiments showed that semiSRC-AVE significantly outperformed supervised learning SRC with an average coefficient (SRC-AVE) method and showed better performance than the other three semisupervised learning methods.

Euler Elastica Regularized Logistic Regression for Whole-Brain Decoding of fMRI Data

OBJECTIVE

Multivariate pattern analysis methods have been widely applied to functional magnetic resonance imaging (fMRI) data to decode brain states. Due to the "high features, low samples" in fMRI data, machine learning methods have been widely regularized using various regularizations to avoid overfitting. Both total variation (TV) using the gradients of images and Euler's elastica (EE) using the gradient and the curvature of images are the two popular regulations with spatial structures. In contrast to TV, EE regulation is able to overcome the disadvantage of TV regulation that favored piecewise constant images over piecewise smooth images. In this study, we introduced EE to fMRI-based decoding for the first time and proposed the EE regularized multinomial logistic regression (EELR) algorithm for multi-class classification.

METHODS

We performed experimental tests on both simulated and real fMRI data to investigate the feasibility and robustness of EELR. The performance of EELR was compared with sparse logistic regression (SLR) and TV regularized LR (TVLR).

RESULTS

The results showed that EELR was more robustness to noises and showed significantly higher classification performance than TVLR and SLR. Moreover, the forward models and weights patterns revealed that EELR detected larger brain regions that were discriminative to each task and activated by each task than TVLR.

CONCLUSION

The results suggest that EELR not only performs well in brain decoding but also reveals meaningful discriminative and activation patterns.

SIGNIFICANCE

This study demonstrated that EELR showed promising potential in brain decoding and discriminative/activation pattern detection.