A Hybrid Stochastic-deterministic Optimization Method for Waveform Inversion

T. Leeuwen, Mark W. Schmidt, M. Friedlander, F. Herrmann
{"title":"A Hybrid Stochastic-deterministic Optimization Method for Waveform Inversion","authors":"T. Leeuwen, Mark W. Schmidt, M. Friedlander, F. Herrmann","doi":"10.3997/2214-4609.20149180","DOIUrl":null,"url":null,"abstract":"Present-day high quality 3D acquisition can give us lower frequencies at longer offsets with which to invert. However, the computational costs involved in handling this data explosion are tremendous. Therefore, recent developments in full-waveform inversion have been geared towards reducing the computational costs involved. Recent attention has been drawn towards reducing the number of sources by randomly combining the sources in to a few supershots, but other strategies are also possible. In all cases, the full data misfit, which involves all the sequential sources, is replaced by a reduced misfit that is much cheaper to evaluate, but also less accurate. The optimization of such an inaccurate, or noisy, misfit is the topic of stochastic optimization. In this paper, we propose an optimization strategy that borrows ideas from this field. The strategy consists of starting with very few sources (low cost) and gradually increasing the accuracy of the misfit as the iterations proceed. We test the proposed strategy on a synthetic dataset. We achieve a very reasonable inversion result at the cost of roughly 13 evaluations of the full misfit and observe a speed-up of roughly a factor 20.","PeriodicalId":137150,"journal":{"name":"73rd EAGE Conference and Exhibition incorporating SPE EUROPEC 2011","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"73rd EAGE Conference and Exhibition incorporating SPE EUROPEC 2011","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3997/2214-4609.20149180","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Present-day high quality 3D acquisition can give us lower frequencies at longer offsets with which to invert. However, the computational costs involved in handling this data explosion are tremendous. Therefore, recent developments in full-waveform inversion have been geared towards reducing the computational costs involved. Recent attention has been drawn towards reducing the number of sources by randomly combining the sources in to a few supershots, but other strategies are also possible. In all cases, the full data misfit, which involves all the sequential sources, is replaced by a reduced misfit that is much cheaper to evaluate, but also less accurate. The optimization of such an inaccurate, or noisy, misfit is the topic of stochastic optimization. In this paper, we propose an optimization strategy that borrows ideas from this field. The strategy consists of starting with very few sources (low cost) and gradually increasing the accuracy of the misfit as the iterations proceed. We test the proposed strategy on a synthetic dataset. We achieve a very reasonable inversion result at the cost of roughly 13 evaluations of the full misfit and observe a speed-up of roughly a factor 20.
波形反演的一种混合随机-确定性优化方法
当今高质量的3D采集可以在更长的偏移量下为我们提供更低的频率。然而,处理这种数据爆炸所涉及的计算成本是巨大的。因此,全波形反演的最新发展已面向减少所涉及的计算成本。最近的注意力被吸引到通过随机将源组合到几个超级镜头中来减少源的数量,但其他策略也是可能的。在所有情况下,包含所有序列源的完整数据不匹配都被简化的不匹配所取代,这种不匹配的评估成本要低得多,但准确性也较低。这种不准确的或有噪声的失配的优化是随机优化的主题。在本文中,我们提出了一个借鉴该领域思想的优化策略。该策略包括从很少的源(低成本)开始,并随着迭代的进行逐渐增加失配的准确性。我们在一个合成数据集上测试了所提出的策略。我们以大约13次完全失配的代价获得了非常合理的反演结果,并观察到大约20倍的加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信