US20220390634A1 - Method for generating a geological age model from incomplete horizon interpretations - Google Patents
Method for generating a geological age model from incomplete horizon interpretations Download PDFInfo
- Publication number
- US20220390634A1 US20220390634A1 US17/537,143 US202117537143A US2022390634A1 US 20220390634 A1 US20220390634 A1 US 20220390634A1 US 202117537143 A US202117537143 A US 202117537143A US 2022390634 A1 US2022390634 A1 US 2022390634A1
- Authority
- US
- United States
- Prior art keywords
- patches
- patch
- links
- age
- recited
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 66
- 239000011159 matrix material Substances 0.000 claims description 17
- 230000015654 memory Effects 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 12
- 238000012545 processing Methods 0.000 claims description 6
- 238000013213 extrapolation Methods 0.000 claims description 5
- 238000013527 convolutional neural network Methods 0.000 claims description 4
- 238000009499 grossing Methods 0.000 claims description 4
- 238000011022 operating instruction Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 abstract description 6
- 238000002955 isolation Methods 0.000 abstract description 2
- 239000013598 vector Substances 0.000 description 16
- 230000006870 function Effects 0.000 description 12
- 238000010586 diagram Methods 0.000 description 9
- 238000013459 approach Methods 0.000 description 6
- 238000005553 drilling Methods 0.000 description 6
- 238000004458 analytical method Methods 0.000 description 4
- 238000010348 incorporation Methods 0.000 description 4
- 230000000007 visual effect Effects 0.000 description 4
- 238000007792 addition Methods 0.000 description 3
- 238000012805 post-processing Methods 0.000 description 3
- 238000012552 review Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 238000013135 deep learning Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000007781 pre-processing Methods 0.000 description 2
- 238000000275 quality assurance Methods 0.000 description 2
- 238000003908 quality control method Methods 0.000 description 2
- 239000004215 Carbon black (E152) Substances 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012512 characterization method Methods 0.000 description 1
- HPNSNYBUADCFDR-UHFFFAOYSA-N chromafenozide Chemical compound CC1=CC(C)=CC(C(=O)N(NC(=O)C=2C(=C3CCCOC3=CC=2)C)C(C)(C)C)=C1 HPNSNYBUADCFDR-UHFFFAOYSA-N 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 230000008021 deposition Effects 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 229930195733 hydrocarbon Natural products 0.000 description 1
- 150000002430 hydrocarbons Chemical class 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000000149 penetrating effect Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 230000001902 propagating effect Effects 0.000 description 1
- 238000004445 quantitative analysis Methods 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
- 239000013049 sediment Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V1/00—Seismology; Seismic or acoustic prospecting or detecting
- G01V1/28—Processing seismic data, e.g. for interpretation or for event detection
- G01V1/30—Analysis
- G01V1/301—Analysis for determining seismic cross-sections or geostructures
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V1/00—Seismology; Seismic or acoustic prospecting or detecting
- G01V1/28—Processing seismic data, e.g. for interpretation or for event detection
- G01V1/32—Transforming one recording into another or one representation into another
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V1/00—Seismology; Seismic or acoustic prospecting or detecting
- G01V1/28—Processing seismic data, e.g. for interpretation or for event detection
- G01V1/34—Displaying seismic recordings or visualisation of seismic data or attributes
- G01V1/345—Visualisation of seismic data or attributes, e.g. in 3D cubes
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V20/00—Geomodelling in general
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V2210/00—Details of seismic processing or analysis
- G01V2210/60—Analysis
- G01V2210/64—Geostructures, e.g. in 3D data cubes
- G01V2210/641—Continuity of geobodies
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V2210/00—Details of seismic processing or analysis
- G01V2210/60—Analysis
- G01V2210/66—Subsurface modeling
- G01V2210/661—Model from sedimentation process modeling, e.g. from first principles
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V2210/00—Details of seismic processing or analysis
- G01V2210/70—Other details related to processing
- G01V2210/74—Visualisation of seismic data
Definitions
- Seismology exploration includes generating seismic waves to map subsurface structures.
- the seismic waves propagate from a source down into the earth and reflect from boundaries between subsurface structures.
- Receivers detect and record the reflected seismic waves, which can be saved as datasets.
- a seismic interpretation workflow is often used to process the datasets.
- a time-consuming and challenging part of the seismic interpretation workflow is the extraction of seismic horizons from the dataset.
- the horizons not only characterize the structure of the subsurface, but also represent surfaces of uniform geological time during the deposition of sediments. Because of more advanced workflows such as reservoir characterization and stratigraphic studies, there is often a need to extract large numbers, such as a 100 or more, of seismic horizons from any given dataset, and to determine the relationships between these horizons.
- the disclosure provides an automated method of generating a geological age model for a subterranean area.
- the automated method includes: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
- the disclosure provides a computer program product having a series of operating instructions stored on a non-transitory computer-readable medium that directs a data processing apparatus when executed thereby to perform operations to generate a geological age model from a pre-interpreted suite of patches.
- the operations include: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
- the disclosure provides an apparatus including at least one processor and memory, the memory including computer program code, the memory and the computer program code configured to, with the at least one processor, cause the apparatus to automatically generate a geological age model from a pre-interpreted suite of patches by performing at least the following: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
- FIG. 1 illustrates a flow diagram of an example of a workflow for horizon interpretation in seismic data carried out according to the principles of the disclosure
- FIG. 2 illustrates a diagram that provides a visual example of defining links between patches according to the principles of the disclosure
- FIG. 3 A illustrates a diagram of an example of seismic data from a subterranean area
- FIG. 3 B illustrates a diagram showing a suite of interpreted patches from the seismic data of FIG. 3 A after pre-processing
- FIG. 3 C illustrates a diagram providing an example of an initial depositional rate model automatically created from pre-processed seismic data of FIG. 3 B ;
- FIG. 3 D illustrates a diagram of an example of a geological age model obtained according to the principles of the disclosure.
- FIG. 4 illustrates a block diagram of an example of a seismic data evaluator constructed according to the principles of the disclosure.
- the disclosure provides a process that does not interpret patches themselves but determines the relationships between patches, in order to associate and link patches to derive a holistic geological interpretation.
- Predefined patches such as from a pre-interpreted suite, are received as inputs to determine the relationships and derive an interpretation for a complete volume.
- This disclosure describes an automated method for defining the relationships between these patches, which allows the construction of a geological age model from the patches.
- the method relates to a component of a seismic workflow for the interpretation of subsurface geological horizons from processed seismic data.
- the seismic data can be reflection data.
- the features disclosed herein can also be applied to interpretation of ground penetrating radar, or seismic data from other methods that can be used to interpret sedimentary layers in a subsurface.
- the method constructs a geological age model from a pre-interpreted suite of incomplete sub-horizons (patches), which may also include a number of complete horizons.
- the method includes determining relative geological ages for the patches, such as for each of the patches, which are constrained by patch-links that associate patches based on spatial-temporal relationships defined according to geological principles. For example, the relationships can be that one patch is older than another, or that a pair of patches are likely to be the same age.
- the geological age model is achieved by interpolating the patch ages onto a grid, wherein the final output can be a Relative Geological Time (RGT) volume.
- RTT Relative Geological Time
- the method allows the addition of known a priori constraints, e.g., well-ties, to quickly arrive at a solution, which can be part of a modular workflow. Additionally, the creation and storage of inter-patch definition of links provides the options for direct user interaction.
- the disclosed method has the benefits of abstracting a seismic volume to a limited number of patches and then further abstracting the geometry of the patches to a subset of spatial and geological relationships between those patches, which can be accomplished by defining the patch-links.
- Abstracting is reducing the data to a simplified representation of the whole, such as a process of removing characteristics to reduce the data to a set of essential characteristics.
- patch-links can be added to constrain the relationships between patches.
- the method allows the incorporation of constraints from well-data, previous interpretations or other observations such that the age-volume can be calibrated.
- the method also allows the ready incorporation of faults and other geological complexities.
- the method generates solution matrices that can be solved to provide the geological age models.
- the solution matrices are square matrices with dimensions of the number of patches.
- FIG. 1 illustrates a flow diagram of an example of a workflow 100 for horizon interpretation in seismic data carried out according to the principles of the disclosure.
- the workflow 100 solves for a global age model from an unlinked suite of patches.
- the workflow uses the geological principle of super-position and the assumption that horizons get older with depth, such that if a patch overlies another then the upper patch is younger than the lower patch.
- At least a portion of the workflow 100 can be automated. At least a portion of workflow 100 can represent an algorithm or algorithms and be encapsulated in software code or in hardware, for example, an application, a code library, a dynamic link library, a module, a function, a RAM, a ROM, and other software and hardware implementations.
- the software can be stored in a file, database, or other computing system storage mechanism.
- the software can be stored on a non-transitory computer readable medium.
- At least a portion of the workflow 100 can be partially implemented in software and partially in hardware.
- a processor can be directed to perform operations according to the algorithms.
- processor 430 of the seismic data evaluator 400 of FIG. 4 can be configured to perform, such as automatically perform, some of the steps of the workflow 100 .
- Various equations are noted in the following discussion of the workflow 100 as examples for performing some of the steps of the workflow 100 .
- the algorithms can correspond to one or more, including all, of the equations.
- the workflow 100 begins by receiving seismic data in step 105 .
- the seismic data can be received from a seismic data store.
- the seismic data can be seismic reflection data.
- the seismic data can be 3D data.
- the seismic data can also be 4D data that would typically include two or more 3D surveys shot at different times.
- the disclosed technique can be applied to each of the two or more 3D datasets independently.
- FIG. 3 A provides an example of seismic data that is received.
- the seismic data of FIG. 3 A is a 2D inline section of 3D seismic data.
- the seismic data is pre-processed to generate a pre-interpreted suite of patches.
- the seismic data can be cleaned-up in step 110 .
- Conventional processing methods can be used to generate a pre-interpreted suite of patches.
- the resulting seismic data can also include horizons with the pre-interpreted suite of patches.
- Patches are defined from the pre-processed seismic data in step 120 .
- the patches can be defined via conventional procedures.
- FIG. 3 B illustrates an example of a suite of interpreted patches from the seismic data of FIG. 3 A after pre-processing. In FIG. 3 B , the patches are represented in black.
- a single patch 310 is identified as an example.
- the pre-defined horizons can be selected from a data repository, such as the seismic data store. Selection and adding of the pre-defined horizons can be performed manually or automatically.
- the pre-defined horizons can be known horizons and a correlation of these horizons with the interpreted seismic data can be determined automatically by a processor or manually by one skilled in the art.
- a match can be based on depth/TWT for pre-existing patches. For example, if the pre-processed patch coincides with (i.e.
- the patch could be removed as the data are redundant. If a patch crosses a known horizon, several options exist: 1) the patch could be split by the ‘known horizon’; 2) the patch could be removed, 3) the patch could be flagged for quality assurance or quality control.
- step 135 the workflow 100 continues to step 140 and patch-links are defined.
- the workflow 100 solves for a global age model from an unlinked suite of patches using the geological principle of super-position and the assumption that horizons get older with depth. Solving for the global age model includes defining relationships or patch-links between the unlinked patches. Patch-links are used to set-up n-simultaneous equations that calculate the depositional rate between superposed patches, such as represented by Equation 1.
- z jk is the depth to path j for link k
- a j is age of patch j
- d ijk is the relative depositional rate between patch i and patch j for link k, such that z jk >z ik .
- Equation 2 To solve for relative geological age Equation 1, for example, can be rearranged into matrix form as represented by Equation 2.
- Equation 3 An overdetermined system of equations from n links between patches can then built represented, for example, by Equation 3.
- L is an n by m matrix, whose entries are defined by the inverse of the distance between horizons.
- ⁇ right arrow over (a) ⁇ is a m by 1 vector of the age of horizon path.
- the links between patches can be defined a variety of ways, but the intent is to define one or more links from each patch to a patch directly below or above it.
- Several strategies could be employed, including but not limited to: On a regular grid of x, y, locations, determine the intersection of patches in the vertical axis (time or depth) and define patch-links between all vertically adjacent patches at a location. For each patch, extract links by searching for the nearest patch and continue to process through the grid to cover the various locations of the grid.
- FIG. 2 provides a visual example that shows five patches and links defined between them.
- An example of an L matrix from Equation 3 for the patches shown in FIG. 2 is given in Equation 4.
- the workflow 100 continues to step 150 where the decision to include an initial age model is made. If an initial age model is not to be used, the workflow 100 continues to step 150 , and a constant initial depositional rate is specified, as an initial condition. If an initial age model is to be included than the workflow continues to step 155 and one is selected.
- the initial age model can be defined based on historical data. Other known methods can be used to select or define the initial age model.
- the initial age model can be used directly or used to define an initial depositional rate mode (by extracting the vertical gradient of the age model for each patch-link).
- FIG. 3 C represents an initial depositional rate model.
- FIG. 3 C illustrates an initial depositional rate model calculated by approximating a “stream function” from seismic dip. In FIG. 3 C , slow areas are denoted in black and fast depositional areas are denoted in dark blue. A slow depositional area 320 and a fast depositional area 330 are identified in FIG. 3 C as examples.
- step 160 the geological age model is iteratively solved.
- the depositional slowness vector or the age vector in Equation 3 is unknown but can be solved iteratively by assuming either an initial age model or slowness vector using Equations 4 and Equation 5.
- ⁇ right arrow over (s) ⁇ and ⁇ right arrow over (a) ⁇ are unknown and an iterative solution is needed. Assuming, for example, a starting model ⁇ right arrow over (s 0 ) ⁇ such as a constant, then for iteration p
- ⁇ is a regularization parameter, set to a negligibly small value so that L is not singular.
- I is the identity matrix and ⁇ defines the rate of convergence such that 0 ⁇ >1.
- FIG. 3 D provides an example of a geological age model generated by step 160 .
- Equations 5 and 6 do not guarantee that the principle of superposition, i.e., a positive depositional rate, is enforced.
- This constraint can be implemented by replacing any negative values ⁇ 0 with relatively large value (e.g., a value of two times the initial (or average) depositional slowness, typically yields good results), or by modifying Equation 5.
- Boundary conditions such as fixed age constraints, can also be used when defining the patch-links in step 140 to assist solving in step 160 .
- L is singular
- addition of a negligible regularization parameter in Equation 5 allows the model to be solved but will lead to a zero-mean age for the patches.
- More geologically sensible results can be obtained by adding one or more boundary condition.
- the age of the horizon can be fixed using Equations 7-10.
- boundary conditions can remove the need for the regularization term in Equation 5, if boundary conditions are set such that L is non-singular.
- boundary conditions By analogy to a directed graph, where the patches are nodes and patch-links are edges, this requires that all connected components of the graph have a boundary condition set.
- boundary conditions can be set, for example if certain interpreted horizons or patches have been assigned a geological age based on external geological knowledge, or if there is an age calibrated well tied to the seismic data, then these known constraints can be incorporated in the solution as additional boundary conditions.
- the initial depositional slowness model used in Equation 5 can be scaled. This can be achieved by applying a constant value that is equivalent to the average depositional slowness inferred from the boundary conditions.
- An alternative solution can use known constraints to define an initial age model for the patches and then use Equation 3 to define an initial slowness model.
- the initial age model could be defined by interpolating between known constraints to define an apriori age volume and then assign an age for each patch by sampling this age volume.
- Manual or automated age equivalence of patches can also be used when defining the patch-links in step 140 .
- the approach of vertical superposition can determine the relative geological ages for disconnected patches that are superposed and sub-parallel. However, for discontinuous, folded and/or faulted horizons or where thicknesses vary significantly, e.g., clinoforms, sometimes the method is less able to constrain the lateral equivalence of patches.
- Equation 10 provides an example of the system of equations based on FIG. 2 if path 1 is known to be 0 Ma and patch 5 is known to be 20 Ma.
- Adding patch-links automatically can include extrapolation between patches and intersections e.g., based on local structural dips, Dynamic time-warping, and Deep learning approaches e.g., horizon tracking using a CNN.
- their incorporation into the least-squares solution for a global age model can be performed via various ways, including the options of soft-constraints and hard-constraints.
- soft constraints a link between the patches is added in a similar way to vertical links, such that patches are encouraged, but not forced, to have the same age. Using this approach it is possible to weight the constraint. i.e., add a link with the format shown by
- Equation 12 shows the system of equations that results from adding a constraint that horizons 3 and 4 of FIG. 2 are known to have equivalent ages.
- Equation 11 provides an example of a soft constraint.
- the patches are merged such that all the patch-links for one of the patches are applied to the equivalent patch and a condition applied that forces identical ages for the patches.
- matrix L can be adjusted using, for example, Equation 13 and a constraint can be added as shown by Equation 14.
- a hard constraint can be added per
- Equation 15 shows the system of equations that results from adding a constraint that horizons 3 and 4 of FIG. 2 are known to be the same age.
- Automating age equivalence assignment can be performed via a trace-to-trace approach that takes two traces, identifies isolated patches (i.e., those that only exist on one of the traces), and extrapolates these isolated patches from each trace to a common location (e.g., the midpoint between traces). Extrapolation can be achieved by various methods, such as using patches present on both traces to define local trends for the extrapolation. Extrapolating based on the local trend of each isolated patch can be performed using a pre-calculated structural trend, for example a dip volume, stream function. The extrapolated position of the isolated patches can be used to define patch-links between patches that are not present on the same trace. It is also possible to extrapolate patches following some measure of local structural dip. These extrapolated patches can then be used to define additional vertical links in the same way as shown in FIG. 2 and used to construct a geological age model.
- Equations 16 and 17 can be imposed.
- Distances could be calculated using various methods, such as Euclidean distance, Manhattan distances or as a structurally weighted distance if distances parallel to structural dip are shorter than an equivalent spatial distance perpendicular to dip.
- Normalization of patch-links can also be used for the solving of step 160 .
- the least square solution of an age model minimizes the differences between the target and the derived depositional rate. Given the same relative difference, a greater value of depositional rate contributes more to the misfit function.
- a weighting matrix can be applied to the solution. Equation 18 provides an example of a weighting vector that can be applied to Equation 3.
- the weights can be determined by a negative power of the depositional slowness vector, if an initial depositional rate model is supplied. Alternatively, weights can be defined based on maximum values of rows in matrix L, such that the impact of each patch-link on the final solution is normalized. Equations 19-21 provide examples of weighting to balance the contribution along the depositional rate vector. These examples are illustrative and not exhaustive, other weighting or combination of weights can be applied. A weighting matrix can be applied using, for example, Equations 19-21.
- Equation 19 a weighting matrix W can be introduced.
- W is a m by m diagonal matrix and its element W ii can be defined by
- the age vector can be solved per
- Linear constraints can also be included into the least square solution to guide the solution of age model.
- the least square solution of the age vector ⁇ right arrow over (a) ⁇ can be equivalent to minimizing the objective function represented by
- w 1 denotes the weighting of the regularization.
- Equation 23 provides an example of considering the solution subject to a linear constraint.
- ⁇ right arrow over (b) ⁇ is a n by 1 vector having the same size as ⁇ right arrow over (a) ⁇
- P is a m by n matrix
- Such a linear constraint can be used to represent various or even any relationship of age as long as it is linear. For example, it can describe the equivalence of age among selected patches. For another example, it can be used to calculate the derivatives of age and compared to an external field, e.g., a structural tensor field, to ensure the consistency between the age model and the external metric field.
- an external field e.g., a structural tensor field
- Equation 24 provides an example of the objective function with the inclusion of a linear constraint.
- w 2 denotes the weighting of the linear constraint
- the value of w 2 determines the harshness of the constraint.
- the matric P can be represented by Equation 25 and vector ⁇ right arrow over (b) ⁇ is a zero vector.
- Equation 26 The least square solution of ⁇ right arrow over (a) ⁇ with respect to the constrained objective function can be represented by Equation 26 with the linear constraint as represented by Equation 2 applied.
- Previously defined faults can also be incorporated into the solution.
- patch creation the patches are truncated or split by faults.
- any patch-links that cross a fault can be removed.
- patch-links can be defined automatically, e.g., based on dynamic time-warping on either side of the fault, or by manual input. But such links are unlikely to follow local structural dip.
- age constraints can also be added to steps 155 and 160 .
- the age constraints can be age-equivalent constraints including some of the constraints noted above with respect to step 140 .
- dynamic time-warping and deep learning approaches such as horizon tracking using a CNN, can be incorporated into one or more of steps 155 and 160 .
- the geological age model can be provided to a display for a visual review. Automated and/or quantitative methods can also be used that analyze, for example, a misfit between the gradient of an interpolated age model and the local structural dip volume. The automated analysis can be relied upon to determine acceptance, or a user can use results from the automatic analysis to assist in manually determining acceptance.
- the workflow 100 returns to step 130 . If acceptable, the workflow 100 continues to post-processing in step 180 .
- the solution of the geological age model results in ages assigned to the patches themselves.
- post-processing including 3D interpolation of patch-ages to generate an age model, 3D structure guided interpolation, e.g. Dave Hale, (2009), “Image-guided blended neighbor interpolation of scattered data,”SEG Technical Program Expanded Abstracts: 1127-1131, which is incorporated herein by reference, grouping patches with similar ages and no overlap then interpolate, sequential dip-tracking of patches, and horizon optimization, e.g. Wu, X. & Hale, D., 2015, Horizon volumes with interpreted constraints, Geophysics, 80(2), IM21-IM33, which is incorporated by reference.
- Other methods of post-processing such as conventional methods and procedures, can also be used.
- an output is provided from the processed geological age model.
- the output can be a Relative Geological Time (RGT) volume.
- RTT Relative Geological Time
- the output provides an understanding of the subsurface geology and can be used to develop oil field models to identify and target hydrocarbon resources.
- the output can be used in a well operation, such as a drilling operation, wherein the output is used to identify the drilling location and drilling is performed at the location.
- FIGS. 3 A to 3 D an example of determining the relative geologic age using the proposed method is provided.
- a 3D seismic cube is used to demonstrate the utility of the method.
- the 3D seismic cube consists of 100 inlines (inline ID from 200 to 300), 900 crosslines (crossline ID from 300 to 1200), and a time window of 1000 ms (from 500 to 1500 ms), which is cropped from an example of an open-source 3D seismic dataset.
- the cross lines are on the x axis and the time is on the y axis of FIG. 3 A that shows the original seismic data on a single inline section, inline 240.
- Nodes are first selected by an automatic scan of seismic troughs. Edges are then generated between the nodes in order to form patches as represented in FIG. 3 B .
- the edges could be generated by one or more different methods, for example using conventional tracking methods, dynamic time warping (DTW) or by dip-tracking to form connections.
- the connected nodes are used to designate interpreted horizons, which are then validated in 3D to avoid any unwanted features, e.g., superposition of seismic events in a single patch. There are several methods that could be used to accomplish this validation.
- FIG. 3 B shows the 2D view of the validated patches overlaid on the selected seismic section. Note that very small patches (less than 5 nodes) have been excluded from the display.
- FIG. 3 C shows one option to automatically create an initial model. First a dip magnitude and azimuth are calculated from the seismic data and used to approximate a three-dimensional stream function by assuming that the dip vectors represent a flow field through the seismic data. An initial depositional rate can then be obtained by calculating the vertical derivative of the stream function.
- FIG. 3 D shows a first-pass, contour plot of the obtained geological age model.
- the weighting of the links is balanced by the inverse of depositional rate. In this example no linear constraint has been added.
- the age values of the patches can be solved via a matrix inverse, and then interpolated to give a fully sample 2D section.
- the age values of the patches are firstly solved by the least square solution, and then interpolated by a 2D linear operator to give a fully sampled 2D age section.
- the contours of the first-pass solution in general show a very good consistency with the seismic data.
- the overall structure of the clinoforms and parallel seismic events are clearly shown in the age section.
- the bottom-right age section shows disagreement, which is mainly limited by the lack of patches and the presence of a major normal fault.
- FIG. 3 D illustrates a contour plot wherein the ages of patches are discrete measurements.
- each line represents a single age and similar lines represent an interval of an age range.
- each of the solid lines represent a single age and all three of the solid lines represent an age interval.
- the age model can be iteratively improved by an interactive updating of links and patches to complete the patches to horizons.
- the entire process can be purely automatic, with choosing appropriate parameters to run the program.
- the computation time of solving the age in 3D for this example took about 15 seconds, on a mobile workstation (8 th Generation Intel i7 processor with 16 Gb RAM).
- the preparation of onsets, patches and initial models can take 5 to 30 minutes, depending on the choice of methods, and the size of the dataset.
- the disclosure provides an efficient solution to construct a 3D age model from seismic data.
- FIG. 4 illustrates a block diagram of an example of a seismic data evaluator 400 constructed according to the principles of the disclosure.
- the seismic data evaluator 400 can be a computing device.
- the seismic data evaluator 400 includes at least one interface 410 for receiving and transmitting information, at least one memory 420 for storing data and computer programs, and at least one processor 430 for performing functions when directed by the computer programs.
- the memory 420 can store code corresponding to algorithms representing at least some of the steps of the workflow 100 , that direct the processor 430 to automatically generate a geological age model from a pre-interpreted suite of patches by abstracting seismic data of a subsurface into a limited number of patches, abstracting the patches by defining links between the patches, and generating a geological age model of the subsurface by solving for the relative geological age of the patches, for example for each of the patches, using the links.
- the algorithms can correspond to one or more, including all, of the equations disclosed herein. Other similar methods or portions of other similar methods can also be used to direct the processor 430 to perform similar functions.
- the interface 410 is a communications interface that includes the necessary hardware, software, or combination th ereof to communicate, i.e., receive and transmit, data.
- the interface 410 can be a conventional interface. As illustrated, the interface can receive seismic data for processing.
- the seismic data can be 3D (three dimensional) data.
- the seismic data may also be 2D or 4D.
- the interface 410 also transmits a geological age model provided by the processor 430 .
- the geological age model can be sent to a display for visual presentation, which can be used for manual interpretation.
- the geological age model can also be presented to another processor or computing system for additional processing and or analysis, such as automated analysis.
- the resulting geological age model can be, for example, used in a well operation, such as a drilling operation, wherein the output is used to identify the drilling location and drilling is performed at the location.
- the memory 420 can be a conventional memory or data storage.
- the processor 430 can be one or more processors, including a CPU, a GPU, or a combination thereof.
- a portion of the above-described apparatus, systems or methods may be embodied in or performed by various analog or digital data processors, wherein the processors are programmed or store executable programs of sequences of software instructions to perform one or more of the steps of the methods.
- a processor may be, for example, a programmable logic device such as a programmable array logic (PAL), a generic array logic (GAL), a field programmable gate arrays (FPGA), or another type of computer processing device (CPD).
- PAL programmable array logic
- GAL generic array logic
- FPGA field programmable gate arrays
- CPD computer processing device
- the software instructions of such programs may represent algorithms and be encoded in machine-executable form on non-transitory digital data storage media, e.g., magnetic or optical disks, random-access memory (RAM), magnetic hard disks, flash memories, and/or read-only memory (ROM), to enable various types of digital data processors or computers to perform one, multiple or all of the steps of one or more of the above-described methods, or functions, systems or apparatuses described herein.
- non-transitory digital data storage media e.g., magnetic or optical disks, random-access memory (RAM), magnetic hard disks, flash memories, and/or read-only memory (ROM), to enable various types of digital data processors or computers to perform one, multiple or all of the steps of one or more of the above-described methods, or functions, systems or apparatuses described herein.
- Non-transitory computer-readable medium that have program code thereon for performing various computer-implemented operations that embody a part of an apparatus, device or carry out the steps of a method set forth herein.
- Non-transitory used herein refers to all computer-readable media except for transitory, propagating signals. Examples of non-transitory computer-readable media include but are not limited to: magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM disks; magneto-optical media such as floppy disks; and hardware devices that are specially configured to store and execute program code, such as ROM and RAM devices.
- Configured means, for example, designed, constructed, or programmed, with the necessary logic and/or features for performing a task or tasks.
- a configured device therefore, is capable of performing the task or tasks.
- Examples of program code include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter.
- the automated method includes: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
- the operations include: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
- An apparatus comprising at least one processor and memory, the memory including computer program code, the memory and the computer program code configured to, with the at least one processor, cause the apparatus to automatically generate a geological age model from a pre-interpreted suite of patches by performing at least the following: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
- Element 1 wherein the defining the patch-links includes defining spatial relationships between the patches.
- Element 2 wherein the spatial relationships are differences in depth.
- Element 3 wherein the geological and spatial relationships are defined according to an inverse of the depositional rate between the patches.
- Element 4 wherein defining the patch-links includes applying a weighting factor to the inverse of depositional rate.
- solving for the relative geological age of the patches includes iteratively solving an equation representing the inverse of the depositional rate between the patches.
- Element 6 wherein iteratively solving the equation includes assuming a starting model for the inverse of the depositional rate.
- Element 7 wherein iteratively solving the equation includes assuming a starting model for the age of each patch.
- Element 8 wherein defining the patch-links includes using constraints.
- Element 9 wherein the constraints are fixed age constraints.
- Element 10 wherein the constraints are soft constraints associated with an age equivalence of the patches.
- Element 11 wherein the constraints are hard constraints associated with an age equivalence of the patches.
- Element 12 wherein the constraints include one or more of extrapolation between patches and intersections, dynamic time-warping, and horizon tracking using a convolutional neural network.
- Element 13 wherein generating the geological age model includes using a smoothing constraint.
- Element 14 wherein generating the geological age model includes balancing contribution of depositional rates by applying a weighting matrix.
- Element 15 wherein generating the geological age model includes using a least square solution and linear constraints.
Landscapes
- Engineering & Computer Science (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- General Life Sciences & Earth Sciences (AREA)
- General Physics & Mathematics (AREA)
- Geophysics (AREA)
- Acoustics & Sound (AREA)
- Environmental & Geological Engineering (AREA)
- Geology (AREA)
- Geophysics And Detection Of Objects (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
In contrast to existing methods wherein derived horizons are interpreted in isolation, the disclosure provides a process that does not interpret patches themselves but determines the relationships between patches, in order to associate and link patches to derive a holistic geological interpretation. Predefined patches, such as from a pre-interpreted suite, are received as inputs to determine the relationships and derive an interpretation for a complete volume. In one aspect the disclosure provides an automated method of generating a geological age model for a subterranean area. In one example, the automated method includes: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
Description
- This application claims the benefit of U.S. Provisional Application Ser. No. 63/197,180, filed by Graham Baines, et al. on Jun. 4, 2021, entitled “A METHOD FOR GENERATING A GEOLOGICAL AGE MODEL FROM INCOMPLETE HORIZON INTERPRETATIONS,” commonly assigned with this application and incorporated herein by reference in its entirety.
- Oil and gas companies often use seismology for subterranean exploration. Seismology exploration includes generating seismic waves to map subsurface structures. The seismic waves propagate from a source down into the earth and reflect from boundaries between subsurface structures. Receivers detect and record the reflected seismic waves, which can be saved as datasets. A seismic interpretation workflow is often used to process the datasets.
- A time-consuming and challenging part of the seismic interpretation workflow is the extraction of seismic horizons from the dataset. The horizons not only characterize the structure of the subsurface, but also represent surfaces of uniform geological time during the deposition of sediments. Because of more advanced workflows such as reservoir characterization and stratigraphic studies, there is often a need to extract large numbers, such as a 100 or more, of seismic horizons from any given dataset, and to determine the relationships between these horizons.
- In one aspect, the disclosure provides an automated method of generating a geological age model for a subterranean area. In one example, the automated method includes: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
- In another aspect, the disclosure provides a computer program product having a series of operating instructions stored on a non-transitory computer-readable medium that directs a data processing apparatus when executed thereby to perform operations to generate a geological age model from a pre-interpreted suite of patches. In one example the operations include: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
- In yet another aspect, the disclosure provides an apparatus including at least one processor and memory, the memory including computer program code, the memory and the computer program code configured to, with the at least one processor, cause the apparatus to automatically generate a geological age model from a pre-interpreted suite of patches by performing at least the following: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
- Reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
-
FIG. 1 illustrates a flow diagram of an example of a workflow for horizon interpretation in seismic data carried out according to the principles of the disclosure; -
FIG. 2 illustrates a diagram that provides a visual example of defining links between patches according to the principles of the disclosure; -
FIG. 3A illustrates a diagram of an example of seismic data from a subterranean area; -
FIG. 3B illustrates a diagram showing a suite of interpreted patches from the seismic data ofFIG. 3A after pre-processing; -
FIG. 3C illustrates a diagram providing an example of an initial depositional rate model automatically created from pre-processed seismic data ofFIG. 3B ; -
FIG. 3D illustrates a diagram of an example of a geological age model obtained according to the principles of the disclosure; and -
FIG. 4 illustrates a block diagram of an example of a seismic data evaluator constructed according to the principles of the disclosure. - Various tracking algorithms are often used to track horizons in a seismic dataset. The conventional tracking algorithms, however, are unable to track a seismic horizon throughout a volume due to lateral heterogeneity along a horizon, structural complexity or noise. As such, a suite of disconnected sub-horizons, or patches, are usually the result.
- In contrast to existing methods wherein derived horizons are interpreted in isolation, the disclosure provides a process that does not interpret patches themselves but determines the relationships between patches, in order to associate and link patches to derive a holistic geological interpretation. Predefined patches, such as from a pre-interpreted suite, are received as inputs to determine the relationships and derive an interpretation for a complete volume.
- This disclosure describes an automated method for defining the relationships between these patches, which allows the construction of a geological age model from the patches. The method relates to a component of a seismic workflow for the interpretation of subsurface geological horizons from processed seismic data. The seismic data can be reflection data. The features disclosed herein can also be applied to interpretation of ground penetrating radar, or seismic data from other methods that can be used to interpret sedimentary layers in a subsurface. The method constructs a geological age model from a pre-interpreted suite of incomplete sub-horizons (patches), which may also include a number of complete horizons.
- The method includes determining relative geological ages for the patches, such as for each of the patches, which are constrained by patch-links that associate patches based on spatial-temporal relationships defined according to geological principles. For example, the relationships can be that one patch is older than another, or that a pair of patches are likely to be the same age. The geological age model is achieved by interpolating the patch ages onto a grid, wherein the final output can be a Relative Geological Time (RGT) volume. The method allows the addition of known a priori constraints, e.g., well-ties, to quickly arrive at a solution, which can be part of a modular workflow. Additionally, the creation and storage of inter-patch definition of links provides the options for direct user interaction.
- The disclosed method has the benefits of abstracting a seismic volume to a limited number of patches and then further abstracting the geometry of the patches to a subset of spatial and geological relationships between those patches, which can be accomplished by defining the patch-links. Abstracting is reducing the data to a simplified representation of the whole, such as a process of removing characteristics to reduce the data to a set of essential characteristics.
- Any number of patch-links can be added to constrain the relationships between patches. For example, the method allows the incorporation of constraints from well-data, previous interpretations or other observations such that the age-volume can be calibrated. The method also allows the ready incorporation of faults and other geological complexities. The method generates solution matrices that can be solved to provide the geological age models. The solution matrices are square matrices with dimensions of the number of patches.
-
FIG. 1 illustrates a flow diagram of an example of aworkflow 100 for horizon interpretation in seismic data carried out according to the principles of the disclosure. Theworkflow 100 solves for a global age model from an unlinked suite of patches. The workflow uses the geological principle of super-position and the assumption that horizons get older with depth, such that if a patch overlies another then the upper patch is younger than the lower patch. - At least a portion of the
workflow 100 can be automated. At least a portion ofworkflow 100 can represent an algorithm or algorithms and be encapsulated in software code or in hardware, for example, an application, a code library, a dynamic link library, a module, a function, a RAM, a ROM, and other software and hardware implementations. The software can be stored in a file, database, or other computing system storage mechanism. The software can be stored on a non-transitory computer readable medium. At least a portion of theworkflow 100 can be partially implemented in software and partially in hardware. A processor can be directed to perform operations according to the algorithms. For example,processor 430 of the seismic data evaluator 400 ofFIG. 4 can be configured to perform, such as automatically perform, some of the steps of theworkflow 100. Various equations are noted in the following discussion of theworkflow 100 as examples for performing some of the steps of theworkflow 100. The algorithms can correspond to one or more, including all, of the equations. - The
workflow 100 begins by receiving seismic data instep 105. As shown inFIG. 1 , the seismic data can be received from a seismic data store. The seismic data can be seismic reflection data. The seismic data can be 3D data. The seismic data can also be 4D data that would typically include two or more 3D surveys shot at different times. The disclosed technique can be applied to each of the two or more 3D datasets independently.FIG. 3A provides an example of seismic data that is received. The seismic data ofFIG. 3A is a 2D inline section of 3D seismic data. - In
step 110, the seismic data is pre-processed to generate a pre-interpreted suite of patches. The seismic data can be cleaned-up instep 110. Conventional processing methods can be used to generate a pre-interpreted suite of patches. The resulting seismic data can also include horizons with the pre-interpreted suite of patches. - Patches are defined from the pre-processed seismic data in
step 120. The patches can be defined via conventional procedures.FIG. 3B illustrates an example of a suite of interpreted patches from the seismic data ofFIG. 3A after pre-processing. InFIG. 3B , the patches are represented in black. Asingle patch 310 is identified as an example. - A determination is made in
step 130 if there are pre-defined horizons to add to the interpreted seismic data. If there are, theworkflow 100 continues to step 135 where the pre-defined horizons are selected and added to the pre-interpreted seismic data. The pre-defined horizons can be selected from a data repository, such as the seismic data store. Selection and adding of the pre-defined horizons can be performed manually or automatically. The pre-defined horizons can be known horizons and a correlation of these horizons with the interpreted seismic data can be determined automatically by a processor or manually by one skilled in the art. A match can be based on depth/TWT for pre-existing patches. For example, if the pre-processed patch coincides with (i.e. duplicates) some or all of a ‘known horizon’, the patch could be removed as the data are redundant. If a patch crosses a known horizon, several options exist: 1) the patch could be split by the ‘known horizon’; 2) the patch could be removed, 3) the patch could be flagged for quality assurance or quality control. - After
step 135, theworkflow 100 continues to step 140 and patch-links are defined. - Additionally, if there are no pre-defined horizons to add, the
workflow 100 continues to step 140. As noted above, theworkflow 100 solves for a global age model from an unlinked suite of patches using the geological principle of super-position and the assumption that horizons get older with depth. Solving for the global age model includes defining relationships or patch-links between the unlinked patches. Patch-links are used to set-up n-simultaneous equations that calculate the depositional rate between superposed patches, such as represented byEquation 1. -
- where zjk is the depth to path j for link k, aj is age of patch j, and dijk is the relative depositional rate between patch i and patch j for link k, such that zjk>zik.
- To solve for relative
geological age Equation 1, for example, can be rearranged into matrix form as represented byEquation 2. -
- where Δzijk=zjk−zik.
- An overdetermined system of equations from n links between patches can then built represented, for example, by
Equation 3. -
{right arrow over (s)}=L{right arrow over (a)} Equation 3: - where {right arrow over (s)} is a n by 1 vector of the inverse of depositional rate (depositional slowness) between horizons such that
-
- L is an n by m matrix, whose entries are defined by the inverse of the distance between horizons. {right arrow over (a)} is a m by 1 vector of the age of horizon path.
- The links between patches can be defined a variety of ways, but the intent is to define one or more links from each patch to a patch directly below or above it. Several strategies could be employed, including but not limited to: On a regular grid of x, y, locations, determine the intersection of patches in the vertical axis (time or depth) and define patch-links between all vertically adjacent patches at a location. For each patch, extract links by searching for the nearest patch and continue to process through the grid to cover the various locations of the grid.
FIG. 2 provides a visual example that shows five patches and links defined between them. An example of an L matrix fromEquation 3 for the patches shown inFIG. 2 is given inEquation 4. -
- Instead of an x, y, rectangular grid, other grids can also be used, such as a triangular grid or an arrangement of patch sizes.
- With defined patch-links, the
workflow 100 continues to step 150 where the decision to include an initial age model is made. If an initial age model is not to be used, theworkflow 100 continues to step 150, and a constant initial depositional rate is specified, as an initial condition. If an initial age model is to be included than the workflow continues to step 155 and one is selected. The initial age model can be defined based on historical data. Other known methods can be used to select or define the initial age model. The initial age model can be used directly or used to define an initial depositional rate mode (by extracting the vertical gradient of the age model for each patch-link).FIG. 3C represents an initial depositional rate model.FIG. 3C illustrates an initial depositional rate model calculated by approximating a “stream function” from seismic dip. InFIG. 3C , slow areas are denoted in black and fast depositional areas are denoted in dark blue. Aslow depositional area 320 and afast depositional area 330 are identified inFIG. 3C as examples. - After
steps workflow 100 continues to step 160 where the geological age model is iteratively solved. The depositional slowness vector or the age vector inEquation 3, for example, is unknown but can be solved iteratively by assuming either an initial age model or slownessvector using Equations 4 andEquation 5. Typically, {right arrow over (s)} and {right arrow over (a)} are unknown and an iterative solution is needed. Assuming, for example, a starting model {right arrow over (s0)} such as a constant, then for iteration p - and
- where γ is a regularization parameter, set to a negligibly small value so that L is not singular. I is the identity matrix and ε defines the rate of convergence such that 0<ε>1.
- An example of a trivial approach is to set a constant initial slowness, solve for the age of the patches, using
Equation 5, update the initial slowness vector using Equation 6 and repeat until solutions converge. For well-posed problems convergence is rapid.FIG. 3D provides an example of a geological age model generated bystep 160. - As written,
Equations 5 and 6 do not guarantee that the principle of superposition, i.e., a positive depositional rate, is enforced. This condition can be added as a constraint, such that >0; where k=1,2, . . . , m. This constraint can be implemented by replacing any negative values <0 with relatively large value (e.g., a value of two times the initial (or average) depositional slowness, typically yields good results), or by modifyingEquation 5. - Boundary conditions, such as fixed age constraints, can also be used when defining the patch-links in
step 140 to assist solving instep 160. For example, inEquation 3, L is singular, addition of a negligible regularization parameter inEquation 5 allows the model to be solved but will lead to a zero-mean age for the patches. More geologically sensible results can be obtained by adding one or more boundary condition. In a simple example, the age of the horizon can be fixed using Equations 7-10. -
{right arrow over (s)}n+1=a0. Equation 7: -
L(n+1)i=1. Equation 8: -
L(n+1)j=0, where j≠i. Equation 9: - The incorporation of one or more boundary conditions, can remove the need for the regularization term in
Equation 5, if boundary conditions are set such that L is non-singular. By analogy to a directed graph, where the patches are nodes and patch-links are edges, this requires that all connected components of the graph have a boundary condition set. - Multiple boundary conditions can be set, for example if certain interpreted horizons or patches have been assigned a geological age based on external geological knowledge, or if there is an age calibrated well tied to the seismic data, then these known constraints can be incorporated in the solution as additional boundary conditions.
- In such cases, to ensure a consistent age model solution across the volume the initial depositional slowness model used in
Equation 5 can be scaled. This can be achieved by applying a constant value that is equivalent to the average depositional slowness inferred from the boundary conditions. - An alternative solution can use known constraints to define an initial age model for the patches and then use
Equation 3 to define an initial slowness model. The initial age model could be defined by interpolating between known constraints to define an apriori age volume and then assign an age for each patch by sampling this age volume. - Manual or automated age equivalence of patches can also be used when defining the patch-links in
step 140. The approach of vertical superposition can determine the relative geological ages for disconnected patches that are superposed and sub-parallel. However, for discontinuous, folded and/or faulted horizons or where thicknesses vary significantly, e.g., clinoforms, sometimes the method is less able to constrain the lateral equivalence of patches. - Equation 10 provides an example of the system of equations based on
FIG. 2 ifpath 1 is known to be 0 Ma andpatch 5 is known to be 20 Ma. -
- Many methods can be used to determine if two patches are age-equivalent. Adding patch-links automatically can include extrapolation between patches and intersections e.g., based on local structural dips, Dynamic time-warping, and Deep learning approaches e.g., horizon tracking using a CNN. Regardless of the method used to define if two patches are equivalent, their incorporation into the least-squares solution for a global age model can be performed via various ways, including the options of soft-constraints and hard-constraints. For soft constraints, a link between the patches is added in a similar way to vertical links, such that patches are encouraged, but not forced, to have the same age. Using this approach it is possible to weight the constraint. i.e., add a link with the format shown by
-
- Equation 12 shows the system of equations that results from adding a constraint that
horizons FIG. 2 are known to have equivalent ages. -
- Equation 11 provides an example of a soft constraint. With hard-constraints, for the purposes of solving the matrix, the patches are merged such that all the patch-links for one of the patches are applied to the equivalent patch and a condition applied that forces identical ages for the patches. For example, if patch i and j are known to have identical ages, matrix L can be adjusted using, for example, Equation 13 and a constraint can be added as shown by Equation 14.
-
L ki =L ki +L kj and L kj=0, for k=1,2, . . . , n Equation 13: - A hard constraint can be added per
-
- Equation 15 shows the system of equations that results from adding a constraint that
horizons FIG. 2 are known to be the same age. -
- Automating age equivalence assignment can be performed via a trace-to-trace approach that takes two traces, identifies isolated patches (i.e., those that only exist on one of the traces), and extrapolates these isolated patches from each trace to a common location (e.g., the midpoint between traces). Extrapolation can be achieved by various methods, such as using patches present on both traces to define local trends for the extrapolation. Extrapolating based on the local trend of each isolated patch can be performed using a pre-calculated structural trend, for example a dip volume, stream function. The extrapolated position of the isolated patches can be used to define patch-links between patches that are not present on the same trace. It is also possible to extrapolate patches following some measure of local structural dip. These extrapolated patches can then be used to define additional vertical links in the same way as shown in
FIG. 2 and used to construct a geological age model. - While constraints can be used when defining the patch-links in
step 140 to assist the solving instep 160, various features can also be used to improve the solving ofstep 160. For example, to generate a smoother age model smoothing based on a minimum distance between two patches, Equations 16 and 17 can be imposed. - where w is the weight assigned to smoothing and the P matrix is a matrix of the inverse distances between patches such that
-
- Distances could be calculated using various methods, such as Euclidean distance, Manhattan distances or as a structurally weighted distance if distances parallel to structural dip are shorter than an equivalent spatial distance perpendicular to dip.
- Normalization of patch-links can also be used for the solving of
step 160. The least square solution of an age model minimizes the differences between the target and the derived depositional rate. Given the same relative difference, a greater value of depositional rate contributes more to the misfit function. To balance the contribution along the data vector, a weighting matrix can be applied to the solution. Equation 18 provides an example of a weighting vector that can be applied toEquation 3. - The weights can be determined by a negative power of the depositional slowness vector, if an initial depositional rate model is supplied. Alternatively, weights can be defined based on maximum values of rows in matrix L, such that the impact of each patch-link on the final solution is normalized. Equations 19-21 provide examples of weighting to balance the contribution along the depositional rate vector. These examples are illustrative and not exhaustive, other weighting or combination of weights can be applied. A weighting matrix can be applied using, for example, Equations 19-21.
- Regarding Equation 19, a weighting matrix W can be introduced.
-
W{right arrow over (s)}=WL{right arrow over (a)} - where W is a m by m diagonal matrix and its element Wii can be defined by
-
Wii=(si)−k Equation 20: - where k is a positive value to control the power of weighting. With the inclusion of W, the age vector can be solved per
-
{right arrow over (a)}=(L T W T WL+w 1 I)−1 L T W T W{right arrow over (s)} Equation 21: - such that the relative weighting among the data samples (depositional rate) can be controlled.
- Linear constraints can also be included into the least square solution to guide the solution of age model. For example, the least square solution of the age vector {right arrow over (a)} can be equivalent to minimizing the objective function represented by
-
φ({right arrow over (a)})=∥{right arrow over (s)}−L{right arrow over (a)}∥ 2 +w 1 ∥{right arrow over (a)}∥ 2 Equation 22: - where w1 denotes the weighting of the regularization.
- Equation 23 provides an example of considering the solution subject to a linear constraint.
-
{right arrow over (b)}=P{right arrow over (a)} Equation 23: - where {right arrow over (b)} is a n by 1 vector having the same size as {right arrow over (a)}, and P is a m by n matrix.
- Such a linear constraint can be used to represent various or even any relationship of age as long as it is linear. For example, it can describe the equivalence of age among selected patches. For another example, it can be used to calculate the derivatives of age and compared to an external field, e.g., a structural tensor field, to ensure the consistency between the age model and the external metric field.
- Equation 24 provides an example of the objective function with the inclusion of a linear constraint.
-
φ({right arrow over (a)})=∥{right arrow over (s)}−L{right arrow over (a)}∥ 2 +w 1 ∥{right arrow over (a)}∥ 2 +w 2 ∥{right arrow over (b)}−P{right arrow over (a)}∥ 2 Equation 24: - where w2 denotes the weighting of the linear constraint, and the value of w2 determines the harshness of the constraint. For example, given the model as illustrated in
FIG. 2 , whenhorizon -
- The least square solution of {right arrow over (a)} with respect to the constrained objective function can be represented by Equation 26 with the linear constraint as represented by
Equation 2 applied. -
{right arrow over (a)}=(L T L+w 1 I+w 2 P T P)−1(L T s+w 2 P T b). Equation 26: - Previously defined faults can also be incorporated into the solution. During patch creation the patches are truncated or split by faults. During or after the specification of vertical links between patches, any patch-links that cross a fault can be removed. Subsequently it may be necessary to add patch-links that define how horizons are linked across the fault, such patch-links can be defined automatically, e.g., based on dynamic time-warping on either side of the fault, or by manual input. But such links are unlikely to follow local structural dip.
- Known age constraints can also be added to
steps steps - After
step 160, a determination is made if the resulting geological age model is acceptable. Determining if the geological age model is acceptable can be determined manually or automatically. For manual determination, a quality assurance or quality control review of the geological age model can be performed. For example, manual review ofFIG. 3D can be performed to determine acceptance. The geological age model can be provided to a display for a visual review. Automated and/or quantitative methods can also be used that analyze, for example, a misfit between the gradient of an interpolated age model and the local structural dip volume. The automated analysis can be relied upon to determine acceptance, or a user can use results from the automatic analysis to assist in manually determining acceptance. - If not acceptable, the
workflow 100 returns to step 130. If acceptable, theworkflow 100 continues to post-processing instep 180. The solution of the geological age model results in ages assigned to the patches themselves. In order to extract a consistent set of horizons throughout the volume, several options exist for post-processing including 3D interpolation of patch-ages to generate an age model, 3D structure guided interpolation, e.g. Dave Hale, (2009), “Image-guided blended neighbor interpolation of scattered data,”SEG Technical Program Expanded Abstracts: 1127-1131, which is incorporated herein by reference, grouping patches with similar ages and no overlap then interpolate, sequential dip-tracking of patches, and horizon optimization, e.g. Wu, X. & Hale, D., 2015, Horizon volumes with interpreted constraints, Geophysics, 80(2), IM21-IM33, which is incorporated by reference. Other methods of post-processing, such as conventional methods and procedures, can also be used. - In
step 190, an output is provided from the processed geological age model. The output can be a Relative Geological Time (RGT) volume. The output provides an understanding of the subsurface geology and can be used to develop oil field models to identify and target hydrocarbon resources. The output can be used in a well operation, such as a drilling operation, wherein the output is used to identify the drilling location and drilling is performed at the location. - Using
FIGS. 3A to 3D , an example of determining the relative geologic age using the proposed method is provided. For this example, a 3D seismic cube is used to demonstrate the utility of the method. The 3D seismic cube consists of 100 inlines (inline ID from 200 to 300), 900 crosslines (crossline ID from 300 to 1200), and a time window of 1000 ms (from 500 to 1500 ms), which is cropped from an example of an open-source 3D seismic dataset. The cross lines are on the x axis and the time is on the y axis ofFIG. 3A that shows the original seismic data on a single inline section, inline 240. - From this seismic data, a suite of patches is automatically interpreted. Nodes are first selected by an automatic scan of seismic troughs. Edges are then generated between the nodes in order to form patches as represented in
FIG. 3B . The edges could be generated by one or more different methods, for example using conventional tracking methods, dynamic time warping (DTW) or by dip-tracking to form connections. The connected nodes are used to designate interpreted horizons, which are then validated in 3D to avoid any unwanted features, e.g., superposition of seismic events in a single patch. There are several methods that could be used to accomplish this validation.FIG. 3B shows the 2D view of the validated patches overlaid on the selected seismic section. Note that very small patches (less than 5 nodes) have been excluded from the display. - The use of an initial depositional rate model is optional but is especially beneficial when geologic structures of interest are complex.
FIG. 3C shows one option to automatically create an initial model. First a dip magnitude and azimuth are calculated from the seismic data and used to approximate a three-dimensional stream function by assuming that the dip vectors represent a flow field through the seismic data. An initial depositional rate can then be obtained by calculating the vertical derivative of the stream function. -
FIG. 3D shows a first-pass, contour plot of the obtained geological age model. There are a total of approximately 3,300 patches, and approximately 63,000 vertical links and 1,000 horizontal links defined among patches. The weighting of the links is balanced by the inverse of depositional rate. In this example no linear constraint has been added. The age values of the patches can be solved via a matrix inverse, and then interpolated to give a fully sample 2D section. For example, the age values of the patches are firstly solved by the least square solution, and then interpolated by a 2D linear operator to give a fully sampled 2D age section. The contours of the first-pass solution in general show a very good consistency with the seismic data. The overall structure of the clinoforms and parallel seismic events are clearly shown in the age section. The bottom-right age section shows disagreement, which is mainly limited by the lack of patches and the presence of a major normal fault. -
FIG. 3D illustrates a contour plot wherein the ages of patches are discrete measurements. In the contour plot ofFIG. 3D , each line represents a single age and similar lines represent an interval of an age range. For example, each of the solid lines represent a single age and all three of the solid lines represent an age interval. - The age model can be iteratively improved by an interactive updating of links and patches to complete the patches to horizons. The entire process can be purely automatic, with choosing appropriate parameters to run the program. The computation time of solving the age in 3D for this example took about 15 seconds, on a mobile workstation (8th Generation Intel i7 processor with 16 Gb RAM). The preparation of onsets, patches and initial models can take 5 to 30 minutes, depending on the choice of methods, and the size of the dataset. As such, the disclosure provides an efficient solution to construct a 3D age model from seismic data.
-
FIG. 4 illustrates a block diagram of an example of aseismic data evaluator 400 constructed according to the principles of the disclosure. Theseismic data evaluator 400 can be a computing device. Theseismic data evaluator 400 includes at least oneinterface 410 for receiving and transmitting information, at least onememory 420 for storing data and computer programs, and at least oneprocessor 430 for performing functions when directed by the computer programs. For example, thememory 420 can store code corresponding to algorithms representing at least some of the steps of theworkflow 100, that direct theprocessor 430 to automatically generate a geological age model from a pre-interpreted suite of patches by abstracting seismic data of a subsurface into a limited number of patches, abstracting the patches by defining links between the patches, and generating a geological age model of the subsurface by solving for the relative geological age of the patches, for example for each of the patches, using the links. The algorithms can correspond to one or more, including all, of the equations disclosed herein. Other similar methods or portions of other similar methods can also be used to direct theprocessor 430 to perform similar functions. - The
interface 410 is a communications interface that includes the necessary hardware, software, or combination th ereof to communicate, i.e., receive and transmit, data. Theinterface 410 can be a conventional interface. As illustrated, the interface can receive seismic data for processing. The seismic data can be 3D (three dimensional) data. The seismic data may also be 2D or 4D. Theinterface 410 also transmits a geological age model provided by theprocessor 430. The geological age model can be sent to a display for visual presentation, which can be used for manual interpretation. The geological age model can also be presented to another processor or computing system for additional processing and or analysis, such as automated analysis. The resulting geological age model can be, for example, used in a well operation, such as a drilling operation, wherein the output is used to identify the drilling location and drilling is performed at the location. - The
memory 420 can be a conventional memory or data storage. Theprocessor 430 can be one or more processors, including a CPU, a GPU, or a combination thereof. - A portion of the above-described apparatus, systems or methods may be embodied in or performed by various analog or digital data processors, wherein the processors are programmed or store executable programs of sequences of software instructions to perform one or more of the steps of the methods. A processor may be, for example, a programmable logic device such as a programmable array logic (PAL), a generic array logic (GAL), a field programmable gate arrays (FPGA), or another type of computer processing device (CPD). The software instructions of such programs may represent algorithms and be encoded in machine-executable form on non-transitory digital data storage media, e.g., magnetic or optical disks, random-access memory (RAM), magnetic hard disks, flash memories, and/or read-only memory (ROM), to enable various types of digital data processors or computers to perform one, multiple or all of the steps of one or more of the above-described methods, or functions, systems or apparatuses described herein.
- Portions of disclosed examples or embodiments may relate to computer storage products with a non-transitory computer-readable medium that have program code thereon for performing various computer-implemented operations that embody a part of an apparatus, device or carry out the steps of a method set forth herein. Non-transitory used herein refers to all computer-readable media except for transitory, propagating signals. Examples of non-transitory computer-readable media include but are not limited to: magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM disks; magneto-optical media such as floppy disks; and hardware devices that are specially configured to store and execute program code, such as ROM and RAM devices. Configured means, for example, designed, constructed, or programmed, with the necessary logic and/or features for performing a task or tasks. A configured device, therefore, is capable of performing the task or tasks. Examples of program code include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter.
- In interpreting the disclosure, all terms should be interpreted in the broadest possible manner consistent with the context. In particular, the terms “comprises” and “comprising” should be interpreted as referring to elements, components, or steps in a non-exclusive manner, indicating that the referenced elements, components, or steps may be present, or utilized, or combined with other elements, components, or steps that are not expressly referenced.
- Those skilled in the art to which this application relates will appreciate that other and further additions, deletions, substitutions and modifications may be made to the described embodiments. It is also to be understood that the terminology used herein is for the purpose of describing particular embodiments only, and is not intended to be limiting, because the scope of the present disclosure will be limited only by the claims. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs. Although any methods and materials similar or equivalent to those described herein can also be used in the practice or testing of the present disclosure, a limited number of the exemplary methods and materials are described herein.
- Aspects disclosed herein include:
- A. An automated method of generating a geological age model for a subterranean area. In one example, the automated method includes: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
B. A computer program product having a series of operating instructions stored on a non-transitory computer-readable medium that directs a data processing apparatus when executed thereby to perform operations to generate a geological age model from a pre-interpreted suite of patches. In one example the operations include: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
C. An apparatus comprising at least one processor and memory, the memory including computer program code, the memory and the computer program code configured to, with the at least one processor, cause the apparatus to automatically generate a geological age model from a pre-interpreted suite of patches by performing at least the following: (1) abstracting seismic data of a subsurface into a limited number of patches, (2) abstracting the patches by defining patch-links between the patches, and (3) generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links. - Each of the aspects disclosed aspects A, B, and C can have one or more of the following additional elements in combination. Element 1: wherein the defining the patch-links includes defining spatial relationships between the patches. Element 2: wherein the spatial relationships are differences in depth. Element 3: wherein the geological and spatial relationships are defined according to an inverse of the depositional rate between the patches. Element 4: wherein defining the patch-links includes applying a weighting factor to the inverse of depositional rate. Element 5: wherein solving for the relative geological age of the patches includes iteratively solving an equation representing the inverse of the depositional rate between the patches. Element 6: wherein iteratively solving the equation includes assuming a starting model for the inverse of the depositional rate. Element 7: wherein iteratively solving the equation includes assuming a starting model for the age of each patch. Element 8: wherein defining the patch-links includes using constraints. Element 9: wherein the constraints are fixed age constraints. Element 10: wherein the constraints are soft constraints associated with an age equivalence of the patches. Element 11: wherein the constraints are hard constraints associated with an age equivalence of the patches. Element 12: wherein the constraints include one or more of extrapolation between patches and intersections, dynamic time-warping, and horizon tracking using a convolutional neural network. Element 13: wherein generating the geological age model includes using a smoothing constraint. Element 14: wherein generating the geological age model includes balancing contribution of depositional rates by applying a weighting matrix. Element 15: wherein generating the geological age model includes using a least square solution and linear constraints.
Claims (20)
1. An automated method of generating a geological age model for a subterranean area, comprising:
abstracting seismic data of a subsurface into a limited number of patches;
abstracting the patches by defining patch-links between the patches; and
generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
2. The method as recited in claim 1 , wherein the defining the patch-links includes defining spatial relationships between the patches.
3. The method as recited in claim 2 , wherein the spatial relationships are differences in depth.
4. The method as recited in claim 2 , wherein the geological and spatial relationships are defined according to an inverse of the depositional rate between the patches.
5. The method as recited in claim 4 , wherein defining the patch-links includes applying a weighting factor to the inverse of depositional rate.
6. The method as recited in claim 4 , wherein solving for the relative geological age of the patches includes iteratively solving an equation representing the inverse of the depositional rate between the patches.
7. The method as recited in claim 6 , wherein iteratively solving the equation includes assuming a starting model for the inverse of the depositional rate.
8. The method as recited in claim 6 , wherein iteratively solving the equation includes assuming a starting model for the age of each patch.
9. The method as recited in claim 1 , wherein defining the patch-links includes using constraints.
10. The method as recited in claim 9 , wherein the constraints are fixed age constraints.
11. The method as recited in claim 9 , wherein the constraints are soft constraints associated with an age equivalence of the patches.
12. The method as recited in claim 9 , wherein the constraints are hard constraints associated with an age equivalence of the patches.
13. The method as recited in claim 9 , wherein the constraints include one or more of extrapolation between patches and intersections, dynamic time-warping, and horizon tracking using a convolutional neural network.
14. The method as recited in claim 1 , wherein generating the geological age model includes using a smoothing constraint.
15. The method as recited in claim 1 , wherein generating the geological age model includes balancing contribution of depositional rates by applying a weighting matrix.
16. The method as recited in claim 1 , wherein generating the geological age model includes using a least square solution and linear constraints.
17. A computer program product having a series of operating instructions stored on a non-transitory computer-readable medium that directs a data processing apparatus when executed thereby to perform operations to generate a geological age model from a pre-interpreted suite of patches, the operations comprising:
abstracting seismic data of a subsurface into a limited number of patches;
abstracting the patches by defining patch-links between the patches; and
generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
18. The computer program product as recited in claim 17 , wherein the defining the patch-links includes defining spatial relationships between the patches.
19. An apparatus comprising at least one processor and memory, the memory including computer program code, the memory and the computer program code configured to, with the at least one processor, cause the apparatus to automatically generate a geological age model from a pre-interpreted suite of patches by performing at least the following:
abstracting seisic data of a subsurface into a limited number of patches;
abstracting the patches by defining patch-links between the patches; and
generating a geological age model of the subsurface by solving for the relative geological age of each of the patches using the patch-links.
20. The apparatus as recited in claim 19 , wherein the defining the patch-links includes defining spatial relationships between the patches according to an inverse of the depositional rate between the patches, and wherein the spatial relationships are differences in depth between the patches.
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US17/537,143 US20220390634A1 (en) | 2021-06-04 | 2021-11-29 | Method for generating a geological age model from incomplete horizon interpretations |
PCT/US2021/061071 WO2022256039A1 (en) | 2021-06-04 | 2021-11-30 | A method for generating a geological age model from incomplete horizon interpretations |
NO20231112A NO20231112A1 (en) | 2021-06-04 | 2021-11-30 | A method for generating a geological age model from incomplete horizon interpretations |
GB2316507.9A GB2621727A (en) | 2021-06-04 | 2021-11-30 | Method for generating a geological age model from incomplete horizon interpretations |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US202163197180P | 2021-06-04 | 2021-06-04 | |
US17/537,143 US20220390634A1 (en) | 2021-06-04 | 2021-11-29 | Method for generating a geological age model from incomplete horizon interpretations |
Publications (1)
Publication Number | Publication Date |
---|---|
US20220390634A1 true US20220390634A1 (en) | 2022-12-08 |
Family
ID=84284047
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/537,143 Pending US20220390634A1 (en) | 2021-06-04 | 2021-11-29 | Method for generating a geological age model from incomplete horizon interpretations |
Country Status (4)
Country | Link |
---|---|
US (1) | US20220390634A1 (en) |
GB (1) | GB2621727A (en) |
NO (1) | NO20231112A1 (en) |
WO (1) | WO2022256039A1 (en) |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080140319A1 (en) * | 2006-12-06 | 2008-06-12 | Schlumberger Technology Corporation | Processing of stratigraphic data |
US8447525B2 (en) * | 2010-07-29 | 2013-05-21 | Schlumberger Technology Corporation | Interactive structural restoration while interpreting seismic volumes for structure and stratigraphy |
CN106707339A (en) * | 2016-11-22 | 2017-05-24 | 中国石油集团川庆钻探工程有限公司地球物理勘探公司 | Depth domain phase-control inversion method |
US20180306938A1 (en) * | 2015-10-29 | 2018-10-25 | Shell Oil Company | Computer system and method for generating attribute renderings from a seismic data volume |
US20230093005A1 (en) * | 2020-02-18 | 2023-03-23 | Foster Findlay Associates Limited | A system and method for improved geographical data interpretation |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2939520B1 (en) * | 2008-12-10 | 2011-05-20 | Elite Image Software | METHOD FOR THE GEOLOGICAL MODELING OF SEISMIC DATA BY CORRELATION OF TRACES |
WO2012030337A1 (en) * | 2010-09-01 | 2012-03-08 | Landmark Graphics Corporation | Method and system of plotting values indicative of characteristics of an underground formation |
FR3057381B1 (en) * | 2016-10-07 | 2018-10-12 | Eliis | PROCESS FOR MANUFACTURING A VECTOR GEOLOGICAL MODEL |
WO2019236078A1 (en) * | 2018-06-06 | 2019-12-12 | Landmark Graphics Corporation | Geological data assessment system |
-
2021
- 2021-11-29 US US17/537,143 patent/US20220390634A1/en active Pending
- 2021-11-30 NO NO20231112A patent/NO20231112A1/en unknown
- 2021-11-30 WO PCT/US2021/061071 patent/WO2022256039A1/en active Application Filing
- 2021-11-30 GB GB2316507.9A patent/GB2621727A/en active Pending
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080140319A1 (en) * | 2006-12-06 | 2008-06-12 | Schlumberger Technology Corporation | Processing of stratigraphic data |
US8447525B2 (en) * | 2010-07-29 | 2013-05-21 | Schlumberger Technology Corporation | Interactive structural restoration while interpreting seismic volumes for structure and stratigraphy |
US20180306938A1 (en) * | 2015-10-29 | 2018-10-25 | Shell Oil Company | Computer system and method for generating attribute renderings from a seismic data volume |
CN106707339A (en) * | 2016-11-22 | 2017-05-24 | 中国石油集团川庆钻探工程有限公司地球物理勘探公司 | Depth domain phase-control inversion method |
US20230093005A1 (en) * | 2020-02-18 | 2023-03-23 | Foster Findlay Associates Limited | A system and method for improved geographical data interpretation |
Also Published As
Publication number | Publication date |
---|---|
NO20231112A1 (en) | 2023-10-18 |
GB2621727A (en) | 2024-02-21 |
GB202316507D0 (en) | 2023-12-13 |
WO2022256039A1 (en) | 2022-12-08 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11029431B2 (en) | Generating common image gather using wave-field separation | |
US7805250B2 (en) | Methods and apparatus for geophysical exploration via joint inversion | |
US10788597B2 (en) | Generating a reflectivity model of subsurface structures | |
US10310117B2 (en) | Efficient seismic attribute gather generation with data synthesis and expectation method | |
GB2565526A (en) | A method for validating geological model data over corresponding original seismic data | |
EP1794625A2 (en) | Methods for earth modeling and seismic imaging using interactive and selective updating | |
AU2015280679B2 (en) | Instantaneous isochron attribute-based geobody identification for reservoir modeling | |
US10838092B2 (en) | Estimating multiple subsurface parameters by cascaded inversion of wavefield components | |
EP3749987B1 (en) | Systems and methods to enhance 3-d prestack seismic data based on non-linear beamforming in the cross-spread domain | |
US20210262329A1 (en) | Method for Generating Initial Models For Least Squares Migration Using Deep Neural Networks | |
US11644591B1 (en) | Computer-implemented method and system for obtaining a subsurface stack image, subsurface angle gathers, and a subsurface velocity model, over an entire survey region having high velocity contrast geo-bodies | |
Bi et al. | Geologic-time-based interpolation of borehole data for building high-resolution models: Methods and applications | |
Cho et al. | Semi‐auto horizon tracking guided by strata histograms generated with transdimensional Markov‐chain Monte Carlo | |
US20220390634A1 (en) | Method for generating a geological age model from incomplete horizon interpretations | |
EP3203269B1 (en) | Multi-stack (broadband) seismic wavelet estimation method | |
US11555936B2 (en) | Analytics and machine learning method for estimating petrophysical property values | |
Fam et al. | Multi-Focusing stacking using the Very Fast Simulated Annealing global optimization algorithm | |
US20240069228A1 (en) | Learning hydrocarbon distribution from seismic image | |
US20240103192A1 (en) | Graph based multi-survey horizon optimization | |
Mora | A Comparison Of Coherence Enhancement, Probabilistic Neural Network, And Convolutional Neural Network Fault Imaging With Manual Interpretation In The Taranaki Basin Area, New Zealand. | |
Bevc et al. | 3-D tomographic updating with automatic volume-based picking | |
Bianchin | Metodi di ricostruzione delle basse frequenze per la stima dei parametri elastici | |
Bevc et al. | Automating the Velocity Building Process |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: LANDMARK GRAPHICS CORPORATION, TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BAINES, GRAHAM;LIU, YIKUO;POSSEE, DANIEL;SIGNING DATES FROM 20211202 TO 20211213;REEL/FRAME:058372/0637 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |