McGaffin Madison G, Fessler Jeffrey A
EECS Department, University of Michigan, Ann Arbor, MI, 48109-2122.
IEEE Trans Comput Imaging. 2015 Sep;1(3):186-199. doi: 10.1109/TCI.2015.2479555. Epub 2015 Sep 17.
Model-based image reconstruction (MBIR) for X-ray computed tomography (CT) offers improved image quality and potential low-dose operation, but has yet to reach ubiquity in the clinic. MBIR methods form an image by solving a large statistically motivated optimization problem, and the long time it takes to numerically solve this problem has hampered MBIR's adoption. We present a new optimization algorithm for X-ray CT MBIR based on duality and group coordinate ascent that may converge even with approximate updates and can handle a wide range of regularizers, including total variation (TV). The algorithm iteratively updates groups of dual variables corresponding to terms in the cost function; these updates are highly parallel and map well onto the GPU. Although the algorithm stores a large number of variables, the "working size" for each of the algorithm's steps is small and can be efficiently streamed to the GPU while other calculations are being performed. The proposed algorithm converges rapidly on both real and simulated data and shows promising parallelization over multiple devices.
基于模型的X射线计算机断层扫描(CT)图像重建(MBIR)可提供更高的图像质量并具备低剂量操作的潜力,但尚未在临床上广泛应用。MBIR方法通过求解一个基于统计学的大型优化问题来形成图像,而数值求解该问题所需的较长时间阻碍了MBIR的应用。我们提出了一种基于对偶性和组坐标上升的用于X射线CT MBIR的新优化算法,该算法即使在近似更新的情况下也可能收敛,并且可以处理包括总变差(TV)在内的各种正则化项。该算法迭代更新与代价函数中的项相对应的对偶变量组;这些更新高度并行,并且能很好地映射到GPU上。尽管该算法存储大量变量,但每个算法步骤的“工作大小”很小,并且可以在执行其他计算时有效地流式传输到GPU。所提出的算法在真实数据和模拟数据上均能快速收敛,并在多个设备上显示出良好的并行化前景。