Fast 3D Least-squares Migration with a Deblurring Filter Wei Dai.

Slides:



Advertisements
Similar presentations
Curved Trajectories towards Local Minimum of a Function Al Jimenez Mathematics Department California Polytechnic State University San Luis Obispo, CA
Advertisements

Mathematical Models Chapter 2
Optimization.
Multi-source Least-squares Migration with Topography Dongliang Zhang and Gerard Schuster King Abdullah University of Science and Technology.
Multi-source Least Squares Migration and Waveform Inversion
1 Numerical Solvers for BVPs By Dong Xu State Key Lab of CAD&CG, ZJU.
Sensitivity kernels for finite-frequency signals: Applications in migration velocity updating and tomography Xiao-Bi Xie University of California at Santa.
Steepest Decent and Conjugate Gradients (CG). Solving of the linear equation system.
Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.
Jonathan Richard Shewchuk Reading Group Presention By David Cline
1 L-BFGS and Delayed Dynamical Systems Approach for Unconstrained Optimization Xiaohui XIE Supervisor: Dr. Hon Wah TAM.
Numerical Optimization
Lecture 2 Linear Variational Problems (Part II). Conjugate Gradient Algorithms for Linear Variational Problems in Hilbert Spaces 1.Introduction. Synopsis.
1 L-BFGS and Delayed Dynamical Systems Approach for Unconstrained Optimization Xiaohui XIE Supervisor: Dr. Hon Wah TAM.
12 1 Variations on Backpropagation Variations Heuristic Modifications –Momentum –Variable Learning Rate Standard Numerical Optimization –Conjugate.
Advanced Topics in Optimization
Monica Garika Chandana Guduru. METHODS TO SOLVE LINEAR SYSTEMS Direct methods Gaussian elimination method LU method for factorization Simplex method of.
PETE 603 Lecture Session #29 Thursday, 7/29/ Iterative Solution Methods Older methods, such as PSOR, and LSOR require user supplied iteration.

ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
UNCONSTRAINED MULTIVARIABLE
Multisource Least-squares Reverse Time Migration Wei Dai.
Multisource Least-Squares Migration Multisource Least-Squares Migration of Marine Streamer Data with Frequency-Division Encoding Yunsong Huang and Gerard.
1 A Domain Decomposition Analysis of a Nonlinear Magnetostatic Problem with 100 Million Degrees of Freedom H.KANAYAMA *, M.Ogino *, S.Sugimoto ** and J.Zhao.
Automatic Wave Equation Migration Velocity Analysis Peng Shen, William. W. Symes HGRG, Total E&P CAAM, Rice University This work supervised by Dr. Henri.
Fast Thermal Analysis on GPU for 3D-ICs with Integrated Microchannel Cooling Zhuo Fen and Peng Li Department of Electrical and Computer Engineering, {Michigan.
Qualifier Exam in HPC February 10 th, Quasi-Newton methods Alexandru Cioaca.
One to One Functions A function is one to one if each y value is associated with only one x value. A one to one function passes both the vertical and horizontal.
Introduction to Level Set Methods: Part II
On implicit-factorization block preconditioners Sue Dollar 1,2, Nick Gould 3, Wil Schilders 2,4 and Andy Wathen 1 1 Oxford University Computing Laboratory,
Data Modeling Patrice Koehl Department of Biological Sciences National University of Singapore
Lecture 13. Geometry Optimization References Computational chemistry: Introduction to the theory and applications of molecular and quantum mechanics, E.
4.3 Logarithmic Functions Logarithms Logarithmic Equations
Multiples Waveform Inversion
Migration Velocity Analysis 01. Outline  Motivation Estimate a more accurate velocity model for migration Tomographic migration velocity analysis 02.
Variations on Backpropagation.
Multisource Least-squares Migration of Marine Data Xin Wang & Gerard Schuster Nov 7, 2012.
Signal Analysis and Imaging Group Department of Physics University of Alberta Regularized Migration/Inversion Henning Kuehl (Shell Canada) Mauricio Sacchi.
Fast Least Squares Migration with a Deblurring Filter Naoshi Aoki Feb. 5,
Migration Velocity Analysis of Multi-source Data Xin Wang January 7,
Least Squares Natural Migration (LSNM) of Surface Waves Zhaolun Liu
Fast Least Squares Migration with a Deblurring Filter 30 October 2008 Naoshi Aoki 1.
Papia Nandi-Dimitrova Education Rice University, PhD Geophysics 2012-Present University of Wyoming, MS Geophysics2005 University of Illinois, Urbana-Champaign.
HOCIGs and VOCIGs via Two-way Reverse Time Migration
Fast Multisource Least Squares Migration of 3D Marine Data with
A Parallel Hierarchical Solver for the Poisson Equation
Deflated Conjugate Gradient Method
Iterative Non-Linear Optimization Methods
Steepest Descent Optimization
Acceleration Changing velocity (non-uniform) means an acceleration is present Acceleration is the rate of change of the velocity Units are m/s² (SI)
Skeletonized Wave-Equation Surface Wave Dispersion (WD) Inversion
Variations on Backpropagation.
Interferometric Least Squares Migration
Overview of Multisource Phase Encoded Seismic Inversion
Overview of Multisource and Multiscale Seismic Inversion
CS5321 Numerical Optimization
Overview of Multisource and Multiscale Seismic Inversion
Introduction to Scientific Computing II
Introduction to Scientific Computing II
PS, SSP, PSPI, FFD KM SSP PSPI FFD.
Introduction to Scientific Computing II
King Abdullah University of Science and Technology
Integrated high-resolution tomography
Numerical Linear Algebra
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Variations on Backpropagation.
Rewriting Equations Equivalent Equations.
Section 3: Second Order Methods
Wave Equation Dispersion Inversion of Guided P-Waves (WDG)
Presentation transcript:

Fast 3D Least-squares Migration with a Deblurring Filter Wei Dai

Outline ObjectiveObjective Numerical TestsNumerical Tests 3D U model3D U model ConclusionConclusion Preconditioned Conjugate GradientPreconditioned Conjugate Gradient IntroductionIntroduction Theory of Deblurring filterTheory of Deblurring filter

Introduction Standard migration: Least-squares migration: Standard migrationLSM ProsFast, robustHigh resolution images ConsImages of low qualityHigh computation cost Forward modeling:

Conjugate Gradient Misfit functional: Normal equation: Direct solver: Need to invert huge matrix. Iterative solver: Iterative conjugate gradient method:

Conjugate Gradient vs Steepest Descent

Conjugate Gradient Gradient: Step length: Conjugate direction: Update:

Objective: Reduce the iteration numbers required for LSM Proposal: A good preconditioner to accelerate the convergence. Objective

Preconditioned Conjugate Gradient To improve the condition number: Solution: to decompose and solve: By change of variables: Problem: is not symmetric.

Preconditioned Conjugate Gradient Gradient: Step length: Conjugate direction: Update: Problem: Need to calculate

Preconditioned Conjugate Gradient By change of variables: Conjugate direction: Gradient:

Preconditioned Conjugate Gradient Step length: Update: Advantage: only need M. Requirement: M to be SPD.

Reference model : grid model with evenly distributed point scatterers. Theory of the Deblurring Calculate its standard migration image:

Construct an image, which is an approximation of Rewrite in matrix notation so,

Numerical Tests model: 3D U model grid: grid interval: 10m background velocity: 1500 m/s 300 shots and 300 receivers on the surface Recording geometry X (m)01500 Y (m) 0 Fig. 1. Recording geometry. Red stars indicate sources and blue triangles indicate receivers.

3D U model Fig. 2. 3D view of the U model. Courtesy of Naoshi Aoki

3D U model Fig. 3. One horizontal and one vertical slices of the U model. X (m)01500 Y (m) 0 X (m) Z (m) 0

Fig. 4. Standard migration result. The same slices as previous figure are shown here. Standard migration image X (m) Y (m) X (m) Z (m)

Fig. 5. Vertical slice of the reference model and its corresponding standard migration image. Reference model X (m) Z (m) 0 X (m)01500 Z (m) 0

Fig. 6. Standard migration image and deblurred image for the reference model (vertical slices). X (m)01500 Z (m) 0 X (m)01500 Z (m) Standard migration image vs Deblurred image

X (m)01500 Y (m) X (m) Y (m) Standard migration image vs Deblurred image Fig. 7. Standard migration image and deblurred image for the 3D U model (horizontal slice along 2 nd reflectivity layer).

Fig. 8. Standard migration image and deblurred image for the 3D U model (vertical slice y=500m) X (m) Z (m) X (m)01500 Z (m) Standard migration image vs Deblurred image

Fig. 9. Standard migration image and deblurred image for the 3D U model (vertical slice x=550m) Y (m) Z (m) Y (m)01500 Z (m) Standard migration image vs Deblurred image

Fig. 10. Residual curves for SD, PSD, CG and PCG. Iteration number Data residual 0 Residual curves

Fig. 11. Image after 3 iterations of PCG X (m)01500 Y (m) 0 X (m)01500 Z (m) Three iterations result

Fig. 12. Image after 5 iterations of PCG. 0 X (m)01500 Y (m) 0 X (m) Z (m) Five iterations result

0 X (m)01500 Y (m) 0 X (m) Z (m) Fig. 13. Image after 10 iterations of PCG. Ten iterations result

0 X (m) Y (m) 0 X (m) Z (m) Fig iterations results of PCG and CG (horizontal slices). PCG vs CG

1 X (m) Z (m) 0 X (m) Z (m) Fig iterations result of PCG and CG (vertical slices). PCG vs CG

Conclusions Our deblurring filter is a good approximation to the Hessian inverse. It can improve the standard migration image and reduce its data residual by about 50%. Our deblurring filter as a preconditioner in LSM can speed up convergence rate by several times 3 iterations of PCG are equivalent to 10 iterations of CG.