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

  title={SPIRiT: Iterative self‐consistent parallel imaging reconstruction from arbitrary k‐space},
  author={Michael Lustig and John M. Pauly},
  journal={Magnetic Resonance in Medicine},
  • M. Lustig, J. Pauly
  • Published 1 August 2010
  • Physics, Mathematics
  • Magnetic Resonance in Medicine
A new approach to autocalibrating, coil‐by‐coil parallel imaging reconstruction, is presented. It is a generalized reconstruction framework based on self‐consistency. The reconstruction problem is formulated as an optimization that yields the most consistent solution with the calibration and acquisition data. The approach is general and can accurately reconstruct images from arbitrary k‐space sampling patterns. The formulation can flexibly incorporate additional image priors such as off… 
Regularization in parallel magnetic resonance imaging
  • Amel Korti
  • Computer Science
    Int. J. Imaging Syst. Technol.
  • 2018
A regularized SPIRiT reconstruction based on steerable pyramid decomposition is proposed, with directionally filter banks leading to a better separation of signal and noise compared to a discrete wavelet transform (DWT).
Improved least squares MR image reconstruction using estimates of k‐Space data consistency
A new approach to reconstruct data that has been corrupted by unfavorable magnetization evolution is described, using a weighted least squares fashion using all available data and a measure of consistency determined from the data itself.
Non‐Cartesian parallel imaging reconstruction
This review will begin with an overview of non‐Cartesian k‐space trajectories and their sampling properties, followed by an in‐depth discussion of several selected non‐ Cartesian parallel imaging algorithms.
Vectorial non-local total variation regularization for calibration-free parallel MRI reconstruction
This work presents a calibration-free parallel magnetic resonance imaging (pMRI) reconstruction approach by exploiting the fact that image structures typically tend to repeat themselves in several locations in the image domain, and proposes an iterative algorithm which is based on a variable splitting strategy.
An Improved Calibration Framework for Iterative Self-Consistent Parallel Imaging Reconstruction (SPIRiT)
An improved calibration framework for SPiriT is presented to reduce noise-induced errors and to adaptively generate optimal linear weighting coefficients and can effectively improve SPIRiT image quality.
Nuclear norm-regularized k-space-based parallel imaging reconstruction
The proposed method exploits the rank deficiency of structured matrix consisting of vectorized patches form entire k-space, which leads to a nuclear norm-regularized problem solved by the numeric algorithms iteratively.
Reconstruction of undersampled radial PatLoc imaging using total generalized variation
This work presents a new iterative reconstruction method based on the total generalized variation, which leads to a significant reduction of computation time in comparison to conventional PatLoc image reconstruction methods.
Low‐dimensional‐structure self‐learning and thresholding: Regularization beyond compressed sensing for MRI Reconstruction
An improved image reconstruction method from undersampled k‐space data, low‐dimensional‐structure self‐learning and thresholding (LOST), which utilizes the structure from the underlying image to improve image reconstruction for accelerated coronary MRI acquisitions is presented.
A Convex Optimization Approach to pMRI Reconstruction
In parallel magnetic resonance imaging (pMRI) reconstruction without using estimation of coil sensitivity functions, one group of algorithms reconstruct sensitivity encoded images of the coils first


On optimality of parallel MRI reconstruction in k‐space
  • A. Samsonov
  • Computer Science
    Magnetic resonance in medicine
  • 2008
The design of optimized reconstruction kernels, the effect of regularization on image error, and the accuracy of different k‐space–based parallel MRI methods are studied; a total error metric is introduced for validation of the reconstruction kernel and choice ofregularization parameters.
Auto‐calibrated parallel spiral imaging
This work describes an auto‐calibrated method for parallel imaging with spiral trajectory where an interpolation kernel, accounting for coil sensitivity factors, is derived from experimental data and used to interpolate the reduced data set in parallel imaging to estimate the missing k‐space data.
Direct parallel image reconstructions for spiral trajectories using GRAPPA
In this study a new and fast approach for parallel image reconstructions for spiral imaging based on the generalized autocalibrating partially parallel acquisitions (GRAPPA) methodology is presented, and the computational burden is reduced such that it becomes comparable to that needed in accelerated Cartesian procedures.
Advances in sensitivity encoding with arbitrary k‐space trajectories
Using the proposed method, SENSE becomes practical with nonstandard k‐space trajectories, enabling considerable scan time reduction with respect to mere gradient encoding, and the in vivo feasibility of non‐Cartesian SENSE imaging with iterative reconstruction is demonstrated.
Field‐of‐view limitations in parallel imaging
It is demonstrated that SENSE fails to reconstruct correct images when coil sensitivity maps are used that do not automatically account for the object size and therefore the aliasing in the reconstructed images, however, with the use of aliased high‐resolution Coil sensitivity maps, accurate SENSE reconstructions can be generated.
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.
Multifrequency interpolation for fast off‐resonance correction
A new correction method based on the existing concept of frequency segmented correction but which is faster and the‐oretically more accurate is introduced, yielding sharply focused images.
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.
Sparse MRI: The application of compressed sensing for rapid MR imaging
Practical incoherent undersampling schemes are developed and analyzed by means of their aliasing interference and demonstrate improved spatial resolution and accelerated acquisition for multislice fast spin‐echo brain imaging and 3D contrast enhanced angiography.
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.