Inversion of Vertical Seismic Profiles by Iterative Modeling
Inversion of Vertical Seismic Profiles by Iterative Modeling
Pierre A. Grivelet*
924
Inversion of VSP Profiles 925
ui = -Rid, + (1 + R,)u,+,, Despite these drawbacks, the recursion method is a fast way
to obtain a rough estimate of the impedance. Then, to get more
and (2)
out of the data, which is reasonable with a VSP where signal-
di+i = (1 - R,)d, + Riui+ Ir to-noise ratio is generally good, use an iterative method.
PARAMETERIZATION
j S,(t + r)W(t) dt
s W2dt ’
and (c) set S,, 1 = S, - 6 * W and return to step (a). When the
residual error 11S, - I, * W I( is low enough or when the desired
number of events has been found, the process is stopped.
The detection algorithm estimates the impulse response, not
the reflection coefficient series directly. Using its output for a
recursive computation of the impedance would give unrealistic
results due to interbed multiples (e.g., Figure 3) and to the fact
that the algorithm only finds a sequence of locally optimal
solutions. As shown in Figure lc, however, this sequence I is a
good first guess for the reflection coefficient series, since the
locations in time of the actual reflection series should line up
with detected events in the impulse response. A further search
for a global optimum will greatly improve the solution.
GLOBAL MINIMIZATION
J(C) = 11s - I * w 112 Nevertheless, the initial reflection series does have nonzero
coefficients at the right times, among some other artificial ones.
over all possible values of ci . Since I is a polynomial of degree
Figure 2c shows, however, that after 12 iterations the exact
N in (ci), J is a squared polynomial of degree 2N, which implies
impedance profile has been restored. This example shows that
that it is a convex function of C. [A function of one variablef(x)
the detection has found a guesswell-suited to the minimization.
is said to be convex if the line segment drawn between two
If events are detected at the correct times, irrespective of their
points on the graph of the function never lies below the graph.]
amplitudes and the existence of some false events, the mini-
The property of convexity ensures that there are no local
mization still tends to converge to the correct solution.
minima in the function J (Polak, 1971).
The synthetic model for the second example (Figure 3a)
Of the available optimization methods, a gradient method is
consists of a single high-impedance bed within a low-
the natural choice for this problem since gradient methods
impedance medium. The impedance contrast (a ratio of 1 to 4)
avoid matrix inversions and the inherent problems of ill-
is exaggerated in order to give clearly visible multiples. In this
conditioning when dealing with large matrices. The algorithm
case, the initial estimate of the impedance (Figure 3b) contains
used here is the conjugate gradient method. Let VJ be the
artificial steps corresponding to the detection of these multiples.
gradient of J, i.e., the vector of partial derivatives ~J/iTc,. Then,
However, since the global minimization accounts for multiples,
given the initial solution Co for the reflection coefficients (the
these steps progressively disappear with successive iterations,
superscript indicates the iteration number) and two auxiliary
until the exact solution is found by the seventh iteration.
vectors Y” and coo, the conjugate gradient method can be
implemented by the following algorithm:
CONSTRAINTS
dJ
-=-2(S-I*W).
hi
Lg*w>,
where al/&, is a time series. In fact, this time seriesis calculated
in the same way as the impulse response I, using the derivative
of the interface equation (2). Computation of the N derivatives
of J thus involves computation of N synthetic seismograms.
low) in these cases. In real examples, of course, the situation is Equality constraints
different. Even a simple representation of the major events on 1
s of real data requires 50 reflection coefficients or more, and the Given a reflection sequence C corresponding to the im-
nonuniqueness of the problem increases considerably. In such pedance profile A, then
cases, iterative inversion without any a priori knowledge of the
low-frequency trend of the impedance profile often gives bad ci = Ai+t - Ai
results. For example, a generally decreasingprofile can be ob-
A t+lAi’ +
tained in an area where the compaction trend implies increasing Alternatively, given C and impedance of the first layer A,, the
impedances. rest of the impedances are obtained by
Nevertheless, it is possible to invert real VSPs if the inversion
is constrained in a geologically realistic manner. These con- i 1fC.
Ai= A,n 2
straints can come from prior knowledge of the subsurface, such j=l 1 - cj’
It5
1$- 4
(4)
1 - c, p-i 1 + Ci’
time ISI l-I 1 -c;
j=i
0 0.5 1.0
SEISMOGRAM /
25* dJ SJ 1 - C;
_=-_ (74
SC, (7ci FC, 1 - c;
?J* ?J
_=- (7’4
SC, ac,
for i > p.
The minimization is then performed using the same algo-
rithm with this new value of the gradient vector. This procedure
_-
; ____ _. --of----- A is easily generalized to any number of constraints. Each new
equality constraint reduces the number of free variables,
15 --c- thereby speeding up the convergence and, in principle, reducing
I * f f- the nonuniqueness of the solution.
strained layer is forced to lie between A - 6A and A + 6A. This die (S)
can be done using a penalty function. A new “power” function 1.0 1.5 2.0 2.5
1
is defined by adding to J a term which is minimal when the
impedance matches the desired constraint. The type of penalty
function employed here is generally called “an interior penalty
function.” The interested reader can find a good discussion of
this and other penalty function methods in Polak (1971).
A proximity constraint does not reduce the number of free
variables and consequently does not speed up the convergence.
However, it monitors the natural trend of the data by checking
if the resulting impedance value lies in the upper or lower part
of (A - &A, A + &A).
Finally, note that an equality or proximity constraint affects
the solution globally, i.e., both above and below the con-
strained layer. This is easily seen from equation (3), which
indicates that the partial derivative aJ/dc, depends upon the
complete impulse response I of the current model and therefore
on the values of all the other reflection coefficients (and im-
plicitly, the impedances). This is important, since otherwise the
results of the inversion method would be reliable (in terms of
absolute values of the impedance) only above a constrained
point, and the inversion for impedance below TD would
depend on providing a good guess for the impedance of the
deepest layer.
FIELD EXAMPLE FIG. 4. Field example VSP data; total well depth is around
4 300 m. Inversion of a shallow level of this VSP allows com-
Figures 4 to 7 illustrate the iterative inversion of an actual parison with logging data.
VSP. Here attention is restricted to the impedances above TD,
inversio
level +
2000
I I I
2.0 2.5
time (S)
FIG. 5. VSP upgoing waves with principal-component log analysis. The good match shows that comparison of VSP and logging
data makes sense.
930 Grivelet
1lN~VER~;tM&l,LT
1
pzKq
SYNTHETIC SEISMOGRAM
FROM LOGS
.-
~-
z :: L I ~1-L I ~__~I
FIG. 6. Field example inversion result; major features of the FIG. 7. Field example inversion without constraints; although
impedance log are reproduced by the inversion of VSP. The the shape of the exact profile is still recognizable, the resulting
two arrows on the inversion result indicate the constraints. The impedance profile shows an anomalous increase between 1.6
result below the last constraint is fairly good. and 1.8 s.