Spiral magnetic resonance imaging (MRI) plays an important role in functional imaging, parallel imaging and dynamic imaging. Most of the traditional image reconstruction algorithms for spiral imaging are based on kernel functions which interpolate the k-space data acquired with spiral trajectories onto a uniform grid in Cartesian space. Non-uniform fast Fourier transform (NUFFT) and least square method could then be applied after gridding to reconstruct the images. With these algorithms, the results are dependent on the choice of kernel function, and reconstruction errors are unavoidable during the gridding process. In this study, a spatio-temporal transform (STT) matrix, representing the relation between the image and sampled k-space data, is introduced in l1 norm to optimize the problem based on spatio-temporal transform and compressed sensing (CS). The k-space data, rather than the after-gridding data, are used as the fidelity term, such that the gridding errors can be avoided. In addition, parallel computing on GPU can be applied to reduce the computation time for the STT matrix, making the algorithm more efficient.
ZHUANG Xiao-xing
,
CAI Cong-bo
,
CHEN Zhong
,
MA Ling-ceng
. An Image Reconstruction Algorithm for Spiral MRI Based on Spatio-Temporal Transform and Compressed Sensing[J]. Chinese Journal of Magnetic Resonance, 2016
, 33(4)
: 549
-558
.
DOI: 10.11938/cjmr20160404
[1] Yang Bao-lian(杨保联). Future of ultra high field MRI in basic research and clinical applications(超高场磁共振人体成像应用研究和医学前景)[J]. Chinese J Magn Reson(波谱学杂志), 2015, 32(4):707-714.
[2] Haacke E M, Brown R W, Thompson M R, et al. Magnetic Resonance Imaging:Physical Principles and Sequence Design[M]. New York:Wiley-Liss, 1999.
[3] Sachs T S, Meyer C H, Hu B S, et al. Real-time motion detection in spiral MRI using navigators[J]. Magn Reson Med, 1994, 32(5):639-645.
[4] Meyer C H, Hu B S, Nishimura D G, et al. Fast spiral coronary artery imaging[J]. Magn Reson Med, 1992, 28(2):202-213.
[5] Tolouee A, Alirezaie J, Babyn P. Compressed sensing reconstruction of cardiac cine MRI using golden angle spiral trajectories[J]. J Magn Reson Imaging, 2015, 260:10-19.
[6] O'Sullivan J D. A fast sinc function gridding algorithm for Fourier inversion in computer tomography[J]. IEEE T Med Imaging, 1985, 4(4):200-207.
[7] Jackson J, Meyer C H, Nishimura D G, et al. Selection of a convolution function for Fourier inversion using gridding[J]. IEEE T Med Imaging, 1991, 10(3):473-478.
[8] Sha L, Guo H, Song A W. An improved gridding method for spiral MRI using nonuniform fast Fourier transform[J]. J Magn Reson Imaging, 2003, 162(2):250-258.
[9] Fessler J A. On NUFFT-based gridding for non-Cartesian MRI[J]. J Magn Reson Imaging, 2007, 188(2):191-195.
[10] Candès E J, Wakin M B. An introduction to compressive sampling[J]. IEEE Signal Proc Mag, 2008, 25(2):21-30.
[11] Donoho D L. Compressed sensing[J]. IEEE T Inform Theory, 2006, 52(4):1289-1306.
[12] Li Zhi-min(李智敏), Xie Hai-bin(谢海滨), Zhou Min-xiong(周敏雄), et al. Spike noise removal for magnetic resonance imaging based on sparse reconstruction(基于稀疏重建的磁共振图像尖峰噪声消除方法)[J]. Chinese J Magn Reson(波谱学杂志), 2015, 32(01):41-50.
[13] Lustig M, Donoho D, Pauly J M. Sparse MRI:The application of compressed sensing for rapid MR imaging[J]. Magn Reson in Med, 2007, 58(6):1182-1195.
[14] Owens J D, Houston M, Luebke D, et al. GPU computing[J]. P IEEE, 2008, 96(5):879-899.
[15] Sanders J, Kandrot E. CUDA by Example:An Introduction to General-purpose GPU Programming[M]. Boston:Addison-Wesley, 2010.
[16] Yang J, Zhang Y, Yin W. A fast alternating direction method for TVL1-L2 signal reconstruction from partial fourier data[J]. IEEE J STSP, 2010, 4(2):288-297.
[17] Zhan Z, Cai J, Guo D, et al. Fast multi-class dictionaries learning with geometrical directions in MRI reconstruction[J]. IEEE T Bio-Med Eng, DOI:10.1109/TBME.2015.2503756.
