汉克尔矩阵
迭代重建
可分离空间
算法
计算机科学
维数(图论)
压缩传感
奇异值分解
稳健性(进化)
奇异值
秩(图论)
数学
人工智能
基因
量子力学
组合数学
物理
生物化学
数学分析
特征向量
化学
纯数学
作者
Xinlin Zhang,Hengfa Lu,Di Guo,Zongying Lai,Huihui Ye,Xi Peng,Bo Zhao,Xiaobo Qu
标识
DOI:10.1109/tmi.2022.3164472
摘要
Magnetic resonance imaging serves as an essential tool for clinical diagnosis, however, suffers from a long acquisition time. Sparse sampling effectively saves this time but images need to be faithfully reconstructed from undersampled data. Among the existing reconstruction methods, the structured low-rank methods have advantages in robustness to the sampling patterns and lower error. However, the structured low-rank methods use the 2D or higher dimension k-space data to build a huge block Hankel matrix, leading to considerable time and memory consumption. To reduce the size of the Hankel matrix, we proposed to separably construct multiple small Hankel matrices from rows and columns of the k-space and then constrain the low-rankness on these small matrices. This separable model can significantly reduce the computational time but ignores the correlation existed in inter- and intra-row or column, resulting in increased reconstruction error. To improve the reconstructed image without obviously increasing the computation, we further introduced the self-consistency of k-space and virtual coil prior. Besides, the proposed separable model can be extended into other imaging scenarios which hold exponential characteristics in the parameter dimension. The in vivo experimental results demonstrated that the proposed method permits the lowest reconstruction error with a fast reconstruction. The proposed approach requires only 4% of the state-of-the-art STDLR-SPIRiT runtime for parallel imaging reconstruction, and achieves the fastest computational speed in parameter imaging reconstruction.
科研通智能强力驱动
Strongly Powered by AbleSci AI