Parallel MR image reconstruction using augmented Lagrangian methods

Synergistic PET and SENSE MR Image Reconstruction Using Joint Sparsity Regularization

In this paper, we propose a generalized joint sparsity regularization prior and reconstruction framework for the synergistic reconstruction of positron emission tomography (PET) and under sampled sensitivity encoded magnetic resonance imaging data with the aim of improving image quality beyond that obtained through conventional independent reconstructions. The proposed prior improves upon the joint total variation (TV) using a non-convex potential function that assigns a relatively lower penalty for the PET and MR gradients, whose magnitudes are jointly large, thus permitting the preservation and formation of common boundaries irrespective of their relative orientation. The alternating direction method of multipliers (ADMM) optimization framework was exploited for the joint PET-MR image reconstruction. In this framework, the joint maximum a posteriori objective function was effectively optimized by alternating between well-established regularized PET and MR image reconstructions. Moreover, the dependency of the joint prior on the PET and MR signal intensities was addressed by a novel alternating scaling of the distribution of the gradient vectors. The proposed prior was compared with the separate TV and joint TV regularization methods using extensive simulation and real clinical data. In addition, the proposed joint prior was compared with the recently proposed linear parallel level sets (PLSs) method using a benchmark simulation data set. Our simulation and clinical data results demonstrated the improved quality of the synergistically reconstructed PET-MR images compared with the unregularized and conventional separately regularized methods. It was also found that the proposed prior can outperform both the joint TV and linear PLS regularization methods in assisting edge preservation and recovery of details, which are otherwise impaired by noise and aliasing artifacts. In conclusion, the proposed joint sparsity regularization within the presented a ADMM reconstruction framework is a promising technique, nonetheless our clinical results showed that the clinical applicability of joint reconstruction might be limited in current PET-MR scanners, mainly due to the lower resolution of PET images.

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.

Improved parallel image reconstruction using feature refinement

PURPOSE

The aim of this study was to develop a novel feature refinement MR reconstruction method from highly undersampled multichannel acquisitions for improving the image quality and preserve more detail information.

THEORY AND METHODS

The feature refinement technique, which uses a feature descriptor to pick up useful features from residual image discarded by sparsity constrains, is applied to preserve the details of the image in compressed sensing and parallel imaging in MRI (CS-pMRI). The texture descriptor and structure descriptor recognizing different types of features are required for forming the feature descriptor. Feasibility of the feature refinement was validated using three different multicoil reconstruction methods on in vivo data.

RESULTS

Experimental results show that reconstruction methods with feature refinement improve the quality of reconstructed image and restore the image details more accurately than the original methods, which is also verified by the lower values of the root mean square error and high frequency error norm.

CONCLUSION

A simple and effective way to preserve more useful detailed information in CS-pMRI is proposed. This technique can effectively improve the reconstruction quality and has superior performance in terms of detail preservation compared with the original version without feature refinement. Magn Reson Med 80:211-223, 2018. © 2017 International Society for Magnetic Resonance in Medicine.

Efficient operator splitting algorithm for joint sparsity-regularized SPIRiT-based parallel MR imaging reconstruction

Self-consistent parallel imaging (SPIRiT) is an auto-calibrating model for the reconstruction of parallel magnetic resonance imaging, which can be formulated as a regularized SPIRiT problem. The Projection Over Convex Sets (POCS) method was used to solve the formulated regularized SPIRiT problem. However, the quality of the reconstructed image still needs to be improved. Though methods such as NonLinear Conjugate Gradients (NLCG) can achieve higher spatial resolution, these methods always demand very complex computation and converge slowly. In this paper, we propose a new algorithm to solve the formulated Cartesian SPIRiT problem with the JTV and JL1 regularization terms. The proposed algorithm uses the operator splitting (OS) technique to decompose the problem into a gradient problem and a denoising problem with two regularization terms, which is solved by our proposed split Bregman based denoising algorithm, and adopts the Barzilai and Borwein method to update step size. Simulation experiments on two in vivo data sets demonstrate that the proposed algorithm is 1.3 times faster than ADMM for datasets with 8 channels. Especially, our proposal is 2 times faster than ADMM for the dataset with 32 channels.

MR image reconstruction via guided filter

Magnetic resonance imaging (MRI) reconstruction from the smallest possible set of Fourier samples has been a difficult problem in medical imaging field. In our paper, we present a new approach based on a guided filter for efficient MRI recovery algorithm. The guided filter is an edge-preserving smoothing operator and has better behaviors near edges than the bilateral filter. Our reconstruction method is consist of two steps. First, we propose two cost functions which could be computed efficiently and thus obtain two different images. Second, the guided filter is used with these two obtained images for efficient edge-preserving filtering, and one image is used as the guidance image, the other one is used as a filtered image in the guided filter. In our reconstruction algorithm, we can obtain more details by introducing guided filter. We compare our reconstruction algorithm with some competitive MRI reconstruction techniques in terms of PSNR and visual quality. Simulation results are given to show the performance of our new method.

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.

An Efficient Reconstruction Algorithm Based on the Alternating Direction Method of Multipliers for Joint Estimation of ${R}_{{2}}^{*}$ and Off-Resonance in fMRI

R*₂ mapping is a useful tool in blood-oxygen-level dependent fMRI due to its quantitative-nature. However, like T*₂-weighted imaging, standard R*₂ mapping based on multi-echo EPI suffers from geometric distortion, due to strong off-resonance near the air-tissue interface. Joint mapping of R*₂ and off-resonance can correct the geometric distortion and is less susceptible to motion artifacts. Single-shot joint mapping of R*₂ and off-resonance is possible with a rosette trajectory due to its frequent sampling of the k-space center. However, the corresponding reconstruction is nonlinear, ill-conditioned, large-scale, and computationally inefficient with current algorithms. In this paper, we propose a novel algorithm for joint mapping of R*₂ and off-resonance, using rosette k-space trajectories. The new algorithm, based on the alternating direction method of multipliers, improves the reconstruction efficiency by simplifying the original complicated cost function into a composition of simpler optimization steps. Compared with a recently developed trust region algorithm, the new algorithm achieves the same accuracy and an acceleration of threefold to sixfold in reconstruction time. Based on the new algorithm, we present simulation and in vivo data from single-shot, double-shot, and quadruple-shot rosettes and demonstrate the improved image quality and reduction of distortions in the reconstructed R*₂ map.

Single-step quantitative susceptibility mapping with variational penalties

Quantitative susceptibility mapping (QSM) estimates the underlying tissue magnetic susceptibility from the gradient echo (GRE) phase signal through background phase removal and dipole inversion steps. Each of these steps typically requires the solution of an ill-posed inverse problem and thus necessitates additional regularization. Recently developed single-step QSM algorithms directly relate the unprocessed GRE phase to the unknown susceptibility distribution, thereby requiring the solution of a single inverse problem. In this work, we show that such a holistic approach provides susceptibility estimation with artifact mitigation and develop efficient algorithms that involve simple analytical solutions for all of the optimization steps. Our methods employ total variation (TV) and total generalized variation (TGV) to jointly perform the background removal and dipole inversion in a single step. Using multiple spherical mean value (SMV) kernels of varying radii permits high-fidelity background removal whilst retaining the phase information in the cortex. Using numerical simulations, we demonstrate that the proposed single-step methods reduce the reconstruction error by up to 66% relative to the multi-step methods that involve SMV background filtering with the same number of SMV kernels, followed by TV- or TGV-regularized dipole inversion. In vivo single-step experiments demonstrate a dramatic reduction in dipole streaking artifacts and improved homogeneity of image contrast. These acquisitions employ the rapid three-dimensional echo planar imaging (3D EPI) and Wave-CAIPI (controlled aliasing in parallel imaging) trajectories for signal-to-noise ratio-efficient whole-brain imaging. Herein, we also demonstrate the multi-echo capability of the Wave-CAIPI sequence for the first time, and introduce an automated, phase-sensitive coil sensitivity estimation scheme based on a 4-s calibration acquisition. Copyright © 2016 John Wiley & Sons, Ltd.

Efficient, Convergent SENSE MRI Reconstruction for Nonperiodic Boundary Conditions via Tridiagonal Solvers

Undersampling is an effective method for reducing scan acquisition time for MRI. Strategies for accelerated MRI such as parallel MRI and Compressed Sensing MRI present challenging image reconstruction problems with non-differentiable cost functions and computationally demanding operations. Variable splitting (VS) can simplify implementation of difficult image reconstruction problems, such as the combination of parallel MRI and Compressed Sensing, CS-SENSE-MRI. Combined with augmented Lagrangian (AL) and alternating minimization strategies, variable splitting can yield iterative minimization algorithms with simpler auxiliary variable updates. However, arbitrary variable splitting schemes are not guaranteed to converge. Many variable splitting strategies are combined with periodic boundary conditions. The resultant circulant Hessians enable 𝒪(n log n) computation but may compromise image accuracy at the spatial boundaries. We propose two methods for CS-SENSE-MRI that use regularization with non-periodic boundary conditions to prevent wrap-around artifacts. Each algorithm computes one of the resulting variable updates efficiently in 𝒪(n) time using a parallelizable tridiagonal solver. AL-tridiag is a VS method designed to enable efficient computation for non-periodic boundary conditions. Another proposed algorithm, ADMM-tridiag, uses a similar VS scheme but also ensures convergence to a minimizer of the proposed cost function using the Alternating Direction Method of Multipliers (ADMM). AL-tridiag and ADMM-tridiag show speeds competitive with previous VS CS-SENSE-MRI reconstruction algorithm AL-P2. We also apply the tridiagonal VS approach to a simple image inpainting problem.

High-resolution whole-brain DCE-MRI using constrained reconstruction: Prospective clinical evaluation in brain tumor patients

PURPOSE

To clinically evaluate a highly accelerated T1-weighted dynamic contrast-enhanced (DCE) MRI technique that provides high spatial resolution and whole-brain coverage via undersampling and constrained reconstruction with multiple sparsity constraints.

METHODS

Conventional (rate-2 SENSE) and experimental DCE-MRI (rate-30) scans were performed 20 minutes apart in 15 brain tumor patients. The conventional clinical DCE-MRI had voxel dimensions 0.9 × 1.3 × 7.0 mm(3), FOV 22 × 22 × 4.2 cm(3), and the experimental DCE-MRI had voxel dimensions 0.9 × 0.9 × 1.9 mm(3), and broader coverage 22 × 22 × 19 cm(3). Temporal resolution was 5 s for both protocols. Time-resolved images and blood-brain barrier permeability maps were qualitatively evaluated by two radiologists.

RESULTS

The experimental DCE-MRI scans showed no loss of qualitative information in any of the cases, while achieving substantially higher spatial resolution and whole-brain spatial coverage. Average qualitative scores (from 0 to 3) were 2.1 for the experimental scans and 1.1 for the conventional clinical scans.

CONCLUSIONS

The proposed DCE-MRI approach provides clinically superior image quality with higher spatial resolution and coverage than currently available approaches. These advantages may allow comprehensive permeability mapping in the brain, which is especially valuable in the setting of large lesions or multiple lesions spread throughout the brain.

Split Bregman multicoil accelerated reconstruction technique: A new framework for rapid reconstruction of cardiac perfusion MRI

PURPOSE

Rapid reconstruction of undersampled multicoil MRI data with iterative constrained reconstruction method is a challenge. The authors sought to develop a new substitution based variable splitting algorithm for faster reconstruction of multicoil cardiac perfusion MRI data.

METHODS

The new method, split Bregman multicoil accelerated reconstruction technique (SMART), uses a combination of split Bregman based variable splitting and iterative reweighting techniques to achieve fast convergence. Total variation constraints are used along the spatial and temporal dimensions. The method is tested on nine ECG-gated dog perfusion datasets, acquired with a 30-ray golden ratio radial sampling pattern and ten ungated human perfusion datasets, acquired with a 24-ray golden ratio radial sampling pattern. Image quality and reconstruction speed are evaluated and compared to a gradient descent (GD) implementation and to multicoil k-t SLR, a reconstruction technique that uses a combination of sparsity and low rank constraints.

RESULTS

Comparisons based on blur metric and visual inspection showed that SMART images had lower blur and better texture as compared to the GD implementation. On average, the GD based images had an ∼18% higher blur metric as compared to SMART images. Reconstruction of dynamic contrast enhanced (DCE) cardiac perfusion images using the SMART method was ∼6 times faster than standard gradient descent methods. k-t SLR and SMART produced images with comparable image quality, though SMART was ∼6.8 times faster than k-t SLR.

CONCLUSIONS

The SMART method is a promising approach to reconstruct good quality multicoil images from undersampled DCE cardiac perfusion data rapidly.

Direct estimation of tracer-kinetic parameter maps from highly undersampled brain dynamic contrast enhanced MRI

PURPOSE

The purpose of this work was to develop and evaluate a T₁ -weighted dynamic contrast enhanced (DCE) MRI methodology where tracer-kinetic (TK) parameter maps are directly estimated from undersampled (k,t)-space data.

THEORY AND METHODS

The proposed reconstruction involves solving a nonlinear least squares optimization problem that includes explicit use of a full forward model to convert parameter maps to (k,t)-space, utilizing the Patlak TK model. The proposed scheme is compared against an indirect method that creates intermediate images by parallel imaging and compressed sensing before to TK modeling. Thirteen fully sampled brain tumor DCE-MRI scans with 5-second temporal resolution are retrospectively undersampled at rates R = 20, 40, 60, 80, and 100 for each dynamic frame. TK maps are quantitatively compared based on root mean-squared-error (rMSE) and Bland-Altman analysis. The approach is also applied to four prospectively R = 30 undersampled whole-brain DCE-MRI data sets.

RESULTS

In the retrospective study, the proposed method performed statistically better than indirect method at R ≥ 80 for all 13 cases. This approach provided restoration of TK parameter values with less errors in tumor regions of interest, an improvement compared to a state-of-the-art indirect method. Applied prospectively, the proposed method provided whole-brain, high-resolution TK maps with good image quality.

CONCLUSION

Model-based direct estimation of TK maps from k,t-space DCE-MRI data is feasible and is compatible up to 100-fold undersampling. Magn Reson Med 78:1566-1578, 2017. © 2016 International Society for Magnetic Resonance in Medicine.

Dynamic MRI reconstruction from highly undersampled (k, t)-space data using weighted Schatten p-norm regularizer of tensor

Combination of the low-rankness and sparsity has been successfully used to reconstruct desired dynamic magnetic resonance image (MRI) from highly-undersampled (k, t)-space data. However, nuclear norm, as a convex relaxation of the rank function, can cause the solution deviating from the original solution of low-rank problem. Moreover, equally treating different rank component is not flexible to deal with real applications. In this paper, an efficient reconstruction model is proposed to efficiently reconstruct dynamic MRI. First, we treat dynamic MRI as a 3rd-order tensor, and formulate the low-rankness via non-convex Schatten p-norm of matrices unfolded from the tensor. Secondly, we assign different weight for each rank component in Schatten p-norm. Furthermore, we combine the proposed weighted Schatten p-norm of a tensor as low-rank regularizer, and spatiotemporal total variation as sparse regularizer to formulate the reconstruction model for dynamic MRI. Thirdly, to efficiently solve the formulated reconstruction model, we derive an algorithm based on Bregman iterations with alternating direction multiplier. Over two public data sets of dynamic MRI, experiments demonstrate that the proposed method achieves much better quality.

SMS-HSL: Simultaneous multislice aliasing separation exploiting hankel subspace learning

PURPOSE

To develop a novel, simultaneous multislice reconstruction method that exploits Hankel subspace learning (SMS-HSL) for aliasing separation in the slice direction.

METHODS

An SMS signal model with the Hankel-structured matrix was proposed. To efficiently suppress interslice leakage artifacts from a signal subspace perspective, a null space was learned from the reference data combined over all slices other than a slice of interest using singular value decomposition. Given the fact that the Hankel-structured matrix is rank-deficient while the magnitude between the reference and its estimate is similar in k-space, the SMS-HSL was reformulated as a constrained optimization problem with both low-rank and magnitude priors. SMS signals were projected onto a slice-specific subspace while undesired signals were eliminated using the null space operator. The simulations and experiments were performed with increasing multiband factors up to 6 using the SMS-HSL and the split slice-GRAPPA.

RESULTS

Compared with the split slice-GRAPPA, the SMS-HSL shows superior performance in suppressing aliasing artifacts and noises at high multiband factors even with: insufficient reference signals, a small number of coils, and a short distance between aliasing voxels.

CONCLUSION

We successfully demonstrated the effectiveness of the SMS-HSL over the split slice-GRAPPA for aliasing separation in the slice direction. Magn Reson Med 78:1392-1404, 2017. © 2016 International Society for Magnetic Resonance in Medicine.

Sparse Parallel MRI Based on Accelerated Operator Splitting Schemes

Recently, the sparsity which is implicit in MR images has been successfully exploited for fast MR imaging with incomplete acquisitions. In this paper, two novel algorithms are proposed to solve the sparse parallel MR imaging problem, which consists of l₁ regularization and fidelity terms. The two algorithms combine forward-backward operator splitting and Barzilai-Borwein schemes. Theoretically, the presented algorithms overcome the nondifferentiable property in l₁ regularization term. Meanwhile, they are able to treat a general matrix operator that may not be diagonalized by fast Fourier transform and to ensure that a well-conditioned optimization system of equations is simply solved. In addition, we build connections between the proposed algorithms and the state-of-the-art existing methods and prove their convergence with a constant stepsize in Appendix. Numerical results and comparisons with the advanced methods demonstrate the efficiency of proposed algorithms.

Maximum Likelihood Reconstruction for Magnetic Resonance Fingerprinting

This paper introduces a statistical estimation framework for magnetic resonance (MR) fingerprinting, a recently proposed quantitative imaging paradigm. Within this framework, we present a maximum likelihood (ML) formalism to estimate multiple MR tissue parameter maps directly from highly undersampled, noisy k-space data. A novel algorithm, based on variable splitting, the alternating direction method of multipliers, and the variable projection method, is developed to solve the resulting optimization problem. Representative results from both simulations and in vivo experiments demonstrate that the proposed approach yields significantly improved accuracy in parameter estimation, compared to the conventional MR fingerprinting reconstruction. Moreover, the proposed framework provides new theoretical insights into the conventional approach. We show analytically that the conventional approach is an approximation to the ML reconstruction; more precisely, it is exactly equivalent to the first iteration of the proposed algorithm for the ML reconstruction, provided that a gridding reconstruction is used as an initialization.

Compressed sensing for rapid late gadolinium enhanced imaging of the left atrium: A preliminary study

Current late gadolinium enhancement (LGE) imaging of left atrial (LA) scar or fibrosis is relatively slow and requires 5-15min to acquire an undersampled (R=1.7) 3D navigated dataset. The GeneRalized Autocalibrating Partially Parallel Acquisitions (GRAPPA) based parallel imaging method is the current clinical standard for accelerating 3D LGE imaging of the LA and permits an acceleration factor ~R=1.7. Two compressed sensing (CS) methods have been developed to achieve higher acceleration factors: a patch based collaborative filtering technique tested with acceleration factor R~3, and a technique that uses a 3D radial stack-of-stars acquisition pattern (R~1.8) with a 3D total variation constraint. The long reconstruction time of these CS methods makes them unwieldy to use, especially the patch based collaborative filtering technique. In addition, the effect of CS techniques on the quantification of percentage of scar/fibrosis is not known. We sought to develop a practical compressed sensing method for imaging the LA at high acceleration factors. In order to develop a clinically viable method with short reconstruction time, a Split Bregman (SB) reconstruction method with 3D total variation (TV) constraints was developed and implemented. The method was tested on 8 atrial fibrillation patients (4 pre-ablation and 4 post-ablation datasets). Blur metric, normalized mean squared error and peak signal to noise ratio were used as metrics to analyze the quality of the reconstructed images, Quantification of the extent of LGE was performed on the undersampled images and compared with the fully sampled images. Quantification of scar from post-ablation datasets and quantification of fibrosis from pre-ablation datasets showed that acceleration factors up to R~3.5 gave good 3D LGE images of the LA wall, using a 3D TV constraint and constrained SB methods. This corresponds to reducing the scan time by half, compared to currently used GRAPPA methods. Reconstruction of 3D LGE images using the SB method was over 20 times faster than standard gradient descent methods.

Accelerated cardiac cine MRI using locally low rank and finite difference constraints

PURPOSE

To evaluate the potential value of combining multiple constraints for highly accelerated cardiac cine MRI.

METHODS

A locally low rank (LLR) constraint and a temporal finite difference (FD) constraint were combined to reconstruct cardiac cine data from highly undersampled measurements. Retrospectively undersampled 2D Cartesian reconstructions were quantitatively evaluated against fully-sampled data using normalized root mean square error, structural similarity index (SSIM) and high frequency error norm (HFEN). This method was also applied to 2D golden-angle radial real-time imaging to facilitate single breath-hold whole-heart cine (12 short-axis slices, 9-13s single breath hold). Reconstruction was compared against state-of-the-art constrained reconstruction methods: LLR, FD, and k-t SLR.

RESULTS

At 10 to 60 spokes/frame, LLR+FD better preserved fine structures and depicted myocardial motion with reduced spatio-temporal blurring in comparison to existing methods. LLR yielded higher SSIM ranking than FD; FD had higher HFEN ranking than LLR. LLR+FD combined the complimentary advantages of the two, and ranked the highest in all metrics for all retrospective undersampled cases. Single breath-hold multi-slice cardiac cine with prospective undersampling was enabled with in-plane spatio-temporal resolutions of 2×2mm(2) and 40ms.

CONCLUSION

Highly accelerated cardiac cine is enabled by the combination of 2D undersampling and the synergistic use of LLR and FD constraints.

An Extended Bayesian-FBP Algorithm

Recently we developed a Bayesian-FBP (Filtered Backprojection) algorithm for CT image reconstruction. This algorithm is also referred to as the FBP-MAP (FBP Maximum a Posteriori) algorithm. This non-iterative Bayesian algorithm has been applied to real-time MRI, in which the k-space is under-sampled. This current paper investigates the possibility to extend this Bayesian-FBP algorithm by introducing more controlling parameters. Thus, our original Bayesian-FBP algorithm became a special case of the extended Bayesian-FBP algorithm. A cardiac patient data set is used in this paper to evaluate the extended Bayesian-FBP algorithm, and the result from a well-establish iterative algorithm with L₁-norms is used as the gold standard. If the parameters are selected properly, the extended Bayesian-FBP algorithm can outperform the original Bayesian-FBP algorithm.

Efficient Compressed Sensing SENSE pMRI Reconstruction With Joint Sparsity Promotion

The theory and techniques of compressed sensing (CS) have shown their potential as a breakthrough in accelerating k-space data acquisition for parallel magnetic resonance imaging (pMRI). However, the performance of CS reconstruction models in pMRI has not been fully maximized, and CS recovery guarantees for pMRI are largely absent. To improve reconstruction accuracy from parsimonious amounts of k-space data while maintaining flexibility, a new CS SENSitivity Encoding (SENSE) pMRI reconstruction framework promoting joint sparsity (JS) across channels (JS CS SENSE) is proposed in this paper. The recovery guarantee derived for the proposed JS CS SENSE model is demonstrated to be better than that of the conventional CS SENSE model and similar to that of the coil-by-coil CS model. The flexibility of the new model is better than the coil-by-coil CS model and the same as that of CS SENSE. For fast image reconstruction and fair comparisons, all the introduced CS-based constrained optimization problems are solved with split Bregman, variable splitting, and combined-variable splitting techniques. For the JS CS SENSE model in particular, these techniques lead to an efficient algorithm. Numerical experiments show that the reconstruction accuracy is significantly improved by JS CS SENSE compared with the conventional CS SENSE. In addition, an accurate residual-JS regularized sensitivity estimation model is also proposed and extended to calibration-less (CaL) JS CS SENSE. Numerical results show that CaL JS CS SENSE outperforms other state-of-the-art CS-based calibration-less methods in particular for reconstructing non-piecewise constant images.

Optimized Kaiser-Bessel Window Functions for Computed Tomography

Kaiser-Bessel window functions are frequently used to discretize tomographic problems because they have two desirable properties: 1) their short support leads to a low computational cost and 2) their rotational symmetry makes their imaging transform independent of the direction. In this paper, we aim at optimizing the parameters of these basis functions. We present a formalism based on the theory of approximation and point out the importance of the partition-of-unity condition. While we prove that, for compact-support functions, this condition is incompatible with isotropy, we show that minimizing the deviation from the partition of unity condition is highly beneficial. The numerical results confirm that the proposed tuning of the Kaiser-Bessel window functions yields the best performance.

High-resolution (1) H-MRSI of the brain using SPICE: Data acquisition and image reconstruction

PURPOSE

To develop data acquisition and image reconstruction methods to enable high-resolution (1) H MR spectroscopic imaging (MRSI) of the brain, using the recently proposed subspace-based spectroscopic imaging framework called SPICE (SPectroscopic Imaging by exploiting spatiospectral CorrElation).

THEORY AND METHODS

SPICE is characterized by the use of a subspace model for both data acquisition and image reconstruction. For data acquisition, we propose a novel spatiospectral encoding scheme that provides hybrid data sets for determining the subspace structure and for image reconstruction using the subspace model. More specifically, we use a hybrid chemical shift imaging /echo-planar spectroscopic imaging sequence for two-dimensional (2D) MRSI and a dual-density, dual-speed echo-planar spectroscopic imaging sequence for three-dimensional (3D) MRSI. For image reconstruction, we propose a method that can determine the subspace structure and the high-resolution spatiospectral reconstruction from the hybrid data sets generated by the proposed sequences, incorporating field inhomogeneity correction and edge-preserving regularization.

RESULTS

Phantom and in vivo brain experiments were performed to evaluate the performance of the proposed method. For 2D MRSI experiments, SPICE is able to produce high-SNR spatiospectral distributions with an approximately 3 mm nominal in-plane resolution from a 10-min acquisition. For 3D MRSI experiments, SPICE is able to achieve an approximately 3 mm in-plane and 4 mm through-plane resolution in about 25 min.

CONCLUSION

Special data acquisition and reconstruction methods have been developed for high-resolution (1) H-MRSI of the brain using SPICE. Using these methods, SPICE is able to produce spatiospectral distributions of (1) H metabolites in the brain with high spatial resolution, while maintaining a good SNR. These capabilities should prove useful for practical applications of SPICE. Magn Reson Med 76:1059-1070, 2016. © 2015 Wiley Periodicals, Inc.

An Efficient Augmented Lagrangian Method for Statistical X-Ray CT Image Reconstruction

Statistical iterative reconstruction (SIR) for X-ray computed tomography (CT) under the penalized weighted least-squares criteria can yield significant gains over conventional analytical reconstruction from the noisy measurement. However, due to the nonlinear expression of the objective function, most exiting algorithms related to the SIR unavoidably suffer from heavy computation load and slow convergence rate, especially when an edge-preserving or sparsity-based penalty or regularization is incorporated. In this work, to address abovementioned issues of the general algorithms related to the SIR, we propose an adaptive nonmonotone alternating direction algorithm in the framework of augmented Lagrangian multiplier method, which is termed as “ALM-ANAD”. The algorithm effectively combines an alternating direction technique with an adaptive nonmonotone line search to minimize the augmented Lagrangian function at each iteration. To evaluate the present ALM-ANAD algorithm, both qualitative and quantitative studies were conducted by using digital and physical phantoms. Experimental results show that the present ALM-ANAD algorithm can achieve noticeable gains over the classical nonlinear conjugate gradient algorithm and state-of-the-art split Bregman algorithm in terms of noise reduction, contrast-to-noise ratio, convergence rate, and universal quality index metrics.

Correlated spectroscopic imaging of calf muscle in three spatial dimensions using group sparse reconstruction of undersampled single and multichannel data

PURPOSE

To implement a 5D (three spatial + two spectral) correlated spectroscopic imaging sequence for application to human calf.

THEORY AND METHODS

Nonuniform sampling was applied across the two phase encoded dimensions and the indirect spectral dimension of an echo planar-correlated spectroscopic imaging sequence. Reconstruction was applied that minimized the group sparse mixed ℓ2,1-norm of the data. Multichannel data were compressed using a sensitivity map-based approach with a spatially dependent transform matrix and utilized the self-sparsity of the individual coil images to simplify the reconstruction.

RESULTS

Single channel data with 8× and 16× undersampling are shown in the calf of a diabetic patient. A 15-channel scan with 12× undersampling of a healthy volunteer was reconstructed using 5 virtual channels and compared to a fully sampled single slice scan. Group sparse reconstruction faithfully reconstructs the lipid cross peaks much better than ℓ1 minimization.

CONCLUSION

COSY spectra can be acquired over a 3D spatial volume with scan time under 15 min using echo planar readout with highly undersampled data and group sparse reconstruction.

Accelerated Optical Projection Tomography Applied to In Vivo Imaging of Zebrafish

Optical projection tomography (OPT) provides a non-invasive 3-D imaging modality that can be applied to longitudinal studies of live disease models, including in zebrafish. Current limitations include the requirement of a minimum number of angular projections for reconstruction of reasonable OPT images using filtered back projection (FBP), which is typically several hundred, leading to acquisition times of several minutes. It is highly desirable to decrease the number of required angular projections to decrease both the total acquisition time and the light dose to the sample. This is particularly important to enable longitudinal studies, which involve measurements of the same fish at different time points. In this work, we demonstrate that the use of an iterative algorithm to reconstruct sparsely sampled OPT data sets can provide useful 3-D images with 50 or fewer projections, thereby significantly decreasing the minimum acquisition time and light dose while maintaining image quality. A transgenic zebrafish embryo with fluorescent labelling of the vasculature was imaged to acquire densely sampled (800 projections) and under-sampled data sets of transmitted and fluorescence projection images. The under-sampled OPT data sets were reconstructed using an iterative total variation-based image reconstruction algorithm and compared against FBP reconstructions of the densely sampled data sets. To illustrate the potential for quantitative analysis following rapid OPT data acquisition, a Hessian-based method was applied to automatically segment the reconstructed images to select the vasculature network. Results showed that 3-D images of the zebrafish embryo and its vasculature of sufficient visual quality for quantitative analysis can be reconstructed using the iterative algorithm from only 32 projections—achieving up to 28 times improvement in imaging speed and leading to total acquisition times of a few seconds.

P-LORAKS: Low-rank modeling of local k-space neighborhoods with parallel imaging data

PURPOSE

To propose and evaluate P-LORAKS a new calibrationless parallel imaging reconstruction framework.

THEORY AND METHODS

LORAKS is a flexible and powerful framework that was recently proposed for constrained MRI reconstruction. LORAKS was based on the observation that certain matrices constructed from fully sampled k-space data should have low rank whenever the image has limited support or smooth phase, and made it possible to accurately reconstruct images from undersampled or noisy data using low-rank regularization. This paper introduces P-LORAKS, which extends LORAKS to the context of parallel imaging. This is achieved by combining the LORAKS matrices from different channels to yield a larger but more parsimonious low-rank matrix model of parallel imaging data. This new model can be used to regularize the reconstruction of undersampled parallel imaging data, and implicitly imposes phase, support, and parallel imaging constraints without needing to calibrate phase, support, or sensitivity profiles.

RESULTS

The capabilities of P-LORAKS are evaluated with retrospectively undersampled data and compared against existing parallel MRI reconstruction methods. Results show that P-LORAKS can improve parallel imaging reconstruction quality, and can enable the use of new k-space trajectories that are not compatible with existing reconstruction methods.

CONCLUSION

The P-LORAKS framewok provides a new and effective way to regularize parallel imaging reconstruction.

Accelerated whole-brain multi-parameter mapping using blind compressed sensing

PURPOSE

To introduce a blind compressed sensing (BCS) framework to accelerate multi-parameter MR mapping, and demonstrate its feasibility in high-resolution, whole-brain T1ρ and T2 mapping.

METHODS

BCS models the evolution of magnetization at every pixel as a sparse linear combination of bases in a dictionary. Unlike compressed sensing, the dictionary and the sparse coefficients are jointly estimated from undersampled data. Large number of non-orthogonal bases in BCS accounts for more complex signals than low rank representations. The low degree of freedom of BCS, attributed to sparse coefficients, translates to fewer artifacts at high acceleration factors (R).

RESULTS

From 2D retrospective undersampling experiments, the mean square errors in T1ρ and T2 maps were observed to be within 0.1% up to R = 10. BCS was observed to be more robust to patient-specific motion as compared to other compressed sensing schemes and resulted in minimal degradation of parameter maps in the presence of motion. Our results suggested that BCS can provide an acceleration factor of 8 in prospective 3D imaging with reasonable reconstructions.

CONCLUSION

BCS considerably reduces scan time for multiparameter mapping of the whole brain with minimal artifacts, and is more robust to motion-induced signal changes compared to current compressed sensing and principal component analysis-based techniques.

Accelerating 4D flow MRI by exploiting vector field divergence regularization

PURPOSE

To improve velocity vector field reconstruction from undersampled four-dimensional (4D) flow MRI by penalizing divergence of the measured flow field.

THEORY AND METHODS

Iterative image reconstruction in which magnitude and phase are regularized separately in alternating iterations was implemented. The approach allows incorporating prior knowledge of the flow field being imaged. In the present work, velocity data were regularized to reduce divergence, using either divergence-free wavelets (DFW) or a finite difference (FD) method using the ℓ1-norm of divergence and curl. The reconstruction methods were tested on a numerical phantom and in vivo data. Results of the DFW and FD approaches were compared with data obtained with standard compressed sensing (CS) reconstruction.

RESULTS

Relative to standard CS, directional errors of vector fields and divergence were reduced by 55-60% and 38-48% for three- and six-fold undersampled data with the DFW and FD methods. Velocity vector displays of the numerical phantom and in vivo data were found to be improved upon DFW or FD reconstruction.

CONCLUSION

Regularization of vector field divergence in image reconstruction from undersampled 4D flow data is a valuable approach to improve reconstruction accuracy of velocity vector fields.

Fast parallel MR image reconstruction via B1-based, adaptive restart, iterative soft thresholding algorithms (BARISTA)

Sparsity-promoting regularization is useful for combining compressed sensing assumptions with parallel MRI for reducing scan time while preserving image quality. Variable splitting algorithms are the current state-of-the-art algorithms for SENSE-type MR image reconstruction with sparsity-promoting regularization. These methods are very general and have been observed to work with almost any regularizer; however, the tuning of associated convergence parameters is a commonly-cited hindrance in their adoption. Conversely, majorize-minimize algorithms based on a single Lipschitz constant have been observed to be slow in shift-variant applications such as SENSE-type MR image reconstruction since the associated Lipschitz constants are loose bounds for the shift-variant behavior. This paper bridges the gap between the Lipschitz constant and the shift-variant aspects of SENSE-type MR imaging by introducing majorizing matrices in the range of the regularizer matrix. The proposed majorize-minimize methods (called BARISTA) converge faster than state-of-the-art variable splitting algorithms when combined with momentum acceleration and adaptive momentum restarting. Furthermore, the tuning parameters associated with the proposed methods are unitless convergence tolerances that are easier to choose than the constraint penalty parameters required by variable splitting algorithms.

A variable splitting based algorithm for fast multi-coil blind compressed sensing MRI reconstruction

Recent work on blind compressed sensing (BCS) has shown that exploiting sparsity in dictionaries that are learnt directly from the data at hand can outperform compressed sensing (CS) that uses fixed dictionaries. A challenge with BCS however is the large computational complexity during its optimization, which limits its practical use in several MRI applications. In this paper, we propose a novel optimization algorithm that utilize variable splitting strategies to significantly improve the convergence speed of the BCS optimization. The splitting allows us to efficiently decouple the sparse coefficient, and dictionary update steps from the data fidelity term, resulting in subproblems that take closed form analytical solutions, which otherwise require slower iterative conjugate gradient algorithms. Through experiments on multi coil parametric MRI data, we demonstrate the superior performance of BCS over conventional CS schemes, while achieving convergence speed up factors of over 10 fold over the previously proposed implementation of the BCS algorithm.

A Weighted Two-Level Bregman Method with Dictionary Updating for Nonconvex MR Image Reconstruction

Nonconvex optimization has shown that it needs substantially fewer measurements than l₁ minimization for exact recovery under fixed transform/overcomplete dictionary. In this work, two efficient numerical algorithms which are unified by the method named weighted two-level Bregman method with dictionary updating (WTBMDU) are proposed for solving l_p optimization under the dictionary learning model and subjecting the fidelity to the partial measurements. By incorporating the iteratively reweighted norm into the two-level Bregman iteration method with dictionary updating scheme (TBMDU), the modified alternating direction method (ADM) solves the model of pursuing the approximated l_p-norm penalty efficiently. Specifically, the algorithms converge after a relatively small number of iterations, under the formulation of iteratively reweighted l₁ and l₂ minimization. Experimental results on MR image simulations and real MR data, under a variety of sampling trajectories and acceleration factors, consistently demonstrate that the proposed method can efficiently reconstruct MR images from highly undersampled k-space data and presents advantages over the current state-of-the-art reconstruction approaches, in terms of higher PSNR and lower HFEN values.

Fast iterative algorithm for the reconstruction of multishot non-cartesian diffusion data

PURPOSE

To accelerate the motion-compensated iterative reconstruction of multishot non-Cartesian diffusion data.

METHOD

The motion-compensated recovery of multishot non-Cartesian diffusion data is often performed using a modified iterative sensitivity-encoded algorithm. Specifically, the encoding matrix is replaced with a combination of nonuniform Fourier transforms and composite sensitivity functions, which account for the motion-induced phase errors. The main challenge with this scheme is the significantly increased computational complexity, which is directly related to the total number of composite sensitivity functions (number of shots × number of coils). The dimensionality of the composite sensitivity functions and hence the number of Fourier transforms within each iteration is reduced using a principal component analysis-based scheme. Using a Toeplitz-based conjugate gradient approach in combination with an augmented Lagrangian optimization scheme, a fast algorithm is proposed for the sparse recovery of diffusion data.

RESULTS

The proposed simplifications considerably reduce the computation time, especially in the recovery of diffusion data from under-sampled reconstructions using sparse optimization. By choosing appropriate number of basis functions to approximate the composite sensitivities, faster reconstruction (close to 9 times) with effective motion compensation is achieved.

CONCLUSION

The proposed enhancements can offer fast motion-compensated reconstruction of multishot diffusion data for arbitrary k-space trajectories.

An augmented Lagrangian based compressed sensing reconstruction for non-Cartesian magnetic resonance imaging without gridding and regridding at every iteration

Background

Non-Cartesian trajectories are used in a variety of fast imaging applications, due to the incoherent image domain artifacts they create when undersampled. While the gridding technique is commonly utilized for reconstruction, the incoherent artifacts may be further removed using compressed sensing (CS). CS reconstruction is typically done using conjugate-gradient (CG) type algorithms, which require gridding and regridding to be performed at every iteration. This leads to a large computational overhead that hinders its applicability.

Methods

We sought to develop an alternative method for CS reconstruction that only requires two gridding and one regridding operation in total, irrespective of the number of iterations. This proposed technique is evaluated on phantom images and whole-heart coronary MRI acquired using 3D radial trajectories, and compared to conventional CS reconstruction using CG algorithms in terms of quantitative vessel sharpness, vessel length, computation time, and convergence rate.

Results

Both CS reconstructions result in similar vessel length (P = 0.30) and vessel sharpness (P = 0.62). The per-iteration complexity of the proposed technique is approximately 3-fold lower than the conventional CS reconstruction (17.55 vs. 52.48 seconds in C++). Furthermore, for in-vivo datasets, the convergence rate of the proposed technique is faster (60±13 vs. 455±320 iterations) leading to a ∼23-fold reduction in reconstruction time.

Conclusions

The proposed reconstruction provides images of similar quality to the conventional CS technique in terms of removing artifacts, but at a much lower computational complexity.

Accelerated MR parameter mapping with low-rank and sparsity constraints

PURPOSE

To enable accurate magnetic resonance (MR) parameter mapping with accelerated data acquisition, utilizing recent advances in constrained imaging with sparse sampling.

THEORY AND METHODS

A new constrained reconstruction method based on low-rank and sparsity constraints is proposed to accelerate MR parameter mapping. More specifically, the proposed method simultaneously imposes low-rank and joint sparse structures on contrast-weighted image sequences within a unified mathematical formulation. With a pre-estimated subspace, this formulation results in a convex optimization problem, which is solved using an efficient numerical algorithm based on the alternating direction method of multipliers.

RESULTS

To evaluate the performance of the proposed method, two application examples were considered: (i) T2 mapping of the human brain and (ii) T1 mapping of the rat brain. For each application, the proposed method was evaluated at both moderate and high acceleration levels. Additionally, the proposed method was compared with two state-of-the-art methods that only use a single low-rank or joint sparsity constraint. The results demonstrate that the proposed method can achieve accurate parameter estimation with both moderately and highly undersampled data. Although all methods performed fairly well with moderately undersampled data, the proposed method achieved much better performance (e.g., more accurate parameter values) than the other two methods with highly undersampled data.

CONCLUSIONS

Simultaneously imposing low-rank and sparsity constraints can effectively improve the accuracy of fast MR parameter mapping with sparse sampling.

Dynamic MR image reconstruction-separation from undersampled (k,t)-space via low-rank plus sparse prior

Dynamic magnetic resonance imaging (MRI) is used in multiple clinical applications, but can still benefit from higher spatial or temporal resolution. A dynamic MR image reconstruction method from partial (k, t)-space measurements is introduced that recovers and inherently separates the information in the dynamic scene. The reconstruction model is based on a low-rank plus sparse decomposition prior, which is related to robust principal component analysis. An algorithm is proposed to solve the convex optimization problem based on an alternating direction method of multipliers. The method is validated with numerical phantom simulations and cardiac MRI data against state of the art dynamic MRI reconstruction methods. Results suggest that using the proposed approach as a means of regularizing the inverse problem remains competitive with state of the art reconstruction techniques. Additionally, the decomposition induced by the reconstruction is shown to help in the context of motion estimation in dynamic contrast enhanced MRI.

A comparison of five standard methods for evaluating image intensity uniformity in partially parallel imaging MRI

PURPOSE

To investigate the utility of five different standard measurement methods for determining image uniformity for partially parallel imaging (PPI) acquisitions in terms of consistency across a variety of pulse sequences and reconstruction strategies.

METHODS

Images were produced with a phantom using a 12-channel head matrix coil in a 3T MRI system (TIM TRIO, Siemens Medical Solutions, Erlangen, Germany). Images produced using echo-planar, fast spin echo, gradient echo, and balanced steady state free precession pulse sequences were evaluated. Two different PPI reconstruction methods were investigated, generalized autocalibrating partially parallel acquisition algorithm (GRAPPA) and modified sensitivity-encoding (mSENSE) with acceleration factors (R) of 2, 3, and 4. Additionally images were acquired with conventional, two-dimensional Fourier imaging methods (R=1). Five measurement methods of uniformity, recommended by the American College of Radiology (ACR) and the National Electrical Manufacturers Association (NEMA) were considered. The methods investigated were (1) an ACR method and a (2) NEMA method for calculating the peak deviation nonuniformity, (3) a modification of a NEMA method used to produce a gray scale uniformity map, (4) determining the normalized absolute average deviation uniformity, and (5) a NEMA method that focused on 17 areas of the image to measure uniformity. Changes in uniformity as a function of reconstruction method at the same R-value were also investigated. Two-way analysis of variance (ANOVA) was used to determine whether R-value or reconstruction method had a greater influence on signal intensity uniformity measurements for partially parallel MRI.

RESULTS

Two of the methods studied had consistently negative slopes when signal intensity uniformity was plotted against R-value. The results obtained comparing mSENSE against GRAPPA found no consistent difference between GRAPPA and mSENSE with regard to signal intensity uniformity. The results of the two-way ANOVA analysis suggest that R-value and pulse sequence type produce the largest influences on uniformity and PPI reconstruction method had relatively little effect.

CONCLUSIONS

Two of the methods of measuring signal intensity uniformity, described by the (NEMA) MRI standards, consistently indicated a decrease in uniformity with an increase in R-value. Other methods investigated did not demonstrate consistent results for evaluating signal uniformity in MR images obtained by partially parallel methods. However, because the spatial distribution of noise affects uniformity, it is recommended that additional uniformity quality metrics be investigated for partially parallel MR images.

Augmented Lagrangian with variable splitting for faster non-Cartesian L1-SPIRiT MR image reconstruction

SPIRiT (iterative self-consistent parallel imaging reconstruction), and its sparsity-regularized variant L1-SPIRiT, are compatible with both Cartesian and non-Cartesian magnetic resonance imaging sampling trajectories. However, the non-Cartesian framework is more expensive computationally, involving a nonuniform Fourier transform with a nontrivial Gram matrix. We propose a novel implementation of the regularized reconstruction problem using variable splitting, alternating minimization of the augmented Lagrangian, and careful preconditioning. Our new method based on the alternating direction method of multipliers converges much faster than existing methods because of the preconditioners' heightened effectiveness. We demonstrate such rapid convergence substantially improves image quality for a fixed computation time. Our framework is a step forward towards rapid non-Cartesian L1-SPIRiT reconstructions.

Adaptive dictionary learning in sparse gradient domain for image recovery

Image recovery from undersampled data has always been challenging due to its implicit ill-posed nature but becomes fascinating with the emerging compressed sensing (CS) theory. This paper proposes a novel gradient based dictionary learning method for image recovery, which effectively integrates the popular total variation (TV) and dictionary learning technique into the same framework. Specifically, we first train dictionaries from the horizontal and vertical gradients of the image and then reconstruct the desired image using the sparse representations of both derivatives. The proposed method enables local features in the gradient images to be captured effectively, and can be viewed as an adaptive extension of the TV regularization. The results of various experiments on MR images consistently demonstrate that the proposed algorithm efficiently recovers images and presents advantages over the current leading CS reconstruction approaches.