An Augmented Lagrangian Based Compressed Sensing Reconstruction for Non-Cartesian Magnetic Resonance Imaging without Gridding and Regridding at Every Iteration

DSpace/Manakin Repository

An Augmented Lagrangian Based Compressed Sensing Reconstruction for Non-Cartesian Magnetic Resonance Imaging without Gridding and Regridding at Every Iteration

Citable link to this page

 

 
Title: An Augmented Lagrangian Based Compressed Sensing Reconstruction for Non-Cartesian Magnetic Resonance Imaging without Gridding and Regridding at Every Iteration
Author: Akçakaya, Mehmet; Nam, Seunghoon; Basha, Tamer A.; Kawaji, Keigo; Tarokh, Vahid; Nezafat, Reza

Note: Order does not necessarily reflect citation order of authors.

Citation: Akçakaya, Mehmet, Seunghoon Nam, Tamer A. Basha, Keigo Kawaji, Vahid Tarokh, and Reza Nezafat. 2014. “An Augmented Lagrangian Based Compressed Sensing Reconstruction for Non-Cartesian Magnetic Resonance Imaging without Gridding and Regridding at Every Iteration.” PLoS ONE 9 (9): e107107. doi:10.1371/journal.pone.0107107. http://dx.doi.org/10.1371/journal.pone.0107107.
Full Text & Related Files:
Abstract: Background: Non-Cartesian trajectories are used in a variety of fast imaging applications, due to the incoherent image domain artifacts they create when undersampled. While the gridding technique is commonly utilized for reconstruction, the incoherent artifacts may be further removed using compressed sensing (CS). CS reconstruction is typically done using conjugate-gradient (CG) type algorithms, which require gridding and regridding to be performed at every iteration. This leads to a large computational overhead that hinders its applicability. Methods: We sought to develop an alternative method for CS reconstruction that only requires two gridding and one regridding operation in total, irrespective of the number of iterations. This proposed technique is evaluated on phantom images and whole-heart coronary MRI acquired using 3D radial trajectories, and compared to conventional CS reconstruction using CG algorithms in terms of quantitative vessel sharpness, vessel length, computation time, and convergence rate. Results: Both CS reconstructions result in similar vessel length (P = 0.30) and vessel sharpness (P = 0.62). The per-iteration complexity of the proposed technique is approximately 3-fold lower than the conventional CS reconstruction (17.55 vs. 52.48 seconds in C++). Furthermore, for in-vivo datasets, the convergence rate of the proposed technique is faster (60±13 vs. 455±320 iterations) leading to a ∼23-fold reduction in reconstruction time. Conclusions: The proposed reconstruction provides images of similar quality to the conventional CS technique in terms of removing artifacts, but at a much lower computational complexity.
Published Version: doi:10.1371/journal.pone.0107107
Other Sources: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4162575/pdf/
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:12987224
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters