Depth mapping of time horizons
| Autor: | Samuel H. Bickel |
|---|---|
| Rok vydání: | 1998 |
| Předmět: | |
| Zdroj: | SEG Technical Program Expanded Abstracts 1998. |
| DOI: | 10.1190/1.1820543 |
| Popis: | This maximum depth principle for computing horizon depths is a dual to Fermat’s minimum time principle for computing traveltimes. With this proposition a reflecting horizon is mapped from time to depth by finding the envelope of all possible depths that can be computed with the velocity model. Thus time-to-depth mapping can be approached as an optimization problem. The power of the method is illustrated by an example where zero-offset time measurements are mapped to depth for a layer with moderate lateral changes in the velocity. Dynamic programming provides an efficient way to successively map traveltimes from the surface to deeper and deeper horizons. The horizon’s depth is determined at each stage by applying the horizon imaging condition to the mapping equation. Mapping multiple time horizons to depth by an exhaustive search is difficult because the number of possibilities quickly becomes astronomical. Dynamic programming (Bellman, 1957) is an efficient way to search for the maximum depth of the horizons when the model has more than one layer. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|