418 research outputs found
Decoding the Encoding of Functional Brain Networks: an fMRI Classification Comparison of Non-negative Matrix Factorization (NMF), Independent Component Analysis (ICA), and Sparse Coding Algorithms
Brain networks in fMRI are typically identified using spatial independent
component analysis (ICA), yet mathematical constraints such as sparse coding
and positivity both provide alternate biologically-plausible frameworks for
generating brain networks. Non-negative Matrix Factorization (NMF) would
suppress negative BOLD signal by enforcing positivity. Spatial sparse coding
algorithms ( Regularized Learning and K-SVD) would impose local
specialization and a discouragement of multitasking, where the total observed
activity in a single voxel originates from a restricted number of possible
brain networks.
The assumptions of independence, positivity, and sparsity to encode
task-related brain networks are compared; the resulting brain networks for
different constraints are used as basis functions to encode the observed
functional activity at a given time point. These encodings are decoded using
machine learning to compare both the algorithms and their assumptions, using
the time series weights to predict whether a subject is viewing a video,
listening to an audio cue, or at rest, in 304 fMRI scans from 51 subjects.
For classifying cognitive activity, the sparse coding algorithm of
Regularized Learning consistently outperformed 4 variations of ICA across
different numbers of networks and noise levels (p0.001). The NMF algorithms,
which suppressed negative BOLD signal, had the poorest accuracy. Within each
algorithm, encodings using sparser spatial networks (containing more
zero-valued voxels) had higher classification accuracy (p0.001). The success
of sparse coding algorithms may suggest that algorithms which enforce sparse
coding, discourage multitasking, and promote local specialization may capture
better the underlying source processes than those which allow inexhaustible
local processes such as ICA
Compressed Sensing For Functional Magnetic Resonance Imaging Data
This thesis addresses the possibility of applying the compressed sensing (CS) framework to Functional Magnetic Resonance Imaging (fMRI) acquisition. The fMRI is one of the non-invasive neuroimaging technique that allows the brain activity to be captured and analysed in a living body. One disadvantage of fMRI is the trade-off between the spatial and temporal resolution of the data. To keep the experiments within a reasonable length of time, the current acquisition technique sacrifices the spatial resolution in favour of the temporal resolution. It is possible to improve this trade-off using compressed sensing.
The main contribution of this thesis is to propose a novel reconstruction method, named Referenced Compressed Sensing, which exploits the redundancy between a signal and a correlated reference by using their distance as an objective function. The compressed video sequences reconstructed using Referenced CS have at least 50% higher in terms of Peak Signal-to-Noise Ratio (PSNR) compared to state-of-the-art conventional reconstruction methods. This thesis also addresses two issues related to Referenced CS. Firstly, the relationship between the reference and the reconstruction performance is studied. To maintain the high-quality references, the Running Gaussian Average (RGA) reference estimator is proposed. The reconstructed results have at least 3dB better PSNR performance with the use of RGA references. Secondly, the Referenced CS with Least Squares is proposed. This study shows that by incorporating the correlated reference, it is possible to perform a linear reconstruction as opposed to the iterative reconstruction commonly used in CS. This approach gives at least 19% improvement in PSNR compared to the state of the art, while reduces the computation time by at most 1200 times.
The proposed method is applied to the fMRI data. This study shows that, using the same amount of samples, the data reconstructed using Referenced CS has higher resolution than the conventional acquisition technique and has on average 50% higher PSNR than state-of-the-art reconstructions. Lastly, to enhance the feature of interest in the fMRI data, the baseline independent (BI) analysis is proposed. Using the BI analysis shows up to 25% improvement in the accuracy of the Referenced CS feature
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery
PCA is one of the most widely used dimension reduction techniques. A related
easier problem is "subspace learning" or "subspace estimation". Given
relatively clean data, both are easily solved via singular value decomposition
(SVD). The problem of subspace learning or PCA in the presence of outliers is
called robust subspace learning or robust PCA (RPCA). For long data sequences,
if one tries to use a single lower dimensional subspace to represent the data,
the required subspace dimension may end up being quite large. For such data, a
better model is to assume that it lies in a low-dimensional subspace that can
change over time, albeit gradually. The problem of tracking such data (and the
subspaces) while being robust to outliers is called robust subspace tracking
(RST). This article provides a magazine-style overview of the entire field of
robust subspace learning and tracking. In particular solutions for three
problems are discussed in detail: RPCA via sparse+low-rank matrix decomposition
(S+LR), RST via S+LR, and "robust subspace recovery (RSR)". RSR assumes that an
entire data vector is either an outlier or an inlier. The S+LR formulation
instead assumes that outliers occur on only a few data vector indices and hence
are well modeled as sparse corruptions.Comment: To appear, IEEE Signal Processing Magazine, July 201
Incoherent dictionary pair learning : application to a novel open-source database of chinese numbers
We enhance the efficacy of an existing dictionary pair learning algorithm by adding a dictionary incoherence penalty term. After presenting an alternating minimization solution, we apply the proposed incoherent dictionary pair learning (InDPL) method in classification of a novel open-source database of Chinese numbers. Benchmarking results confirm that the InDPL algorithm offers enhanced classification accuracy, especially when the number of training samples is limited
- …