SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Time vs Depth Migration

pooky avatar
pooky
18 diapositives · 782 Views · Sep 09, 2014

Time vs Depth Migration. CMP Gather. CMP Gather. time. time. Depth Migration. Time Migration. Insensitive to v(z) model. Sensitive to v(z) model. Incoherent summation if guess is wrong. Time migration uses best fit hyperbola. Coherent summation. Depth migration uses best

Time vs Depth Migration - slide 1
01 / 18Time vs Depth Migration
1 / 17

Télécharger la présentation

Time vs Depth Migration
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Time vs Depth Migration CMP Gather CMP Gather time time Depth Migration Time Migration Insensitive to v(z) model Sensitive to v(z) model Incoherent summation if guess is wrong Time migration uses best fit hyperbola Coherent summation Depth migration uses best guess moveout curve Expensive calculation of t(x,y,z) Easy calculation of v(z) False Structures True Structures

  2. Stacked Section time Depth Migration Time Migration Stacked Section M(x,z) M(x,T) time Low-velocity zone Low-velocity zone False structure

  3.   g g g m(x,z) = 2-way vertical traveltime z 2 2 d (g, 4[(x-g)/c] + (2z/c) ) 2 2 d (g, 4[(x-g)/c] + T ) m(x,z(T)) = 2 2 d (g, 4[(x-g)/c] + T ) M(x,T) = Depth Migration -> Time Migration Depth Migration: Maps data into function(x,z) We know 2z/c=T so Time Migration: Maps data into function(x,T)

  4. g,s 2 2 + [(x-s)/c] + (z/c) ) 2 2 2 2 + d (g,s, [(x-g)/c] + T ) M(x,T) = Prestack Time Migration Depth Migration: Maps data into function(x,z) 2  2 m(x,z) = d (g,s, [(x-g)/c] + (z/c) g,s [(x-s)/c] + T

  5. g c(T) v1 v2 T v3 v4 v5 v6 Time Migration for c(T) Time Migration: Maps data into function(x,T) 2 2 M(x,T) = d (g, 4[(x-g)/c(T)] + T ) More generally, c(T) is a function of T!

  6. g m(x,z) = Loop over x in model Loop over z in model d (g, )  xg MATLAB ZO Depth Migration for ixtrace=1:ntrace; for ixs=istart:iend; for izs=1:nz; r = sqrt(4*(ixtrace*dx-ixs*dx )^2+(2*izs*dx)^2); time = 1 + round( r/c/dt ); mig(ixs,izs) = mig(ixs,izs)/r + data(ixtrace,time); end; end; end; Traveltime Table Traveltime

  7. g 2 2 M(x,T) = Loop over x in model Loop over x in model Loop over z in model Loop over iT in model MATLAB ZO Time Migration d (g, 4[(x-g)/c(T)] + T ) for ixtrace=1:ntrace; for ixs=istart:iend; for izs=1:nz; r = sqrt(4*(ixtrace*dx-ixs*dx )^2+(2*izs*dx)^2); time = 1 + round( r/c/dt ); mig(ixs,izs) = mig(ixs,izs)/r + data(ixtrace,time); end; end; end; for ixtrace=1:ntrace; for ixs=istart:iend; for iT=1:nT; time = sqrt(4*([ixtrace*dx-ixs*dx]/c(iT))^2+(iT*dt)^2); time = 1 + round( time/dt ); mig(ixs,iT) = mig(ixs,iT)/r + data(ixtrace,time); end; end; end; Traveltime Table Traveltime Traveltime Note: c(iT) or c(ixtrace,iT)

  8. g 2 2 M(x,T) = Loop over x in model Loop over iT in model MATLAB ZO Time Migration d (g, 4[(x-g)/c(T)] + T ) for ixtrace=1:ntrace; for ixs=istart:iend; for iT=1:nT; time = sqrt(4*([ixtrace*dx-ixs*dx]/c(iT))^2+(iT*dt)^2); time = 1 + round( time/dt ); mig(ixs,iT) = mig(ixs,iT)/r + data(ixtrace,time); end; end; end; Traveltime Note: c(iT) or c(ixtrace,iT)

  9. Time Migration vs Depth Migration  2 2 M(x,T) = d (g, 4[(x-g)/c] + T ) Insensitive to c(z) model Time migration uses best fit hyperbola

  10. Time Migration vs Depth Migration  2 2 M(x,T) = d (g, 4[(x-g)/c] + T ) Insensitive to v(z) model Time migration uses best fit hyperbola

  11. Time Migration vs Depth Migration  2 2 M(x,T) = d (g, 4[(x-g)/c] + T ) Insensitive to v(z) model Time migration uses best fit hyperbola

  12. Time Migration vs Depth Migration  2 2 M(x,T) = d (g, 4[(x-g)/c] + T ) Insensitive to v(z) model Time migration uses best fit hyperbola

  13. Summary: Time Migration vs Depth Migration  2 2 M(x,T) = d (g, 4[(x-g)/c] + T ) =c/f  M(x,z) = d (g, t ) gx Insensitive to v(z) model Sensitive to v(z) model Incoherent summation if guess is wrong Time migration uses best fit hyperbola Coherent summation Depth migration uses best guess moveout curve Cheaper: no ray tracing More expensive: ray tracing Stretched wavelet thickness Uniform wavelet thickness 1/f Best focusing if v(x,z) correct Best focusing if v(x,z) really wrong Good focusing if v(x,z) smooth

  14. Conclusions • Depth Migration in Deep GOM is only Way to Go if V(x,y,z) Correct • Therefore, spend time to get v(x,y,z) Correct: Tomography, MVA, Waveform Inversion

  15. NMO Velocity Analysis  2 2 M(x,T) = d (g, 4[(x-g)/c] + T ) CMP C(T) T Time x c

  16. Nyquist Sampling Frequency & Aliasing Data Aliasing Problem Dt > T/2 Aliasing Solution Low-pass filtering data Fancy Interpolation Finer time spacing digital signal High freq. masqerade as low freq.

  17. Migration Aliasing 2D dot product of migration Operator and d(g,t) Data Aliasing Problem Dx > lx/2 Aliasing Solution Low-pass filtering data Fancy Interpolation Finer rec-src spacing No data aliasing: (dx/dt)min Tmin/2 > Dx lx/2

  18. Operator Aliasing (m(x)=dot product data by mig. Operator) 2D dot product of migration Operator and d(g,t) (dx/dt)min Tmin/2 > Dx