US5153858A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for finding horizons in 3D seismic data
Assignee: Landmark Graphics Corp
•
Filing: 1991-07-09
•
Granted: 1992-10-06
•
Expires: 2011-07-09
Abstract
Abstract A method 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 or "0"'s are determined for each seismic trace of the volume. 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". A record is maintained of parent and child bits whereby seed bits are designated as parent bits and each found bit is designated a child bit. Such parent-child information is useful in editing of horizon maps created by the method. Numerical attributes of the wavelets at the depths of the 1 bits are stored as a function of the depths of the bits, thereby reducing required storage space.
Inventors
- 👤 Harold A. Hildebrand
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 14:48
CPC Classifications
G; G01; G01V; G01V1/00; G01V1/28; G01V1/30; G01V1/301
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
155 words
A method of automatically selecting horizons of formations from a three-dimensional volume of seismic data traces comprising the steps of, first (a) converting each of said seismic data traces to a bit trace defined by a sequence of 0 and 1 bits as a function of depth, where a "1" at a depth of a trace indicates that a horizon exists at that depth and a "0" indicates that a horizon does not exist at that depth, and (b) storing each of said bit traces in the memory of a computer as a three-dimensional bit volume of bits traces, and later (c) selecting a seed bit on a bit trace in said bit volume which falls on a particular horizon, and (d) 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 which lie on said particular horizon.
Claim 2
Independent Claim
155 words
A method of automatically selecting horizons of formations from a three-dimensional volume of seismic data traces comprising the steps of, first (a) converting each of said seismic data traces to a bit trace defined by a sequence of 0 and 1 bits as a function of depth, where a "1" at a depth of a trace indicates that a horizon exists at that depth and a "0" indicates that a horizon does not exist at that depth, and (b) storing each of said bit traces in the memory of a computer as a three-dimensional bit volume of bits traces, and later (c) selecting a seed bit on a bit trace in said bit volume which falls on a particular horizon, and (d) 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 which lie on said particular horizon.
Claim 3
Dependent Claim
138 words
The method of claim 1 wherein said converting step includes the sub-steps of: (1) for certain seismic data traces in said three-dimensional volume of seismic data traces with each such data trace being in turn designated a test data trace, determining the test depth points of a characteristic of a wavelet of said test seismic data trace, (2) for each test data trace, identifying a test volume of seismic data traces including said test data trace in its center and four side seismic data traces, and (3) 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.
Claim 4
Dependent Claim
166 words
The method of claim 2 wherein picking of depth points of side traces includes progressing from a beginning trace to a target trace comprising the steps of (i) recording a numerical value of said characteristic of a beginning wavelet at a beginning depth point of said beginning trace, (ii) transferring the depth of said beginning depth point to said target trace and finding the depth point of said characteristic of the wavelet of said target trace that exists between zero crossings of said target trace and recording said depth point and a numerical value of said characteristic of said target trace wavelet, and (iii) transferring the depth of said depth point of said target trace back to said beginning trace to determine if it is between zero crossings of said wavelet of said beginning trace, and if it is, (iv) requiring that the difference between said numerical value of said characteristic of said beginning trace wavelet and said target trace be within a predetermined numerical amount.
Claim 5
Dependent Claim
103 words
The method of claim 2 further including the sub-step of 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' such that each picked depth point 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.
Claim 6
Dependent Claim
38 words
The method of claim 1 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.
Claim 7
Dependent Claim
24 words
The method of claim 2 wherein said characteristic of a wavelet of said test seismic data trace is the maximum amplitude of said wavelet.
Claim 8
Dependent Claim
24 words
The method of claim 2 wherein said characteristic of a wavelet of said test seismic data trace is the minimum amplitude of said wavelet.
Claim 9
Dependent Claim
139 words
The method of claim 1 wherein said step of 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 the steps of (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.
Claim 10
Dependent Claim
27 words
The method of claim 8 wherein said bit pattern as a function of depth is plotted on an x-y pattern with changes in depth thereof parametrically displayed.
Claim 11
Dependent Claim
41 words
The method of claim 8 further comprising the step of 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.
Claim 12
Dependent Claim
48 words
The method of claim 1 further comprising the steps of determining a numerical value of an attribute of said seismic data traces at each depth at which is a 1 is recorded, and recording said numerical values as a function of depths at which such 1's are recorded.
Claim 13
Dependent Claim
102 words
In a method of automatically picking horizons from a three dimensional volume of seismic data traces, a method of creating a bit volume comprising the steps of converting said seismic data traces to a bit trace defined by a sequence of 0 and 1 bits as a function of depth, where a "1" at a depth of a trace indicates that a horizon exists at that depth and a "0" indicates that a horizon does not exist at that depth, and storing each of said bit traces in the memory of a computer as a three dimensional bit volume of bit traces.
Claim 14
Dependent Claim
102 words
In a method of automatically picking horizons from a three dimensional volume of seismic data traces, a method of creating a bit volume comprising the steps of converting said seismic data traces to a bit trace defined by a sequence of 0 and 1 bits as a function of depth, where a "1" at a depth of a trace indicates that a horizon exists at that depth and a "0" indicates that a horizon does not exist at that depth, and storing each of said bit traces in the memory of a computer as a three dimensional bit volume of bit traces.
Claim 15
Dependent Claim
59 words
The method of claim 12 further comprising the steps of interactively selecting a seed bit on a bit trace in said bit volume which falls on a horizon, and scanning said horizon through said bit volume by starting with said seed bit, and picking 1 bits on adjacent bit traces of said bit volume which lie on said horizon.
Claim 16
Dependent Claim
177 words
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, and where said common attribute may vary in depth as a function of x-y coordinates of said seismic data traces, a method of creating an indicia volume comprising the steps of 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 storing each of said indicia traces in the memory of a computer as a three-dimensional indicia volume of indicia traces.
Claim 17
Dependent Claim
177 words
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, and where said common attribute may vary in depth as a function of x-y coordinates of said seismic data traces, a method of creating an indicia volume comprising the steps of 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 storing each of said indicia traces in the memory of a computer as a three-dimensional indicia volume of indicia traces.
Claim 18
Dependent Claim
21 words
The method of claim 14 wherein said first indicium is a "1" bit and said second indicium is a "0" bit.
References Cited (Backward Citations)
US4633448A
Cited
US5056066A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-10-06 | 1996-04-06 | 1996-10-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-10-06 | 2000-04-06 | 2000-10-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-10-06 | 2004-04-06 | 2004-10-06 | $7700.00 | Window Closed / Lapsed |