next up previous [pdf]

Next: Case study Up: Ayeni: Cyclic matching Previous: Velocity, path-length and travel

Cyclic 1D match-filtering by Evolutionary Programming

The match-filtering problem between two data sets, one baseline and one monitor, can be posed in the frequency domain as follows:

$\displaystyle \tensor{F}(\omega)=\frac{\tensor{\overline M}(\omega)\tensor{B}(\omega)}{\tensor{\overline M}(\omega)\tensor{M}(\omega)+\epsilon^2}.$ (4)

where $ \tensor{F}(\omega)$ is the match filter, $ \tensor{B}(\omega)$ is the baseline data, and $ \tensor{M}(\omega)$ is the monitor data at frequency $ \omega$ . The damping factor ($ \epsilon$ ) in the denominator prevents zero-division. The overline denotes complex conjugation. Match filters can be estimated globally (for all trace locations), locally (on a trace-by-trace basis) or both. In this paper, only local 1D match filters are considered.

At each trace location, local match filters are non-linear functions of the estimation parameters. Usually, these parameters are selected by a manual trial-and-error approach. This can be a tedious or impossible challenge due to the strong non-linearity of the problem and the large size of seismic data sets. Furthermore, in most cases a single set of parameters is used for all traces locations. While a particular parameter set may result in satisfactory filter estimates in some parts of the data volume, it may result in very poor filters in other parts.

Here, an evolutionary programming (EP) method is used estimate the optimal filter parameters at each trace location. EP belongs to a class of global optimization methods called evolutionary algorithms. These algorithms solve optimization problems using Darwinian evolutionary principles of natural selection. Although any global optimization method may be used, the EP method was chosen because of its easy implementation, easy parameterization and flexibility. The optimized estimation parameters include estimation window size and taper, filter-length and the damping factor. Ayeni and Nasser (2009) provide a more detailed description and an application of evolutionary programming to the match filtering problem. An extended version of this filter estimation approach that is used in this paper is presented in Algorithm 4.

Figure: Optimal cyclic 1D matching by evolutionary programming
\begin{figure}\begin{algorithm}[H]% enter the algorithm environment
% give the ...
...STATE Apply constraints
\ENDFOR
\end{algorithmic}
\end{algorithm}\end{figure}

next up previous [pdf]

Next: Case study Up: Ayeni: Cyclic matching Previous: Velocity, path-length and travel

2010-05-19