Improved k-t PCA Algorithm Using Artificial Sparsity in Dynamic MRI

The k-t principal component analysis (k-t PCA) is an effective approach for high spatiotemporal resolution dynamic magnetic resonance (MR) imaging. However, it suffers from larger residual aliasing artifacts and noise amplification when the reduction factor goes higher. To further enhance the performance of this technique, we propose a new method called sparse k-t PCA that combines the k-t PCA algorithm with an artificial sparsity constraint. It is a self-calibrated procedure that is based on the traditional k-t PCA method by further eliminating the reconstruction error derived from complex subtraction of the sampled k-t space from the original reconstructed k-t space. The proposed method is tested through both simulations and in vivo datasets with different reduction factors. Compared to the standard k-t PCA algorithm, the sparse k-t PCA can improve the normalized root-mean-square error performance and the accuracy of temporal resolution. It is thus useful for rapid dynamic MR imaging.