Efficient MR image reconstruction for compressed MR imaging

18Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Huang, J., Zhang, S., & Metaxas, D. (2010). Efficient MR image reconstruction for compressed MR imaging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6361 LNCS, pp. 135–142). https://doi.org/10.1007/978-3-642-15705-9_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free