Calibrationless parallel MRI with joint total variation regularization

44Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a calibrationless method is proposed for parallel magnetic resonance imaging (pMRI). It is motivated by the observation that the gradients of the aliased images are jointly sparse. Therefore, the pMRI problem can be formulated as a joint total variation regularization task. The field of view is finally obtained via a sum of square approach. We develop an iterative algorithm to efficiently solve this problem. Experiments on pMRI datasets demonstrate that our method outperforms the state-of-the-art pMRI methods even when they can achieve sufficient calibration data, and far better than existing calibrationless pMRI algorithms. Clinic MR applications could benefit from this method even when accurate calibration is limited or not possible at all. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Chen, C., Li, Y., & Huang, J. (2013). Calibrationless parallel MRI with joint total variation regularization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8151 LNCS, pp. 106–114). https://doi.org/10.1007/978-3-642-40760-4_14

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