| Autor: |
Mehmet Akçakaya, Seunghoon Nam, Tamer A Basha, Keigo Kawaji, Vahid Tarokh, Reza Nezafat |
| Jazyk: |
angličtina |
| Rok vydání: |
2014 |
| Předmět: |
|
| Zdroj: |
PLoS ONE, Vol 9, Iss 9, p e107107 (2014) |
| Druh dokumentu: |
article |
| ISSN: |
1932-6203 |
| DOI: |
10.1371/journal.pone.0107107 |
| Popis: |
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.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.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.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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
