• Corpus ID: 119233083

Parallel MRI Reconstruction by Convex Optimization

  title={Parallel MRI Reconstruction by Convex Optimization},
  author={Cisheng Zhang and Ifat-Al Baqee},
  journal={arXiv: Medical Physics},
In parallel magnetic resonance imaging (pMRI), to find a joint solution for the image and coil sensitivity functions is a nonlinear and nonconvex problem. A class of algorithms reconstruct sensitivity encoded images of the coils first followed by the magnitude only image reconstruction, e.g. GRAPPA. It is shown in this paper that, if only the magnitude image is reconstructed, there exists a convex solution space for the magnitude image and sensitivity encoded images. This solution space enables… 

Figures and Tables from this paper



Parallel magnetic resonance imaging reconstruction by convex optimization

A constraint on the image function determined by magnetic resonance physics is introduced to formulate the joint image and sensitivity reconstruction into a convex problem, which will lead to a global and optimal solution and accurate and efficient computation for pMRI reconstruction.

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.

Simultaneous image reconstruction and sensitivity estimation in parallel MRI using blind compressed sensing

A novel algorithm is proposed to reconstruct both the coil sensitivities and image simultaneously from randomly undersampled, multichannel k-space data and is shown to improve the reconstruction accuracy of SparseSENSE and L1-SPIRiT when the same number of measurements is used.

Parallel imaging with nonlinear reconstruction using variational penalties

The improved reconstruction quality obtained from joint estimation of image and coil sensitivities is combined with the superior noise suppression of total variation and total generalized variation regularization to lead to enhanced removal of sampling artifacts arising from pseudorandom and radial sampling patterns.

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.

Generalized autocalibrating partially parallel acquisitions (GRAPPA)

This technique, GeneRalized Autocalibrating Partially Parallel Acquisitions (GRAPPA) is an extension of both the PILS and VD‐AUTO‐SMASH reconstruction techniques and provides unaliased images from each component coil prior to image combination.

Adaptive self‐calibrating iterative GRAPPA reconstruction

A new, adaptive iterative generalized auto‐calibrating partially parallel acquisition with dynamic self‐calibration is developed, yielding highly accurate calibration and thus reduces artifacts and noises even at high acceleration.

The Split Bregman Method for L1-Regularized Problems

This paper proposes a “split Bregman” method, which can solve a very broad class of L1-regularized problems, and applies this technique to the Rudin-Osher-Fatemi functional for image denoising and to a compressed sensing problem that arises in magnetic resonance imaging.

The NMR phased array

We describe methods for simultaneously acquiring and subsequently combining data from a multitude of closely positioned NMR receiving coils. The approach is conceptually similar to phased array radar

SPIRiT: Iterative self‐consistent parallel imaging reconstruction from arbitrary k‐space

A new approach to autocalibrating, coil‐by‐coil parallel imaging reconstruction, is presented, a generalized reconstruction framework based on self‐consistency that can accurately reconstruct images from arbitrary k‐space sampling patterns.