快速DMO算法

在Ｈａｌｅ傅氏变换法ＤＭＯ的基础上，引入Ｂｏｌｏｎｄｉ提出的对数拉伸变换，将ｔ－ｋ域中含有积分的ＤＭＯ算子转化为ｆ－ｋ域中的二维滤波因子，也就是将含有积分的ＤＭＯ运算转化为快速傅氏变换和一个二维滤波的过程。本文给出了这种对数拉伸变换下产生的快速Ｈａｌｅ、Ｌｉｎｅｒ和Ｎｏｔｆｏｒｓ算法的计算公式，对这三种快速ＤＭＯ算法和ＰＳＰＭ ＤＭＯ方法的理论模型计算结果和实际资料处理效果进行了比较并给出了一些结

Fast DMO algorithm

On the basis of Hale's dipmoveout by Fourier trans form,we take Bolondi's logarithmic strctch transform to transfer integral DMO operator in t-k domain into 2D filtering factor in fk domain,that is to say,to convert integral DMO operation into fast Fourier transforrn and 2D filtering process. The formulae of Hale's,Liner's and Not fors' sfast algorithms based on logarithmic stretch transform are given in the paper. Theoretical and real data processing results of the three fast DMO algorithms and PSPM DMO method are compared to draw some conclusions.