Search

Dynamic MR image reconstruction from incomplete k‐space data has generated great research interest due to its capability in reducing scan time. Nevertheless, the reconstruction problem is still challenging due to its ill‐posed nature. Most existing methods either suffer from long iterative reconstruction time or explore limited prior knowledge. This paper proposes a dynamic MR imaging method with both k‐space and spatial prior knowledge integrated via multi‐supervised network training, dubbed as DIMENSION. Specifically, the DIMENSION architecture consists of a frequential prior network for updating the k‐space with its network prediction and a spatial prior network for capturing image structures and details. Furthermore, a multi‐supervised network training technique is developed to constrain the frequency domain information and the spatial domain information. The comparisons with classical k‐t FOCUSS, k‐t SLR, L+S and the state‐of‐the‐art CNN‐based method on in vivo datasets show our method can achieve improved reconstruction results in shorter time. [ABSTRACT FROM AUTHOR]

Deep learning methods have achieved attractive performance in dynamic MR cine imaging. However, most of these methods are driven only by the sparse prior of MR images, while the important low-rank (LR) prior of dynamic MR cine images is not explored, which may limit further improvements in dynamic MR reconstruction. In this paper, a learned singular value thresholding (Learned-SVT) operator is proposed to explore low-rank priors in dynamic MR imaging to obtain improved reconstruction results. In particular, we put forward a model-based unrolling sparse and low-rank network for dynamic MR imaging, dubbed as SLR-Net. SLR-Net is defined over a deep network flow graph, which is unrolled from the iterative procedures in the iterative shrinkage-thresholding algorithm (ISTA) for optimizing a sparse and LR-based dynamic MRI model. Experimental results on a single-coil scenario show that the proposed SLR-Net can further improve the state-of-the-art compressed sensing (CS) methods and sparsity-driven deep learning-based methods with strong robustness to different undersampling patterns, both qualitatively and quantitatively. Besides, SLR-Net has been extended to a multi-coil scenario, and achieved excellent reconstruction results compared with a sparsity-driven multi-coil deep learning-based method under a high acceleration. Prospective reconstruction results on an open real-time dataset further demonstrate the capability and flexibility of the proposed method on real-time scenarios. [ABSTRACT FROM AUTHOR]

Purpose: The application of compressed sensing (CS) technology in magnetic resonance imaging (MRI) is to accelerate the MRI scan speed by incoherent undersampling of k-space data and nonlinear iterative reconstruction of MRI images. This paper generalizes the existing rosette trajectories to configure the sampling patterns for undersampled k-space data acquisition in MRI scans. The arch and curvature characteristics of the generalized rosette trajectories are analyzed to explore their feasibility and advantages for CS reconstruction of MRI images. Methods: Two key properties crucial to the CS MRI application, the scan speed and sampling incoherence of the generalized rosette trajectories, are analyzed. The analysis on the scan speed of generalized rosette trajectories is based on the transversal time derived from the curvature of the trajectories, and the sampling incoherence is based on the evaluation of the point spread function for the measurement matrix. The results of analysis are supported by extensive simulations where the performances of rosette, spiral, and radial sampling patterns at different acceleration factors are compared. Results: It is shown that compared with spiral trajectories, the arch and curvature characteristics of the generalized rosette trajectories are more feasible to meet the physical requirements of undersampled k-space data acquisition in terms of time shortness and scan area. It is further shown that the sampling pattern of the rosette trajectory has higher incoherence than that of the other trajectories and can thus achieve higher reconstruction performance. Reconstruction performances illustrate that the rosette trajectory can achieve about 10% higher peak signal-to-noise ratio than radial and spiral trajectories under the high acceleration factor R = 10. Conclusions: The generalized rosette trajectories can be a desirable candidate for CS reconstruction of MRI. [ABSTRACT FROM AUTHOR]

• A model-based unrolled low-rank plus sparse network (L+S-Net) for dynamic MR reconstruction is proposed. • A learned singular value thresholding (LSVT) was introduced to exploit the deep low rank prior in dynamic MR. • The iterative steps are unrolled into a network whose regularization parameters are learned during training instead of the empirical selection. • The convergence analysis guarantees the performance of the reconstruction theoretically. • Retrospective and prospective study on single-coil/multi-coil datasets show that the L+S-Net can improve the reconstruction result both qualitatively and quantitatively. [Display omitted] In dynamic magnetic resonance (MR) imaging, low-rank plus sparse (L+S) decomposition, or robust principal component analysis (PCA), has achieved stunning performance. However, the selection of the parameters of L+S is empirical, and the acceleration rate is limited, which are common failings of iterative compressed sensing MR imaging (CS-MRI) reconstruction methods. Many deep learning approaches have been proposed to address these issues, but few of them use a low-rank prior. In this paper, a model-based low-rank plus sparse network, dubbed L+S-Net, is proposed for dynamic MR reconstruction. In particular, we use an alternating linearized minimization method to solve the optimization problem with low-rank and sparse regularization. Learned soft singular value thresholding is introduced to ensure the clear separation of the L component and S component. Then, the iterative steps are unrolled into a network in which the regularization parameters are learnable. We prove that the proposed L+S-Net achieves global convergence under two standard assumptions. Experiments on retrospective and prospective cardiac cine datasets show that the proposed model outperforms state-of-the-art CS and existing deep learning methods and has great potential for extremely high acceleration factors (up to 24 ×). [ABSTRACT FROM AUTHOR]