A fast iterative convolution weighting approach for gridding-based direct Fourier three-dimensional reconstruction with correction for the contrast transfer function
A fast iterative convolution weighting approach for gridding-based direct Fourier three-dimensional reconstruction with correction for the contrast transfer function
复制标题
DOI：
10.1016/j.ultramic.2015.05.018
复制
发表时间：
2015-10-01
期刊：
影响因子：
2.2
通讯作者：
Sorzano, C. O. S.
中科院分区：
文献类型：
--
作者：
Abrishami, V.;Bilbao-Castro, J. R.;Sorzano, C. O. S.
我们描述了一种快速，准确的方法重建的大分子复合物从一组投影。直接傅里叶反演（其中傅里叶切片定理起着核心作用）是处理这个逆问题的解决方案。不幸的是，该组投影提供了所保持的单个颗粒中的大分子傅立叶变换的非等距采样版本（并且因此，直接傅立叶反演）可能不是最佳解决方案。在本文中，我们介绍了一种基于网格的直接傅立叶方法的三维重建方法，使用加权技术来计算均匀采样的傅立叶变换。此外，显微镜的对比度传递函数，这是一个限制因素，在追求高分辨率的重建，校正的算法。该算法的并行化，无论是在线程上还是在多个CPU上，都使得三维重建的过程更快。实验结果表明，我们提出的基于网格的直接傅立叶重建比类似的现有方法更准确，并提出了一个较低的计算复杂度在时间和内存方面，从而允许其使用更大的体积。该算法在开源Xmipp包中完全实现，可以从http://xmipp.cnb.csic.es下载。(C)2015 Elsevier By. All rights reserved.
We describe a fast and accurate method for the reconstruction of macromolecular complexes from a set of projections. Direct Fourier inversion (in which the Fourier Slice Theorem plays a central role) is a solution for dealing with this inverse problem. Unfortunately, the set of projections provides a non-equidistantly sampled version of the macromolecule Fourier transform in the single particle held (and, therefore, a direct Fourier inversion) may not be an optimal solution. In this paper, we introduce a griddling-based direct Fourier method for the three-dimensional reconstruction approach that uses a weighting technique to compute a uniform sampled Fourier transform. Moreover, the contrast transfer function of the microscope, which is a limiting factor in pursuing a high resolution reconstruction, is corrected by the algorithm. Parallelization of this algorithm, both on threads and on multiple CPU's, makes the process of three-dimensional reconstruction even faster. The experimental results show that our proposed gridding-based direct Fourier reconstruction is slightly more accurate than similar existing methods and presents a lower computational complexity both in terms of time and memory, thereby allowing its use on larger volumes. The algorithm is fully implemented in the open-source Xmipp package and is downloadable from http://xmipp.cnb.csic.es. (C) 2015 Elsevier By. All rights reserved.