Recovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraints
Recent developments in highly accelerated fMRI data acquisition have employed low-rank and/or sparsity constraints for image reconstruction, as an alternative to conventional, time-independent parallel imaging. When under-sampling factors are high or the signals of interest are low-variance, however...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2018
|
| _version_ | 1826273552922312704 |
|---|---|
| author | Chiew, M Graedel, N Miller, K |
| author_facet | Chiew, M Graedel, N Miller, K |
| author_sort | Chiew, M |
| collection | OXFORD |
| description | Recent developments in highly accelerated fMRI data acquisition have employed low-rank and/or sparsity constraints for image reconstruction, as an alternative to conventional, time-independent parallel imaging. When under-sampling factors are high or the signals of interest are low-variance, however, functional data recovery can be poor or incomplete. We introduce a method for improving reconstruction fidelity using external constraints, like an experimental design matrix, to partially orient the estimated fMRI temporal subspace. Combining these external constraints with low-rank constraints introduces a new image reconstruction model that is analogous to using a mixture of subspace-decomposition (PCA/ICA) and regression (GLM) models in fMRI analysis. We show that this approach improves fMRI reconstruction quality in simulations and experimental data, focusing on the model problem of detecting subtle 1-s latency shifts between brain regions in a block-design task-fMRI experiment. Successful latency discrimination is shown at acceleration factors up to R = 16 in a radial-Cartesian acquisition. We show that this approach works with approximate, or not perfectly informative constraints, where the derived benefit is commensurate with the information content contained in the constraints. The proposed method extends low-rank approximation methods for under-sampled fMRI data acquisition by leveraging knowledge of expected task-based variance in the data, enabling improvements in the speed and efficiency of fMRI data acquisition without the loss of subtle features. |
| first_indexed | 2024-03-06T22:29:56Z |
| format | Journal article |
| id | oxford-uuid:57f22759-9b25-46c2-8f28-d92e30d75e5b |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T22:29:56Z |
| publishDate | 2018 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | oxford-uuid:57f22759-9b25-46c2-8f28-d92e30d75e5b2022-03-26T16:59:55ZRecovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraintsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:57f22759-9b25-46c2-8f28-d92e30d75e5bEnglishSymplectic Elements at OxfordElsevier2018Chiew, MGraedel, NMiller, KRecent developments in highly accelerated fMRI data acquisition have employed low-rank and/or sparsity constraints for image reconstruction, as an alternative to conventional, time-independent parallel imaging. When under-sampling factors are high or the signals of interest are low-variance, however, functional data recovery can be poor or incomplete. We introduce a method for improving reconstruction fidelity using external constraints, like an experimental design matrix, to partially orient the estimated fMRI temporal subspace. Combining these external constraints with low-rank constraints introduces a new image reconstruction model that is analogous to using a mixture of subspace-decomposition (PCA/ICA) and regression (GLM) models in fMRI analysis. We show that this approach improves fMRI reconstruction quality in simulations and experimental data, focusing on the model problem of detecting subtle 1-s latency shifts between brain regions in a block-design task-fMRI experiment. Successful latency discrimination is shown at acceleration factors up to R = 16 in a radial-Cartesian acquisition. We show that this approach works with approximate, or not perfectly informative constraints, where the derived benefit is commensurate with the information content contained in the constraints. The proposed method extends low-rank approximation methods for under-sampled fMRI data acquisition by leveraging knowledge of expected task-based variance in the data, enabling improvements in the speed and efficiency of fMRI data acquisition without the loss of subtle features. |
| spellingShingle | Chiew, M Graedel, N Miller, K Recovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraints |
| title | Recovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraints |
| title_full | Recovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraints |
| title_fullStr | Recovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraints |
| title_full_unstemmed | Recovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraints |
| title_short | Recovering task fMRI signals from highly under-sampled data with low-rank and temporal subspace constraints |
| title_sort | recovering task fmri signals from highly under sampled data with low rank and temporal subspace constraints |
| work_keys_str_mv | AT chiewm recoveringtaskfmrisignalsfromhighlyundersampleddatawithlowrankandtemporalsubspaceconstraints AT graedeln recoveringtaskfmrisignalsfromhighlyundersampleddatawithlowrankandtemporalsubspaceconstraints AT millerk recoveringtaskfmrisignalsfromhighlyundersampleddatawithlowrankandtemporalsubspaceconstraints |