z-logo
Premium
MAXIMUM‐LIKELIHOOD ESTIMATION OF SEISMIC IMPULSE RESPONSES *
Author(s) -
URSIN B.,
HOLBERG O.
Publication year - 1985
Publication title -
geophysical prospecting
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.735
H-Index - 79
eISSN - 1365-2478
pISSN - 0016-8025
DOI - 10.1111/j.1365-2478.1985.tb00432.x
Subject(s) - noise (video) , least squares function approximation , impulse (physics) , impulse response , reflection (computer programming) , deconvolution , estimation theory , seismic trace , statistics , mathematics , geology , algorithm , computer science , estimator , mathematical analysis , physics , quantum mechanics , artificial intelligence , wavelet , image (mathematics) , programming language
A seismic trace is assumed to consist of a known signal pulse convolved with a reflection coefficient series plus a moving average noise process (colored noise). Multiple reflections and reverberations are assumed to be removed from the trace by conventional means. The method of maximum likelihood (ML) is used to estimate the reflection coefficients and the unknown noise parameters. If the reflection coefficients are known from well logs, the seismic pulse and the noise parameters can be estimated. The maximum likelihood estimation problem is reduced to a nonlinear least‐squares problem. When the further assumption is made that the noise is white, the method of maximum likelihood is equivalent to the method of least squares (LS). In that case the sampling rate should be chosen approximately equal to the Nyquist rate of the trace. Statistical and numerical properties of the ML‐ and the LS‐estimates are discussed briefly. Synthetic data examples demonstrate that the ML‐method gives better resolution and improved numerical stability compared to the LS‐method. A real data example shows the ML‐ and LS‐method applied to stacked seismic data. The results are compared with reflection coefficients obtained from well log data.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here