LORAKS makes better SENSE: Phase-constrained partial fourier SENSE reconstruction without phase calibration

Fast Whole-Brain MR Multi-Parametric Mapping with Scan-Specific Self-Supervised Networks

Quantification of tissue parameters using MRI is emerging as a powerful tool in clinical diagnosis and research studies. The need for multiple long scans with different acquisition parameters prohibits quantitative MRI from reaching widespread adoption in routine clinical and research exams. Accelerated parameter mapping techniques leverage parallel imaging, signal modelling and deep learning to offer more practical quantitative MRI acquisitions. However, the achievable acceleration and the quality of maps are often limited. Joint MAPLE is a recent state-of-the-art multi-parametric and scan-specific parameter mapping technique with promising performance at high acceleration rates. It synergistically combines parallel imaging, model-based and machine learning approaches for joint mapping ofT 1 , T 2 * , proton density and the field inhomogeneity. However, Joint MAPLE suffers from prohibitively long reconstruction time to estimate the maps from a multi-echo, multi-flip angle (MEMFA) dataset at high resolution in a scan-specific manner. In this work, we propose a faster version of Joint MAPLE which retains the mapping performance of the original version. Coil compression, random slice selection, parameter-specific learning rates and transfer learning are synergistically combined in the proposed framework. It speeds-up the reconstruction time up to 700 times than the original version and processes a whole-brain MEMFA dataset in 21 minutes on average, which originally requires ~260 hours for Joint MAPLE. The mapping performance of the proposed framework is ~2-fold better than the standard and the state-of-the-art evaluated reconstruction techniques on average in terms of the root mean squared error.

Knowledge-driven deep learning for fast MR imaging: Undersampled MR image reconstruction from supervised to un-supervised learning

Deep learning (DL) has emerged as a leading approach in accelerating MRI. It employs deep neural networks to extract knowledge from available datasets and then applies the trained networks to reconstruct accurate images from limited measurements. Unlike natural image restoration problems, MRI involves physics-based imaging processes, unique data properties, and diverse imaging tasks. This domain knowledge needs to be integrated with data-driven approaches. Our review will introduce the significant challenges faced by such knowledge-driven DL approaches in the context of fast MRI along with several notable solutions, which include learning neural networks and addressing different imaging application scenarios. The traits and trends of these techniques have also been given which have shifted from supervised learning to semi-supervised learning, and finally, to unsupervised learning methods. In addition, MR vendors' choices of DL reconstruction have been provided along with some discussions on open questions and future directions, which are critical for the reliable imaging systems.

Dynamic field mapping and distortion correction using single-shot blip-rewound EPI and joint multi-echo reconstruction

PURPOSE

To develop a method for dynamic∆ B 0 $$ \Delta {B}_0 $$ mapping and distortion correction.

METHODS

A blip-rewound EPI trajectory was developed to acquire multiple 2D EPI images in a single readout with an interleaved order, which allows a short TE difference. A joint multi-echo reconstruction was utilized to exploit the shared information between EPI images. The reconstructed images from each readout are combined to produce a final magnitude image. A∆ B 0 $$ \Delta {B}_0 $$ map is calculated from the phase of these images for distortion correction. The efficacy of the proposed method is assessed with phantom and in vivo experiments. The performance of the proposed method in the presence of subject motion is also investigated.

RESULTS

Compared to conventional multi-echo EPI, the proposed method allows dynamic∆ B 0 $$ \Delta {B}_0 $$ mapping at matched resolution with a much shorter TR. Phantom and in vivo results show that the proposed method can provide a comparable magnitude image as conventional single-shot EPI. The∆ B 0 $$ \Delta {B}_0 $$ maps calculated from the proposed method are consistent with conventional multi-echo EPI in the phantom experiment. For in vivo experiments, the proposed method provides a more accurate estimation of∆ B 0 $$ \Delta {B}_0 $$ than conventional multi-echo EPI, which is prone to phase wrapping problems due to the long TE difference. In-vivo scan with subject motion shows the proposed dynamic field mapping method can improve the temporal stability of EPI time series compared to gradient echo (GRE) based static field mapping.

CONCLUSION

The proposed method allows accurate dynamic∆ B 0 $$ \Delta {B}_0 $$ mapping for robust distortion correction without compromising spatial or temporal resolution.

Joint MAPLE: Accelerated joint T1 and T 2 * $$ {{\mathrm{T}}_2}^{\ast } $$ mapping with scan-specific self-supervised networks

PURPOSE

Quantitative MRI finds important applications in clinical and research studies. However, it is encoding intensive and may suffer from prohibitively long scan times. Accelerated MR parameter mapping techniques have been developed to help address these challenges. Here, an accelerated joint T1,T 2 * $$ {{\mathrm{T}}_2}^{\ast } $$ , frequency and proton density mapping technique with scan-specific self-supervised network reconstruction is proposed to synergistically combine parallel imaging, model-based, and deep learning approaches to speed up parameter mapping.

METHODS

Proposed framework, Joint MAPLE, includes parallel imaging, signal modeling, and data consistency blocks which are optimized jointly in a combined loss function. A scan-specific self-supervised reconstruction is embedded into the framework, which takes advantage of multi-contrast data from a multi-echo, multi-flip angle, gradient echo acquisition.

RESULTS

In comparison with parallel reconstruction techniques powered by low-rank methods, emerging scan specific networks, and model-basedT 2 * $$ {{\mathrm{T}}_2}^{\ast } $$ estimation approaches, the proposed framework reduces the reconstruction error in parameter maps by approximately two-fold on average at acceleration rates as high as R = 16 with uniform sampling. It can outperform evaluated parallel reconstruction techniques up to four-fold on average in the presence of challenging sub-sampling masks. It is observed that Joint MAPLE performs well at extreme acceleration rates of R = 25 and R = 36 with error values less than 20%.

CONCLUSION

Joint MAPLE enables higher fidelity parameter estimation at high acceleration rates by synergistically combining parallel imaging and model-based parameter mapping and exploiting multi-echo, multi-flip angle datasets. Utilizing a scan-specific self-supervised reconstruction obviates the need for large data sets for training while improving the parameter estimation ability.

The Potential of Phase Constraints for Non-Fourier Radiofrequency-Encoded MRI

In modern magnetic resonance imaging, it is common to use phase constraints to reduce sampling requirements along Fourier-encoded spatial dimensions. In this work, we investigate whether phase constraints might also be beneficial to reduce sampling requirements along spatial dimensions that are measured using non-Fourier encoding techniques, with direct relevance to approaches that use tailored spatially-selective radiofrequency (RF) pulses to perform spatial encoding along the slice dimension in a 3D imaging experiment. In the first part of the paper, we use the Cramér-Rao lower bound to examine the potential estimation theoretic benefits of using phase constraints. The results suggest that phase constraints can be used to improve experimental efficiency and enable acceleration, but only if the RF encoding matrix is complex-valued and appropriately designed. In the second part of the paper, we use simulations of RF-encoded data to test the benefits of phase constraints combined with optimized RF-encodings, and find that the theoretical benefits are indeed borne out empirically. These results provide new insights into the potential benefits of phase constraints for RF-encoded data, and provide a solid theoretical foundation for future practical explorations.

Structured low-rank reconstruction for navigator-free water/fat separated multi-shot diffusion-weighted EPI

PURPOSE

Multi-shot diffusion-weighted EPI allows an increase in image resolution and reduced geometric distortions and can be combined with chemical-shift encoding (Dixon) to separate water/fat signals. However, such approaches suffer from physiological motion-induced shot-to-shot phase variations. In this work, a structured low-rank-based navigator-free algorithm is proposed to address the challenge of simultaneously separating water/fat signals and correcting for physiological motion-induced shot-to-shot phase variations in multi-shot EPI-based diffusion-weighted MRI.

THEORY AND METHODS

We propose an iterative, model-based reconstruction pipeline that applies structured low-rank regularization to estimate and eliminate the shot-to-shot phase variations in a data-driven way, while separating water/fat images. The algorithm is tested in different anatomies, including head-neck, knee, brain, and prostate. The performance is validated in simulations and in-vivo experiments in comparison to existing approaches.

RESULTS

In-vivo experiments and simulations demonstrated the effectiveness of the proposed algorithm compared to extra-navigated and an alternative self-navigation approach. The proposed algorithm demonstrates the capability to reconstruct in the multi-shot/Dixon hybrid space domain under-sampled datasets, using the same number of acquired EPI shots compared to conventional fat-suppression techniques but eliminating fat signals through chemical-shift encoding. In addition, partial Fourier reconstruction can also be achieved by using the concept of virtual conjugate coils in conjunction with the proposed algorithm.

CONCLUSION

The proposed algorithm effectively eliminates the shot-to-shot phase variations and separates water/fat images, making it a promising solution for future DWI on different anatomies.

New Theory and Faster Computations for Subspace-Based Sensitivity Map Estimation in Multichannel MRI

Sensitivity map estimation is important in many multichannel MRI applications. Subspace-based sensitivity map estimation methods like ESPIRiT are popular and perform well, though can be computationally expensive and their theoretical principles can be nontrivial to understand. In the first part of this work, we present a novel theoretical derivation of subspace-based sensitivity map estimation based on a linear-predictability/structured low-rank modeling perspective. This results in an estimation approach that is equivalent to ESPIRiT, but with distinct theory that may be more intuitive for some readers. In the second part of this work, we propose and evaluate a set of computational acceleration approaches (collectively known as PISCO) that can enable substantial improvements in computation time (up to  ∼ 100× in the examples we show) and memory for subspace-based sensitivity map estimation.

High-fidelity mesoscale in-vivo diffusion MRI through gSlider-BUDA and circular EPI with S-LORAKS reconstruction

PURPOSE

To develop a high-fidelity diffusion MRI acquisition and reconstruction framework with reduced echo-train-length for less T2* image blurring compared to typical highly accelerated echo-planar imaging (EPI) acquisitions at sub-millimeter isotropic resolution.

METHODS

We first proposed a circular-EPI trajectory with partial Fourier sampling on both the readout and phase-encoding directions to minimize the echo-train-length and echo time. We then utilized this trajectory in an interleaved two-shot EPI acquisition with reversed phase-encoding polarity, to aid in the correction of off-resonance-induced image distortions and provide complementary k-space coverage in the missing partial Fourier regions. Using model-based reconstruction with structured low-rank constraint and smooth phase prior, we corrected the shot-to-shot phase variations across the two shots and recover the missing k-space data. Finally, we combined the proposed acquisition/reconstruction framework with an SNR-efficient RF-encoded simultaneous multi-slab technique, termed gSlider, to achieve high-fidelity 720 µm and 500 µm isotropic resolution in-vivo diffusion MRI.

RESULTS

Both simulation and in-vivo results demonstrate the effectiveness of the proposed acquisition and reconstruction framework to provide distortion-corrected diffusion imaging at the mesoscale with markedly reduced T2*-blurring. The in-vivo results of 720 µm and 500 µm datasets show high-fidelity diffusion images with reduced image blurring and echo time using the proposed approaches.

CONCLUSIONS

The proposed method provides high-quality distortion-corrected diffusion-weighted images with ∼40% reduction in the echo-train-length and T2* blurring at 500µm-isotropic-resolution compared to standard multi-shot EPI.

K-UNN: k-space interpolation with untrained neural network

Recently, untrained neural networks (UNNs) have shown satisfactory performances for MR image reconstruction on random sampling trajectories without using additional full-sampled training data. However, the existing UNN-based approaches lack the modeling of physical priors, resulting in poor performance in some common scenarios (e.g., partial Fourier (PF), regular sampling, etc.) and the lack of theoretical guarantees for reconstruction accuracy. To bridge this gap, we propose a safeguarded k-space interpolation method for MRI using a specially designed UNN with a tripled architecture driven by three physical priors of the MR images (or k-space data), including transform sparsity, coil sensitivity smoothness, and phase smoothness. We also prove that the proposed method guarantees tight bounds for interpolated k-space data accuracy. Finally, ablation experiments show that the proposed method can characterize the physical priors of MR images well. Additionally, experiments show that the proposed method consistently outperforms traditional parallel imaging methods and existing UNNs, and is even competitive against supervised-trained deep learning methods in PF and regular undersampling reconstruction.

Reconstruction for 7T high-resolution whole-brain diffusion MRI using two-stage N/2 ghost correction and L1-SPIRiT without single-band reference

PURPOSE

To combine a new two-stage N/2 ghost correction and an adapted L1-SPIRiT method for reconstruction of 7T highly accelerated whole-brain diffusion MRI (dMRI) using only autocalibration scans (ACS) without the need of additional single-band reference (SBref) scans.

METHODS

The proposed ghost correction consisted of a 3-line reference approach in stage 1 and the reference-free entropy method in stage 2. The adapted L1-SPIRiT method was formulated within the 3D k-space framework. Its efficacy was examined by acquiring two dMRI data sets at 1.05-mm isotropic resolutions with a total acceleration of 6 or 9 (i.e., 2-fold or 3-fold slice and 3-fold in-plane acceleration). Diffusion analysis was performed to derive DTI metrics and estimate fiber orientation distribution functions (fODFs). The results were compared with those of 3D k-space GRAPPA using only ACS, all in reference to 3D k-space GRAPPA using both ACS and SBref (serving as a reference).

RESULTS

The proposed ghost correction eliminated artifacts more robustly than conventional approaches. Our adapted L1-SPIRiT method outperformed 3D k-space GRAPPA when using only ACS, improving image quality to what was achievable with 3D k-space GRAPPA using both ACS and SBref scans. The improvement in image quality further resulted in an improvement in estimation performances for DTI and fODFs.

CONCLUSION

The combination of our new ghost correction and adapted L1-SPIRiT method can reliably reconstruct 7T highly accelerated whole-brain dMRI without the need of SBref scans, increasing acquisition efficiency and reducing motion sensitivity.

High-fidelity, high-spatial-resolution diffusion magnetic resonance imaging of ex vivo whole human brain at ultra-high gradient strength with structured low-rank echo-planar imaging ghost correction

Diffusion magnetic resonance imaging (dMRI) of whole ex vivo human brain specimens enables three-dimensional (3D) mapping of structural connectivity at the mesoscopic scale, providing detailed evaluation of fiber architecture and tissue microstructure at a spatial resolution that is difficult to access in vivo. To account for the short T2 and low diffusivity of fixed tissue, ex vivo dMRI is often acquired using strong diffusion-sensitizing gradients and multishot/segmented 3D echo-planar imaging (EPI) sequences to achieve high spatial resolution. However, the combination of strong diffusion-sensitizing gradients and multishot/segmented EPI readout can result in pronounced ghosting artifacts incurred by nonlinear spatiotemporal variations in the magnetic field produced by eddy currents. Such ghosting artifacts cannot be corrected with conventional correction solutions and pose a significant roadblock to leveraging human MRI scanners with ultrahigh gradients for ex vivo whole-brain dMRI. Here, we show that ghosting-correction approaches that correct for either polarity-related ghosting or shot-to-shot variations in a separate manner are suboptimal for 3D multishot diffusion-weighted EPI experiments in fixed human brain specimens using strong diffusion-sensitizing gradients on the 3-T Connectom MRI scanner, resulting in orientationally biased dMRI estimates. We apply a recently developed advanced k-space reconstruction method based on structured low-rank matrix (SLM) modeling that handles both polarity-related ghosting and shot-to-shot variation simultaneously, to mitigate artifacts in high-angular resolution multishot dMRI data acquired in several fixed human brain specimens at 0.7-0.8-mm isotropic spatial resolution using b-values up to 10,000 s/mm2 and gradient strengths up to 280 mT/m. We demonstrate the improved mapping of diffusion tensor imaging and fiber orientation distribution functions in key neuroanatomical areas distributed across the whole brain using SLM-based EPI ghost correction compared with alternative techniques.

Three-dimensional simultaneous brain mapping of T1, T2, T2∗ and magnetic susceptibility with MR Multitasking

PURPOSE

To develop a new technique that enables simultaneous quantification of whole-brain T1 , T2 , T 2 ∗ , as well as susceptibility and synthesis of six contrast-weighted images in a single 9.1-minute scan.

METHODS

The technique uses hybrid T2 -prepared inversion-recovery pulse modules and multi-echo gradient-echo readouts to collect k-space data with various T1, T2, and T 2 ∗ weightings. The underlying image is represented as a six-dimensional low-rank tensor consisting of three spatial dimensions and three temporal dimensions corresponding to T1 recovery, T2 decay, and multi-echo behaviors, respectively. Multiparametric maps were fitted from reconstructed image series. The proposed method was validated on phantoms and healthy volunteers, by comparing quantitative measurements against corresponding reference methods. The feasibility of generating six contrast-weighted images was also examined.

RESULTS

High quality, co-registered T1 , T2 , and T 2 ∗ susceptibility maps were generated that closely resembled the reference maps. Phantom measurements showed substantial consistency (R2 > 0.98) with the reference measurements. Despite the significant differences of T1 (p < .001), T2 (p = .002), and T 2 ∗ (p = 0.008) between our method and the references for in vivo studies, excellent agreement was achieved with all intraclass correlation coefficients greater than 0.75. No significant difference was found for susceptibility (p = .900). The framework is also capable of synthesizing six contrast-weighted images.

CONCLUSION

The MR Multitasking-based 3D brain mapping of T1 , T2 , T 2 ∗ , and susceptibility agrees well with the reference and is a promising technique for multicontrast and quantitative imaging.

Isotropic multichannel total variation framework for joint reconstruction of multicontrast parallel MRI

Purpose: To develop a synergistic image reconstruction framework that exploits multicontrast (MC), multicoil, and compressed sensing (CS) redundancies in magnetic resonance imaging (MRI). Approach: CS, MC acquisition, and parallel imaging (PI) have been individually well developed, but the combination of the three has not been equally well studied, much less the potential benefits of isotropy within such a setting. Inspired by total variation theory, we introduce an isotropic MC image regularizer and attain its full potential by integrating it into compressed MC multicoil MRI. A convex optimization problem is posed to model the new variational framework and a first-order algorithm is developed to solve the problem. Results: It turns out that the proposed isotropic regularizer outperforms many of the state-of-the-art reconstruction methods not only in terms of rotation-invariance preservation of symmetrical features, but also in suppressing noise or streaking artifacts, which are normally encountered in PI methods at aggressive undersampling rates. Moreover, the new framework significantly prevents intercontrast leakage of contrast-specific details, which seems to be a difficult situation to handle for some variational and low-rank MC reconstruction approaches. Conclusions: The new framework is a viable option for image reconstruction in fast protocols of MC parallel MRI, potentially reducing patient discomfort in otherwise long and time-consuming scans.

XCloud-pFISTA: A Medical Intelligence Cloud for Accelerated MRI

Machine learning and artificial intelligence have shown remarkable performance in accelerated magnetic resonance imaging (MRI). Cloud computing technologies have great advantages in building an easily accessible platform to deploy advanced algorithms. In this work, we develop an open-access, easy-to-use and high-performance medical intelligence cloud computing platform (XCloud-pFISTA) to reconstruct MRI images from undersampled k-space data. Two state-of-the-art approaches of the Projected Fast Iterative Soft-Thresholding Algorithm (pFISTA) family have been successfully implemented on the cloud. This work can be considered as a good example of cloud-based medical image reconstruction and may benefit the future development of integrated reconstruction and online diagnosis system.

Autoregression and Structured Low-Rank Modeling of Sinogram Neighborhoods

Sinograms are commonly used to represent the raw data from tomographic imaging experiments. Although it is already well-known that sinograms posess some amount of redundancy, in this work, we present novel theory suggesting that sinograms will often possess substantial additional redundancies that have not been explicitly exploited by previous methods. Specifically, we derive that sinograms will often satisfy multiple simple data-dependent autoregression relationships. This kind of autoregressive structure enables missing/degraded sinogram samples to be linearly predicted using a simple shift-invariant linear combination of neighboring samples. Our theory also further implies that if sinogram samples are assembled into a structured Hankel/Toeplitz matrix, then the matrix will be expected to have low-rank characteristics. As a result, sinogram restoration problems can be formulated as structured low-rank matrix recovery problems. Illustrations of this approach are provided using several different (real and simulated) X-ray imaging datasets, including comparisons against a state-of-the-art deep learning approach. Results suggest that structured low-rank matrix methods for sinogram recovery can have comparable performance to state-of-the-art approaches. Although our evaluation focuses on competitive comparisons against other approaches, we believe that autoregressive constraints are actually complementary to existing approaches with strong potential synergies.

Accelerated multicontrast reconstruction for synthetic MRI using joint parallel imaging and variable splitting networks

PURPOSE

Synthetic magnetic resonance imaging (MRI) requires the acquisition of multicontrast images to estimate quantitative parameter maps, such as T₁ , T₂ , and proton density (PD). The study aims to develop a multicontrast reconstruction method based on joint parallel imaging (JPI) and joint deep learning (JDL) to enable further acceleration of synthetic MRI.

METHODS

The JPI and JDL methods are extended and combined to improve reconstruction for better-quality, synthesized images. JPI is performed as a first step to estimate the missing k-space lines, and JDL is then performed to correct and refine the previous estimate with a trained neural network. For the JDL architecture, the original variable splitting network (VS-Net) is modified and extended to form a joint variable splitting network (JVS-Net) to apply to multicontrast reconstructions. The proposed method is designed and tested for multidynamic multiecho (MDME) images with Cartesian uniform under-sampling using acceleration factors between 4 and 8.

RESULTS

It is demonstrated that the normalized root-mean-square error (nRMSE) is lower and the structural similarity index measure (SSIM) values are higher with the proposed method compared to both the JPI and JDL methods individually. The method also demonstrates the potential to produce a set of synthesized contrast-weighted images that closely resemble those from the fully sampled acquisition without erroneous artifacts.

CONCLUSION

Combining JPI and JDL enables the reconstruction of highly accelerated synthetic MRIs.

Simultaneous multi-slice image reconstruction using regularized image domain split slice-GRAPPA for diffusion MRI

The main goal of this work is to improve the quality of simultaneous multi-slice (SMS) reconstruction for diffusion MRI. We accomplish this by developing an image domain method that reaps the benefits of both SENSE and GRAPPA-type approaches and enables image regularization in an optimization framework. We propose a new approach termed regularized image domain split slice-GRAPPA (RI-SSG), which establishes an optimization framework for SMS reconstruction. Within this framework, we use a robust forward model to take advantage of both the SENSE model with explicit sensitivity estimations and the SSG model with implicit kernel relationship among coil images. The proposed approach also allows combining of coil images to increase the SNR and enables image domain regularization on estimated coil-combined single slices. We compare the performance of RI-SSG with that of SENSE and SSG using in-vivo diffusion EPI datasets with simulated and actual SMS acquisitions collected on a 3T MR scanner. Reconstructed diffusion-weighted images (DWIs) and the resulting diffusion tensor imaging (DTI) and neurite orientation dispersion and density imaging (NODDI) maps are analyzed to evaluate the quantitative and qualitative performance of the three methods. The DWIs reconstructed by RI-SSG are closer to the single-band ground truth images than SENSE and SSG. Specifically, the proposed RI-SSG reduces the normalized root-mean-square-error (nRMSE) against ground truth images by ∼5% and increases the structural similarity index (SSIM) by ∼4% compared to SSG. All three methods produce similar fractional anisotropy (FA) maps using DTI representation, but mean diffusivity (MD) and fiber orientation estimates using RI-SSG are closer to the reference than SENSE and SSG. RI-SSG results in NODDI maps with noticeably smaller errors than those of SENSE and SSG and improves the accuracy of the mean value of orientation dispersion index (ODI) by ∼5% and the mean value of intracellular volume fraction by ∼7% in regions of interest in brain white matter compared to SSG.

Joint calibrationless reconstruction of highly undersampled multicontrast MR datasets using a low-rank Hankel tensor completion framework

PURPOSE

To jointly reconstruct highly undersampled multicontrast two-dimensional (2D) datasets through a low-rank Hankel tensor completion framework.

METHODS

A multicontrast Hankel tensor completion (MC-HTC) framework is proposed to exploit the shareable information in multicontrast datasets with respect to their highly correlated image structure, common spatial support, and shared coil sensitivity for joint reconstruction. This is achieved by first organizing multicontrast k-space datasets into a single block-wise Hankel tensor. Subsequent low-rank tensor approximation via higher-order singular value decomposition (HOSVD) uses the image structural correlation by considering different contrasts as virtual channels. Meanwhile, the HOSVD imposes common spatial support and shared coil sensitivity by treating data from different contrasts as from additional k-space kernels. The missing k-space data are then recovered by iteratively performing such low-rank approximation and enforcing data consistency. This joint reconstruction framework was evaluated using multicontrast multichannel 2D human brain datasets (T₁ -weighted, T₂ -weighted, fluid-attenuated inversion recovery, and T₁ -weighted-inversion recovery) of identical image geometry with random and uniform undersampling schemes.

RESULTS

The proposed method offered high acceleration, exhibiting significantly less residual errors when compared with both single-contrast SAKE (simultaneous autocalibrating and k-space estimation) and multicontrast J-LORAKS (joint parallel-imaging-low-rank matrix modeling of local k-space neighborhoods) low-rank reconstruction. Furthermore, the MC-HTC framework was applied uniquely to Cartesian uniform undersampling by incorporating a novel complementary k-space sampling strategy where the phase-encoding direction among different contrasts is orthogonally alternated.

CONCLUSION

The proposed MC-HTC approach presents an effective tensor completion framework to jointly reconstruct highly undersampled multicontrast 2D datasets without coil-sensitivity calibration.

A guaranteed convergence analysis for the projected fast iterative soft-thresholding algorithm in parallel MRI

Sparse sampling and parallel imaging techniques are two effective approaches to alleviate the lengthy magnetic resonance imaging (MRI) data acquisition problem. Promising data recoveries can be obtained from a few MRI samples with the help of sparse reconstruction models. To solve the optimization models, proper algorithms are indispensable. The pFISTA, a simple and efficient algorithm, has been successfully extended to parallel imaging. However, its convergence criterion is still an open question. Besides, the existing convergence criterion of single-coil pFISTA cannot be applied to the parallel imaging pFISTA, which, therefore, imposes confusions and difficulties on users about determining the only parameter - step size. In this work, we provide the guaranteed convergence analysis of the parallel imaging version pFISTA to solve the two well-known parallel imaging reconstruction models, SENSE and SPIRiT. Along with the convergence analysis, we provide recommended step size values for SENSE and SPIRiT reconstructions to obtain fast and promising reconstructions. Experiments on in vivo brain images demonstrate the validity of the convergence criterion.

MRI Reconstruction Using Markov Random Field and Total Variation as Composite Prior

Reconstruction of magnetic resonance images (MRI) benefits from incorporating a priori knowledge about statistical dependencies among the representation coefficients. Recent results demonstrate that modeling intraband dependencies with Markov Random Field (MRF) models enable superior reconstructions compared to inter-scale models. In this paper, we develop a novel reconstruction method, which includes a composite prior based on an MRF model and Total Variation (TV). We use an anisotropic MRF model and propose an original data-driven method for the adaptive estimation of its parameters. From a Bayesian perspective, we define a new position-dependent type of regularization and derive a compact reconstruction algorithm with a novel soft-thresholding rule. Experimental results show the effectiveness of this method compared to the state of the art in the field.

Phase-constrained reconstruction of high-resolution multi-shot diffusion weighted image

Diffusion weighted imaging (DWI) is a unique examining method in tumor diagnosis, acute stroke evaluation. Single-shot echo planar imaging is currently conventional method for DWI. However, single-shot DWI suffers from image distortion, blurring and low spatial resolution. Although multi-shot DWI improves image resolution, it brings phase variations among different shots at the same time. In this paper, we introduce a smooth phase constraint of each shot image into multi-shot navigator-free DWI reconstruction by imposing the low-rankness of Hankel matrix constructed from the k-space data. Furthermore, we exploit the partial sum minimization of singular values to constrain the low-rankness of Hankel matrix. Results on brain imaging data show that the proposed method outperforms the state-of-the-art methods in terms of artifacts removal and our method potentially has the ability to reconstruct high number of shot of DWI.

Improved MUSSELS reconstruction for high-resolution multi-shot diffusion weighted imaging

PURPOSE

MUSSELS is a one-step iterative reconstruction method for multishot diffusion weighted (msDW) imaging. The current work presents an efficient implementation, termed IRLS MUSSELS, that enables faster reconstruction to enhance its utility for high-resolution diffusion MRI studies.

METHODS

The recently proposed MUSSELS reconstruction belongs to a new class of parallel imaging-based methods that recover artifact-free DWIs from msDW data without needing phase compensation. The reconstruction is achieved via structured low-rank matrix completion algorithms, which are computationally demanding due to the large size of the Hankel matrices and their associated computations involving singular value decompositions. Because of this, computational demands of the MUSSELS reconstruction scales as the matrix size and the number of shots increases, which hinders its practical utility for high-resolution applications. In this work, we derive a computationally efficient MUSSELS formulation by modifying the iterative reweighted least squares (IRLS) method that were proposed earlier to solve such problems. Using whole-brain in vivo data, we show the utility of the IRLS MUSSELS for routine high-resolution studies with reduced computational burden.

RESULTS

IRLS MUSSELS provides about five times faster reconstruction for matrix sizes 192 × 192 and 256 × 256 compared to the earlier MUSSELS implementation. The widely employed conjugate symmetry priors can also be incorporated into IRLS MUSSELS to reduce blurring of the partial Fourier acquisitions, without incurring much computational burden.

CONCLUSIONS

The proposed method is observed to be computationally efficient to enable routine high-resolution studies. The computational complexity matches the traditional msDWI reconstruction methods and provides improved reconstruction results with the additional constraints.

Quantitative susceptibility map reconstruction using annihilating filter-based low-rank Hankel matrix approach

PURPOSE

Quantitative susceptibility mapping (QSM) inevitably suffers from streaking artifacts caused by zeros on the conical surface of the dipole kernel in k-space. This work proposes a novel and accurate QSM reconstruction method based on k-space low-rank Hankel matrix constraint, avoiding the over-smoothing problem and streaking artifacts.

THEORY AND METHODS

Based on the recent theory of annihilating filter-based low-rank Hankel matrix approach (ALOHA), QSM is formulated as deconvolution under low-rank Hankel matrix constraint in the k-space. The computational complexity and the high memory burden were reduced by successive reconstruction of 2-D planes along 3 independent axes of the 3-D phase image in Fourier domain. Feasibility of the proposed method was tested on a simulated phantom and human data and were compared with existing QSM reconstruction methods.

RESULTS

The proposed ALOHA-QSM effectively reduced streaking artifacts and accurately estimated susceptibility values in deep gray matter structures, compared to the existing QSM methods.

CONCLUSIONS

The suggested ALOHA-QSM algorithm successfully solves the 3-dimensional QSM dipole inversion problem using k-space low rank property with no anatomical constraint. ALOHA-QSM can provide detailed brain structures and accurate susceptibility values with no streaking artifacts.

A Generalized Structured Low-Rank Matrix Completion Algorithm for MR Image Recovery

Recent theory of mapping an image into a structured low-rank Toeplitz or Hankel matrix has become an effective method to restore images. In this paper, we introduce a generalized structured low-rank algorithm to recover images from their undersampled Fourier coefficients using infimal convolution regularizations. The image is modeled as the superposition of a piecewise constant component and a piecewise linear component. The Fourier coefficients of each component satisfy an annihilation relation, which results in a structured Toeplitz matrix. We exploit the low-rank property of the matrices to formulate a combined regularized optimization problem. In order to solve the problem efficiently and to avoid the high-memory demand resulting from the large-scale Toeplitz matrices, we introduce a fast and a memory-efficient algorithm based on the half-circulant approximation of the Toeplitz matrix. We demonstrate our algorithm in the context of single and multi-channel MR images recovery. Numerical experiments indicate that the proposed algorithm provides improved recovery performance over the state-of-the-art approaches.

Improving GRAPPA reconstruction using joint nonlinear kernel mapped and phase conjugated virtual coils

To improve the reconstruction condition and alleviate the noise amplification of GRAPPA reconstruction by aggregating the phase conjugated and nonlinear kernel mapped coils with the original physical coil. Nonlinear GRAPPA (NL-GRAPPA) is a kernel-based non-iterative approach which can reduce noise-induced error in GRAPPA reconstruction. And virtual conjugate coil (VCC) embeds the conjugate symmetric property of k-space into GRAPPA data synthesis to improve reconstruction condition. This work proposed NL-VCC-GRAPPA to jointly utilize the nonlinear mapped virtual coil and phase conjugated virtual coil to further reduce noise amplification in parallel imaging. In vivo static and dynamic 2D imaging accelerated by uniform undersampling schemes were performed to evaluate the proposed method in terms of visual image quality, root-mean-square-error (RMSE), and geometry factor (g-factor). The effects of acceleration factors, calibration data size and kernel shape on the proposed model were also separately analyzed and discussed. The proposed method illustrated improved visual image quality evidenced by reduced retrospective RMSE and prospective g-factor comparing with conventional GRAPPA and the recently proposed iterative SENSE-LORAKS reconstructions. Although a larger amount of calibration data and smaller kernel size were required to stabilize the calibration of fourfold extended kernel for the proposed method, it was non-iterative and relatively insensitive to parameter adjustment in the applications. The proposed NL-VCC-extension to conventional GRAPPA brings visible improvements for imaging scenarios accelerated by the widely available uniform undersampling schemes in a practically efficient manner without iteration.

Diffusion Acceleration with Gaussian process Estimated Reconstruction (DAGER)

PURPOSE

Image acceleration provides multiple benefits to diffusion MRI, with in-plane acceleration reducing distortion and slice-wise acceleration increasing the number of directions that can be acquired in a given scan time. However, as acceleration factors increase, the reconstruction problem becomes ill-conditioned, particularly when using both in-plane acceleration and simultaneous multislice imaging. In this work, we develop a novel reconstruction method for in vivo MRI acquisition that provides acceleration beyond what conventional techniques can achieve.

THEORY AND METHODS

We propose to constrain the reconstruction in the spatial (k) domain by incorporating information from the angular (q) domain. This approach exploits smoothness of the signal in q-space using Gaussian processes, as has previously been exploited in post-reconstruction analysis. We demonstrate in-plane undersampling exceeding the theoretical parallel imaging limits, and simultaneous multislice combined with in-plane undersampling at a total factor of 12. This reconstruction is cast within a Bayesian framework that incorporates estimation of smoothness hyper-parameters, with no need for manual tuning.

RESULTS

Simulations and in vivo results demonstrate superior performance of the proposed method compared with conventional parallel imaging methods. These improvements are achieved without loss of spatial or angular resolution and require only a minor modification to standard pulse sequences.

CONCLUSION

The proposed method provides improvements over existing methods for diffusion acceleration, particularly for high simultaneous multislice acceleration with in-plane undersampling.

Navigator-Free EPI Ghost Correction With Structured Low-Rank Matrix Models: New Theory and Methods

Structured low-rank matrix models have previously been introduced to enable calibrationless MR image reconstruction from sub-Nyquist data, and such ideas have recently been extended to enable navigator-free echo-planar imaging (EPI) ghost correction. This paper presents a novel theoretical analysis which shows that, because of uniform subsampling, the structured low-rank matrix optimization problems for EPI data will always have either undesirable or non-unique solutions in the absence of additional constraints. This theory leads us to recommend and investigate problem formulations for navigator-free EPI that incorporate side information from either image-domain or k-space domain parallel imaging methods. The importance of using nonconvex low-rank matrix regularization is also identified. We demonstrate using phantom and in vivo data that the proposed methods are able to eliminate ghost artifacts for several navigator-free EPI acquisition schemes, obtaining better performance in comparison with the state-of-the-art methods across a range of different scenarios. Results are shown for both single-channel acquisition and highly accelerated multi-channel acquisition.

Wave-LORAKS: Combining wave encoding with structured low-rank matrix modeling for more highly accelerated 3D imaging

PURPOSE

Wave-CAIPI is a novel acquisition approach that enables highly accelerated 3D imaging. This paper investigates the combination of Wave-CAIPI with LORAKS-based reconstruction (Wave-LORAKS) to enable even further acceleration.

METHODS

LORAKS is a constrained image reconstruction framework that can impose spatial support, smooth phase, sparsity, and/or parallel imaging constraints. LORAKS requires minimal prior information, and instead uses the low-rank subspace structure of the raw data to automatically learn which constraints to impose and how to impose them. Previous LORAKS implementations addressed 2D image reconstruction problems. In this work, several recent advances in structured low-rank matrix recovery were combined to enable large-scale 3D Wave-LORAKS reconstruction with improved quality and computational efficiency. Wave-LORAKS was investigated by retrospective subsampling of two fully sampled Wave-encoded 3D MPRAGE datasets, and comparisons were made against existing Wave reconstruction approaches.

RESULTS

Results show that Wave-LORAKS can yield higher reconstruction quality with 16×-accelerated data than is obtained by traditional Wave-CAIPI with 9×-accerated data.

CONCLUSIONS

There are strong synergies between Wave encoding and LORAKS, which enables Wave-LORAKS to achieve higher acceleration and more flexible sampling compared to Wave-CAIPI.

Improving parallel imaging by jointly reconstructing multi-contrast data

PURPOSE

To develop parallel imaging techniques that simultaneously exploit coil sensitivity encoding, image phase prior information, similarities across multiple images, and complementary k-space sampling for highly accelerated data acquisition.

METHODS

We introduce joint virtual coil (JVC)-generalized autocalibrating partially parallel acquisitions (GRAPPA) to jointly reconstruct data acquired with different contrast preparations, and show its application in 2D, 3D, and simultaneous multi-slice (SMS) acquisitions. We extend the joint parallel imaging concept to exploit limited support and smooth phase constraints through Joint (J-) LORAKS formulation. J-LORAKS allows joint parallel imaging from limited autocalibration signal region, as well as permitting partial Fourier sampling and calibrationless reconstruction.

RESULTS

We demonstrate highly accelerated 2D balanced steady-state free precession with phase cycling, SMS multi-echo spin echo, 3D multi-echo magnetization-prepared rapid gradient echo, and multi-echo gradient recalled echo acquisitions in vivo. Compared to conventional GRAPPA, proposed joint acquisition/reconstruction techniques provide more than 2-fold reduction in reconstruction error.

CONCLUSION

JVC-GRAPPA takes advantage of additional spatial encoding from phase information and image similarity, and employs different sampling patterns across acquisitions. J-LORAKS achieves a more parsimonious low-rank representation of local k-space by considering multiple images as additional coils. Both approaches provide dramatic improvement in artifact and noise mitigation over conventional single-contrast parallel imaging reconstruction. Magn Reson Med 80:619-632, 2018. © 2018 International Society for Magnetic Resonance in Medicine.

THE FOURIER RADIAL ERROR SPECTRUM PLOT: A MORE NUANCED QUANTITATIVE EVALUATION OF IMAGE RECONSTRUCTION QUALITY

In the modern biomedical image reconstruction literature, the quality of a reconstructed image is often numerically quantified using scalar error measures such as mean-squared error or the structural similarity index. While such measures provide a rough summary of image quality, they also suffer from well-known limitations. For example, a substantial amount of information is necessarily lost whenever the characteristics of a high-dimensional image are summarized by a single number. In this work, we introduce the Fourier radial Error Spectrum Plot (ESP), which provides a novel and more nuanced assessment of error by decomposing the error into its different spatial frequency components. The usefulness of ESP is illustrated in the context of MRI reconstruction from under-sampled data. In addition, we demonstrate that the extra dimension of insight provided by ESP can be used to improve the performance of existing image reconstruction techniques.

Learning Joint-Sparse Codes for Calibration-Free Parallel MR Imaging

The integration of compressed sensing and parallel imaging (CS-PI) has shown an increased popularity in recent years to accelerate magnetic resonance (MR) imaging. Among them, calibration-free techniques have presented encouraging performances due to its capability in robustly handling the sensitivity information. Unfortunately, existing calibration-free methods have only explored joint-sparsity with direct analysis transform projections. To further exploit joint-sparsity and improve reconstruction accuracy, this paper proposes to Learn joINt-sparse coDes for caliBration-free parallEl mR imaGing (LINDBERG) by modeling the parallel MR imaging problem as an - - minimization objective with an norm constraining data fidelity, Frobenius norm enforcing sparse representation error and the mixed norm triggering joint sparsity across multichannels. A corresponding algorithm has been developed to alternatively update the sparse representation, sensitivity encoded images and K-space data. Then, the final image is produced as the square root of sum of squares of all channel images. Experimental results on both physical phantom and in vivo data sets show that the proposed method is comparable and even superior to state-of-the-art CS-PI reconstruction approaches. Specifically, LINDBERG has presented strong capability in suppressing noise and artifacts while reconstructing MR images from highly undersampled multichannel measurements.

A Fast Algorithm for Convolutional Structured Low-rank Matrix Recovery

Fourier domain structured low-rank matrix priors are emerging as powerful alternatives to traditional image recovery methods such as total variation (TV) and wavelet regularization. These priors specify that a convolutional structured matrix, i.e., Toeplitz, Hankel, or their multi-level generalizations, built from Fourier data of the image should be low-rank. The main challenge in applying these schemes to large-scale problems is the computational complexity and memory demand resulting from a lifting the image data to a large scale matrix. We introduce a fast and memory efficient approach called the Generic Iterative Reweighted Annihilation Filter (GIRAF) algorithm that exploits the convolutional structure of the lifted matrix to work in the original un-lifted domain, thus considerably reducing the complexity. Our experiments on the recovery of images from undersampled Fourier measurements show that the resulting algorithm is considerably faster than previously proposed algorithms, and can accommodate much larger problem sizes than previously studied.

Multi-shot sensitivity-encoded diffusion data recovery using structured low-rank matrix completion (MUSSELS)

PURPOSE

To introduce a novel method for the recovery of multi-shot diffusion weighted (MS-DW) images from echo-planar imaging (EPI) acquisitions.

METHODS

Current EPI-based MS-DW reconstruction methods rely on the explicit estimation of the motion-induced phase maps to recover artifact-free images. In the new formulation, the k-space data of the artifact-free DWI is recovered using a structured low-rank matrix completion scheme, which does not require explicit estimation of the phase maps. The structured matrix is obtained as the lifting of the multi-shot data. The smooth phase-modulations between shots manifest as null-space vectors of this matrix, which implies that the structured matrix is low-rank. The missing entries of the structured matrix are filled in using a nuclear-norm minimization algorithm subject to the data-consistency. The formulation enables the natural introduction of smoothness regularization, thus enabling implicit motion-compensated recovery of the MS-DW data.

RESULTS

Our experiments on in-vivo data show effective removal of artifacts arising from inter-shot motion using the proposed method. The method is shown to achieve better reconstruction than the conventional phase-based methods.

CONCLUSION

We demonstrate the utility of the proposed method to effectively recover artifact-free images from Cartesian fully/under-sampled and partial Fourier acquired data without the use of explicit phase estimates. Magn Reson Med 78:494-507, 2017. © 2016 International Society for Magnetic Resonance in Medicine.

Recent advances in parallel imaging for MRI

Magnetic Resonance Imaging (MRI) is an essential technology in modern medicine. However, one of its main drawbacks is the long scan time needed to localize the MR signal in space to generate an image. This review article summarizes some basic principles and recent developments in parallel imaging, a class of image reconstruction techniques for shortening scan time. First, the fundamentals of MRI data acquisition are covered, including the concepts of k-space, undersampling, and aliasing. It is demonstrated that scan time can be reduced by sampling a smaller number of phase encoding lines in k-space; however, without further processing, the resulting images will be degraded by aliasing artifacts. Nearly all modern clinical scanners acquire data from multiple independent receiver coil arrays. Parallel imaging methods exploit properties of these coil arrays to separate aliased pixels in the image domain or to estimate missing k-space data using knowledge of nearby acquired k-space points. Three parallel imaging methods-SENSE, GRAPPA, and SPIRiT-are described in detail, since they are employed clinically and form the foundation for more advanced methods. These techniques can be extended to non-Cartesian sampling patterns, where the collected k-space points do not fall on a rectangular grid. Non-Cartesian acquisitions have several beneficial properties, the most important being the appearance of incoherent aliasing artifacts. Recent advances in simultaneous multi-slice imaging are presented next, which use parallel imaging to disentangle images of several slices that have been acquired at once. Parallel imaging can also be employed to accelerate 3D MRI, in which a contiguous volume is scanned rather than sequential slices. Another class of phase-constrained parallel imaging methods takes advantage of both image magnitude and phase to achieve better reconstruction performance. Finally, some applications are presented of parallel imaging being used to accelerate MR Spectroscopic Imaging.

Simultaneous Time Interleaved MultiSlice (STIMS) for Rapid Susceptibility Weighted acquisition

T₂* weighted 3D Gradient Echo (GRE) acquisition is the main sequence used for Susceptibility Weighted Imaging (SWI) and Quantitative Susceptibility Mapping (QSM). These applications require a long echo time (TE) to build up phase contrast, requiring a long repetition time (TR), and leading to excessively lengthy scans. The long TE acquisition creates a significant amount of unused time within each TR, which can be utilized for either multi-echo sampling or additional image encoding with the echo-shift technique. The latter leads to significant saving in acquisition time while retaining the desired phase and T₂* contrast. In this work, we introduce the Simultaneous Time Interleaved MultiSlice (STIMS) echo-shift technique, which mitigates slab boundary artifacts by interleaving comb-shaped slice groups with Simultaneous MultiSlice (SMS) excitation. This enjoys the same SNR benefit of 3D signal averaging as previously introduced multi-slab version, where each slab group is sub-resolved with kz phase encoding. Further, we combine SMS echo-shift with Compressed Sensing (CS) Wave acceleration, which enhances Wave-CAIPI acquisition/reconstruction with random undersampling and sparsity prior. STIMS and CS-Wave combination thus yields up to 45-fold acceleration over conventional full encoding, allowing a 15sec full-brain acquisition with 1.5 mm isotropic resolution at long TE of 39 ms at 3T. In addition to utilizing empty sequence time due to long TE, STIMS is a general concept that could exploit gaps due to e.g. inversion modules in magnetization-prepared rapid gradient-echo (MPRAGE) and fluid attenuated inversion recovery (FLAIR) sequences.