Search

Radially encoded MRI has gained increasing attention due to its motion insensitivity and reduced artifacts. However, because its samples are collected nonuniformly in the k-space, multidimensional (especially 3-D) radially sampled Mill image reconstruction is challenging. The objective of this paper is to develop a reconstruction technique in high dimensions with on-the-fly kernel calculation. It implements general multidimensional nonuniform fast Fourier transform (NUFFT) algorithms and incorporates them into a k-space image reconstruction framework. The method is then applied to reconstruct from the radially encoded k-space data, although the method is applicable to any non- Cartesian patterns. Performance comparisons are made against the conventional Kaiser-Bessel (KB) gridding method for 2-D and 3-D radially encoded computer-simulated phantoms and physically scanned phantoms. The results show that the NUFFT reconstruction method has better accuracy-efficiency tradeoff than the KB gridding method when the kernel weights are calculated on the fly. It is found that for a particular conventional kernel function, using its corresponding deapodization function as a scaling factor in the NUFFT framework has the potential to improve accuracy. In particular, when a cosine scaling factor is used, the NUFFT method is faster than KB gridding method since a closed-form solution is available and is less computationally expensive than the KB kernel (KB griding requires computation of Bessel functions). The NUFFT method has been successfully applied to 2-D and 3-D in vivo studies on small animals. [ABSTRACT FROM AUTHOR]

Recent advances in murine cardiac studies with three-dimensional (3D) cone beam micro-CT used a retrospective gating technique. However, this sampling technique results in a limited number of projections with an irregular angular distribution due to the temporal resolution requirements and radiation dose restrictions. Both angular irregularity and undersampling complicate the reconstruction process, since they cause significant streaking artifacts. This work provides an iterative reconstruction solution to address this particular challenge. A sparseness prior regularized weighted l2 norm optimization is proposed to mitigate streaking artifacts based on the fact that most medical images are compressible. Total variation is implemented in this work as the regularizer for its simplicity. Comparison studies are conducted on a 3D cardiac mouse phantom generated with experimental data. After optimization, the method is applied to in vivo cardiac micro-CT data. [ABSTRACT FROM AUTHOR]

Non-Cartesian sampling is widely used for fast magnetic resonance imaging (MRI). Accurate and fast image reconstruction from non-Cartesian k-space data becomes a challenge and gains a lot of attention. Images provided by conventional direct reconstruction methods usually bear ringing, streaking, and other leakage artifacts caused by discontinuous structures. In this paper, we tackle these problems by analyzing the principal point spread function (PSF) of non-Cartesian reconstruction and propose a leakage reduction reconstruction scheme based on discontinuity subtraction. Data fidelity in k-space is enforced during each iteration. Multidimensional nonuniform fast Fourier transform (NUFFT) algorithms are utilized to simulate the k-space samples as well as to reconstruct images. The proposed method is compared to the direct reconstruction method on computer-simulated phantoms and physical scans. Non-Cartesian sampling trajectories including 2D spiral, 2D and 3D radial trajectories are studied. The proposed method is found useful on reducing artifacts due to high image discontinuities. It also improves the quality of images reconstructed from undersampled data. [ABSTRACT FROM AUTHOR]