子空间拓扑
笛卡尔张量
笛卡尔坐标系
分解
加速度
群(周期表)
张量(固有定义)
数学
秩(图论)
算法
计算机科学
人工智能
数学分析
张量场
几何学
张量密度
化学
物理
量子力学
广义相对论的精确解
有机化学
纯数学
组合数学
经典力学
作者
Bei Liu,Zekang Ding,Yu-Fei Zhang,Huajun She,Yiping P. Du
出处
期刊:IEEE Transactions on Biomedical Engineering
[Institute of Electrical and Electronics Engineers]
日期:2022-08-22
卷期号:70 (2): 681-693
被引量:8
标识
DOI:10.1109/tbme.2022.3200709
摘要
Objective: Dynamic MR imaging often requires long scan time, and acceleration of data acquisition is highly desirable in clinical applications. Methods: We proposed a Low-rank Tensor subspace decomposition with Weighted Group Sparsity (LTWGS) algorithm for non-Cartesian dynamic MRI. The proposed algorithm introduces the weighted group sparse constraints together with the subspace decomposition technique into the framework of low-rank tensor and sparse decomposition to better utilize the sparsity in the data. Results: LTWGS increases the PSNR values by 1.97 dB, 2.03 dB, and 2.83 dB compared with PROST (patch-based reconstruction), SRTPCA (smooth robust tensor principal component analysis), and LRTES (low-rank tensor with "explicit subspace") in the dynamic abdominal imaging at an acceleration rate R = 25. LTWGS increases the PSNR values by 2.42 dB and 3.57 dB compared with PROST and LRTES in DCE liver imaging at R = 25. LTWGS increases the PSNR values by 1.40 dB and 1.96 dB compared with PROST and SRTPCA in cardiac cine imaging at R = 25. Conclusion and Significance: Jointly using group sparsity and sparsity can obtain better results than that using group sparsity alone, and weighted regularization can achieve better results than that without weighted regularization. The proposed algorithm results in reduced reconstruction error and improved image structural similarity in comparison with several state-of-the-art methods at relatively high acceleration factors. The proposed algorithm has the potential in various dynamic MRI application scenarios.
科研通智能强力驱动
Strongly Powered by AbleSci AI