US6018499A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Three-dimensional seismic imaging of complex velocity structures
Assignee: 3DGEO DEVELOPMENT Inc
•
Filing: 1998-10-20
•
Granted: 2000-01-25
•
Expires: 2018-10-20
Abstract
Abstract Accurate and reliable traveltimes for a seismic exploration volume having a complex velocity structure are generated by selectively advancing a traveltime front at its minimum traveltime grid point, using an entropy-satisfying finite-difference approximation to the eikonal equation. A narrow band propagation zone is used to advance the finite difference stencil. Tentative traveltimes for the narrow band adjacent to the traveltime front are computed using the eikonal equation and arranged on a heap. The minimum traveltime (top of the heap) is selected as an accepted traveltime, saved in the output table, and removed from the heap. Tentative traveltimes for all non-accepted grid points neighboring the selected point are then computed/recomputed and put on the heap. The traveltime computation is fast, unconditionally stable, resolves any overturning propagation wavefronts, and ensures that the eikonal equation is globally solved for each point of the 3-D grid. The traveltimes accurately characterize the propagation of seismic signals through the volume. The traveltimes are used for accurately imaging the volume.
Inventors
- 👤 James A. Sethian
- 👤 Alexander M. Popovici
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 22:18
CPC Classifications
G; G01; G01V; G01V1/00; G01V1/28; G01V1/30; G01V1/303; G01V1/305; G01V1/282; G01V2210/00; G01V2210/50; G01V2210/51
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
189 words
A computer-implemented three-dimensional seismic data processing method comprising: a) providing a set of seismic signals for a seismic exploration volume; b) providing a complex velocity model for said volume; c) generating a set of accepted traveltimes for said volume by providing accepted traveltimes for an accepted grid region within said volume, providing tentative traveltimes for a set of trial grid points arranged in a narrow band around said accepted grid region, arranging said tentative traveltimes on a heap, selecting a minimum traveltime from said heap as an accepted traveltime, thereby adding to said accepted grid region a minimum-traveltime grid point corresponding to said minimum traveltime, adding a neighbor of said minimum-traveltime grid point which is not in said accepted grid region to said set of trial grid points, computing a tentative traveltime for said neighbor using said velocity model and said accepted traveltimes, putting said tentative traveltime for said neighbor on said heap, and advancing said accepted grid region to generate said set of accepted traveltimes; and d) processing said seismic signals using said set of accepted traveltimes to characterize a propagation of said seismic signals through said volume.
Claim 2
Dependent Claim
189 words
A computer-implemented three-dimensional seismic data processing method comprising: a) providing a set of seismic signals for a seismic exploration volume; b) providing a complex velocity model for said volume; c) generating a set of accepted traveltimes for said volume by providing accepted traveltimes for an accepted grid region within said volume, providing tentative traveltimes for a set of trial grid points arranged in a narrow band around said accepted grid region, arranging said tentative traveltimes on a heap, selecting a minimum traveltime from said heap as an accepted traveltime, thereby adding to said accepted grid region a minimum-traveltime grid point corresponding to said minimum traveltime, adding a neighbor of said minimum-traveltime grid point which is not in said accepted grid region to said set of trial grid points, computing a tentative traveltime for said neighbor using said velocity model and said accepted traveltimes, putting said tentative traveltime for said neighbor on said heap, and advancing said accepted grid region to generate said set of accepted traveltimes; and d) processing said seismic signals using said set of accepted traveltimes to characterize a propagation of said seismic signals through said volume.
Claim 3
Dependent Claim
18 words
The method of claim 1 wherein said processing said seismic signals comprises generating an image of said volume.
Claim 4
Dependent Claim
13 words
The method of claim 2 wherein said image is generated by Kirchhoff migration.
Claim 5
Dependent Claim
24 words
The method of claim 1 further comprising using said minimum traveltime to recompute a tentative traveltime for a trial grid point neighboring said neighbor.
Claim 6
Dependent Claim
23 words
The method of claim 1 wherein said computing said tentative traveltime for said neighbor comprises employing a finite-difference solution to the eikonal equation.
Claim 7
Dependent Claim
14 words
The method of claim 5 wherein said finite-difference solution comprises a gradient term ##EQU3##
Claim 8
Dependent Claim
22 words
The method of claim 5 wherein said finite-difference solution comprises a gradient term |∇u|=(max(D.sub.ijk.sup.-x u,-D.sub.ijk.sup.+x u,0).sup.2 +max(D.sub.ijk.sup.-y u,-D.sub.ijk.sup.+y u,0).sup.2 +max(D.sub.ijk.sup.-z u,-D.sub.ijk.sup.+z u,0).sup.2).sup.1/2.
Claim 9
Dependent Claim
15 words
The method of claim 5 wherein said grid points are arranged on a cartesian grid.
Claim 10
Dependent Claim
15 words
The method of claim 5 wherein said grid points are arranged on a spherical grid.
Claim 11
Dependent Claim
162 words
A computer-implemented three-dimensional seismic imaging method comprising: a) providing accepted traveltimes for an accepted grid region of a seismic exploration volume having a complex velocity structure; b) providing tentative traveltimes for a set of close grid points situated one grid point away from said accepted grid region, said tentative traveltimes for said set of close grid points being arranged on a heap; c) selecting a minimum traveltime from said tentative traveltimes, said minimum traveltime corresponding to a minimum-traveltime grid point; d) saving said minimum traveltime as an accepted traveltime, thereby adding said minimum-traveltime grid point to said accepted grid region; e) adding neighbors of said minimum-traveltime grid point which are not in said accepted grid region to said set of close grid points; f) computing tentative traveltimes for said neighbors using a finite-difference approximation to the eikonal equation; g) putting said tentative traveltimes for said neighbors on said heap; and h) employing said accepted traveltimes to generate an image of said volume.
Claim 12
Dependent Claim
162 words
A computer-implemented three-dimensional seismic imaging method comprising: a) providing accepted traveltimes for an accepted grid region of a seismic exploration volume having a complex velocity structure; b) providing tentative traveltimes for a set of close grid points situated one grid point away from said accepted grid region, said tentative traveltimes for said set of close grid points being arranged on a heap; c) selecting a minimum traveltime from said tentative traveltimes, said minimum traveltime corresponding to a minimum-traveltime grid point; d) saving said minimum traveltime as an accepted traveltime, thereby adding said minimum-traveltime grid point to said accepted grid region; e) adding neighbors of said minimum-traveltime grid point which are not in said accepted grid region to said set of close grid points; f) computing tentative traveltimes for said neighbors using a finite-difference approximation to the eikonal equation; g) putting said tentative traveltimes for said neighbors on said heap; and h) employing said accepted traveltimes to generate an image of said volume.
Claim 13
Dependent Claim
13 words
The method of claim 10 wherein said image is generated by Kirchhoff migration.
Claim 14
Dependent Claim
29 words
The method of claim 10 further comprising recomputing tentative traveltimes for close grid points one grid point away from said minimum-traveltime grid point, said recomputing employing said minimum traveltime.
Claim 15
Dependent Claim
102 words
A computer-implemented three-dimensional seismic imaging method comprising: a) computing accepted traveltimes for grid points of a seismic exploration volume having a complex velocity structure, by establishing a narrow band of grid points adjacent to a traveltime front at each of a plurality of positions of said traveltime front in said volume, establishing a heap of tentative traveltimes for said narrow band, and saving a minimum traveltime from said heap as an accepted traveltime in a traveltime output grid, to advance said front at a minimum traveltime grid point corresponding to said minimum traveltime; and b) imaging said volume using said accepted traveltimes.
Claim 16
Dependent Claim
102 words
A computer-implemented three-dimensional seismic imaging method comprising: a) computing accepted traveltimes for grid points of a seismic exploration volume having a complex velocity structure, by establishing a narrow band of grid points adjacent to a traveltime front at each of a plurality of positions of said traveltime front in said volume, establishing a heap of tentative traveltimes for said narrow band, and saving a minimum traveltime from said heap as an accepted traveltime in a traveltime output grid, to advance said front at a minimum traveltime grid point corresponding to said minimum traveltime; and b) imaging said volume using said accepted traveltimes.
Claim 17
Dependent Claim
23 words
The method of claim 13 wherein said imaging said volume comprises processing a set of seismic signals for said volume by Kirchhoff migration.
Claim 18
Dependent Claim
27 words
The method of claim 13 further comprising recomputing a tentative traveltime for a grid point neighboring said minimum traveltime grid point, said recomputing employing said minimum traveltime.
Claim 19
Dependent Claim
211 words
A three-dimensional seismic imaging apparatus comprising: a) means for providing a set of seismic signals for a seismic exploration volume; b) means for providing a complex velocity model for said volume; c) means for generating a set of accepted traveltimes for said volume, including means for providing accepted traveltimes for an accepted grid region within said volume, means for providing tentative traveltimes for a set of trial grid points arranged in a narrow band around said accepted grid region, means for arranging said tentative traveltimes on a heap, means for selecting a minimum traveltime from said heap as an accepted traveltime, thereby adding to said accepted grid region a minimum-traveltime grid point corresponding to said minimum traveltime, means for adding a neighbor of said minimum-traveltime grid point which is not in said accepted grid region to said set of trial grid points, means for computing a tentative traveltime for said neighbor using said velocity model and said accepted traveltimes, means for putting said tentative traveltime for said neighbor on said heap, and means for advancing said accepted grid region to generate said set of accepted traveltimes; and d) means for processing said seismic signals using said set of accepted traveltimes to characterize a propagation of said seismic signals through said volume.
Claim 20
Dependent Claim
211 words
A three-dimensional seismic imaging apparatus comprising: a) means for providing a set of seismic signals for a seismic exploration volume; b) means for providing a complex velocity model for said volume; c) means for generating a set of accepted traveltimes for said volume, including means for providing accepted traveltimes for an accepted grid region within said volume, means for providing tentative traveltimes for a set of trial grid points arranged in a narrow band around said accepted grid region, means for arranging said tentative traveltimes on a heap, means for selecting a minimum traveltime from said heap as an accepted traveltime, thereby adding to said accepted grid region a minimum-traveltime grid point corresponding to said minimum traveltime, means for adding a neighbor of said minimum-traveltime grid point which is not in said accepted grid region to said set of trial grid points, means for computing a tentative traveltime for said neighbor using said velocity model and said accepted traveltimes, means for putting said tentative traveltime for said neighbor on said heap, and means for advancing said accepted grid region to generate said set of accepted traveltimes; and d) means for processing said seismic signals using said set of accepted traveltimes to characterize a propagation of said seismic signals through said volume.
Claim 21
Dependent Claim
22 words
The apparatus of claim 16 wherein said means for processing said seismic signals comprises means for generating an image of said volume.
Claim 22
Dependent Claim
13 words
The apparatus of claim 17 wherein said image is generated by Kirchhoff migration.
Claim 23
Dependent Claim
26 words
The apparatus of claim 16 further comprising means for using said minimum traveltime to recompute a tentative traveltime for a trial grid point neighboring said neighbor.
Claim 24
Dependent Claim
21 words
The apparatus of claim 16 wherein said means for computing said tentative traveltime employs a finite-difference solution to the eikonal equation.
Claim 25
Dependent Claim
14 words
The apparatus of claim 20 wherein said finite-difference solution comprises a gradient term ##EQU4##
Claim 26
Dependent Claim
22 words
The apparatus of claim 20 wherein said finite-difference solution comprises a gradient term |∇u|=(max(D.sub.ijk.sup.-x u,-D.sub.ijk.sup.+x u,0).sup.2 +max(D.sub.ijk.sup.-y u,-D.sub.ijk.sup.+y u,0).sup.2 +max(D.sub.ijk.sup.-z u,-D.sub.ijk.sup.+z u,0).sup.2).sup.1/2.
Claim 27
Dependent Claim
15 words
The apparatus of claim 20 wherein said grid points are arranged on a cartesian grid.
Claim 28
Dependent Claim
15 words
The apparatus of claim 20 wherein said grid points are arranged on a spherical grid.
Claim 29
Dependent Claim
174 words
A three-dimensional seismic imaging apparatus comprising: a) means for providing accepted traveltimes for an accepted grid region of a seismic exploration volume having a complex velocity structure; b) means for providing tentative traveltimes for a set of close grid points situated one grid point away from said accepted grid region, said tentative traveltimes for said set of close grid points being arranged on a heap; c) means for selecting a minimum traveltime from said tentative traveltimes, said minimum traveltime corresponding to a minimum-traveltime grid point; d) means for saving said minimum traveltime as an accepted traveltime, thereby adding said minimum-traveltime grid point to said accepted grid region; e) means for adding neighbors of said minimum-traveltime grid point which are not in said accepted grid region to said set of close grid points; f) means for computing tentative traveltimes for said neighbors using a finite-difference approximation to the eikonal equation; g) means for putting said tentative traveltimes for said neighbors on said heap; and h) means for employing said accepted traveltimes to image said volume.
Claim 30
Dependent Claim
174 words
A three-dimensional seismic imaging apparatus comprising: a) means for providing accepted traveltimes for an accepted grid region of a seismic exploration volume having a complex velocity structure; b) means for providing tentative traveltimes for a set of close grid points situated one grid point away from said accepted grid region, said tentative traveltimes for said set of close grid points being arranged on a heap; c) means for selecting a minimum traveltime from said tentative traveltimes, said minimum traveltime corresponding to a minimum-traveltime grid point; d) means for saving said minimum traveltime as an accepted traveltime, thereby adding said minimum-traveltime grid point to said accepted grid region; e) means for adding neighbors of said minimum-traveltime grid point which are not in said accepted grid region to said set of close grid points; f) means for computing tentative traveltimes for said neighbors using a finite-difference approximation to the eikonal equation; g) means for putting said tentative traveltimes for said neighbors on said heap; and h) means for employing said accepted traveltimes to image said volume.
Claim 31
Dependent Claim
129 words
A three-dimensional seismic imaging apparatus comprising: a) accepted traveltime storage means comprising a set of accepted traveltimes stored therein, said set of accepted traveltimes characterizing an accepted grid region within a seismic exploration volume having a complex velocity structure; b) traveltime computation means for providing a set of tentative traveltimes for a narrow band around said accepted grid region using a finite-difference solution to the eikonal equation; c) tentative traveltime storage means for storing said tentative traveltimes as a heap; d) minimum traveltime selection means for selecting a minimum traveltime from said set of tentative traveltimes, and for storing said minimum traveltime in said accepted traveltime storage means as an accepted traveltime; and e) imaging means for generating an image of said volume using said set of accepted traveltimes.
Claim 32
Dependent Claim
129 words
A three-dimensional seismic imaging apparatus comprising: a) accepted traveltime storage means comprising a set of accepted traveltimes stored therein, said set of accepted traveltimes characterizing an accepted grid region within a seismic exploration volume having a complex velocity structure; b) traveltime computation means for providing a set of tentative traveltimes for a narrow band around said accepted grid region using a finite-difference solution to the eikonal equation; c) tentative traveltime storage means for storing said tentative traveltimes as a heap; d) minimum traveltime selection means for selecting a minimum traveltime from said set of tentative traveltimes, and for storing said minimum traveltime in said accepted traveltime storage means as an accepted traveltime; and e) imaging means for generating an image of said volume using said set of accepted traveltimes.
References Cited (Backward Citations)
US5513150A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-01-24 | 2003-07-26 | 2004-01-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-01-24 | 2007-07-26 | 2008-01-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-01-24 | 2011-07-26 | 2012-01-25 | $7700.00 | Window Closed / Lapsed |