TY - GEN
T1 - An efficient non-iterative reconstruction algorithm for parallel MRI with arbitrary K-space trajectories
AU - Ying, Leslie
AU - Haldar, Justin
AU - Liang, Zhi Pei
PY - 2005
Y1 - 2005
N2 - Parallel imaging using multiple receiver coils has emerged as an effective tool to reduce imaging time in various MRI applications. Although several different image reconstruction methods have been developed and demonstrated to be successful for Cartesian k-space trajectories, there is a lack of efficient reconstruction methods for arbitrary trajectories. In this paper, we formulate the reconstruction problem in k-space and propose a novel image reconstruction method that is fast and effective for arbitrary trajectories. To obtain the desired image, the method reconstructs the Nyquist-sampled k-space data of the image on a uniform Cartesian grid from the undersampled multichannel k-space data on an arbitrary grid, followed by inverse Fourier transform. We demonstrate the effectiveness of the proposed fast algorithm using simulations. In particular, we compare the proposed method with the existing iterative method and show that the former is able to achieve similar image quality to the latter but with reduced computational complexity.
AB - Parallel imaging using multiple receiver coils has emerged as an effective tool to reduce imaging time in various MRI applications. Although several different image reconstruction methods have been developed and demonstrated to be successful for Cartesian k-space trajectories, there is a lack of efficient reconstruction methods for arbitrary trajectories. In this paper, we formulate the reconstruction problem in k-space and propose a novel image reconstruction method that is fast and effective for arbitrary trajectories. To obtain the desired image, the method reconstructs the Nyquist-sampled k-space data of the image on a uniform Cartesian grid from the undersampled multichannel k-space data on an arbitrary grid, followed by inverse Fourier transform. We demonstrate the effectiveness of the proposed fast algorithm using simulations. In particular, we compare the proposed method with the existing iterative method and show that the former is able to achieve similar image quality to the latter but with reduced computational complexity.
UR - http://www.scopus.com/inward/record.url?scp=33846917711&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33846917711&partnerID=8YFLogxK
U2 - 10.1109/iembs.2005.1616676
DO - 10.1109/iembs.2005.1616676
M3 - Conference contribution
AN - SCOPUS:33846917711
SN - 0780387406
SN - 9780780387409
T3 - Annual International Conference of the IEEE Engineering in Medicine and Biology - Proceedings
SP - 1344
EP - 1347
BT - Proceedings of the 2005 27th Annual International Conference of the Engineering in Medicine and Biology Society, IEEE-EMBS 2005
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2005 27th Annual International Conference of the Engineering in Medicine and Biology Society, IEEE-EMBS 2005
Y2 - 1 September 2005 through 4 September 2005
ER -