IEEE Trans Image Process. 2016 Mar;25(3):1207-18. doi: 10.1109/TIP.2016.2516945.
Reconstruction of underconstrained tomographic data sets remains a major challenge. Standard analytical techniques frequently lead to unsatisfactory results due to insufficient information. Several iterative algorithms, which can easily integrate a priori knowledge, have been developed to tackle this problem during the last few decades. Most of these iterative algorithms are based on an implementation of the Radon transform that acts as forward projector. This operator and its adjoint, the backprojector, are typically called few times per iteration and represent the computational bottleneck of the reconstruction process. Here, we present a Fourier-based forward projector, founded on the regridding method with minimal oversampling. We show that this implementation of the Radon transform significantly outperforms in efficiency other state-of-the-art operators with O(N2log2N) complexity. Despite its reduced computational cost, this regridding method provides comparable accuracy to more sophisticated projectors and can, therefore, be exploited in iterative algorithms to substantially decrease the time required for the reconstruction of underconstrained tomographic data sets without loss in the quality of the results.
重建欠约束层析数据集仍然是一个主要挑战。由于信息不足,标准分析技术经常导致不理想的结果。在过去几十年中,已经开发了几种迭代算法,可以轻松地整合先验知识来解决这个问题。这些迭代算法中的大多数都是基于作为正向投影器的 Radon 变换的实现。该算子及其伴随算子,即反向投影器,通常在每次迭代中被调用几次,代表了重建过程中的计算瓶颈。在这里,我们提出了一种基于傅里叶的正向投影器,该投影器基于最小过采样的重网格化方法。我们表明,这种 Radon 变换的实现效率明显优于其他具有 O(N2log2N)复杂度的最先进算子。尽管计算成本降低,但这种重网格化方法提供了与更复杂的投影器相当的准确性,因此可以在迭代算法中利用它,在不损失结果质量的情况下,大大减少重建欠约束层析数据集所需的时间。