2000
DOI: 10.1190/1.1444790
|View full text |Cite
|
Sign up to set email alerts
|

Efficient 2.5-D true‐amplitude migration

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2000
2000
2024
2024

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 27 publications
(15 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…For this same reason, we have also spent considerably more algorithm development time devising computationally efficient approximations of the Kirchhoff migration operator G T j than we have of the Kirchhoff modeling operator G j (see, e.g., Gray, 1997, andHanitzsch et al, 1994). We therefore start with a description of G T j as implemented in our 2.5-D true-amplitude prestack Kirchhoff depth-migration algorithm (Gray and May, 1994;Dellinger et al, 2000), and define G j as the transpose of G T j . One distinct advantage of the eikonal-equation-based Kirchhoff versus the computationally more expensive waveequation-based migration schemes is that we are able to account for 3-D spreading measured by 2-D seismic lines by means of asymptotic ray theory (Bleistein, 1987).…”
Section: Appendix a The Kirchhoff Migration Operator And Its Transposementioning
confidence: 98%
See 2 more Smart Citations
“…For this same reason, we have also spent considerably more algorithm development time devising computationally efficient approximations of the Kirchhoff migration operator G T j than we have of the Kirchhoff modeling operator G j (see, e.g., Gray, 1997, andHanitzsch et al, 1994). We therefore start with a description of G T j as implemented in our 2.5-D true-amplitude prestack Kirchhoff depth-migration algorithm (Gray and May, 1994;Dellinger et al, 2000), and define G j as the transpose of G T j . One distinct advantage of the eikonal-equation-based Kirchhoff versus the computationally more expensive waveequation-based migration schemes is that we are able to account for 3-D spreading measured by 2-D seismic lines by means of asymptotic ray theory (Bleistein, 1987).…”
Section: Appendix a The Kirchhoff Migration Operator And Its Transposementioning
confidence: 98%
“…In this paper, we will instead begin with our workhorse production common-offset Kirchhoff-migration operator, G T , developed by Gray (Gray and May, 1994;Dellinger et al, 2000) based on earlier work by Bleistein (1987) and described in Appendix A:…”
Section: Kirchhoff Modelingmentioning
confidence: 99%
See 1 more Smart Citation
“…This paper is an outgrowth of an earlier paper by the first author (Bleistein 1999), with active involvement at the reviewing stage by the second author. The thesis of that earlier paper and this one is that Hagedoorn's (1954)‘string construction technique’ or, equivalently, ‘ruler and compass technique’ really anticipated the methods that we now call Kirchhoff migration (Schneider 1978) and Kirchhoff inversion (Bleistein 1987a, 1987b; Docherty 1991; Hanitzsch 1995, 1997; Gray 1997; Dellinger et al 2000). That is, a mathematical description of the string construction is equivalent to the Kirchhoff migration processes in the following sense.…”
Section: Introductionmentioning
confidence: 99%
“…Several methods for traveltime interpolation have also been proposed, e.g., parabolic and hyperbolic approximations (Ursin, 1982;Gjøystdal et al, 1984;Schleicher et al, 1993b) or Fourier (sinc) interpolation (Brokešová, 1996) to name only a few. Since the standard method to compute the weight functions is to perform dynamic ray tracing for each point under consideration, much effort has gone into finding simplified, more economic expressions for them, as shown by, e.g., Dellinger et al (2000) or Zhang et al (2000). Hanitzsch et al (2001) introduce an interesting method that applies the weight after the stacking.…”
Section: Introductionmentioning
confidence: 99%