Efficient MR image reconstruction for compressed MR imaging

In this paper, we propose an efficient algorithm for MR image reconstruction. The algorithm minimizes a linear combination of three terms corresponding to a least square data fitting, total variation (TV) and L1 norm regularization. This has been shown to be very powerful for the MR image reconstruction. First, we decompose the original problem into L1 and TV norm regularization subproblems respectively. Then, these two subproblems are efficiently solved by existing techniques. Finally, the reconstructed image is obtained from the weighted average of solutions from two subproblems in an iterative framework. We compare the proposed algorithm with previous methods in term of the reconstruction accuracy and computation complexity. Numerous experiments demonstrate the superior performance of the proposed algorithm for compressed MR image reconstruction.

Advantages over previous methods.Figure optionsDownload high-quality image (201 K)Download as PowerPoint slideHighlights
► An efficient algorithm is proposed for MR image reconstruction.
► Theoretical proofs are provided to mathematically demonstrates the benefit of the proposed method.
► The proposed algorithm outperforms previous methods in numerous experiments.