previous up next print clean
Next: MIGRATION WITH VELOCITY ESTIMATION Up: STACKING AND VELOCITY ANALYSIS Previous: Decomposing a gather by

Reflected head waves on sections

It is common for an interpreter looking at a stacked section to identify a reflected head wave. Experimentally it is just a hyperbolic asymptote seen in (y,t)-space. Theoretically, it is a ray that moves away from a source along a horizontal interface until it encounters an irregularity, a fault perhaps, from which it reflects and returns toward the source. Reflected head waves are sometimes called reflected refractions. This event provides an easy velocity estimate, namely, $v\ =\ 2\,dy/dt$.From a processing point of view, such a velocity measurement is unexpected, because automatic processing extracts all velocity information in offset space, a space which many interpreters prefer to leave inside the computer. Of course, for a reflected head wave to be identified, a special geological circumstance must be present--a scatterer strong enough to have its hyperbolic asymptote visible. The point scatterer must also be strong enough to get through the typical suppression effects of shot and geophone patterns and CDP stacking. The most highly suppressed events, water velocity and ground roll, are just those whose velocities are most often apparent on stacked sections. (Recall Larner's streaks).

Velocity estimates made from reflections are averages of all the layers above the reflection point. To get depth resolution, it is necessary to subtract velocity estimates of different depth levels. Because of the subtraction, accuracy is lost. So with reflected waves, there is naturally a trade-off between accuracy and depth resolution. On the other hand, velocity estimates from head waves naturally have a high resolution in depth.

Processing seems to ignore or discriminate against the backscattered head wave, yet it is often seen and used. There must be an explanation. Perhaps there is also a latent opportunity. From a theoretical point of view, Clayton's cosines showed that at wide angles the velocity and dip sensitivity of midpoint and offset are exchanged. At late times another factor becomes significant: the aperture of a cable length can be much less than the width of a migration hyperbola. So, although it is easy to find an asymptote in midpoint space, there is little time shift at the end of the cable in offset space.

What processing could take advantage of lateral reflectivity and could enhance, instead of suppress, our ability to determine velocity in this way? Start by stacking at a high velocity. Then use the idea that at any depth z, the power spectrum of the data $U ( \omega , k_y )$ should have a cutoff at the evanescent stepout $p ( z )\ =\ $$k_y / \omega\ =\ $1 / v ( z ). This would show up in a plot of the power spectrum $ U^{{{\rm }} * \,} U$, or better yet of the dip spectrum, as a function of depth. Perhaps it would be still better to visually inspect the seismic section itself after filtering in dip space about the expected velocity.

The wave-extrapolation equation is an all-pass filter, so why does the power spectrum change with depth? It changes because at any depth z it is necessary to exclude all the seismic data before t=0. This data should be zeroed before computing the dip spectrum. The procedure is depicted in Figure 9.

 
specz
specz
Figure 9
The dip-spectrum method of velocity determination. To find the velocity at any depth, seek the steepest dip on the section at that depth. On the left, at the earth's surface, you see the surface ground roll. In frames B and C the slowest events are the asymptotes of successively faster hyperbolas.


view

To my knowledge this method has never been tried. I believe it is worth some serious testing. Even in the most layered of geological regions there are always faults and irregularities to illuminate the full available spectrum. Difficulty is unlikely to come from weak signals. More probably, the potential for difficulty lies in near-surface velocity irregularity.

EXERCISES:

  1. Assume that the data P(y,h,t) is constant with midpoint y. Given a common-midpoint gather P(h,t,z=0), define a Stolt-type integral transformation from P(h,t,z=0) to P(h=0,t,z) based on the double-square-root equation:

    \begin{displaymath}
{\partial \ \over \partial z} \ P\ \eq \ 
-\,i\ {\omega \ove...
 ...ft[ \sqrt{1\ -\ (Y+H)^2}\ +\ 
\sqrt{1\ -\ (Y-H)^2} \ \right]\ P\end{displaymath}

    As with Stolt migration, your answer should be expressed as a 2-D inverse Fourier transform.
  2. Start with a CDP gather u(h,t) defined (by reciprocity) at both positive and negative values of h. Describe the effect of the following operations: Fourier transform to $U( k_h , \omega )$;multiply by $1\ +\ \sgn( \omega ) \, \sgn( k_h )$;transform back to (h,t)-space.

 
exer
exer
Figure 10
What is this?


view


previous up next print clean
Next: MIGRATION WITH VELOCITY ESTIMATION Up: STACKING AND VELOCITY ANALYSIS Previous: Decomposing a gather by
Stanford Exploration Project
10/31/1997