Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.