The University of Southampton
University of Southampton Institutional Repository

k-t FASTER: a novel method for accelerating FMRI data acquisition using low rank constraints

k-t FASTER: a novel method for accelerating FMRI data acquisition using low rank constraints
k-t FASTER: a novel method for accelerating FMRI data acquisition using low rank constraints
Purpose
In functional MRI (fMRI), faster sampling of data can provide richer temporal information and increase temporal degrees of freedom. However, acceleration is generally performed on a volume‐by‐volume basis, without consideration of the intrinsic spatio‐temporal data structure. We present a novel method for accelerating fMRI data acquisition, k‐t FASTER (FMRI Accelerated in Space‐time via Truncation of Effective Rank), which exploits the low‐rank structure of fMRI data.

Theory and Methods
Using matrix completion, 4.27× retrospectively and prospectively under‐sampled data were reconstructed (coil‐independently) using an iterative nonlinear algorithm, and compared with several different reconstruction strategies. Matrix reconstruction error was evaluated; a dual regression analysis was performed to determine fidelity of recovered fMRI resting state networks (RSNs).

Results
The retrospective sampling data showed that k‐t FASTER produced the lowest error, approximately 3–4%, and the highest quality RSNs. These results were validated in prospectively under‐sampled experiments, with k‐t FASTER producing better identification of RSNs than fully sampled acquisitions of the same duration.

Conclusion
With k‐t FASTER, incoherently under‐sampled fMRI data can be robustly recovered using only rank constraints. This technique can be used to improve the speed of fMRI sampling, particularly for multivariate analyses such as temporal independent component analysis. Magn Reson Med 74:353–364, 2015. © 2014 The Authors Magnetic Resonance in Medicine published by Wiley Periodicals, Inc. on behalf of International Society for Magnetic Resonance in Medicine. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited
0740-3194
353-364
Chiew, Mark
04fd2aeb-6c75-4740-b7da-c73146e5c726
Smith, Steve M.
2c82c3b8-3aae-4de4-94de-a3e86edd11a1
Koopmans, Peter J.
473020b1-bd1c-47d6-834f-300f52fa750c
Graedel, Nadine N.
47a76009-a9f8-4dc2-88d8-10495493f934
Blumensath, Thomas
470d9055-0373-457e-bf80-4389f8ec4ead
Miller, Karla L.
550fd362-6bff-4d9a-a88e-89a2469bbdc3
Chiew, Mark
04fd2aeb-6c75-4740-b7da-c73146e5c726
Smith, Steve M.
2c82c3b8-3aae-4de4-94de-a3e86edd11a1
Koopmans, Peter J.
473020b1-bd1c-47d6-834f-300f52fa750c
Graedel, Nadine N.
47a76009-a9f8-4dc2-88d8-10495493f934
Blumensath, Thomas
470d9055-0373-457e-bf80-4389f8ec4ead
Miller, Karla L.
550fd362-6bff-4d9a-a88e-89a2469bbdc3

Chiew, Mark, Smith, Steve M., Koopmans, Peter J., Graedel, Nadine N., Blumensath, Thomas and Miller, Karla L. (2015) k-t FASTER: a novel method for accelerating FMRI data acquisition using low rank constraints. Magnetic Resonance in Medicine, 74 (2), 353-364. (doi:10.1002/mrm.25395).

Record type: Article

Abstract

Purpose
In functional MRI (fMRI), faster sampling of data can provide richer temporal information and increase temporal degrees of freedom. However, acceleration is generally performed on a volume‐by‐volume basis, without consideration of the intrinsic spatio‐temporal data structure. We present a novel method for accelerating fMRI data acquisition, k‐t FASTER (FMRI Accelerated in Space‐time via Truncation of Effective Rank), which exploits the low‐rank structure of fMRI data.

Theory and Methods
Using matrix completion, 4.27× retrospectively and prospectively under‐sampled data were reconstructed (coil‐independently) using an iterative nonlinear algorithm, and compared with several different reconstruction strategies. Matrix reconstruction error was evaluated; a dual regression analysis was performed to determine fidelity of recovered fMRI resting state networks (RSNs).

Results
The retrospective sampling data showed that k‐t FASTER produced the lowest error, approximately 3–4%, and the highest quality RSNs. These results were validated in prospectively under‐sampled experiments, with k‐t FASTER producing better identification of RSNs than fully sampled acquisitions of the same duration.

Conclusion
With k‐t FASTER, incoherently under‐sampled fMRI data can be robustly recovered using only rank constraints. This technique can be used to improve the speed of fMRI sampling, particularly for multivariate analyses such as temporal independent component analysis. Magn Reson Med 74:353–364, 2015. © 2014 The Authors Magnetic Resonance in Medicine published by Wiley Periodicals, Inc. on behalf of International Society for Magnetic Resonance in Medicine. This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited

Text
CSKGBM_MRM14.pdf - Other
Download (4MB)

More information

e-pub ahead of print date: 28 August 2014
Published date: 1 August 2015
Organisations: Signal Processing & Control Grp

Identifiers

Local EPrints ID: 367800
URI: http://eprints.soton.ac.uk/id/eprint/367800
ISSN: 0740-3194
PURE UUID: d39688f9-4e6d-4862-b9db-827313d7b868
ORCID for Thomas Blumensath: ORCID iD orcid.org/0000-0002-7489-265X

Catalogue record

Date deposited: 21 Aug 2014 14:23
Last modified: 15 Mar 2024 03:34

Export record

Altmetrics

Contributors

Author: Mark Chiew
Author: Steve M. Smith
Author: Peter J. Koopmans
Author: Nadine N. Graedel
Author: Karla L. Miller

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×