Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX, USA.
Neuroinformatics. 2018 Oct;16(3-4):425-430. doi: 10.1007/s12021-017-9354-9.
The most recent history of parallel Magnetic Resonance Imaging (pMRI) has in large part been devoted to finding ways to reduce acquisition time. While joint total variation (JTV) regularized model has been demonstrated as a powerful tool in increasing sampling speed for pMRI, however, the major bottleneck is the inefficiency of the optimization method. While all present state-of-the-art optimizations for the JTV model could only reach a sublinear convergence rate, in this paper, we squeeze the performance by proposing a linear-convergent optimization method for the JTV model. The proposed method is based on the Iterative Reweighted Least Squares algorithm. Due to the complexity of the tangled JTV objective, we design a novel preconditioner to further accelerate the proposed method. Extensive experiments demonstrate the superior performance of the proposed algorithm for pMRI regarding both accuracy and efficiency compared with state-of-the-art methods.
最近的并行磁共振成像(pMRI)历史在很大程度上致力于寻找缩短采集时间的方法。虽然联合全变分(JTV)正则化模型已被证明是提高 pMRI 采样速度的有力工具,但主要瓶颈在于优化方法的效率低下。虽然目前所有用于 JTV 模型的最先进的优化方法只能达到次线性收敛速度,但在本文中,我们通过为 JTV 模型提出一种线性收敛的优化方法来提高性能。所提出的方法基于迭代重加权最小二乘法。由于纠缠的 JTV 目标的复杂性,我们设计了一种新颖的预处理子来进一步加速所提出的方法。广泛的实验表明,与最先进的方法相比,所提出的算法在 pMRI 方面的准确性和效率方面具有优越的性能。