Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Similar presentations


Presentation on theme: "Fast 3D Least-squares Migration with a Deblurring Filter Wei Dai."— Presentation transcript:

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

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

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

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

5 Conjugate Gradient vs Steepest Descent

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

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

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

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

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

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

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

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

14 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.

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

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

17 Fig. 4. Standard migration result. The same slices as previous figure are shown here. Standard migration image X (m) 0 1500 Y (m) 0 0.02 -0.12 X (m)0 1500 Z (m) 0 0.2 -0.1

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

19 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) 0 0.5 -0.3 Standard migration image vs Deblurred image

20 X (m)01500 Y (m) 0 0.02 -0.12 X (m) 0 1500 Y (m) 0 0.1 -0.6 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).

21 Fig. 8. Standard migration image and deblurred image for the 3D U model (vertical slice y=500m) X (m) 0 1500 Z (m) 0 0.2 -0.1 X (m)01500 Z (m) 0 0.6 -0.4 Standard migration image vs Deblurred image

22 Fig. 9. Standard migration image and deblurred image for the 3D U model (vertical slice x=550m) Y (m) 0 1500 Z (m) 0 0.25 -0.15 Y (m)01500 Z (m) 0 0.5 -0.5 Standard migration image vs Deblurred image

23 Fig. 10. Residual curves for SD, PSD, CG and PCG. Iteration number0 30 0.7 Data residual 0 Residual curves

24 Fig. 11. Image after 3 iterations of PCG. 0.1 -0.8 X (m)01500 Y (m) 0 X (m)01500 Z (m) 0 0.8 -0.6 Three iterations result

25 Fig. 12. Image after 5 iterations of PCG. 0 X (m)01500 Y (m) 0 X (m)0 1500 Z (m) 0 1 -0.8 Five iterations result

26 0 X (m)01500 Y (m) 0 X (m)0 1500 Z (m) 0 1 -0.8 Fig. 13. Image after 10 iterations of PCG. Ten iterations result

27 0 X (m) 0 1500 Y (m) 0 X (m) 0 1500 Z (m) 0 0 -0.9 Fig. 14. 30 iterations results of PCG and CG (horizontal slices). PCG vs CG

28 1 X (m) 0 1500 Z (m) 0 X (m)0 1500 Z (m) 0 0.8 -0.8 Fig. 15. 30 iterations result of PCG and CG (vertical slices). PCG vs CG

29 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.


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

Similar presentations


Ads by Google