scholarly journals Migration of viscoacoustic data using acoustic reverse time migration with hybrid deblurring filters

Geophysics ◽  
2019 ◽  
Vol 84 (3) ◽  
pp. S127-S136 ◽  
Author(s):  
Yuqing Chen ◽  
Bowen Guo ◽  
Gerard T. Schuster
Keyword(s):  
Least Squares ◽  
Computation Time ◽  
Phase Distortion ◽  
Storage Space ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Image Domain ◽  
Time Migration ◽  
The Cost ◽  
Least Squares Migration

Viscoacoustic migration can significantly compensate for the amplitude loss and phase distortion in migration images computed from highly attenuated data. However, solving the viscoacoustic wave equation requires a significant amount of storage space and computation time, especially for least-squares migration methods. To mitigate this problem, we used acoustic reverse time migration (RTM) instead of viscoacoustic migration to migrate the viscoacoustic data and then we correct the amplitude and phase distortion by hybrid deblurring filters in the image domain. Numerical tests on synthetic and field data demonstrate that acoustic RTM combined with hybrid deblurring filters can compensate for the attenuation effects and produce images with high resolution and balanced amplitudes. This procedure requires less than one-third of the storage space and is [Formula: see text] times faster compared with the viscoacoustic migration, but at the cost of mildly reduced accuracy. Here, [Formula: see text] represents the number of iterations used for least-squares migration method. This method can be extended to 3D migration at even a greater cost saving.

Elastic least-squares reverse time migration in the image domain

2017 ◽  
Author(s):  
Bruno Pereira-Dias ◽  
André Bulcão ◽  
Djalma Soares Filho ◽  
Roberto Dias ◽  
Felipe Duarte ◽  
...  
Keyword(s):  
Least Squares ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Image Domain ◽  
Time Migration

An exact adjoint operation pair in time extrapolation and its application in least-squares reverse-time migration

Geophysics ◽  
2009 ◽  
Vol 74 (5) ◽  
pp. H27-H33 ◽  
Author(s):  
Jun Ji
Keyword(s):  
Least Squares ◽  
Adjoint Operator ◽  
Synthetic Data ◽  
Forward Modeling ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Time Migration ◽  
Product Test ◽  
Least Squares Migration ◽  
Time Extrapolation

To reduce the migration artifacts arising from incomplete data or inaccurate operators instead of migrating data with the adjoint of the forward-modeling operator, a least-squares migration often is considered. Least-squares migration requires a forward-modeling operator and its adjoint. In a derivation of the mathematically correct adjoint operator to a given forward-time-extrapolation modeling operator, the exact adjoint of the derived operator is obtained by formulating an explicit matrix equation for the forward operation and transposing it. The programs that implement the exact adjoint operator pair are verified by the dot-product test. The derived exact adjoint operator turns out to differ from the conventional reverse-time-migration (RTM) operator, an implementation of wavefield extrapolation backward in time. Examples with synthetic data show that migration using the exact adjoint operator gives similar results for a conventional RTM operator and that least-squares RTM is quite successful in reducing most migration artifacts. The least-squares solution using the exact adjoint pair produces a model that fits the data better than one using a conventional RTM operator pair.

Mini-batch Least-Squares Reverse Time Migration In A Deep Learning Framework

Geophysics ◽  
2020 ◽  
pp. 1-61
Author(s):  
Janaki Vamaraju ◽  
Jeremy Vila ◽  
Mauricio Araya-Polo ◽  
Debanjan Datta ◽  
Mohamed Sidahmed ◽  
...  
Keyword(s):  
Deep Learning ◽  
Least Squares ◽  
Spatial Resolution ◽  
Data Science ◽  
Computational Cost ◽  
Computation Time ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Learning Framework ◽  
Time Migration

Migration techniques are an integral part of seismic imaging workflows. Least-squares reverse time migration (LSRTM) overcomes some of the shortcomings of conventional migration algorithms by compensating for illumination and removing sampling artifacts to increase spatial resolution. However, the computational cost associated with iterative LSRTM is high and convergence can be slow in complex media. We implement pre-stack LSRTM in a deep learning framework and adopt strategies from the data science domain to accelerate convergence. The proposed hybrid framework leverages the existing physics-based models and machine learning optimizers to achieve better and cheaper solutions. Using a time-domain formulation, we show that mini-batch gradients can reduce the computation cost by using a subset of total shots for each iteration. Mini-batch approach does not only reduce source cross-talk but also is less memory intensive. Combining mini-batch gradients with deep learning optimizers and loss functions can improve the efficiency of LSRTM. Deep learning optimizers such as the adaptive moment estimation are generally well suited for noisy and sparse data. We compare different optimizers and demonstrate their efficacy in mitigating migration artifacts. To accelerate the inversion, we adopt the regularised Huber loss function in conjunction. We apply these techniques to 2D Marmousi and 3D SEG/EAGE salt models and show improvements over conventional LSRTM baselines. The proposed approach achieves higher spatial resolution in less computation time measured by various qualitative and quantitative evaluation metrics.

Improved subsalt images with least-squares reverse time migration

2017 ◽  
Vol 5 (3) ◽  
pp. SN25-SN32 ◽  
Author(s):  
Ping Wang ◽  
Shouting Huang ◽  
Ming Wang
Keyword(s):  
Least Squares ◽  
Field Data ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Lateral Velocity ◽  
Image Domain ◽  
Time Migration ◽  
Iterative Inversion ◽  
Velocity Variations ◽  
Subsalt Imaging

Complex overburdens often distort reservoir images in terms of structural positioning, stratigraphic resolution, and amplitude fidelity. One prime example of a complex overburden is in the deepwater Gulf of Mexico, where thick and irregular layers of remobilized (i.e., allochthonous) salt are situated above prospective reservoir intervals. The highly variant salt layers create large lateral velocity variations that distort wave propagation and the illumination of deeper reservoir targets. In subsalt imaging, tools such as reflection tomography, full-waveform inversion, and detailed salt interpretation are needed to derive a high-resolution velocity model that captures the lateral velocity variations. Once a velocity field is obtained, reverse time migration (RTM) can be applied to restore structural positioning of events below and around the salt. However, RTM by nature is unable to fully recover the reflectivity for desired amplitudes and resolution. This shortcoming is well-recognized by the imaging community, and it has propelled the emergence of least-squares RTM (LSRTM) in recent years. We have investigated how current LSRTM methods perform on subsalt images. First, we compared the formulation of data-domain versus image-domain least-squares migration, as well as methods using single-iteration approximation versus iterative inversion. Then, we examined the resulting subsalt images of several LSRTM methods applied on the synthetic and field data. Among our tests, we found that image-domain single-iteration LSRTM methods, including an extension of an approximate inverse Hessian method in the curvelet domain, not only compensated for amplitude loss due to poor illumination caused by complex salt bodies, but it also produced subsalt images with fewer migration artifacts in the field data. In contrast, an iterative inversion method showed its potential for broadening the bandwidth in the subsalt, but it was less effective in reducing migration artifacts and noise. Based on our understanding, we evaluated the current state of LSRTM for subsalt imaging.

3D acoustic least-squares reverse time migration using the energy norm

Geophysics ◽  
2018 ◽  
Vol 83 (3) ◽  
pp. S261-S270 ◽  
Author(s):  
Daniel Rocha ◽  
Paul Sava ◽  
Antoine Guitton
Keyword(s):  
Least Squares ◽  
Convergence Rates ◽  
Energy Norm ◽  
Ocean Bottom ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Data Set ◽  
Image Domain ◽  
Time Migration ◽  
And Migration

We have developed a least-squares reverse time migration (LSRTM) method that uses an energy-based imaging condition to obtain faster convergence rates when compared with similar methods based on conventional imaging conditions. To achieve our goal, we also define a linearized modeling operator that is the proper adjoint of the energy migration operator. Our modeling and migration operators use spatial and temporal derivatives that attenuate imaging artifacts and deliver a better representation of the reflectivity and scattered wavefields. We applied the method to two Gulf of Mexico field data sets: a 2D towed-streamer benchmark data set and a 3D ocean-bottom node data set. We found LSRTM resolution improvement relative to RTM images, as well as the superior convergence rate obtained by the linearized modeling and migration operators based on the energy norm, coupled with inversion preconditioning using image-domain nonstationary matching filters.

Fast least-squares reverse time migration via a superposition of Kronecker products

Geophysics ◽  
2020 ◽  
Vol 85 (2) ◽  
pp. S115-S134
Author(s):  
Wenlei Gao ◽  
Gian Matharu ◽  
Mauricio D. Sacchi
Keyword(s):  
Least Squares ◽  
Computational Cost ◽  
Low Rank ◽  
Fast Method ◽  
Kronecker Products ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Major Drawback ◽  
Image Domain ◽  
Time Migration

Least-squares reverse time migration (LSRTM) has become increasingly popular for complex wavefield imaging due to its ability to equalize image amplitudes, attenuate migration artifacts, handle incomplete and noisy data, and improve spatial resolution. The major drawback of LSRTM is the considerable computational cost incurred by performing migration/demigration at each iteration of the optimization. To ameliorate the computational cost, we introduced a fast method to solve the LSRTM problem in the image domain. Our method is based on a new factorization that approximates the Hessian using a superposition of Kronecker products. The Kronecker factors are small matrices relative to the size of the Hessian. Crucially, the factorization is able to honor the characteristic block-band structure of the Hessian. We have developed a computationally efficient algorithm to estimate the Kronecker factors via low-rank matrix completion. The completion algorithm uses only a small percentage of preferentially sampled elements of the Hessian matrix. Element sampling requires computation of the source and receiver Green’s functions but avoids explicitly constructing the entire Hessian. Our Kronecker-based factorization leads to an imaging technique that we name Kronecker-LSRTM (KLSRTM). The iterative solution of the image-domain KLSRTM is fast because we replace computationally expensive migration/demigration operations with fast matrix multiplications involving small matrices. We first validate the efficacy of our method by explicitly computing the Hessian for a small problem. Subsequent 2D numerical tests compare LSRTM with KLSRTM for several benchmark models. We observe that KLSRTM achieves near-identical images to LSRTM at a significantly reduced computational cost (approximately 5–15× faster); however, KLSRTM has an increased, yet manageable, memory cost.

Fast image-domain target-oriented least-squares reverse time migration

Geophysics ◽  
2018 ◽  
Vol 83 (6) ◽  
pp. A81-A86 ◽  
Author(s):  
Zeyu Zhao ◽  
Mrinal K. Sen
Keyword(s):  
Plane Wave ◽  
Least Squares ◽  
Large Scale ◽  
Green's Functions ◽  
Green’S Functions ◽  
Hessian Matrix ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Image Domain ◽  
Time Migration

We have developed a fast image-domain target-oriented least-squares reverse time migration (LSRTM) method based on applying the inverse or pseudoinverse of a target-oriented Hessian matrix to a migrated image. The image and the target-oriented Hessian matrix are constructed using plane-wave Green’s functions that are computed by solving the two-way wave equation. Because the number of required plane-wave Green’s functions is small, the proposed method is highly efficient. We exploit the sparsity of the Hessian matrix by computing only a couple of off-diagonal terms for the target-oriented Hessian, which further improves the computational efficiency. We examined the proposed LSRTM method using the 2D Marmousi model. We demonstrated that our method correctly recovers the reflectivity model, and the retrieved results have more balanced illumination and higher spatial resolution than traditional images. Because of the low cost of computing the target-oriented Hessian matrix, the proposed method has the potential to be applied to large-scale problems.

Least-squares migration with primary- and multiple-guided weighting matrices

Geophysics ◽  
2019 ◽  
Vol 84 (3) ◽  
pp. S171-S185 ◽  
Author(s):  
Chuang Li ◽  
Jianping Huang ◽  
Zhenchun Li ◽  
Han Yu ◽  
Rongrong Wang
Keyword(s):  
Free Surface ◽  
Least Squares ◽  
Seismic Data ◽  
Synthetic Data ◽  
Velocity Model ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Multiple Reflections ◽  
Time Migration ◽  
Least Squares Migration

Least-squares migration (LSM) of seismic data is supposed to produce images of subsurface structures with better quality than standard migration if we have an accurate migration velocity model. However, LSM suffers from data mismatch problems and migration artifacts when noise pollutes the recorded profiles. This study has developed a reweighted least-squares reverse time migration (RWLSRTM) method to overcome the problems caused by such noise. We first verify that spiky noise and free-surface multiples lead to the mismatch problems and should be eliminated from the data residual. The primary- and multiple-guided weighting matrices are then derived for RWLSRTM to reduce the noise in the data residual. The weighting matrices impose constraints on the data residual such that spiky noise and free-surface multiple reflections are reduced whereas primary reflections are preserved. The weights for spiky noise and multiple reflections are controlled by a dynamic threshold parameter decreasing with iterations for better results. Finally, we use an iteratively reweighted least-squares algorithm to minimize the weighted data residual. We conduct numerical tests using the synthetic data and compared the results of this method with the results of standard LSRTM. The results suggest that RWLSRTM is more robust than standard LSRTM when the seismic data contain spiky noise and multiple reflections. Moreover, our method not only suppresses the migration artifacts, but it also accelerates the convergence.

Least-squares migration of multisource data with a deblurring filter

Geophysics ◽  
2011 ◽  
Vol 76 (5) ◽  
pp. R135-R146 ◽  
Author(s):  
Wei Dai ◽  
Xin Wang ◽  
Gerard T. Schuster
Keyword(s):  
Wave Equation ◽  
Least Squares ◽  
Computational Efficiency ◽  
Computational Cost ◽  
Processing Technique ◽  
Reverse Time ◽  
Reverse Time Migration ◽  
Time Migration ◽  
Migration Method ◽  
Least Squares Migration

Least-squares migration (LSM) has been shown to be able to produce high-quality migration images, but its computational cost is considered to be too high for practical imaging. We have developed a multisource least-squares migration algorithm (MLSM) to increase the computational efficiency by using the blended sources processing technique. To expedite convergence, a multisource deblurring filter is used as a preconditioner to reduce the data residual. This MLSM algorithm is applicable with Kirchhoff migration, wave-equation migration, or reverse time migration, and the gain in computational efficiency depends on the choice of migration method. Numerical results with Kirchhoff LSM on the 2D SEG/EAGE salt model show that an accurate image is obtained by migrating a supergather of 320 phase-encoded shots. When the encoding functions are the same for every iteration, the input/output cost of MLSM is reduced by 320 times. Empirical results show that the crosstalk noise introduced by blended sources is more effectively reduced when the encoding functions are changed at every iteration. The analysis of signal-to-noise ratio (S/N) suggests that not too many iterations are needed to enhance the S/N to an acceptable level. Therefore, when implemented with wave-equation migration or reverse time migration methods, the MLSM algorithm can be more efficient than the conventional migration method.

Sign in / Sign up

Export Citation Format

Share Document