SELECTION OF A CONVOLUTION FUNCTION FOR FOURIER INVERSION USING GRIDDING
SELECTION OF A CONVOLUTION FUNCTION FOR FOURIER INVERSION USING GRIDDING
复制标题
DOI：
10.1109/42.97598
复制
发表时间：
1991-09-01
影响因子：
10.6
通讯作者：
MACOVSKI, A
中科院分区：
文献类型：
--
作者：
JACKSON, JI;MEYER, CH;MACOVSKI, A
在从射电天文学到磁共振成像的领域中，不落在笛卡尔网格上的数据的傅立叶反演一直是一个问题。因此，已经创建了用于从非均匀频率样本重建图像的多种算法。在称为网格化的技术中，数据样本被加权以获得采样密度，并与有限核卷积，然后在网格上重新采样以准备快速傅立叶变换。本文比较了几种卷积函数的效用，包括在某些情况下优于“最佳”长椭球波函数的卷积函数。
In fields ranging from radio astronomy to magnetic resonance imaging, Fourier inversion of data not falling on a Cartesian grid has been a problem. As a result, multiple algorithms have been created for reconstructing images from non-uniform frequency samples. In the technique known as gridding, the data samples are weighted for sampling density and convolved with a finite kernel, then resampled on a grid preparatory to a fast Fourier transform. This paper compares the utility of several convolution functions, including one that out-performs the "optimal" prolate spheroidal wave function in some situations.