Fast MRI


This project proposes to exploit compressed sensing reconstruction techniques to accelerate dynamic Magnetic Resonance Imaging (MRI) acquisition, which is inherently a slow process. Through k-space undersampling and under the assumption that the data is compressible in a sparse domain, MRI acquisition can be accelerated by partially acquiring the amount of data that is otherwise required to produce a dynamic cardiac MR sequence. The novelty of the work stems from the use of dictionary learning methods to learn an adaptive spatio-temporal sparse domain from the data instead of using fixed transform domains, enabling higher acceleration rates.

Problem and objectives

MRI is an important tool for medical diagnosis and research, providing unique soft tissue contrast while being non-ionising and non-invasive. However, the generation of images relies on a sequential sampling and the speed at which it can be performed is limited by physiological function. This imposes a sampling budget that is particularly tight in the case of dynamic MRI, such as cardiac cine, where good spatial and temporal resolutions are required. Accelerating imaging speed would not only improve the quality of images and enable new applications, but would also improve patient comfort considerably, as well as maximising machine throughput and therefore profitability.

Compressed Sensing MRI

Traditionally, the minimum number of samples required for the acquisition of a signal has been dictated by the Nyquist sampling criterion, with the assumption that the signal of interest is bandlimited, but recently the assumption of redundancy and sparsity of a signal has resulted in more flexible assumptions that allow sampling below the Nyquist rate and still achieve perfect reconstruction. One of these sampling frameworks, termed Compressed Sensing (CS), is theoretically appealing for the case of MRI because the necessary sampling incoherence condition is easily met. One of the main ingredients for successful CSMRI reconstruction is the degree of redundancy or sparsity in the data, with higher sparsity providing higher recovery rates.

Dictionary Learning MRI

Fixed-basis transform domains for sparse representation of cardiac cine MRI data can be wavelets, spatio-temporal TV or the temporal Fourier transform domain. Recently, sparse transform domains which can learn from training data and provide an adaptive transform that is optimised for a particular dataset have shown to provide higher degrees of sparsity relative to their fixed-basis counterparts. We apply these novel approaches to cardiac cine MR by constructing spatio-temporal adaptive dictionaries using the K-SVD algorithm.


Results show that the method proposed consistently outperforms the reconstruction of another CSMRI method that uses the temporal Fourier transform for sparse representation on examples of synthetic single-coil cardiac cine MR from ten different patients. The method has also been extended to the case of parallel MRI, where acceleration rates generally stagnate at x4, achieving good reconstructions at accelerations of x6.