Leading-order seismic imaging using curvelets

Geophysics ◽  
2007 ◽  
Vol 72 (6) ◽  
pp. S231-S248 ◽  
Author(s):  
Huub Douma ◽  
Maarten V. de Hoop
Keyword(s):  
Seismic Data ◽  
Order Approximation ◽  
Angular Frequency ◽  
Leading Order ◽  
Numerical Examples ◽  
Depth Migration ◽  
Map Migration ◽  
Kirchhoff Depth Migration ◽  
Homogeneous Media ◽  
Spatial Support

Curvelets are plausible candidates for simultaneous compression of seismic data, their images, and the imaging operator itself. We show that with curvelets, the leading-order approximation (in angular frequency, horizontal wavenumber, and migrated location) to common-offset (CO) Kirchhoff depth migration becomes a simple transformation of coordinates of curvelets in the data, combined with amplitude scaling. This transformation is calculated using map migration, which employs the local slopes from the curvelet decomposition of the data. Because the data can be compressed using curvelets, the transformation needs to be calculated for relatively few curvelets only. Numerical examples for homogeneous media show that using the leading-order approximation only provides a good approximation to CO migration for moderate propagation times. As the traveltime increases and rays diverge beyond the spatial support of a curvelet; however, the leading-order approximation is no longer accurate enough. This shows the need for correction beyond leading order, even for homogeneous media.

Prestack Kirchhoff depth migration of shallow seismic data

Geophysics ◽  
1998 ◽  
Vol 63 (4) ◽  
pp. 1241-1247 ◽  
Author(s):  
Linus Pasasa ◽  
Friedemann Wenzel ◽  
Ping Zhao
Keyword(s):  
Waste Disposal ◽  
Seismic Data ◽  
Signal To Noise Ratio ◽  
Disposal Site ◽  
Model Estimation ◽  
Waste Disposal Site ◽  
Depth Migration ◽  
Prestack Migration ◽  
Shallow Seismic ◽  
Kirchhoff Depth Migration

Prestack Kirchhoff depth migration is applied successfully to shallow seismic data from a waste disposal site near Arnstadt in Thuringia, Germany. The motivation behind this study was to locate an underground building buried in a waste disposal. The processing sequence of the prestack migration is simplified significantly as compared to standard common (CMP) data processing. It includes only two parts: (1) velocity‐depth‐model estimation and (2) prestack depth migration. In contrast to conventional CMP stacking, prestack migration does not require a separation of reflections and refractions in the shot data. It still provides an appropriate image. Our data example shows that a superior image can be achieved that would contain not just subtle improvements but a qualitative step forward in resolution and signal‐to‐noise ratio.

Prestack 2D parsimonious Kirchhoff depth migration of elastic seismic data

Geophysics ◽  
2011 ◽  
Vol 76 (4) ◽  
pp. S157-S164 ◽  
Author(s):  
Robert Sun ◽  
George A. McMechan
Keyword(s):  
Seismic Data ◽  
Velocity Model ◽  
P Wave ◽  
P Value ◽  
Common Source ◽  
S Wave ◽  
P Values ◽  
Depth Migration ◽  
Reflector Surface ◽  
Kirchhoff Depth Migration

We have extended prestack parsimonious Kirchhoff depth migration for 2D, two-component, reflected elastic seismic data for a P-wave source recorded at the earth’s surface. First, we separated the P-to-P reflected (PP-) waves and P-to-S converted (PS-) waves in an elastic common-source gather into P-wave and S-wave seismograms. Next, we estimated source-ray parameters (source p values) and receiver-ray parameters (receiver p values) for the peaks and troughs above a threshold amplitude in separated P- and S-wavefields. For each PP and PS reflection, we traced (1) a source ray in the P-velocity model in the direction of the emitted ray angle (determined by the source p value) and (2) a receiver ray in the P- or S-velocity model back in the direction of the emergent PP- or PS-wave ray angle (determined by the PP- or PS-wave receiver p value), respectively. The image-point position was adjusted from the intersection of the source and receiver rays to the point where the sum of the source time and receiver-ray time equaled the two-way traveltime. The orientation of the reflector surface was determined to satisfy Snell’s law at the intersection point. The amplitude of a P-wave (or an S-wave) was distributed over the first Fresnel zone along the reflector surface in the P- (or S-) image. Stacking over all P-images of the PP-wave common-source gathers gave the stacked P-image, and stacking over all S-images of the PS-wave common-source gathers gave the stacked S-image. Synthetic examples showed acceptable migration quality; however, the images were less complete than those produced by scalar reverse-time migration (RTM). The computing time for the 2D examples used was about 1/30 of that for scalar RTM of the same data.

Robust and efficient upwind finite‐difference traveltime calculations in three dimensions

Geophysics ◽  
1995 ◽  
Vol 60 (4) ◽  
pp. 1108-1117 ◽  
Author(s):  
William A. Schneider
Keyword(s):  
Finite Difference ◽  
Seismic Data ◽  
Velocity Model ◽  
Radial Component ◽  
Three Dimensions ◽  
Spherical Coordinate ◽  
Depth Migration ◽  
Slowness Vector ◽  
Kirchhoff Depth Migration ◽  
Upwind Finite Difference

First‐arrival traveltimes in complicated 3-D geologic media may be computed robustly and efficiently using an upwind finite‐difference solution of the 3-D eikonal equation. An important application of this technique is computing traveltimes for imaging seismic data with 3-D prestack Kirchhoff depth migration. The method performs radial extrapolation of the three components of the slowness vector in spherical coordinates. Traveltimes are computed by numerically integrating the radial component of the slowness vector. The original finite‐difference equations are recast into unitless forms that are more stable to numerical errors. A stability condition adaptively determines the radial steps that are used to extrapolate. Computations are done in a rotated spherical coordinate system that places the small arc‐length regions of the spherical grid at the earth’s surface (z = 0 plane). This improves efficiency by placing large grid cells in the central regions of the grid where wavefields are complicated, thereby maximizing the radial steps. Adaptive gridding allows the angular grid spacings to vary with radius. The computation grid is also adaptively truncated so that it does not extend beyond the predefined Cartesian traveltime grid. This grid handling improves efficiency. The method cannot compute traveltimes corresponding to wavefronts that have “turned” so that they propagate in the negative radial direction. Such wavefronts usually represent headwaves and are not needed to image seismic data. An adaptive angular normalization prevents this turning, while allowing lower‐angle wavefront components to accurately propagate. This upwind finite‐difference method is optimal for vector‐parallel supercomputers, such as the CRAY Y-MP. A complicated velocity model that generates turned wavefronts is used to demonstrate the method’s accuracy by comparing with results that were generated by 3-D ray tracing and by an alternate traveltime calculation method. This upwind method has also proven successful in the 3-D prestack Kirchhoff depth migration of field data.

Imaging structures below dipping TI media

Geophysics ◽  
1999 ◽  
Vol 64 (4) ◽  
pp. 1239-1246 ◽  
Author(s):  
Robert W. Vestrum ◽  
Don C. Lawton ◽  
Ron Schmid
Keyword(s):  
Seismic Data ◽  
Seismic Anisotropy ◽  
Rocky Mountain ◽  
Transversely Isotropic ◽  
Velocity Model ◽  
P Wave ◽  
Depth Imaging ◽  
Depth Migration ◽  
Kirchhoff Depth Migration ◽  
Ti Media

Seismic anisotropy in dipping shales causes imaging and positioning problems for underlying structures. We developed an anisotropic depth‐migration approach for P-wave seismic data in transversely isotropic (TI) media with a tilted axis of symmetry normal to bedding. We added anisotropic and dip parameters to the depth‐imaging velocity model and used prestack depth‐migrated image gathers in a diagnostic manner to refine the anisotropic velocity model. The apparent position of structures below dipping anisotropic overburden changes considerably between isotropic and anisotropic migrations. The ray‐tracing algorithm used in a 2-D prestack Kirchhoff depth migration was modified to calculate traveltimes in the presence of TI media with a tilted symmetry axis. The resulting anisotropic depth‐migration algorithm was applied to physical‐model seismic data and field seismic data from the Canadian Rocky Mountain Thrust and Fold Belt. The anisotropic depth migrations offer significant improvements in positioning and reflector continuity over those obtained using isotropic algorithms.

Efficient 2.5-D true‐amplitude migration

Geophysics ◽  
2000 ◽  
Vol 65 (3) ◽  
pp. 943-950 ◽  
Author(s):  
Joe A. Dellinger ◽  
Samuel H. Gray ◽  
Gary E. Murphy ◽  
John T. Etgen
Keyword(s):  
Seismic Data ◽  
Constant Velocity ◽  
Three Dimensions ◽  
Additional Source ◽  
Standard Methods ◽  
Depth Migration ◽  
Kirchhoff Migration ◽  
Out Of Plane ◽  
Kirchhoff Method ◽  
Kirchhoff Depth Migration

Kirchhoff depth migration is a widely used algorithm for imaging seismic data in both two and three dimensions. To perform the summation at the heart of the algorithm, standard Kirchhoff migration requires a traveltime map for each source and receiver. True‐amplitude Kirchhoff migration in 2.5-D υ(x, z) media additionally requires maps of amplitudes, out‐of‐plane spreading factors, and takeoff angles; these quantities are necessary for calculating the true‐amplitude weight term in the summation. The increased input/output (I/O) and computational expense of including the true‐amplitude weight term is often not justified by significant improvement in the final muted and stacked image. For this reason, some authors advocate neglecting the weight term in the Kirchhoff summation entirely for most everyday imaging purposes. We demonstrate that for nearly the same expense as ignoring the weight term, a much better solution is possible. We first approximate the true‐amplitude weight term by the weight term for constant‐velocity media; this eliminates the need for additional source and receiver maps. With one small additional approximation, the weight term can then be moved entirely outside the innermost loop of the summation. The resulting Kirchhoff method produces images that are almost as good as for exact true‐amplitude Kirchhoff migration and at almost the same cost as standard methods that do not attempt to preserve amplitudes.

3-D prestack Kirchhoff beam migration for depth imaging

Geophysics ◽  
2000 ◽  
Vol 65 (5) ◽  
pp. 1592-1603 ◽  
Author(s):  
Yonghe Sun ◽  
Fuhao Qin ◽  
Steve Checkles ◽  
Jacques P. Leveille
Keyword(s):  
Distributed Environment ◽  
Small Surface ◽  
Depth Imaging ◽  
Depth Migration ◽  
Kirchhoff Migration ◽  
Surface Patches ◽  
Image Volume ◽  
Kirchhoff Depth Migration ◽  
Full Volume ◽  
Single Set

A beam implementation is presented for efficient full‐volume 3-D prestack Kirchhoff depth migration of seismic data. Unlike conventional Kirchhoff migration in which the input seismic traces in time are migrated one trace at a time into the 3-D image volume for the earth’s subsurface, the beam migration processes a group of input traces (a supergather) together. The requirement for a supergather is that the source and receiver coordinates of the traces fall into two small surface patches. The patches are small enough that a single set of time maps pertaining to the centers of the patches can be used to migrate all the traces within the supergather by Taylor expansion or interpolation. The migration of a supergather consists of two major steps: stacking the traces into a τ-P beam volume, and mapping the beams into the image volume. Since the beam volume is much smaller than the image volume, the beam migration cost is roughly proportional to the number of input supergathers. The computational speedup of beam migration over conventional Kirchhoff migration is roughly proportional to [Formula: see text], the average number of traces per supergather, resulting a theoretical speedup up to two orders of magnitudes. The beam migration was successfully implemented and has been in production use for several years. A factor of 5–25 speedup has been achieved in our in‐house depth migrations. The implementation made 3-D prestack full‐volume depth imaging feasible in a parallel distributed environment.

Kinematic interpretation in the prestack depth‐migrated domain

Geophysics ◽  
1997 ◽  
Vol 62 (4) ◽  
pp. 1226-1237 ◽  
Author(s):  
Irina Apostoiu‐Marin ◽  
Andreas Ehinger
Keyword(s):  
Signal To Noise Ratio ◽  
Velocity Model ◽  
Point Of View ◽  
Prestack Depth Migration ◽  
Depth Migration ◽  
Velocity Models ◽  
Time Domain Data ◽  
And Migration ◽  
Point To Point ◽  
Homogeneous Media

Prestack depth migration can be used in the velocity model estimation process if one succeeds in interpreting depth events obtained with erroneous velocity models. The interpretational difficulty arises from the fact that migration with erroneous velocity does not yield the geologically correct reflector geometries and that individual migrated images suffer from poor signal‐to‐noise ratio. Moreover, migrated events may be of considerable complexity and thus hard to identify. In this paper, we examine the influence of wrong velocity models on the output of prestack depth migration in the case of straight reflector and point diffractor data in homogeneous media. To avoid obscuring migration results by artifacts (“smiles”), we use a geometrical technique for modeling and migration yielding a point‐to‐point map from time‐domain data to depth‐domain data. We discover that strong deformation of migrated events may occur even in situations of simple structures and small velocity errors. From a kinematical point of view, we compare the results of common‐shot and common‐offset migration. and we find that common‐offset migration with erroneous velocity models yields less severe image distortion than common‐shot migration. However, for any kind of migration, it is important to use the entire cube of migrated data to consistently interpret in the prestack depth‐migrated domain.

Sign in / Sign up

Export Citation Format

Share Document