Highly undersampled magnetic resonance image reconstruction using two-level Bregman method with dictionary updating

K-space and image domain collaborative energy-based model for parallel MRI reconstruction

Decreasing magnetic resonance (MR) image acquisition times can potentially make MR examinations more accessible. Prior arts including the deep learning models have been devoted to solving the problem of long MRI imaging time. Recently, deep generative models have exhibited great potentials in algorithm robustness and usage flexibility. Nevertheless, none of existing schemes can be learned from or employed to the k-space measurement directly. Furthermore, how do the deep generative models work well in hybrid domain is also worth being investigated. In this work, by taking advantage of the deep energy-based models, we propose a k-space and image domain collaborative generative model to comprehensively estimate the MR data from under-sampled measurement. Equipped with parallel and sequential orders, experimental comparisons with the state-of-the-arts demonstrated that they involve less error in reconstruction accuracy and are more stable under different acceleration factors.

A novel data-driven method for the analysis and reconstruction of cardiac cine MRI

Cardiac cine magnetic resonance imaging (MRI) can be considered the optimal criterion for measuring cardiac function. This imaging technique can provide us with detailed information about cardiac structure, tissue composition and even blood flow, which makes it highly used in medical science. But due to the image time acquisition and several other factors the MRI sequences can easily get corrupted, causing radiologists to misdiagnose 40 million people worldwide each and every single year. Hence, the urge to decrease these numbers, researchers from different fields have been introducing novel tools and methods in the medical field. Aiming to the same target, we consider in this work the application of the higher order dynamic mode decomposition (HODMD) technique. The HODMD algorithm is a linear method, which was originally introduced in the fluid dynamics domain, for the analysis of complex systems. Nevertheless, the proposed method has extended its applicability to numerous domains, including medicine. In this work, HODMD in used to analyze sets of MR images of a heart, with the ultimate goal of identifying the main patterns and frequencies driving the heart dynamics. Furthermore, a novel interpolation algorithm based on singular value decomposition combined with HODMD is introduced, providing a three-dimensional reconstruction of the heart. This algorithm is applied (i) to reconstruct corrupted or missing images, and (ii) to build a reduced order model of the heart dynamics.

TL-HARDI: Transform learning based accelerated reconstruction of HARDI data

Diffusion magnetic resonance imaging (dMRI) is being extensively used to study the neural architecture of the brain. High angular resolution diffusion imaging (HARDI), a variant of diffusion MRI, measures the diffusion of water molecules along the angular gradient directions in the q-space. It provides better estimates of fiber orientations compared to the traditionally used diffusion tensor imaging (DTI). However, HARDI requires acquisition of relatively large number of samples leading to longer scanning times. Several approaches based on compressive sensing (CS) have been proposed to accelerate HARDI acquisition, leveraging on the sparse representation of the HARDI signal in a pre-specified sparsifying basis. In this paper, we propose to carry out reconstruction of compressively sensed HARDI data using an adaptively learned transform. The transform is learned (i) from the compressive measurements on-the-fly, thereby, eliminating the overhead of choosing fixed sparsifying transforms, and (ii) on overlapping patches of the data, thereby, capturing local image structure effectively. Experiments are conducted on multiple real HARDI data for varying sampling ratios and sampling schemes. The performance of the proposed "TL-HARDI" method is compared with the state-of-the-art methods on various known image quality metrics as well as on dMRI feature maps derived from the reconstructed images. The proposed method is observed to yield better reconstruction than the existing state-of-the-art methods in both quantitative and qualitative comparisons.

Accelerating MR Parameter Mapping Using Nonlinear Compressive Manifold Learning and Regularized Pre-Imaging

In this study, we presented a novel method to reconstruct the MR parametric maps from highly undersampled k-space data. Specifically, we utilized a nonlinear model to sparsely represent the unknown MR parameter-weighted images in high-dimensional feature space. Each image at a specific time point is assumed to belong to a low-dimensional manifold which is learned from training images created based on the parametric model. The final reconstruction is carried out by venturing the sparse representation of the images in the feature space back to the input space, using the pre-imaging technique. Particularly, among an infinite number of solutions that satisfy the data consistency, the one that is closest to the manifold is selected as the desired solution. The underlying optimization problem is solved using kernel trick, sparse coding, and split Bregman iteration algorithm. In addition, both spatial and temporal regularizations were utilized to further improve the reconstruction quality. The proposed method was validated on both phantom and in vivo human brain T2 mapping data. Results showed the proposed method was superior to the conventional linear model-based reconstruction methods, in terms of artifact removal and quantitative estimate accuracy. The proposed method could be potentially beneficial for quantitative MR applications.

Homotopic Gradients of Generative Density Priors for MR Image Reconstruction

Deep learning, particularly the generative model, has demonstrated tremendous potential to significantly speed up image reconstruction with reduced measurements recently. Rather than the existing generative models that often optimize the density priors, in this work, by taking advantage of the denoising score matching, homotopic gradients of generative density priors (HGGDP) are exploited for magnetic resonance imaging (MRI) reconstruction. More precisely, to tackle the low-dimensional manifold and low data density region issues in generative density prior, we estimate the target gradients in higher-dimensional space. We train a more powerful noise conditional score network by forming high-dimensional tensor as the network input at the training phase. More artificial noise is also injected in the embedding space. At the reconstruction stage, a homotopy method is employed to pursue the density prior, such as to boost the reconstruction performance. Experiment results implied the remarkable performance of HGGDP in terms of high reconstruction accuracy. Only 10% of the k-space data can still generate image of high quality as effectively as standard MRI reconstructions with the fully sampled data.

Adaptive sparsity level and dictionary size estimation for image reconstruction in accelerated 2D radial cine MRI

PURPOSE

In the past, dictionary learning (DL) and sparse coding (SC) have been proposed for the regularization of image reconstruction problems. The regularization is given by a sparse approximation of all image patches using a learned dictionary, that is, an overcomplete set of basis functions learned from data. Despite its competitiveness, DL and SC require the tuning of two essential hyperparameters: the sparsity level S - the number of basis functions of the dictionary, called atoms, which are used to approximate each patch, and K - the overall number of such atoms in the dictionary. These two hyperparameters usually have to be chosen a priori and are determined by repetitive and computationally expensive experiments. Furthermore, the final reported values vary depending on the specific situation. As a result, the clinical application of the method is limited, as standardized reconstruction protocols have to be used.

METHODS

In this work, we use adaptive DL and propose a novel adaptive sparse coding algorithm for two-dimensional (2D) radial cine MR image reconstruction. Using adaptive DL and adaptive SC, the optimal dictionary size K as well as the optimal sparsity level S are chosen dependent on the considered data.

RESULTS

Our three main results are the following: First, adaptive DL and adaptive SC deliver results which are comparable or better than the most widely used nonadaptive version of DL and SC. Second, the time needed for the regularization is accelerated due to the fact that the sparsity level S is never overestimated. Finally, the a priori choice of S and K is no longer needed but is optimally chosen dependent on the data under consideration.

CONCLUSIONS

Adaptive DL and adaptive SC can highly facilitate the application of DL- and SC-based regularization methods. While in this work we focused on 2D radial cine MR image reconstruction, we expect the method to be applicable to different imaging modalities as well.

High-dimensional embedding network derived prior for compressive sensing MRI reconstruction

Although recent deep learning methodology has shown promising performance in fast imaging, the network needs to be retrained for specific sampling patterns and ratios. Therefore, how to explore the network as a general prior and leverage it into the observation constraint flexibly is urgent. In this work, we present a multi-channel enhanced Deep Mean-Shift Prior (MEDMSP) to address the highly under-sampled magnetic resonance imaging reconstruction problem. By extending the naive DMSP via integration of multi-model aggregation and multi-channel network learning, a high-dimensional embedding network derived prior is formed. Then, we apply the learned prior to single-channel image reconstruction via variable augmentation technique. The resulting model is tackled by proximal gradient descent and alternative iteration. Experimental results under various sampling trajectories and acceleration factors consistently demonstrated the superiority of the proposed prior.

CS-MRI reconstruction based on analysis dictionary learning and manifold structure regularization

Compressed sensing (CS) significantly accelerates magnetic resonance imaging (MRI) by allowing the exact reconstruction of image from highly undersampling k-space data. In this process, the high sparsity obtained by the learned dictionary and exploitation of correlation among patches are essential to the reconstructed image quality. In this paper, by a use of these two aspects, we propose a novel CS-MRI model based on analysis dictionary learning and manifold structure regularization (ADMS). Furthermore, a proper tight frame constraint is used to obtain an effective overcomplete analysis dictionary with a high sparsifying capacity. The constructed manifold structure regularization nonuniformly enforces the correlation of each group formed by similar patches, which is more consistent with the diverse nonlocal similarity in realistic images. The proposed model is efficiently solved by the alternating direction method of multipliers (ADMM), in which the fast algorithm for each sub-problem is separately developed. The experimental results demonstrate that main components in the proposed method contribute to the final reconstruction performance and the effectiveness of the proposed model.

Orthogonal tensor dictionary learning for accelerated dynamic MRI

A direct application of the compressed sensing (CS) theory to dynamic magnetic resonance imaging (MRI) reconstruction needs vectorization or matricization of the dynamic MRI data, which is composed of a stack of 2D images and can be naturally regarded as a tensor. This 1D/2D model may destroy the inherent spatial structure property of the data. An alternative way to exploit the multidimensional structure in dynamic MRI is to employ tensor decomposition for dictionary learning, that is, learning multiple dictionaries along each dimension (mode) and sparsely representing the multidimensional data with respect to the Kronecker product of these dictionaries. In this work, we introduce a novel tensor dictionary learning method under an orthonormal constraint on the elementary matrix of the tensor dictionary for dynamic MRI reconstruction. The proposed algorithm alternates sparse coding, tensor dictionary learning, and updating reconstruction, and each corresponding subproblem is efficiently solved by a closed-form solution. Numerical experiments on phantom and synthetic data show significant improvements in reconstruction accuracy and computational efficiency obtained by the proposed scheme over the existing method that uses the 1D/2D model with overcomplete dictionary learning. Graphical abstract Fig. 1 Comparison between (a) the traditional method and (b) the proposed method based on dictionary learning for dynamic MRI reconstruction.

Self-prior image-guided MRI reconstruction with dictionary learning

PURPOSE

A novel method, named self-prior image-guided MRI reconstruction with dictionary learning (SPIDLE), is developed to improve the performance of MR imaging with high acceleration rates. "self-prior" means that the prior image is obtained from the target image itself and any extra MRI scans are not needed.

METHODS

The proposed method integrates self-prior image constraint with compressed sensing (CS) and the dictionary learning (DL) technique. The self-prior image is a preliminary result reconstructed using the undersampled k-space measurements of the target image. Therefore, the self-prior image has similar structural features with the target image, and they match each other accurately. CS approach is applied to the residual error of the target image with the self-prior image, because the error image is much sparser than the target image. The split Bregman method is used to solve the proposed approach to promote fast convergence. For multicoil measurements, each coil image is reconstructed individually and the final result is produced as the square root of sum of squares (SOS) of all channel images.

RESULTS

The performance of the proposed SPIDLE method was inspected using different undersampling schemes and acceleration rates with various types of in vivo MR datasets. Experiments showed that the SPIDLE method is superior to other typical state-of-the-art methods. Specifically, the SPIDLE method produces fewer reconstruction errors, and it is robust to initialization.

CONCLUSIONS

The proposed SPIDLE method substantially widens the applications of prior image-guided MRI reconstruction, especially for applications that are not suitable to use existing MR scans as prior images. The SPIDLE method obviously improves the reconstruction quality for highly undersampled MRI. It is also promising for reconstruction of dynamic MRI and other imaging modalities, such as CT and CT-MRI multimodality imaging.

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.

Bayesian K-SVD Using Fast Variational Inference

Recent work in signal processing in general and image processing in particular deals with sparse representation related problems. Two such problems are of paramount importance: an overriding need for designing a well-suited overcomplete dictionary containing a redundant set of atoms-i.e., basis signals-and how to find a sparse representation of a given signal with respect to the chosen dictionary. Dictionary learning techniques, among which we find the popular K-singular value decomposition algorithm, tackle these problems by adapting a dictionary to a set of training data. A common drawback of such techniques is the need for parameter-tuning. In order to overcome this limitation, we propose a fully-automated Bayesian method that considers the uncertainty of the estimates and produces a sparse representation of the data without prior information on the number of non-zeros in each representation vector. We follow a Bayesian approach that uses a three-tiered hierarchical prior to enforce sparsity on the representations and develop an efficient variational inference framework that reduces computational complexity. Furthermore, we describe a greedy approach that speeds up the whole process. Finally, we present experimental results that show superior performance on two different applications with real images: denoising and inpainting.

Partial Discreteness: A Novel Prior for Magnetic Resonance Image Reconstruction

An important factor influencing the quality of magnetic resonance (MR) images is the reconstruction method that is employed, and specifically, the type of prior knowledge that is exploited during reconstruction. In this work, we introduce a new type of prior knowledge, partial discreteness (PD), where a small number of regions in the image are assumed to be homogeneous and can be well represented by a constant magnitude. In particular, we mathematically formalize the partial discreteness property based on a Gaussian Mixture Model (GMM) and derive a partial discreteness image representation that characterizes the salient features of partially discrete images: a constant intensity in homogeneous areas and texture in heterogeneous areas. The partial discreteness representation is then used to construct a novel prior dedicated to the reconstruction of partially discrete MR images. The strength of the proposed prior is demonstrated on various simulated and real k-space data-based experiments with partially discrete images. Results demonstrate that the PD algorithm performs competitively with state-of-the-art reconstruction methods, being flexible and easy to implement.

Sparse and dense hybrid representation via subspace modeling for dynamic MRI

Recent theoretical results on compressed sensing and low-rank matrix recovery have inspired significant interest in joint sparse and low rank modeling of dynamic magnetic resonance imaging (dMRI). Existing approaches usually describe these two respective prior information with different formulations. In this paper, we present a novel sparse and dense hybrid representation (SDR) model which describes the sparse plus low rank properties by a unified way. More specifically, under the learned dictionary consisting of temporal basis functions, SDR models the spatial coefficients in two subspaces with Laplacian and Gaussian prior distributions, respectively. This results in the objective function consisting of L1-L2 hybrid penalty term for the coefficients and Frobenius norm term for the dictionary. An efficient algorithm utilizing alternating direction technique is developed to solve the proposed model. Extensive experiments under a variety of test images and a comprehensive evaluation against existing state-of-the-art methods consistently demonstrate the potential of the proposed model and algorithm, in terms of reconstruction and separation comparisons.

Two-Layer Tight Frame Sparsifying Model for Compressed Sensing Magnetic Resonance Imaging

Compressed sensing magnetic resonance imaging (CSMRI) employs image sparsity to reconstruct MR images from incoherently undersampled K-space data. Existing CSMRI approaches have exploited analysis transform, synthesis dictionary, and their variants to trigger image sparsity. Nevertheless, the accuracy, efficiency, or acceleration rate of existing CSMRI methods can still be improved due to either lack of adaptability, high complexity of the training, or insufficient sparsity promotion. To properly balance the three factors, this paper proposes a two-layer tight frame sparsifying (TRIMS) model for CSMRI by sparsifying the image with a product of a fixed tight frame and an adaptively learned tight frame. The two-layer sparsifying and adaptive learning nature of TRIMS has enabled accurate MR reconstruction from highly undersampled data with efficiency. To solve the reconstruction problem, a three-level Bregman numerical algorithm is developed. The proposed approach has been compared to three state-of-the-art methods over scanned physical phantom and in vivo MR datasets and encouraging performances have been achieved.

Projected Iterative Soft-Thresholding Algorithm for Tight Frames in Compressed Sensing Magnetic Resonance Imaging

Compressed sensing (CS) has exhibited great potential for accelerating magnetic resonance imaging (MRI). In CS-MRI, we want to reconstruct a high-quality image from very few samples in a short time. In this paper, we propose a fast algorithm, called projected iterative soft-thresholding algorithm (pISTA), and its acceleration pFISTA for CS-MRI image reconstruction. The proposed algorithms exploit sparsity of the magnetic resonance (MR) images under the redundant representation of tight frames. We prove that pISTA and pFISTA converge to a minimizer of a convex function with a balanced tight frame sparsity formulation. The pFISTA introduces only one adjustable parameter, the step size, and we provide an explicit rule to set this parameter. Numerical experiment results demonstrate that pFISTA leads to faster convergence speeds than the state-of-art counterpart does, while achieving comparable reconstruction errors. Moreover, reconstruction errors incurred by pFISTA appear insensitive to the step size.

ACCELERATING MAGNETIC RESONANCE IMAGING VIA DEEP LEARNING

This paper proposes a deep learning approach for accelerating magnetic resonance imaging (MRI) using a large number of existing high quality MR images as the training datasets. An off-line convolutional neural network is designed and trained to identify the mapping relationship between the MR images obtained from zero-filled and fully-sampled k-space data. The network is not only capable of restoring fine structures and details but is also compatible with online constrained reconstruction methods. Experimental results on real MR data have shown encouraging performance of the proposed method for efficient and effective imaging.

A Dictionary Learning Method with Total Generalized Variation for MRI Reconstruction

Reconstructing images from their noisy and incomplete measurements is always a challenge especially for medical MR image with important details and features. This work proposes a novel dictionary learning model that integrates two sparse regularization methods: the total generalized variation (TGV) approach and adaptive dictionary learning (DL). In the proposed method, the TGV selectively regularizes different image regions at different levels to avoid oil painting artifacts largely. At the same time, the dictionary learning adaptively represents the image features sparsely and effectively recovers details of images. The proposed model is solved by variable splitting technique and the alternating direction method of multiplier. Extensive simulation experimental results demonstrate that the proposed method consistently recovers MR images efficiently and outperforms the current state-of-the-art approaches in terms of higher PSNR and lower HFEN values.

Patch based reconstruction of undersampled data (PROUD) for high signal-to-noise ratio and high frame rate contrast enhanced liver imaging

PURPOSE

High spatial-temporal four-dimensional imaging with large volume coverage is necessary to accurately capture and characterize liver lesions. Traditionally, parallel imaging and adapted sampling are used toward this goal, but they typically result in a loss of signal to noise. Furthermore, residual under-sampling artifacts can be temporally varying and complicate the quantitative analysis of contrast enhancement curves needed for pharmacokinetic modeling. We propose to overcome these problems using a novel patch-based regularization approach called Patch-based Reconstruction Of Under-sampled Data (PROUD).

THEORY AND METHODS

PROUD produces high frame rate image reconstructions by exploiting the strong similarities in spatial patches between successive time frames to overcome the severe k-space under-sampling. To validate PROUD, a numerical liver perfusion phantom was developed to characterize contrast-to-noise ratio (CNR) performance compared with a previously proposed method, TRACER. A second numerical phantom was constructed to evaluate the temporal footprint and lag of PROUD and TRACER reconstructions. Finally, PROUD and TRACER were evaluated in a cohort of five liver donors.

RESULTS

In the CNR phantom, PROUD, compared with TRACER, improved peak CNR by 3.66 times while maintaining or improving temporal fidelity. In vivo, PROUD demonstrated an average increase in CNR of 60% compared with TRACER.

CONCLUSION

The results presented in this work demonstrate the feasibility of using a combination of patch based image constraints with temporal regularization to provide high SNR, high temporal frame rate and spatial resolution four dimensional imaging.

Undersampled MR Image Reconstruction with Data-Driven Tight Frame

Undersampled magnetic resonance image reconstruction employing sparsity regularization has fascinated many researchers in recent years under the support of compressed sensing theory. Nevertheless, most existing sparsity-regularized reconstruction methods either lack adaptability to capture the structure information or suffer from high computational load. With the aim of further improving image reconstruction accuracy without introducing too much computation, this paper proposes a data-driven tight frame magnetic image reconstruction (DDTF-MRI) method. By taking advantage of the efficiency and effectiveness of data-driven tight frame, DDTF-MRI trains an adaptive tight frame to sparsify the to-be-reconstructed MR image. Furthermore, a two-level Bregman iteration algorithm has been developed to solve the proposed model. The proposed method has been compared to two state-of-the-art methods on four datasets and encouraging performances have been achieved by DDTF-MRI.

Accelerating patch-based directional wavelets with multicore parallel computing in compressed sensing MRI

Compressed sensing MRI (CS-MRI) is a promising technology to accelerate magnetic resonance imaging. Both improving the image quality and reducing the computation time are important for this technology. Recently, a patch-based directional wavelet (PBDW) has been applied in CS-MRI to improve edge reconstruction. However, this method is time consuming since it involves extensive computations, including geometric direction estimation and numerous iterations of wavelet transform. To accelerate computations of PBDW, we propose a general parallelization of patch-based processing by taking the advantage of multicore processors. Additionally, two pertinent optimizations, excluding smooth patches and pre-arranged insertion sort, that make use of sparsity in MR images are also proposed. Simulation results demonstrate that the acceleration factor with the parallel architecture of PBDW approaches the number of central processing unit cores, and that pertinent optimizations are also effective to make further accelerations. The proposed approaches allow compressed sensing MRI reconstruction to be accomplished within several seconds.

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.

PANDA-T1ρ: Integrating principal component analysis and dictionary learning for fast T1ρ mapping

PURPOSE

Long scanning time greatly hinders the widespread application of spin-lattice relaxation in rotating frame (T1ρ) in clinics. In this study, a novel method is proposed to reconstruct the T1ρ-weighted images from undersampled k-space data and hence accelerate the acquisition of T1ρ imaging.

METHODS

The proposed approach (PANDA-T1ρ) combined the benefit of PCA and dictionary learning when reconstructing image from undersampled data. Specifically, the PCA transform was first used to sparsify the image series along the parameter direction and then the sparsified images were reconstructed by means of dictionary learning and finally solved the images. A variation of PANDA-T1ρ was also developed for the heavy noise case. Numerical simulation and in vivo experiments were carried out with the accelerating factor from 2 to 4 to verify the performance of PANDA-T1ρ.

RESULTS

The reconstructed T1ρ maps using the PANDA-T1ρ method were found to be comparable to the reference at all verified acceleration factors. Moreover, the variation exhibited better performance than the original version when the k-space data were contaminated by heavy noise.

CONCLUSION

PANDA-T1ρ can significantly reduce the scanning time of T1ρ by integrating PCA and dictionary learning and provides better parameter estimation than the state-of-art methods for a fixed acceleration factor.

Accelerating Dynamic Cardiac MR imaging using structured sparse representation

Compressed sensing (CS) has produced promising results on dynamic cardiac MR imaging by exploiting the sparsity in image series. In this paper, we propose a new method to improve the CS reconstruction for dynamic cardiac MRI based on the theory of structured sparse representation. The proposed method user the PCA subdictionaries for adaptive sparse representation and suppresses the sparse coding noise to obtain good reconstructions. An accelerated iterative shrinkage algorithm is used to solve the optimization problem and achieve a fast convergence rate. Experimental results demonstrate that the proposed method improves the reconstruction quality of dynamic cardiac cine MRI over the state-of-the-art CS method.