Reflection tomography in the postmigrated domain

Geophysics ◽  
1992 ◽  
Vol 57 (5) ◽  
pp. 680-692 ◽  
Author(s):  
Christof Stork

Reflection tomography is an inversion method that adjusts a velocity and reflector depth model to be consistent with the prestack time data. This tomography approach minimizes the misfit of the data and model in the premigrated domain. Generally, the data are represented by the traveltimes of reflection events, which has made the technique problematic and unpopular. Techniques generally known as “migration velocity analysis” have a similar objective but use the postmigrated domain. For a variety of practical reasons, this postmigrated domain has advantages over the premigrated domain. With slight modifications, the reflection tomography approach can be implemented in the postmigrated domain. In this domain, a model is determined by optimizing the consistency of imaged reflection events on what has been called a common reflection point (CRP) gather. Extending reflection tomography to the postmigrated domain allows much of the knowledge developed for migration velocity analysis to be coupled with that of reflection tomography. As a result, many of the practical techniques developed for migration velocity analysis can be used to improve the robustness and efficiency of reflection tomography. Similarly, much of the reflection tomography work done on analysis and solution of the linear system can be applied to postmigrated domain optimization.

Geophysics ◽  
2014 ◽  
Vol 79 (3) ◽  
pp. C65-C79 ◽  
Author(s):  
Ernesto V. Oropeza ◽  
George A. McMechan

We have developed a common-reflection-point (CRP)-based kinematic migration velocity analysis for 2D P-wave reflection data to estimate the four transversely isotropic (TI) parameters [Formula: see text], [Formula: see text], and [Formula: see text], and the tilt angle [Formula: see text] of the symmetry axis in a TI medium. In each iteration, the tomographic parameter was updated alternately with prestack anisotropic ray-based migration. Iterations initially used layer stripping to reduce the number of degrees of freedom; after convergence was reached, a couple of more iterations over all parameters and all CRPs ensured global interlayer coupling and parameter interaction. The TI symmetry axis orientation was constrained to be locally perpendicular to the reflectors. The [Formula: see text] dominated the inversion, and so it was weighted less than [Formula: see text] and [Formula: see text] in the parameter updates. Estimates of [Formula: see text] and [Formula: see text] were influenced if the error in [Formula: see text] was [Formula: see text]; estimates of [Formula: see text] were also influenced if the error in [Formula: see text] was [Formula: see text]. Examples included data for a simple model with a homogeneous TI layer whose dips allowed recovery of all anisotropy parameters from noise-free data, and a more realistic model (the BP tilted transversely isotropic (TTI) model) for which only [Formula: see text], [Formula: see text], and [Formula: see text] were recoverable. The adequacy of the traveltimes predicted by the inverted anisotropic models was tested by comparing migrated images and common image gathers, with those produced using the known velocity models.


Geophysics ◽  
2005 ◽  
Vol 70 (2) ◽  
pp. U9-U17 ◽  
Author(s):  
Weihong Fei ◽  
George A. McMechan

Migration velocity analysis can be made more efficient by preselecting the traces that contribute to a series of common-reflection-point (CRP) gathers and migrating only those traces. The data traces that contribute to a CRP for one reflection point on one layer are defined in a two-step procedure. First, poststack parsimonious Kirchhoff depth migration of zero-offset (or stacked) traces defines approximate reflector positions and orientations. Then, ray tracing from the reflection points for nonzero reflection angles defines the source and receiver locations of the data traces in the CRP gather. These traces are then prestack depth migrated, and the interval velocity model adjustment is obtained by fitting the velocity that maximizes the stack amplitude over the predicted (nonhyperbolic) moveout. A small number (2–3) of iterations converge to a 2D model of layer shape and interval velocity. Further efficiency is obtained by implementing layer stripping. The computation time is greatly reduced by combining parsimonious migration with processing only the salient portions of the whole seismic data set. The algorithm can handle lateral velocity variation within each layer as well as constant velocity. The computation time of the proposed algorithm is of the same order as that of the standard rms velocity scan method, but it does not have the inherent assumptions of the velocity scan method and is faster than current iterative prestack depth migration velocity analysis methods for typical field data.


Geophysics ◽  
2006 ◽  
Vol 71 (5) ◽  
pp. S161-S167 ◽  
Author(s):  
Weihong Fei ◽  
George A. McMechan

Three-dimensional prestack depth migration and depth residual picking in common-image gathers (CIGs) are the most time-consuming parts of 3D migration velocity analysis. Most migration-based velocity analysis algorithms need spatial coordinates of reflection points and CIG depth residuals at different offsets (or angles) to provide updated velocity information. We propose a new algorithm that can analyze 3D velocity quickly and accurately. Spatial coordinates and orientations of reflection points are provided by a 3D prestack parsimonious depth migration; the migration involves only the time samples picked from the salient reflection events on one 3D common-offset volume. Ray tracing from the reflection points to the surface provides a common-reflection-point (CRP) gather for each reflection point. Predicted (nonhyperbolic) moveouts for local velocity perturbations, based on maximizing the stacked amplitude, give the estimated velocity updates for each CRP gather. Then the velocity update for each voxel in the velocity model is obtained by averaging over all predicted velocity updates for that voxel. Prior model constraints may be used to stabilize velocity updating. Compared with other migration velocity analyses, the traveltime picking is limited to only one common-offset volume (and needs to be done only once); there is no need for intensive 3D prestack depth migration. Hence, the computation time is orders of magnitude less than other migration-based velocity analyses. A 3D synthetic data test shows the algorithm works effectively and efficiently.


Author(s):  
Wiktor Weibull ◽  
Børge Arntsen ◽  
Marianne Houbiers ◽  
Joachim Mispel

2016 ◽  
Vol 65 (3) ◽  
pp. 639-649 ◽  
Author(s):  
Tariq Alkhalifah ◽  
Zedong Wu

Sign in / Sign up

Export Citation Format

Share Document