首页 | 本学科首页   官方微博 | 高级检索  
     

基于贪婪—快速迭代收缩阈值的Radon变换及其在多次波压制中的应用
引用本文:张全,雷芩,林柏栎,彭博,刘书妍.基于贪婪—快速迭代收缩阈值的Radon变换及其在多次波压制中的应用[J].石油地球物理勘探,2022,57(6):1332-1341.
作者姓名:张全  雷芩  林柏栎  彭博  刘书妍
作者单位:1. 西南石油大学计算机科学学院, 四川成都 610500;2. 油气藏地质及开发工程国家重点实验室(西南石油大学), 四川成都 610500;3. 电子科技大学信息与通信工程学院, 四川成都 611731
基金项目:本项研究受油气藏地质及开发工程国家重点实验室开放基金项目“石油钻井环境异常工况智能识别技术研究”(PLN2022-51)、“基于高性能计算与卷积神经网络的地震多次波压制方法研究”(PLN2021-21)和“基于联合深度学习的地震多次波压制方法研究”(PLN2021-25)联合资助。
摘    要:多次波的存在严重影响了地震资料的解释精度,有效压制多次波是地震资料处理过程中的重要环节。目前,抛物线Radon变换是压制多次波的常用方法。针对抛物线Radon变换这一逆问题的求解,目前行业内应用最多的是迭代收缩阈值算法(Iterative Shrinkage Thresholding Algorithm,ISTA)。该方法在计算精度和计算效率方面优势明显,但对庞大的地震数据而言,处理效率仍需进一步提高。为提高抛物线Radon变换收敛速率,将贪婪的快速迭代收缩阈值算法(Greedy Fast ISTA,Greedy FISTA) 引入到Radon变换压制多次波的逆问题求解中,构建了一种基于贪婪的快速迭代收缩的混合域快速稀疏时不变Radon变换。与ISTA相比,该方法将前两次的迭代结果加权求和作为当前的迭代起点,通过引入重启条件和收敛条件,使迭代过程中振荡周期减小、计算速度提高。合成数据和实际数据的多次波压制实验表明,相比于ISTA与快速迭代收缩阈值算法(FISTA),该算法收敛效率有很大提高、精度也略有提升。

关 键 词:多次波压制  Radon变换  ISTA  FISTA  Greedy  FISTA  
收稿时间:2021-12-26

Radon transform based on greedy fast iterative shrinkage threshold and its application in multiple suppression
ZHANG Quan,LEI Qin,LIN Baiyue,PENG Bo,LIU Shuyan.Radon transform based on greedy fast iterative shrinkage threshold and its application in multiple suppression[J].Oil Geophysical Prospecting,2022,57(6):1332-1341.
Authors:ZHANG Quan  LEI Qin  LIN Baiyue  PENG Bo  LIU Shuyan
Affiliation:1. School of Computer Science, Southwest Petroleum University, Chengdu, Sichuan 610500, China;2. State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation (Southwest Petroleum University), Chengdu, Sichuan 610500, China;3. School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China
Abstract:In seismic exploration, multiples seriously affect the interpretation accuracy of seismic data, and effective suppression of multiples is important in seismic data processing. The parabolic Radon transform is a common method to suppress multiples. The iterative shrinkage thresholding algorithm (ISTA) is the most widely used method in the industry to obtain the solution to the inverse problem of the parabolic Radon transform. It has excellent computational accuracy and efficiency, but for massive seismic data, the processing efficiency still needs to be improved. To improve the convergence rate of the parabolic Radon transform, this study proposes greedy fast ISTA (Greedy FISTA) to processing of inversion problem for Radom transform suppressing multiple, and constract an accelerated sparse time-invariant Randon transform in the mixed frequency-time domain based on fast interative shrinkage-thesholding algorithn(SRTGFIS). Unlike ISTA, Greedy FISTA takes the weighted sum of the results of the previous two iterations as the iteration starting point, and it introduces restart conditions and convergence conditions to reduce the oscillation period in the iteration process and accelerate the calculation. The multiple suppression experiments with synthetic and real data show that compared with ISTA and FISTA, the proposed algorithm has a great improvement in convergence efficiency and a slight improvement in convergence accuracy.
Keywords:multiple suppression  Radon transform  ISTA  FISTA  greedy FISTA  
点击此处可从《石油地球物理勘探》浏览原始摘要信息
点击此处可从《石油地球物理勘探》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号