MR image reconstruction from undersampled data by using the iterative refinement procedure

  • He L
  • Chang T
  • Osher S
  • et al.
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Magnetic resonance imaging (MRI) reconstruction from sparsely sampled data has been a difficult problem in medical imaging field. We approach this problem by formulating a cost functional that includes a constraint term that is imposed by the raw measurement data in k‐space and the L 1 norm of a sparse representation of the reconstructed image. The sparse representation is usually realized by total variational regularization and/or wavelet transform. We have applied the Bregman iteration to minimize this functional to recover finer scales in our recent work. Here we propose nonlinear inverse scale space methods in addition to the iterative refinement procedure. Numerical results from the two methods are presented and it shows that the nonlinear inverse scale space method is a more efficient algorithm than the iterated refinement method. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Cite

CITATION STYLE

APA

He, L., Chang, T., Osher, S., Fang, T., & Speier, P. (2007). MR image reconstruction from undersampled data by using the iterative refinement procedure. PAMM, 7(1), 1011207–1011208. https://doi.org/10.1002/pamm.200700776

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