Parallel Magnetic Resonance Imaging

  title={Parallel Magnetic Resonance Imaging},
  author={Martin Uecker},
  • M. Uecker
  • Published 25 January 2015
  • Mathematics
  • ArXiv
The main disadvantage of Magnetic Resonance Imaging (MRI) are its long scan times and, in consequence, its sensitivity to motion. Exploiting the complementary information from multiple receive coils, parallel imaging is able to recover images from under-sampled k-space data and to accelerate the measurement. Because parallel magnetic resonance imaging can be used to accelerate basically any imaging sequence it has many important applications. Parallel imaging brought a fundamental shift in… 

Figures from this paper

Calibrationless Multi-coil Magnetic Resonance Imaging with Compressed Sensing

We present a method for combining the data retrieved by multiple coils of a Magnetic Resonance Imaging (MRI) system with the a priori assumption of compressed sensing to reconstruct a single image.

Autocalibrating and calibrationless parallel magnetic resonance imaging as a bilinear inverse problem

  • M. Uecker
  • Mathematics
    2017 International Conference on Sampling Theory and Applications (SampTA)
  • 2017
This work discusses some recently developed approaches for the solution of the bilinear reconstruction problem related to multi-channel blind deconvolution in magnetic resonance imaging.

Compressive Imaging: Structure, Sampling, Learning

An in-depth treatment of compressive imaging, with an eye to the next decade of imaging research, and using both empirical and mathematical insights, examines the potential benefits and the pitfalls of these latest approaches.



Nonlinear Reconstruction Methods for Parallel Magnetic Resonance Imaging

The problem of inaccurate coil sensitivities is addressed with a new non-linear algorithm for auto-calibrated parallel imaging, which allows for a reconstruction of artefact-free images with higher acceleration factors and less reference data than previous linear approaches.

A generalized approach to parallel magnetic resonance imaging.

A generalized formulation for parallel MR imaging is derived, demonstrating the relationship between existing techniques such as SMASH and SENSE, and suggesting new algorithms with improved performance.

Image reconstruction by regularized nonlinear inversion—Joint estimation of coil sensitivities and image content

A respective algorithm based on a Newton‐type method with appropriate regularization terms is demonstrated to improve the performance of autocalibrating parallel MRI—mainly due to a better estimation of the coil sensitivity profiles.

SENSE: Sensitivity encoding for fast MRI

The problem of image reconstruction from sensitivity encoded data is formulated in a general fashion and solved for arbitrary coil configurations and k‐space sampling patterns and special attention is given to the currently most practical case, namely, sampling a common Cartesian grid with reduced density.

Parallel imaging reconstruction using automatic regularization

A reconstruction algorithm based on Tikhonov regularization is presented that reduces the SNR loss due to geometric correlations in the spatial information from the array coil elements.

Improved self-calibrated spiral parallel imaging using JSENSE.

Model-Based Iterative Reconstruction for Radial Fast Spin-Echo MRI

Simulations and experimental results demonstrate that the proposed reconstruction method directly yields a spin-density and relaxivity map from only a single radial data set that is neither affected by the typical artifacts from TE mixing, nor by streaking artifacts from the incomplete k-space coverage at individual echo times.

Fast, iterative image reconstruction for MRI in the presence of field inhomogeneities

A tool for accelerating iterative reconstruction of field-corrected MR images: a novel time-segmented approximation to the MR signal equation that uses a min-max formulation to derive the temporal interpolator.

Parallel magnetic resonance imaging as approximation in a reproducing kernel Hilbert space

Reconstruction from samples at arbitrary locations can be understood as approximation of vector-valued functions from the acquired samples and formulated using a Reproducing Kernel Hilbert Space (RKHS) with a matrix-valued kernel defined by the spatial sensitivities of the receive coils.

Joint image reconstruction and sensitivity estimation in SENSE (JSENSE)

The problem of error propagation in the sequential procedure of sensitivity estimation followed by image reconstruction in existing methods, such as sensitivity encoding (SENSE) and simultaneous acquisition of spatial harmonics (SMASH), is considered and reformulates the image reconstruction problem as a joint estimation of the coil sensitivities and the desired image, which is solved by an iterative optimization algorithm.