Abstract

Least-squares reverse-time migration (LSRTM) formulates reverse-time migration (RTM) in the least-squares inversion framework to obtain the optimal reflectivity image. It can generate images with more accurate amplitudes, higher resolution, and fewer artifacts than RTM. However, three problems still exist: (1) inversion can be dominated by strong events in the residual; (2) low-wavenumber artifacts in the gradient affect convergence speed and imaging results; (3) high-wavenumber noise is also amplified as iteration increases. To solve these three problems, we have improved LSRTM: firstly, we use Huber-norm as the objective function to emphasize the weak reflectors during the inversion; secondly, we adapt the de-primary imaging condition to remove the low-wavenumber artifacts above strong reflectors as well as the false high-wavenumber reflectors in the gradient; thirdly, we apply the L 1 -norm sparse constraint in the curvelet-domain as the regularization term to suppress the high-wavenumber migration noise. As the new inversion objective function contains the non-smooth L 1 -norm, we use a modified iterative soft thresholding (IST) method to update along the Polak-Ribière conjugate-gradient direction by using a preconditioned non-linear conjugate-gradient (PNCG) method. The numerical examples, especially the Sigsbee2A model, demonstrate that the Huber inversion-based RTM can generate high-quality images by mitigating migration artifacts and improving the contribution of weak reflection events.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.