Rethinking Sampling in Parallel MRI: A Data-Driven Approach

Volkan Cevher, Baran Gözcü, Thomas Sanchez
IEEE, 2019
Conference paper

Abstract

In the last decade, Compressive Sensing (CS) has emerged as the most promising, model-driven approach to accelerate MRI scans. CS relies on the key sparsity assumption and proposes random sampling for data acquisition. The practical CS approaches in MRI employ variable-density (VD) sampling, where samples are drawn at random based on a parametric probability model which focuses on the center of the Fourier domain. In stark contrast to this model-driven sampling approaches, we propose a data-driven framework for optimizing sampling in parallel (multi-coil) MRI. Our approach does not assume any structure in the data, and instead optimizes a performance metric (e.g. PSNR) for any given reconstruction algorithm, based on our earlier learning-based sampling framework previously applied to 2D MRI which we also extend to 3D MRI setting in this work by employing lazy evaluations in the greedy algorithm. We show boosted performance for the parallel MRI based on this sampling approach and highlight the inefficiency of variable density approaches. This suggests that data-driven sampling methods could be the key to unlocking the full power of CS applied to MRI.

Official source

https://infoscience.epfl.ch/record/265525?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts

Related publications

Scalable Learning-Based Sampling Optimization for Compressive Dynamic MRI

Volkan Cevher, Baran Gözcü, Thomas Sanchez, Ruud van Heeswijk

Slow acquisition has been one of the historical problems in dynamic magnetic resonance imaging (dMRI), but the rise of compressed sensing (CS) has brought numerous algorithms that successfully achieve high acceleration rates. While CS proposes random sampling for data acquisition, practical CS applications to dMRI have typically relied on random variable-density (VD) sampling patterns, where masks are drawn from probabilistic models, which preferably sample from the center of the Fourier domain. In contrast to this model-driven approach, we propose the first data-driven, scalable framework for optimizing sampling patterns in dMRI. Through a greedy algorithm, this approach allows the data to directly govern the search for a mask that exhibits good empirical performance. Previous greedy approach, designed for static MRI, required very intensive computations, prohibiting their direct application to dMRI, and we address this issue by resorting to a stochastic greedy algorithm that exploits only a fraction of resources compared to the previous approach without sacrificing the reconstruction accuracy. A thorough comparison on in vivo datasets shows the inefficiency of model-based approaches in terms of sampling performance and suggests that our data-driven sampling approach could fully enable the potential of CS applied to dMRI.

2019

Data-driven Measurement Designs for Magnetic Resonance Imaging

Baran Gözcü

Despite being a powerful medical imaging technique which does not emit any ionizing radiation, magnetic resonance imaging (MRI) always had the major problem of long scanning times that can take up to an hour depending on the application. It also requires uncomfortable breath-holds due to the slow acquisition, sedation of children and repeated scans in the cases of degraded image quality due to body motion. Recent years have seen new image reconstruction techniques that need less amount of acquired data (i.e., accelerated scans) for reconstructing MRI images: parallel imaging and compressed sensing (CS). Although much work has been done on the reconstruction side, there has been relatively less work on experimental design, i.e., which parts of the Fourier domain to acquire during the scan, an essential factor that considerably affects the performance of image reconstructions. The state-of-the-art experimental designs use random subsampling either based on parametric models or heuristical adaptive models. The requirement of extensive parameter tuning and the random nature of the performance render these methods impractical and unreliable for clinical use. Can we systematically use the data acquired during past MRI scans for the design of accelerated scans with a reliable image quality? This problem is the focus of this thesis which proposes a data-driven scan design approach and training procedures which efficiently and effectively learn the structure inherent in the data, and accordingly, design the scans that directly acquire only the most relevant information during acquisition given an acceleration rate constraint. As a result, this boosts the performance of the existing state-of-the-art compressive sensing techniques on real-world datasets. Moreover, this approach provides strong theoretical guarantees by using tools from statistical learning theory. The intensive computational training procedures of our approach are made feasible by large-scale implementations on a parallel computing cluster. In return, this approach avoids any dependence on parametric or heuristic models and provides a reliably consistent image reconstruction performance for accelerated scans. Our approach is flexible and capable of giving deterministic scan designs specific to the anatomy, to the acceleration rate in use, to the reconstruction algorithm and the scan settings such as static/dynamic and parallel imaging. Apart from measurement designs for MRI, this thesis also considers the reconstruction problem. In particular, we focus on the inverse problems that involve a mixture of regularizers in the objective function, exploiting multiple structures at the same time. For these problems, we propose a reliable and systematic optimization framework and illustrate its effectiveness. Finally, in the last part of the thesis, we present a data-driven model and an optimization method for the design of nearly isometric, linear and dimensionality reducing embeddings.

EPFL2019

Acoustic tomography aims at recovering the unknown parameters that describe a field of interest by studying the physical characteristics of sound propagating through the considered field. The tomographic approach is appealing in that it is non-invasive and allows to obtain a significantly larger amount of data compared to the classical one-sensor one-measurement setup. It has, however, two major drawbacks which may limit its applicability in a practical setting: the methods by which the tomographic data are acquired and then converted to the field values are computationally intensive and often ill-conditioned. This thesis specifically addresses these two shortcomings by proposing novel acoustic tomography algorithms for signal acquisition and field reconstruction. The first part of our exposition deals with some theoretical aspects of the tomographic sampling problems and associated reconstruction schemes for scalar and vector tomography. We show that the classical time-of-flight measurements are not sufficient for full vector field reconstruction. As a solution, an additional set of measurements is proposed. The main advantage of the proposed set is that it can be directly computed from acoustic measurements. It thus avoids the need for extra measuring devices. We then describe three novel reconstruction methods that are conceptually quite different. The first one is based on quadratic optimization and does not require any a priori information. The second method builds upon the notion of sparsity in order to increase the reconstruction accuracy when little data is available. The third approach views tomographic reconstruction as a parametric estimation problem and solves it using recent sampling results on non-bandlimited signals. The proposed methods are compared and their respective advantages are outlined. The second part of our work is dedicated to the application of the proposed algorithms to three practical problems: breast cancer detection, thermal therapy monitoring, and temperature monitoring in the atmosphere. We address the problem of breast cancer detection by computing a map of sound speed in breast tissue. A noteworthy contribution of this thesis is the development of a signal processing technique that significantly reduces the artifacts that arise in very inhomogeneous and absorbent tissue. Temperature monitoring during thermal therapies is then considered. We show how some of our algorithms allow for an increased spatial resolution and propose ways to reduce the computational complexity. Finally, we demonstrate the feasibility of tomographic temperature monitoring in the atmosphere using a custom-built laboratory-scale experiment. In particular, we discuss various practical aspects of time-of-flight measurement using cheap, off-the-shelf sensing devices.

EPFL2008

Data-driven Measurement Designs for Magnetic Resonance Imaging

Baran Gözcü

EPFL2019