LsmGANs: Image-Domain Least-Squares Migration Using a New Framework of Generative Adversarial Networks

增采样 计算机科学 特征(语言学) 黑森矩阵 卷积(计算机科学) 算法 人工智能 图像(数学) 数学 人工神经网络 应用数学 语言学 哲学
作者
Jiaxing Sun,Jidong Yang,Jianping Huang,Youcai Yu,Zhenchun Li,Chong Zhao
出处
期刊:IEEE Transactions on Geoscience and Remote Sensing [Institute of Electrical and Electronics Engineers]
卷期号:61: 1-13 被引量:5
标识
DOI:10.1109/tgrs.2023.3304726
摘要

Compared with traditional adjoint migration, the least-squares migration (LSM) can effectively mitigate the unbalanced illumination and limited resolution associated with finite acquisition apertures, complex overburden structures and band-limited records. Data-domain LSM needs many times of Born modeling and adjoint migration to converge to a good solution, which is still challenging for large-scale 3D model under current computational capacity. To reduce computational cost and produce high-quality images, we directly approximate the Hessian inverse in the image-domain LSM using a new framework of generative adversarial networks (GANs). The migrated images, source illumination and migration velocity model are used as input data for the GANs, and the ground-truth reflectivity is utilized as the label data to train the network. Directly applying conventional GAN framework to implement the image-domain LSM leads to dislocated reflection events and incorrect images. To overcome this issue, we develop a new GAN framework that is more suitable for the Hessian approximation of image-domain LSM, which is named as LsmGANs. In the new framework, we use a max-pooling instead of convolution to downsample the feature maps to capture horizontal and vertical variations of reflectors. This enables us to map reflection events to correct location in downsampling. To address the lateral discontinuity of events in the predicted image from conventional GANs, we further apply multiple transform layers to strengthen feature transformation to guide Hessian approximation. Finally, we add the skip connection in the transform layer to enhance the information exchange of the feature channels and avoid the gradient vanishing problem to improve image resolution. Assembling predicted patches to construct a whole reflectivity image is a key step in the neural-network-based LSM. We investigate four strategies using different overlapping ratio and window functions to assemble the LSM patches and observe that less overlapping produces more patch-edge artifacts and the partition of unit with a Gaussian window has the best performance. Numerical experiments for synthetic and field data show that the proposed LsmGAN method can produce high-quality images with balanced amplitudes, reduced artifacts and improved resolution.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
共享精神应助伊比采纳,获得10
刚刚
刚刚
852应助小易采纳,获得10
刚刚
舒桐啊发布了新的文献求助10
刚刚
刚刚
刚刚
小赵发布了新的文献求助10
刚刚
skyleon发布了新的文献求助10
1秒前
2秒前
3秒前
上岸上岸2发布了新的文献求助10
3秒前
哭泣冬瓜完成签到,获得积分20
3秒前
4秒前
曹大壮发布了新的文献求助10
4秒前
4秒前
闪闪发光旭少完成签到,获得积分10
4秒前
4秒前
Jasper应助啊哦采纳,获得10
4秒前
MEEW完成签到,获得积分20
5秒前
5秒前
guuuu发布了新的文献求助10
5秒前
5秒前
zhuxiansheng发布了新的文献求助10
6秒前
6秒前
李木槿发布了新的文献求助20
6秒前
marshyyy发布了新的文献求助10
6秒前
矮小的笑槐完成签到,获得积分10
7秒前
7秒前
正直惜海完成签到,获得积分10
7秒前
在水一方应助xixi采纳,获得10
7秒前
7秒前
迷路吐司完成签到,获得积分10
8秒前
9秒前
噜噜噜完成签到 ,获得积分10
9秒前
9秒前
sj发布了新的文献求助10
9秒前
JIN发布了新的文献求助10
10秒前
云水别行客完成签到,获得积分10
10秒前
伊比完成签到,获得积分20
10秒前
西门追命完成签到,获得积分10
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
日本現代怪異事典 副読本 700
Concise Introduction to Heritage Studies 650
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 650
Machine Learning for Asset Management and Pricing 600
Numerical analysis of the coupled atmosphere-ocean models (CAO II). II 600
Models for the coupled atmosphere and ocean 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7380407
求助须知:如何正确求助?哪些是违规求助? 8988010
关于积分的说明 19116893
捐赠科研通 7020072
什么是DOI,文献DOI怎么找? 3226790
关于科研通互助平台的介绍 2390030
邀请新用户注册赠送积分活动 2207613