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.
Previous work has also tried to exploit regularities in the reconstruction error in different ways. In the popular dynamic MRI reconstruction method k-t FOCUSS @cite_18 @cite_5 , the original signal is decomposed into a predicted signal and a residual signal. The predicted signal is estimated by temporal averaging, while the highly sparse residual signal has a @math -norm regularization. An iterative feature refinement strategy for CS-MRI was proposed in @cite_26 to exploit the structural error produced in each iteration. In @cite_24 , the k-space measurements are divided into high and low frequency regions and reconstructed separately. In @cite_30 the MR image is decomposed into a smooth layer and a detail layer which are estimated using total variation and wavelet regularization separately. In @cite_2 , the low frequency information is estimated using parallel imaging techniques. These methods each employ a fixed transform basis.
@cite_30 @cite_18 @cite_26 @cite_24 @cite_2 @cite_5
1969799136 2791621240 2070167142 2128391413
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. 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. Compressed sensing (CS) has been applied to magnetic resonance imaging for the acceleration of data collection. However, existing CS techniques usually produce images with residual artifacts, particularly at high reduction factors. In this paper, we propose a novel, two-stage reconstruction scheme, which takes advantage of the properties of k-space data and under-sampling patterns that are useful in CS. In this algorithm, the under-sampled k-space data is segmented into low-frequency and high-frequency domains. Then, in stage one, using dense measurements, the low-frequency region of k-space data is faithfully reconstructed. The fully reconstituted low-frequency k-space data from the first stage is then combined with the high-frequency k-space data to complete the second stage reconstruction of the whole of k-space. With this two-stage approach, each reconstruction inherently incorporates a lower data under-sampling rate and more homogeneous signal magnitudes than conventional approaches. Because the restricted isometric property is easier to satisfy, the reconstruction consequently produces lower residual errors at each step. Compared with a conventional CS reconstruction, for the cases of cardiac cine, brain and angiogram imaging, the proposed method achieves a more accurate reconstruction with an improvement of 2-4 dB in peak signal-to-noise ratio respectively, using reduction factors of up to 6. A new method for correction of MRI motion artifacts induced by corrupted k-space data, acquired by multiple receiver coils such as phased arrays, is presented. In our approach, a projections onto convex sets (POCS)-based method for reconstruction of sensitivity encoded MRI data (POCSENSE) is employed to identify corrupted k-space samples. After the erroneous data are discarded from the dataset, the artifact-free images are restored from the remaining data using coil sensitivity profiles. The error detection and data restoration are based on informational redundancy of phased-array data and may be applied to full and reduced datasets. An important advantage of the new POCS-based method is that, in addition to multicoil data redundancy, it can use a priori known properties about the imaged object for improved MR image artifact correction. The use of such information was shown to improve significantly k-space error detection and image artifact correction. The method was validated on data corrupted by simulated and real motion such as head motion and pulsatile flow. Magn Reson Med 63:1104–1110, 2010. V C 2010