Compressed sensing in MRI : mathematical preliminaries and basic examples

In magnetic resonance imaging (MRI), k-space sampling, due to physical restrictions, is very time- -consuming. It cannot be much improved using classical Nyquist-based sampling theory. Recent developments utilize the fact that MR images are sparse in some representations (i.e. wavelet coeffi cients). This new theory, created by Candès and Romberg, called compressed sensing (CS), shows that images with sparse representations can be recovered from randomly undersampled k-space data, by using nonlinear reconstruction algorithms (i.e. l1-norm minimization). Throughout this paper, mathematical preliminaries of CS are outlined, in the form introduced by Candès. We describe the main conditions for measurement matrices and recovery algorithms and present a basic example, showing that while the method really works (reducing the time of MR examination), there are some major problems that need to be taken into consideration.

---

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę.