Magnetic resonance imaging serves as an essential tool for clinical diagnosis, however, suffers from a long acquisition time. Sparse sampling effectively saves this time but images need to be faithfully reconstructed from undersampled data. Among the existing reconstruction methods, the structured low-rank methods have advantages in robustness to the sampling patterns and lower error. However, the structured low-rank methods use the 2D or higher dimension k-space data to build a huge block Hankel matrix, leading to considerable time and memory consumption. To reduce the size of the Hankel matrix, we proposed to separably construct multiple small Hankel matrices from rows and columns of the k-space and then constrain the low-rankness on these small matrices. This separable model can significantly reduce the computational time but ignores the correlation existed in inter- and intra-row or column, resulting in increased reconstruction error. To improve the reconstructed image without obviously increasing the computation, we further introduced the self-consistency of k-space and virtual coil prior. Besides, the proposed separable model can be extended into other imaging scenarios which hold exponential characteristics in the parameter dimension. The in vivo experimental results demonstrated that the proposed method permits the lowest reconstruction error with a fast reconstruction. The proposed approach requires only 4% of the state-of-the-art STDLR-SPIRiT runtime for parallel imaging reconstruction, and achieves the fastest computational speed in parameter imaging reconstruction.

Magnetic resonance spectroscopic imaging (MRSI) is a powerful molecular imaging modality but has very limited speed, resolution, and SNR tradeoffs. Construction of a low-dimensional model to effectively reduce the dimensionality of the imaging problem has recently shown great promise in improving these tradeoffs. This paper presents a new approach to model and reconstruct the spectroscopic signals by learning a nonlinear low-dimensional representation of the general MR spectra. Specifically, we trained a deep neural network to capture the low-dimensional manifold, where the high-dimensional spectroscopic signals reside. A regularization formulation is proposed to effectively integrate the learned model and physics-based data acquisition model for MRSI reconstruction with the capability to incorporate additional spatiospectral constraints. An efficient numerical algorithm was developed to solve the associated optimization problem involving back-propagating the trained network. Simulation and experimental results were obtained to demonstrate the representation power of the learned model and the ability of the proposed formulation in producing SNR-enhancing reconstruction from the practical MRSI data.

The problem of recovering an image from limited or sparsely sampled Fourier measurements occurs in the application of magnetic resonance imaging. To address this problem, we propose a novel MR image reconstruction method with convolutional characteristic constraints. We first estimate the convolutional characteristics using standard compressed sensing method in a parallel fashion. Then we use the recovered image characteristics to constrain the target image function. The image characteristics should either be sparser or of higher SNR than the original image to enable superior performance. In this work, we studied using thirteen kernels and experiments based on a brain data set were conducted. It is demonstrated that the proposed method outperforms the existing methods in terms of high quality imaging due to multiple characteristic constraints and the robustness to measurement noise.

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.