Compressed sensing for magnetic resonance imaging (CS-MRI) exploits image sparsity properties to reconstruct MRI from very few Fourier k-space measurements. The goal is to minimize any structural errors in the reconstruction that could have a negative impact on its diagnostic quality. To this end, we propose a deep error correction network (DECN) for CS-MRI. The DECN model consists of three parts, which we refer to as modules: a guide, or template, module, an error correction module, and a data fidelity module. Existing CS-MRI algorithms can serve as the template module for guiding the reconstruction. Using this template as a guide, the error correction module learns a convolutional neural network (CNN) to map the k-space data in a way that adjusts for the reconstruction error of the template image. Our experimental results show the proposed DECN CS-MRI reconstruction framework can considerably improve upon existing inversion algorithms by supplementing with an error-correcting CNN.
Much focus of previous work has been on proposing appropriate regularizations that lead to better MRI reconstructions. In the pioneering work of CS-MRI called SparseMRI @cite_20 , this regularization adds an @math penalty on the wavelet coefficients and the total variation of the reconstructed image. Based on SparseMRI, more efficient optimization methods have been proposed to optimize this objective, such as TVCMRI @cite_28 , RecPF @cite_3 and FCSA @cite_1 . Variations on the wavelet penalty exploit geometric information of MRI, such as PBDW PBDWS @cite_22 @cite_0 and GBRWT @cite_13 , for improved results. Dictionary learning methods @cite_14 @cite_17 @cite_9 @cite_4 have also been applied to CS-MRI reconstruction, as have nonlocal priors such as NLR @cite_8 , PANO @cite_15 and BM3D-MRI @cite_25 . These previous works can be considered sparsity-promoting regularized CS-MRI methods that are optimized using iterative algorithms. They also represent images using simple single layer features that are either predefined (e.g., wavelets) or learned from the data (e.g., dictionary learning).
@cite_14 @cite_4 @cite_22 @cite_8 @cite_28 @cite_9 @cite_1 @cite_3 @cite_0 @cite_15 @cite_13 @cite_25 @cite_20 @cite_17
2119047398 2141168890 2791621240 1969799136
We develop a Bayesian nonparametric model for reconstructing magnetic resonance images (MRIs) from highly undersampled (k ) -space data. We perform dictionary learning as part of the image reconstruction process. To this end, we use the beta process as a nonparametric dictionary learning prior for representing an image patch as a sparse combination of dictionary elements. The size of the dictionary and patch-specific sparsity pattern are inferred from the data, in addition to other dictionary learning variables. Dictionary learning is performed directly on the compressed image, and so is tailored to the MRI being considered. In addition, we investigate a total variation penalty term in combination with the dictionary learning model, and show how the denoising property of dictionary learning removes dependence on regularization parameters in the noisy setting. We derive a stochastic optimization algorithm based on Markov chain Monte Carlo for the Bayesian model, and use the alternating direction method of multipliers for efficiently performing total variation minimization. We present empirical results on several MRI, which show that the proposed regularization framework can improve reconstruction accuracy over other methods. Abstract Compressed sensing MRI (CS-MRI) has shown great potential in reducing data acquisition time in MRI. Sparsity or compressibility plays an important role to reduce the image reconstruction error. Conventional CS-MRI typically uses a pre-defined sparsifying transform such as wavelet or finite difference, which sometimes does not lead to a sufficient sparse representation for the image to be reconstructed. In this paper, we design a patch-based nonlocal operator (PANO) to sparsify magnetic resonance images by making use of the similarity of image patches. The definition of PANO results in sparse representation for similar patches and allows us to establish a general formulation to trade the sparsity of these patches with the data consistency. It also provides feasibility to incorporate prior information learnt from undersampled data or another contrast image, which leads to optimized sparse representation of images to be reconstructed. Simulation results on in vivo data demonstrate that the proposed method achieves lower reconstruction error and higher visual quality than conventional CS-MRI methods. Compressed sensing magnetic resonance imaging (CS-MRI) has provided theoretical foundations upon which the time-consuming MRI acquisition process can be accelerated. However, it primarily relies on iterative numerical solvers, which still hinders their adaptation in time-critical applications. In addition, recent advances in deep neural networks have shown their potential in computer vision and image processing, but their adaptation to MRI reconstruction is still in an early stage. In this paper, we propose a novel deep learning-based generative adversarial model, RefineGAN , for fast and accurate CS-MRI reconstruction. The proposed model is a variant of fully-residual convolutional autoencoder and generative adversarial networks (GANs), specifically designed for CS-MRI formulation; it employs deeper generator and discriminator networks with cyclic data consistency loss for faithful interpolation in the given under-sampled @math -space data. In addition, our solution leverages a chained network to further enhance the reconstruction quality. RefineGAN is fast and accurate—the reconstruction process is extremely rapid, as low as tens of milliseconds for reconstruction of a @math image, because it is one-way deployment on a feed-forward network, and the image quality is superior even for extremely low sampling rate (as low as 10 ) due to the data-driven nature of the method. We demonstrate that RefineGAN outperforms the state-of-the-art CS-MRI methods by a large margin in terms of both running time and image quality via evaluation using several open-source MRI databases. Abstract Compressed sensing (CS) MRI exploits the sparsity of an image in a transform domain to reconstruct the image from incoherently under-sampled k-space data. However, it has been shown that CS suffers particularly from loss of low-contrast image features with increasing reduction factors. To retain image details in such degraded experimental conditions, in this work we introduce a novel CS reconstruction method exploiting feature-based complementary dual decomposition with joint estimation of local scale mixture (LSM) model and images. Images are decomposed into dual block sparse components: total variation for piecewise smooth parts and wavelets for residuals. The LSM model parameters of residuals in the wavelet domain are estimated and then employed as a regional constraint in spatially adaptive reconstruction of high frequency subbands to restore image details missing in piecewise smooth parts. Alternating minimization of the dual image components subject to data consistency is performed to extract image details from residuals and add them back to their complementary counterparts while the LSM model parameters and images are jointly estimated in a sequential fashion. Simulations and experiments demonstrate the superior performance of the proposed method in preserving low-contrast image features even at high reduction factors.