Method and apparatus for finding horizons in 3D seismic data

• US 5,251,184 A
• Filed: 07/23/1992
• Issued: 10/05/1993
• Est. Priority Date: 07/09/1991
• Status: Expired due to Term

• Current Assignee: Landmark Graphics Corporation (Halliburton Company)
• Original Assignee: Landmark Graphics Corporation (Halliburton Company)
• Inventors: Alam, Aftab, Caragounis, Peter, Hildebrand, Harold A.
• Primary Examiner(s): Lobo, Ian J.
• Application Number:
  US07/919,167
• Time in Patent Office: 439 Days
• Field of Search: 367/38, 367/72, 367/73
• US Class Current: 367/72
• CPC Class Codes: G01V 1/301 for determining seismic cross-sections or geostructures

Abstract

A method and apparatus of rapidly generating horizon maps from a three dimensional volume of seismic traces is disclosed. During batch processing of the digital data representing trace wavelets, "1"'"'"'s are "0"'"'"'s are determined for each seismic trace of the volume. A bit volume is produced of which a "1" at a depth of a trace indicates that a horizon exists at that depth and at other depths of "1"'"'"'s of adjacent traces which are within a predetermined depth. In a real time mode, an explorationist selects a seed point thereby identifying a "1" on a particular trace at a particular depth. An automatic scanning procedure finds all other "1"'"'"'s at depths of adjacent traces. Each found "1" of adjacent traces is redesignated a seed point and the process is continued until no more "1"'"'"'s can be found. A horizon map is created from the depths of each found "1". An alternative method and apparatus is disclosed by which such bit volume is replaced with a compressed trace volume where each bit of the bit volume is replaced with a numerical value corresponding to the precise depth location of the attribute extremum represented by the bit. Such depth values are stored consecutively to form compressed traces. Interpolation of wavelets to find maximum or minimum attributes of such wavelets identifies depths above or below a bit of the bit volume which allows the production of an interpolated compressed trace volume.

Claims

1. Apparatus for automatically picking horizons from a three dimensional volume of seismic data traces and creating an indicia volume representative of horizons in the earth'"'"'s crust, where a horizon is a bedding interface in the earth'"'"'s crust and is represented in said seismic data traces through said bedding interface by a common attribute of a seismic wavelet, and where said common attribute may vary in depth as a function of x-y coordinates of said seismic data traces, comprising

computer program means for converting each of said seismic data traces to an indicia trace defined by a sequence of a first indicium and a second indicium as a function of depth, where a first indicium at any depth of such indicia trace indicates that a horizon exists at such depth of said seismic data trace and a second indicium at any depth of such indicia trace indicates that a horizon does not exist at such depth of said seismic data trace, and

means for storing each of said indicia traces in the memory of a computer as a three-dimensional indicia volume of indicia traces.

2. The apparatus of claim 1 wherein said first indicium is "1" bit and said second indicium is a indicium is a "0" bit.

3. The apparatus of claim 1 further comprising

means for selecting a seed bit on an indicia trace in said indicia volume which falls on a particular horizon, and

means for automatically scanning said particular horizon through said indicia volume by starting with said seed bit, and picking 1 bits on adjacent bit traces of said indicia volume which lie on said particular horizon.

4. The apparatus of claim 1 wherein said computer program means for converting includes

means for determining test depth points of a characteristic of a wavelet of a test seismic data trace when for certain seismic data traces in said three-dimensional volume of seismic data traces each data trace is designated in turn a test data trace,

means for identifying, for each test data trace, a test volume of seismic data traces including said test data trace at its center and four side seismic data traces, and

means for determining if a local horizon exists through each of said test depth points of said test seismic data trace by requiring that a depth point be picked on each of said four side seismic data traces which correspond to said wavelet characteristic at a corresponding depth of said test depth point.

5. The apparatus of claim 4 further including

means for comparing picked depth points z of the center trace of each test volume V with depth points z'"'"' of the center trace of adjacent test volumes V'"'"' are within a predetermined depth of a depth point z of the test volume V and that the depth of depth point z'"'"' of an adjacent test volume V'"'"' is the same depth as a corresponding side seismic data trace of said depth point z of said test volume V.

6. The apparatus of claim 4 wherein said certain seismic data traces are all seismic data traces which may serve as a center trace of a three-by-three volume of data traces of said three-dimensional volume of seismic data traces.

7. The apparatus of claim 4 wherein said characteristic of wavelet of said test seismic data trace is a maximum amplitude of said wavelet.

8. The apparatus of claim 3 wherein said means for automatically scanning said particular horizon through said bit volume by starting with said seed bit and picking 1 bits on adjacent bit traces of said bit volume includes means for

(1) beginning with said seed bit on said bit trace, identifying the same depth as said seed bit on adjacent bit traces, and

(2) searching said adjacent bit traces to find bits within a predetermined depth as the depth of said seed bit,

(3) designating any found bit of an adjacent bit trace as being on the same horizon as said seed bit, and designating such found bit as a seed bit, and

(4) repeating steps (1), (2) and (3) above except for searching bit traces already searched, until no more bits or adjacent bit traces can be found.

9. The apparatus of claim 8 further including means for plotting said found bits as a function of depth on an x-y pattern with changes in depth thereof parametrically displayed.

10. The apparatus of claim 8 further comprising means for recording each seed bit as a parent bit, and for each said found bit of an adjacent bit trace, recording said found bit as being a child of said parent bit.

11. In a method of automatically picking horizons from a three dimensional volume of seismic data traces, where a horizon is a bedding interface in the earth'"'"'s crust and is represented in said seismic data traces through said bedding interface by a common attribute of a seismic wavelet, a method of creating a compressed trace volume comprising the steps of,

identifying for each of said seismic data traces depths at which horizons exists, and

storing for each such seismic data trace a sequence of numerical values representative of said depths at which said horizons exist to create compressed traces of a compressed trace volume,

where a compressed trace is defined as a sequence of numbers representative of the depths of a seismic data trace at which horizons exist, and

a compressed trace volume is defined as a three dimensional volume of compressed traces, where each compressed trace corresponds to one of said seismic data traces of said three dimensional volume of seismic traces.

12. The method of claim 11 wherein each of said seismic data traces is a sequence of data records with each record including a depth and a wavelet amplitude, where each record is separated in depth from its adjacent record by an equal amount, the method further comprising the step of,

for each depth of said data record which is identified as a horizon, interpolating among depths above and below said identified depth to determine and store in memory the precise depth of an interpolated depth of an attribute of said wavelet, whereby such interpolated depth represents a more accurate identification of depth than said depth of said depth record.

13. The method of claim 12 wherein said interpolating step includes the step of fitting a parabola through three points defined by said attribute of a wavelet amplitude of the identified depth and wavelet amplitudes of depths above and below said identified depth.

14. The method of claim 13 wherein said attribute of said wavelet amplitude is the maximum of said amplitude.

15. The method of claim 13 wherein said attribute of said wavelet amplitude is the minimum of said amplitude.

16. The method of claim 11 further comprising the step of,

determining a numerical value of an attribute of said wavelets at each of said interpolated depths of said compressed trace and for each of said compressed traces of said compressed trace volume.

17. The method of claim 16 further comprising the step of,

storing said numerical values of said attributes of said wavelets with the corresponding identified depths of said attributes of said compressed traces.

18. The method of claim 11 further comprising the steps of,

selecting a seed depth on a compressed trace which falls on a particular horizon, and

automatically scanning said particular horizon through said compressed trace volume by starting with said seed depth on said compressed trace and picking depths on adjacent compressed traces of said compressed trace volume which lie on said particular horizon.

19. The method of claim 18 wherein said step of automatically scanning includes the steps of,

(1) beginning with said seed depth index on said compressed trace, identifying the same index as said seed depth on adjacent compressed traces,

(2) searching said adjacent compressed traces to find depths within a predetermined difference in indices as the depth of said seed depth,

(3) designating any found depth of an adjacent compressed trace as being on the same horizon as said seed depth, or alternatively repeating step (2) with a doubled difference in indices, and

(4) repeating steps (1), (2) and (3) above except for searching compressed traces already searched, until no more depths of adjacent compressed traces can be found.

20. Apparatus for automatically picking horizons from a three dimensional volume of seismic data traces, where a horizon is a bedding interface in the earth'"'"'s crust and is represented in said seismic data traces through said bedding interface by a common attribute of a seismic wavelet, and for creating a compressed trace volume comprising,

computer program means for identifying for each of said seismic data traces depths at which horizons exists, and

means for storing for each such seismic data trace a sequence of numerical values representative of said depths at which said horizons exist to create compressed traces of a compressed trace volume,

where a compressed trace is defined as a sequence of numbers representative of the depths of a seismic data trace at which horizons exist, and

a compressed trace volume is defined as a three dimensional volume of compressed traces, where each compressed trace corresponds to one of said seismic data traces of said three dimensional volume of seismic traces.

21. The apparatus of claim 20 wherein each of said seismic data traces is a sequence of data records with each record including a depth and a wavelet amplitude, where each record is separated in depth from its adjacent record by an equal amount, the apparatus further comprising,

for each depth of said data record which is identified as a horizon, means for interpolating among depths above and below said identified depth to determine and store in memory a depth of an interpolated extremum of an attribute of said wavelet, whereby such interpolated depth represents a more accurate identification of depth than said depth of said depth record.

22. The apparatus of claim 21 wherein said means for interpolating includes means for of fitting a parabola through three points defined by said attribute of a wavelet amplitude of the identified depth and wavelet amplitudes of depths above and below said identified depth.

23. The apparatus of claim 22 wherein said attribute of said wavelet amplitude is the maximum of said amplitude.

24. The apparatus of claim 22 wherein said attribute of said wavelet amplitude is the minimum of said amplitude.

25. The apparatus of claim 20 further comprising the step of,

means for determining a numerical value of an attribute of said wavelets at each of said interpolated depths of said compressed trace and for each of said compressed traces of said compressed trace volume.

26. The apparatus of claim 25 further comprising,

means for storing said numerical values of said attributes of said wavelets with the corresponding identified depths of said attributes of said compressed traces.

27. The apparatus of claim 20 further comprising,

means for selecting a seed depth on a compressed trace which falls on a particular horizon, and

computer program means for automatically scanning said particular horizon through said compressed trace volume by starting with said seed depth on said compressed trace and picking depths on adjacent compressed traces of said compressed trace volume which lie on said particular horizon.

28. The apparatus of claim 27 wherein said computer program means for automatically scanning includes means for

(1) beginning with said seed depth index on said compressed trace, identifying the same index as said seed depth on adjacent compressed traces,

(2) searching said adjacent compressed traces to find depths within a predetermined difference in indices as the depth of said seed depth, or alternatively repeating step (2) with a doubled difference in indices, and

(3) designating any found depth of an adjacent compressed trace as being on the same horizon as said seed depth, and

(4) repeating steps (1), (2) and (3) above except for searching compressed traces already searched, until no more depths of adjacent compressed traces can be found.