.png){kind=icon}
返回
A fast reconstruction algorithm for electron microscope tomography
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jsb.2003.09.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We have implemented a Fast Fourier Summation algorithm for tomographic reconstruction of three-dimensional biological data sets obtained via transmission electron microscopy. We designed the fast algorithm to reproduce results obtained by the direct summation algorithm (also known as filtered or R-weighted backprojection). For two-dimensional images, the new algorithm scales as O(NthetaM log M) + O(MN log N) operations, where N-0 is the number of projection angles and M x N is the size of the reconstructed image. Three-dimensional reconstructions are constructed from sequences of two-dimensional reconstructions. We demonstrate the algorithm on real data sets. For typical sizes of data sets, the new algorithm is 1.5-2.5 times faster than using direct summation in the space domain. The speed advantage is even greater as the size of the data sets grows. The new algorithm allows us to use higher order spline interpolation of the data without additional computational cost. The algorithm has been incorporated into a commonly used package for tomographic reconstruction. (C) 2003 Elsevier Inc. All rights reserved.
Keyword:
electron tomography
weighted backprojection
3-D reconstruction algorithm
unequally spaced fast Fourier transform
期刊
IF:
2.7
论文数:
4.4K
被引数:
1.0W
机构
暂无机构信息
引用论文
ASML NXE pellicle update.png)
Photomask Japan 2019: XXVI Symposium on Photomask and Next-Generation Lithography Mask Technology
Photomask Japan 2019: XXVI Symposium on Photomask and Next-Generation Lithography Mask TechnologyIF0
PREAI
分享收藏
Lessons Learned from the Canadian Agency Implementation of Transportation Asset Management Systems
PREAI
分享收藏分享收藏
查看更多内容