Improved k-t PCA algorithm using artificial sparsity in dynamic MRI

Yiran Wang, Zhifeng Chen, Jing Wang, Lixia Yuan, Ling Xia, Feng Liu

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)


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.

Original languageEnglish
Article number4816024
Number of pages12
JournalComputational and Mathematical Methods in Medicine
Publication statusPublished - 2017
Externally publishedYes

Cite this