Prestack Migration

h h

S O M G

CMP equation:

R 4h 2 cos2 
t 2  to2 
N v2
 2 MN
where to 
v

 Stack velocity is dip-dependent.

 NMO + stack does not preserve events with conflicting dips.

Dip-moveout corrections (DMO) Prestack migration

CMP gather with conflicting dips

CMP gather velocity spectrum after NMO

area of
conflicting
dips

multiples

(Yilmaz, 2001)

1
 Dip-MoveOut correction (DMO)
 DMO is applied to NMO corrected prestack data to preserve conflicting dips.
 The result of DMO is a stack section that better approximates a zero-offset section.
 Conventional poststack migration can be applied to a DMO corrected stack section.

Salt dome
stack after NMO stack after NMO + DMO

(Yilmaz, 2001)

Dip-MoveOut correction (DMO)

poststack migration after NMO poststack migration after NMO + DMO

(Yilmaz, 2001)

2
 Prestack Migration
Poststack migration Prestack migration

(Yilmaz, 2001)

Prestack Migration
h h

S P O M G
xm xd xn x

CMP equation:

R 4h 2 cos2 
t 2  to2 
N v2
 2 MN
where to 
xm xd xn x
v
2 PR
tm  2OR 4h 2
td 
v
v tn
t 2  tn2 
mig dmo v2
2 MN
to 
v
prestack mig nmo
SR  RG
t t
v

3
 Prestack Migration

midpoint

Common-offset section
t

time

h h

S M G x

Ellipse with foci in S and G

A reflection at time t can be produced by any point R for which: SR  RG  vt

Prestack Migration
h h

S M G
[0,0] x

[x,z] R
Ellipse with foci in S and G
z

A reflection at time t can be produced by any point R for which: SR  RG  vt

Assuming x=0 in midpoint M, the ellipse equation is:

( x  h ) 2  z 2  ( x  h ) 2  z 2  vt circle in x,z when h=0

vt m
If tm is the traveltime after migration z
2
The prestack migration of a
vt m 2 vt
( x  h)2  ( )  ( x  h ) 2  ( m ) 2  vt
common-offset section is obtained
by semi-elliptical superposition
2 2

4
 Prestack Migration
h h hh hh hh hh h h

S S S M S M S GM SGM GM GM G G
x

midpoint

Common-offset
section

time

diffraction generated by a scattering point

Prestack Migration
h h

S M G
[0,0] [x,0] x

[0,z]

A scattering point in [0,z] generates a diffraction that in a common-offset section is described by:

( x  h ) 2  z 2  ( x  h ) 2  z 2  vt hyperbola in x,t when h=0

where x is the midpoint horizontal position.

vt m
If tm is the traveltime after migration z
2
The prestack migration of a
vt m 2 vt
common-offset section is obtained
by diffraction summation ( x  h)2  ( )  ( x  h ) 2  ( m ) 2  vt
2 2

5
 One-step Prestack Migration
For any h,
vtm 2 vt
sum along the diffraction pattern ( x  h) 2  ( )  ( x  h)2  ( m )2  vt
x 2 2
and sum the result in [tm , 0, 0]

t h tm

t h

Two-step Prestack Migration

1) For any h,
vtm 2 vt
sum along the diffraction pattern ( x  h) 2  ( )  ( x  h)2  ( m )2  vt
x and save the result in the 2 2
diffraction apex
vtm 2
x at x=0 2 h2  ( )  vt
2

4h2
t 2  tm2  hyperbola
t tm
v2
h
x
t h

tm

t h

2) Sum along the hyperbola

and save the result in [tm , 0, 0]

6
 Velocity analysis
CMP gathers NMO PSM Common offset sections
constant
constant velocity
velocity prestack
NMO migration

CVG CVS CVMG CVMP

(constant vel. gathers) (constant vel. stack) (const. vel. mig. gathers) (const. vel. mig. panels)

velocity velocity
function function

prestack
NMO
migration

x Migration velocity analysis CVMG

x (const. vel. mig. gathers)

t
t
h
h x

t
h

constant
velocity
prestack
migration

7
Migration velocity analysis

(Yilmaz, 2001)

Migration velocity analysis

(Yilmaz, 2001)

8
Migration velocity analysis

(Yilmaz, 2001)

Migration velocity analysis

(Yilmaz, 2001)

9
 Migration velocity analysis
Prestack time migration

(Yilmaz, 2001)

Migration velocity analysis

CVMP
x x
(const. vel. mig. panels)

t
h t

t
constant
velocity
prestack
migration
t

10
Migration velocity analysis

(Yilmaz, 2001)

Migration velocity analysis

(Yilmaz, 2001)
constant velocity migration panels

11
Migration velocity analysis

(Yilmaz, 2001)

Migration velocity analysis

Prestack time migration

(Yilmaz, 2001)

12
Processing sequence
Demultiplex
Vibroseis correlation
Geometry input
Bandpass Filter
Decimation/Interpolation
FK filter
Gain
Deconvolution (wavelet shaping)
Static correction

CMP sorting CO sorting

Velocity analysis Pre-stack Velocity analysis
NMO corrections Pre-stack migration (first step)
Residual static corrections CMP Velocity analysis
Inverse NMO Pre-stack migration (second step)
Velocity analysis Deconvolution (multiple suppression)
NMO corrections TVF
Mute
Stack
Deconvolution (multiple suppression)
TVF
Migration

Computing Power

1.000.000 shots x 3.000 channels = 3 Giga-traces

3D survey e.g. 1 trace = 4 s / 1 ms = 4.000 samples
Data storage = 3 Gt x 4.000 x 2byte = 24 Terabyte

13
Computing Power

Computing power demand PC clusters

(rate of a factor of 2 per year) (thousands of CPUs)

Note
1 PC processor can perform 100 Gflops (2010)
1 GPU can perform 500-1000 Gflops (2010)

Computing Power

3 petaflops

ENI Green data centre in Pavia (launched in 2013)

1500 dual CPU nodes (= 24000 cores)

1300 GPUs (= 20800 cores)
5 petabyte disk capacity

2003 2006 2009 2012 2015

14
 Computing Power

18.6 petaflops

ENI Green data centre in Pavia (powered in 2018)

1600 dual 24 core CPU nodes (= 76800 cores)

2 GPU accellerators
3 petaflops 15 petabyte disk capacity

Note
2003 2006 2009 2012 2015 2018
1 PC processor can perform 300 Gflops (2018)
1 GPU can perform 6 Tflops (2018)

Computing Power

DUG (DownUnderGeosolutions) supercomputer in Houston

(operational in February 2019)

40.000 servers in 720 tanks filled with dielectric cooling fluid

delivering 250 petaflops
(superior to the current most powerful computer at Oak Ridge National Lab in Tennessee delivering 122 petaflops)

15