Abstract:
Embodiments of automated structural interpretation are described. In some embodiments, a method includes identifying one or more object points belonging to an object to be tracked; tracking a trajectory of the one or more object points, including: calculating a plurality of etalons around at least one of the one or more object points using one or more different angular parameters; selecting one or more candidate points for evaluation; extracting one or more samples from around the one or more candidate points; and evaluating a next trajectory location of the one or more object points based at least partially on the one or more samples and one or more of the plurality of etalons.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This patent application claims priority under 35 USC §119(e) from U.S. Provisional Patent Application No. 61/153,002 filed Feb. 17 th , 2009, which application is incorporated herein by reference. 
     
    
     FIELD OF THE INVENTION 
       [0002]    The present disclosure relates to computational simulation and analysis of geological formations, and more specifically, to automated structural interpretation. 
       BACKGROUND 
       [0003]    Research operations, such as surveying, drilling, testing, and computational simulations, are typically performed to help locate and extract valuable hydrocarbon resources. The information developed during such research operations may be used to assess geological formations, and to locate the desired subterranean assets. 
         [0004]    Fault identification and interpretation is one of the major challenges in seismic interpretation. Several existing methods have been developed to detect seismic faults, including those methods disclosed, for example, in U.S. Pat. No. 7,630,865 issued to Berkovitch et al. U.S. Pat. No. 7,330,791 issued to Kim et al., U.S. Pat. No. 7,069,149 issued to Goff et al., and U.S. Pat. No. 6,735,526 issued to Meldahl et al. In contrast with seismic horizons interpretation, however, conventional techniques for identification and interpretation of seismic faults typically suffer from a lack of accurate and robust automatic solutions. Thus, although desirable results have been achieved using conventional techniques, there is room for substantial improvement. 
       SUMMARY 
       [0005]    The present disclosure relates to methods and systems for automated structural interpretation of geological structures, including seismic fault detection and tracking. Embodiments of methods and systems in accordance with the teachings of the present disclosure may advantageously provide automated seismic interpretation functionalities, thereby reducing time and costs associated with seismic structural interpretation activities. 
         [0006]    In some embodiments, a method for automated interpretation of a seismic structure including: identifying one or more object points belonging to an object to be tracked; tracking a trajectory of the one or more object points, including: calculating a plurality of etalons around at least one of the one or more object points using one or more different angular parameters; selecting one or more candidate points for evaluation; extracting one or more samples from around the one or more candidate points; and evaluating a next trajectory location of the one or more object points based at least partially on the one or more samples and one or more of the plurality of etalons. 
         [0007]    This summary is merely intended to provide a brief synopsis of a possible implementation of, and possible aspects or advantages of, systems and methods in accordance with at least some embodiments of the present disclosure. This summary is further intended as merely an aid to the reader&#39;s understanding of such particular embodiments, and is not intended to define or limit other embodiments of systems and methods disclosed elsewhere herein. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0008]    The detailed description is described with reference to the accompanying figures, in which similar or identical reference numerals may be used to identify common or similar elements. 
           [0009]      FIG. 1  is a schematic view of an exemplary environment which may be modeled in accordance with the teachings of the present disclosure. 
           [0010]      FIG. 2  is a flowchart of an embodiment of a method in accordance with the teachings of the present disclosure. 
           [0011]      FIG. 3  shows an embodiment of a vector scheme which may be used in accordance with the teachings of the present disclosure. 
           [0012]      FIG. 4  illustrates an example computing device in which various embodiments of methods and systems in accordance with the teachings of the present disclosure may be implemented. 
       
    
    
     DETAILED DESCRIPTION 
       [0013]    This disclosure is directed to systems and methods for automated structural interpretation of geological structures, including seismic fault detection and tracking. More specifically, embodiments of systems and methods in accordance with the teachings of the present disclosure may be used for automatic interpretation of faults and other structural features in three-dimensional (3D) seismic data. In at least some implementations, such systems and methods may advantageously improve the quality of seismic interpretation, while reducing time and costs associated with such analyses. 
         [0014]    Generally, in at least some implementations, calculated quantities termed “etalons” may be used to calculate a fitness function. As used herein, the term etalons refers to one or more samples created around the same point, and such etalons may contain information (partial or full) about such points. For each candidate point that may be next along a trajectory being tracked, at least one sample is determined. At the same time, a collection of samples (etalons) is available around previous points. Thus, etalons are created around points that are already “tracked”, and new samples are calculated around new candidate points and then compared with etalons. 
         [0015]    In at least some implementations, a fitness function for each candidate may be defined, for example, as a distance to a most similar sample in the etalon. More specifically, in at least some implementations, one point may be picked by a user, and then volume images (samples) may be created of that point under different angles to provide one or more etalons. A candidate point may then be selected near the original one, and an image may be extracted for that candidate point (e.g. a candidate point having 0 rotation). An image in a previously-created collection is selected that most closely resembles (looks most similar to) the current, non rotated image. Once found, the similarity between two points (original and candidate) is assumed as the similarity between these two images. These and other aspects of methods and systems in accordance with the teachings of the present disclosure are described more fully below with reference to the accompanying figures. 
         [0016]    Exemplary Environment 
         [0017]      FIG. 1  is a schematic view of an exemplary environment  100  which may be modeled in accordance with the teachings of the present disclosure. More specifically, in this embodiment, the environment (or oilfield)  100  includes a subterranean formation  102  containing a reservoir  104  therein. A seismic truck  106  performs a survey operation by producing one or more waves  111  (e.g. sonic waves, ultrasonic waves, electromagnetic waves, etc.) that may be used to measure properties of the subterranean formation  102 . 
         [0018]    More specifically, as shown in  FIG. 1 , one or more waves  111  are emitted by a source  110  and reflect off one or more horizons  114  in an earth formation  116 . The reflected waves  112  are then received or detected by one or more sensors, such as geophone-receivers  118  or the like, situated on the surface. In at least some embodiments, the geophone-receivers  118  produce electrical output signals in response to the characteristics of the reflected waves  112  (e.g. amplitude, frequency, etc.), referred to as data received  120  in  FIG. 1 . 
         [0019]    The data received  120  may be provided as input to a computer  122  (e.g. located in the seismic truck  106 ). Responsive to the input data, the computer  122  may generate a seismic data output  124  which may be stored, transmitted, or further processed as desired, including by various analysis techniques in accordance with the teachings of the present disclosure. 
         [0020]    Additional aspects of systems and methods of automated detection of seismic faults are described in the following sections. It should be appreciated that the systems and methods described herein are merely exemplary, and are included for illustration purposes and should not be construed as limiting. 
         [0021]    Exemplary Processes 
         [0022]    Seismic interpretation can be conducted using a three-dimensional (3D) image analysis approach in association with a mathematical model in accordance with the teachings of the present disclosure. Embodiments of systems and methods in accordance the present disclosure may advantageously provide highly accurate, automated interpretations of geological survey information, and such results may be used as multi-dimensional attribute data for subsequent analyses. In at least some implementations, the techniques disclosed herein can be complimented with expert knowledge regarding reservoirs and reservoir engineering. 
         [0023]    Fault identification and interpretation is one of the major challenges in seismic interpretation. But in contrast with seismic horizons interpretation, the conventional techniques for identification and interpretation of seismic faults typically suffer from a significant lack of accurate and robust automatic solutions. As a consequence, conventional methods may require labor-intensive, time-consuming manual fault interpretation which entails numerous repetitive similar pickings of faults intersections with different seismic sections. 
         [0024]    On the other hand, in at least some embodiments in accordance with the teachings of the present disclosure, it may be assumed that once a fault or any other structural event is picked on only a few sections (or even one), the picking process could be automatically continued if information from manually picked points is extracted and used properly. 
         [0025]    To begin to describe methods and systems for automated fault interpretation in accordance with the teachings of the present disclosure, several definitions will now be introduced. For example, as used herein, a template Ω, denotes an array of points ω with integer Cartesian coordinates (i,j,k) selected according to some custom rule, as shown in the following Equation (1): 
         [0000]      Ω={ω 1 , . . . , ω n }, ω m =( i   m   , j   m   , k   m )  (1) 
         [0026]    Similarly, as used herein, a sample Λ extracted using a template around kernel point K with parameters (φ,θ) denotes an array of λ, defined by the following Equation (2): 
         [0000]      θ Ω ( K , φ, θ, Ψ)=(λ 1 , . . . , λ n ), λ m   =S ( K+ω   m   φ,θ,Ψ )  (2), 
         [0000]    where S(t) denotes interpolated value of 3D seismic volume at point t with Cartesian coordinates (i,j,k), indexes φ, θ, Ψ, at point ω mean sequential rotation of applied template Ω to angle φ around X axis, to angle θ around axis Y and to angle Ψ i around axis Z. 
         [0027]    Now, using notation introduced above it is possible to define a new measure of distance between two arbitrary points K 1  and K 2  in seismic volume, referred to herein as a sample-based distance, as shown in the following Equation (3): 
         [0000]    
       
         
           
             
               
                 
                   
                     L 
                      
                     
                       ( 
                       
                         
                           
                             Λ 
                             Ω 
                           
                            
                           
                             ( 
                             
                               
                                 K 
                                 1 
                               
                               , 
                               
                                 ϕ 
                                 1 
                               
                               , 
                               
                                 θ 
                                 1 
                               
                               , 
                               
                                 ψ 
                                 1 
                               
                             
                             ) 
                           
                         
                         , 
                         
                           
                             Λ 
                             Ω 
                           
                            
                           
                             ( 
                             
                               
                                 K 
                                 2 
                               
                               , 
                               
                                 ϕ 
                                 2 
                               
                               , 
                               
                                 θ 
                                 2 
                               
                               , 
                               
                                 ψ 
                                 2 
                               
                             
                             ) 
                           
                         
                       
                       ) 
                     
                   
                   = 
                   
                     
                        
                       
                         
                           
                             Λ 
                             Ω 
                           
                            
                           
                             ( 
                             
                               
                                 K 
                                 1 
                               
                               , 
                               
                                 ϕ 
                                 1 
                               
                               , 
                               
                                 θ 
                                 1 
                               
                               , 
                               
                                 ψ 
                                 1 
                               
                             
                             ) 
                           
                         
                         - 
                         
                           
                             Λ 
                             Ω 
                           
                            
                           
                             ( 
                             
                               
                                 K 
                                 2 
                               
                               , 
                               
                                 ϕ 
                                 2 
                               
                               , 
                               
                                 θ 
                                 2 
                               
                               , 
                               
                                 ψ 
                                 2 
                               
                             
                             ) 
                           
                         
                       
                        
                     
                     
                       
                          
                         
                           
                             Λ 
                             Ω 
                           
                            
                           
                             ( 
                             
                               
                                 K 
                                 1 
                               
                               , 
                               
                                 ϕ 
                                 1 
                               
                               , 
                               
                                 θ 
                                 1 
                               
                               , 
                               
                                 ψ 
                                 1 
                               
                             
                             ) 
                           
                         
                          
                       
                       + 
                       
                          
                         
                           
                             Λ 
                             Ω 
                           
                            
                           
                             ( 
                             
                               
                                 K 
                                 2 
                               
                               , 
                               
                                 ϕ 
                                 2 
                               
                               , 
                               
                                 θ 
                                 2 
                               
                               , 
                               
                                 ψ 
                                 2 
                               
                             
                             ) 
                           
                         
                          
                       
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
         [0000]    This measure allows a defining degree of similarity between different points in seismic volume in terms of selected template and angles. For example, a simple one-point template Ω={(0,0,0)} can lead to direct comparison of seismic amplitudes in locations K 1  and K 2 . 
         [0028]    In at least some implementations, an assumption behind the one or more automated tracking algorithms proposed herein is that every point belonging to a particular seismic feature has a set of analogues or similar points on the same feature in terms of a sample-based distance in some range of templates. Furthermore, in at least some implementations, one can also assume that two points with a small sample-based distance between them represent the same object (or similar objects). 
         [0029]    The definitions and notations introduced above allow for a full step-by-step description of an embodiment of a method for automated detection of seismic faults. For example,  FIG. 2  is a flowchart of an embodiment of a method  150  in accordance with the teachings of the present disclosure. In this embodiment, the method  150  includes selection of seismic volumes and corresponding templates to be used for interpretation at  152 . The notations introduced above can be generalized for a multidimensional case, such that different seismic volumes (original amplitudes or any seismic attributes) may be used for interpretation. 
         [0030]    An initial points interpretation is performed at  154 . As mentioned above, some points belonging to the object to be tracked (e.g. faults, stratigraphic terminations, etc) could be identified manually. Alternately, the initial points belonging to the object to be tracked may be selected based on any suitable automated or semi-automated logic. After the initial points are selected or otherwise generated, they may be used as references for automated picking. 
         [0031]    With continued reference to  FIG. 2 , the method  150  further includes calculation of etalons at  156 . It will be appreciated that, as used herein, an etalon denotes an ordered set of samples A extracted around the same kernel point using different angle parameters φ, θ, and Ψ. The etalons are constructed around points that were picked on previous iterations (including an original starting point) and used for candidate evaluation (described below). An etalon may be expressed as shown by the following Equation (4): 
         [0000]        Et   Ω ( K , Φ, Θ, Ψ)={Λ Ω ( K, φ   i , θ j , ψ k )}, φ i ∉Φ, θ j ∉Θ, ψ k ∉Ψ  (4) 
         [0032]    With respect to Equation (4) shown above, the etalon EtΩ represents samples extracted around kernel point K in 3D space, where Φ, Θ and Ψ denote sets of rotation angles used for etalon calculation. 
         [0033]    In at least some implementations, etalon sets may include a history of the overall iterative process and may be invariant to any geometrical changes in reservoir layers or faults. Ranges of rotation angles and number of nodes in sets Φ, Θ and Ψ can be defined by a user (or by a suitable automated or semi-automated process) and play a role in supporting this invariability. 
         [0034]    When the etalon sets are updated (at  156 ), the points that will be the candidates for evaluation on a current iteration of the algorithm are selected at a candidate selection  158 . More specifically, let p denote the number of a current iteration, let C p  denote the set of candidates on iteration p, let R p−1  denote a set of results for the previous p− 1  iterations and K p  denotes the result of the algorithm on the previous iteration. The candidate sets can then be created (at  158 ), for example, according to the following Equation (5): 
         [0000]    
       
         
           
             
               
                 
                   
                     C 
                     p 
                   
                   = 
                   
                     { 
                     
                       
                         ⋃ 
                         
                           
                             τ 
                             1 
                           
                           , 
                           
                             τ 
                             2 
                           
                           , 
                           
                             
                               τ 
                               3 
                             
                             = 
                             
                               - 
                               τ 
                             
                           
                         
                         τ 
                       
                        
                       
                         
                           ( 
                           
                             
                               K 
                               p 
                             
                             + 
                             
                               ( 
                               
                                 
                                   τ 
                                   1 
                                 
                                 , 
                                 
                                   τ 
                                   2 
                                 
                                 , 
                                 
                                   τ 
                                   3 
                                 
                               
                               ) 
                             
                           
                           ) 
                         
                          
                         \ 
                          
                         
                           { 
                           
                             
                               C 
                               
                                 P 
                                 - 
                                 1 
                               
                             
                             ⋃ 
                             
                               R 
                               
                                 p 
                                 - 
                                 1 
                               
                             
                           
                           } 
                         
                       
                     
                     } 
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where the symbol τ represents a size of cubic area around k p  where candidates are searched. 
         [0035]    It means that in some implementations, the candidates of the candidate sets are selected from the points with discrete coordinates within a cube with side 2σ+1 around point K p . In some embodiments as also shown in Equation (5), the algorithm can be made more efficient by removing all previously visited points C p−1 ∪R p−1 . 
         [0036]    It will be appreciated that the proposed algorithm for selection of candidates at  158  is not the only one possible, and that a variety of suitable algorithms may be conceived. For example, in various alternate implementations, the candidate selection at  158  may include: visited points may be included to the set; the candidates search can be anisotropic, etc. 
         [0037]    With continued reference to  FIG. 2 , in some implementations, in a sample extraction  160 , when the candidate points (C p1 , . . . C pn ) forming candidates set C p  are selected, samples may be extracted around them using an initial template given by the following Equation (5.5): 
         [0000]      {right arrow over (Λ)}Ω( C   p )=(Λ Ω ( c   p1 ,0,0,0), . . . Λ Ω ( c   pn ,0,0,0))  (5.5) 
         [0038]    The method  150  further includes an evaluation at  160 . More specifically, when we have the samples extracted around all candidates (at  158 ), the samples can be evaluated to find one or more candidates similar to kernels of etalons sets. For purposes of the evaluation of the samples (at  160 ), a fitness function may be defined in different ways for example by changing a type of the norm in Equation (3). A suitable fitness function is presented by Equation (7) below: 
         [0039]    Let d (,) define distance between evaluated point K and etalon Ett as shown in Equation (6): 
         [0000]    
       
         
           
             
               
                 
                   
                     d 
                      
                     
                       ( 
                       
                         K 
                         , 
                         
                           Et 
                           t 
                         
                       
                       ) 
                     
                   
                   = 
                   
                     
                       min 
                       
                         u 
                         , 
                         v 
                         , 
                         w 
                       
                     
                      
                     
                       ( 
                       
                         L 
                          
                         
                           ( 
                           
                             
                               
                                 Λ 
                                 Ω 
                               
                                
                               
                                 ( 
                                 
                                   K 
                                   , 
                                   0 
                                   , 
                                   0 
                                   , 
                                   0 
                                 
                                 ) 
                               
                             
                             , 
                             
                               Et 
                               
                                 u 
                                 , 
                                 v 
                                 , 
                                 w 
                               
                             
                           
                           ) 
                         
                       
                       ) 
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
         [0040]    where 
         [0000]        Et   u,v,w =Λ Ω ( K,φ   u , θ v , ψ w )  (6.1) 
         [0000]    Then let a distance between K and etalons set Et be defined as a weighted sum of distances from K to etalons from Et, given by Equation (6.5) as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       d 
                        
                       
                         ( 
                         
                           K 
                           , 
                           Et 
                         
                         ) 
                       
                     
                     = 
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           1 
                         
                         ρ 
                       
                        
                       
                         
                           d 
                            
                           
                             ( 
                             
                               K 
                               , 
                               
                                 Et 
                                 i 
                               
                             
                             ) 
                           
                         
                          
                         
                           η 
                           i 
                         
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   6.5 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where η i , i=1 . . . ρ are weights coefficients which can be changed by user or have some predefined values. A fitness function then may be defined by Equation (7) below: 
         [0000]        H ( c   v )= M   v   d ( c   v   Et )  (7) 
         [0000]    where M v -is a geometrical correction given by Equation (8): 
         [0000]        M   pv   =g  cos {right arrow over (( c   pv   −R   p-γ ,)}{right arrow over (R p−1   −R   p-γ-1 )})+α  (8) 
         [0041]    and where 
         [0000]    
       
         
           
             
               
                 
                   
                     v 
                     opt 
                   
                   = 
                   
                     arg 
                      
                     
                       
                         min 
                         v 
                       
                        
                       
                         ( 
                         
                           H 
                            
                           
                             ( 
                             
                               c 
                               v 
                             
                             ) 
                           
                         
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
         [0042]    As is seen from Equation (7), the fitness function can be represented, in some implementations, as a minimum of weighted sums of sample-based distances from the evaluated point to the etalon adjusted for a geometrical correction M. The geometrical correction M is defined in Equation (8), and may be considered a kind of inertia which prevents sudden jumps in the tracking trajectory.  FIG. 3  shows a possible example of embodiment of a vector scheme  170  which may be used for calculation of the geometrical correction M in accordance with the teachings of the present disclosure. 
         [0043]    In at least some implementations, a candidate point where the fitness function (Equation (7) above) reaches a minimum is the optimal result on the current iteration, and is given by Equation (9) above. One or more stop criteria can be evaluated to abort tracking when the degree of similarity becomes low. For example, suitable stop criteria may be based on an absolute value of the fitness function, or may be calculated relative to the value on the first element, or any other suitable stop criteria may be devised. 
         [0044]    As shown in  FIG. 2 , the method  150  further includes a results update  164 . If the stop criteria is passed, a new point may be added to the result set, given by Equation (14) below: 
         [0000]        R   p   =R   p−1   ∪c   PVopt   (14) 
         [0045]    A determination is made whether a requested number of iterations has been reached at  166 . If the requested number of iterations is not reached, the method  150  may return to the calculation of etalons (at  156 ) and repeat the above-described actions until the number of iterations is reached (at  166 ). 
         [0046]    When the method  150  is complete (at  166 ), the method  150  may continue to other operations or may terminate at  168 . Upon completion, the results set R (see Equation (14) above) may include a three-dimensional (3D) trajectory of the tracked object. If more than one point was tracked, all individual result sets can be joined to get a final trajectory. 
         [0047]    In one or more implementations, the proposed algorithm(s) discussed above can be useful. Example embodiments of methods and systems described herein are merely exemplary should not be construed to in any way limit the functionality of the methods described above, and/or the scope of the claims listed below. Furthermore, it should be appreciated that one or more of the activities described herein, including the activities described above with respect to  FIG. 2 , may either be tied to a particular apparatus, or may involve a transformation of something (e.g. data, information, etc.) into a different state or thing. 
         [0048]    In at least some implementations, the result of the methods for automatic tracking are highly accurate, and may be of the same quality as the results provided by manual tracking activities. In addition, the stopping mechanism may advantageously prevent false picking and may identify quickly the ambiguous areas. 
         [0049]    Similarly, dramatic reductions of time spent for seismic interpretation may be achieved. More specifically, in at least some implementations, the proposed methods generally allow much faster seismic interpretation because the number of manually interpreted sections are reduced by approximately one or two orders of magnitude. In addition, expert knowledge may be taken into account to further enhance performance. 
         [0050]    In further implementations, multi-attribute analyses may be achieved. For example, the methods and systems proposed herein may allow the use of different input data for tracking at the same time. This aspect may advantageously improve the quality of the results since structural features may be more visible on some attributes than on original amplitudes. 
         [0051]    Exemplary Computational Environment 
         [0052]    Systems and methods for automated structural interpretation of geological structures in accordance with the teachings of the present disclosure may be implemented in a variety of computational environments. For example,  FIG. 4  illustrates an exemplary environment  200  in which various embodiments of systems and methods in accordance with the teachings of the present disclosure can be implemented. In this implementation, the environment  200  includes a computing device  210  configured in accordance with the teachings of the present disclosure. In some embodiments, the computing device  210  may include one or more processors  212  and one or more input/output (I/O) devices  214  coupled to a memory  220  by a bus  216 . One or more Application Specific Integrated Circuits (ASICs)  215  may be coupled to the bus  216  and configured to perform one or more desired functionalities described herein. 
         [0053]    The one or more processors  212  may be composed of any suitable combination of hardware, software, or firmware to provide the desired functionality described herein. Similarly, the I/O devices  214  may include any suitable I/O devices, including, for example, a keyboard  214 A, a cursor control device (e.g. mouse  214 B), a display device (or monitor)  214 C, a microphone, a scanner, a speaker, a printer, a network card, or any other suitable I/O device. In some embodiments, one or more of the I/O components  214  may be configured to operatively communicate with one or more external networks  240 , such as a cellular telephone network, a satellite network, an information network (e.g. Internet, intranet, cellular network, cable network, fiber optic network, LAN, WAN, etc.), an infrared or radio wave communication network, or any other suitable network. The system bus  216  of the computing device  210  may represent any of the several types of bus structures (or combinations of bus structures), including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. 
         [0054]    The memory  220  may include one or more computer-readable media configured to store data and/or program modules for implementing the techniques disclosed herein. For example, the memory  220  may host (or store) a basic input/output system (BIOS)  222 , an operating system  224 , one or more application programs  226 , and program data  228  that can be accessed by the one or more processors  212  for performing various functions disclosed herein. 
         [0055]    The computing device  210  may further include a structural interpretation package  250  in accordance with the teachings of the present disclosure. More specifically, the structural interpretation package  250  may be configured to perform structural interpretation and tracking processes of a geological structure  260 , including, for example, those processes and activities described above with respect to the method  150  shown in  FIG. 2 . 
         [0056]    As depicted in  FIG. 4 , the structural interpretation package  250  may be stored within (or hosted by) the memory  220 . In alternate implementations, however, the structural interpretation package  250  may reside within or be distributed among one or more other components or portions of the computing device  210 . For example, in some implementations, one or more aspects of the structural interpretation functionalities described herein may reside in one or more of the processors  212 , the I/O devices  214 , the ASICs  215 , or the memory  220  (e.g. one or more application programs  226 ). 
         [0057]    In the foregoing description, various techniques have been or may be described in the general context of software or program modules. Generally, software includes routines, programs, objects, components, data structures, and so forth that perform particular tasks or implement particular abstract data types. An implementation of these modules and techniques may be stored on or transmitted across some form of computer readable media. Computer readable media can be any available medium or media that can be accessed by a computing device. By way of example, and not limitation, computer readable media may comprise “computer storage media”. 
         [0058]    “Computer storage media” include volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, or other data. Computer storage media may include, but is not limited to, random access memory (RAM), read only memory (ROM), electrically erasable programmable ROM (EEPROM), flash memory or other memory technology, compact disk ROM (CD-ROM), digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium, including paper, punch cards and the like, which can be used to store the desired information and which can be accessed by the computing device  210 . Combinations of any of the above should also be included within the scope of computer readable media. 
         [0059]    Moreover, the computer-readable media included in the system memory  220  can be any available media that can be accessed by the computing device  210 , including removable computer storage media (e.g. CD-ROM  220 A) or non-removeable storage media. Computer storage media may include both volatile and nonvolatile media (or persistent and non-persistent) implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules, or other data. Generally, program modules executed on the computing device  210  may include routines, programs, objects, components, data structures, etc., for performing particular tasks or implementing particular abstract data types. These program modules and the like may be executed as a native code or may be downloaded and executed such as in a virtual machine or other just-in-time compilation execution environments. Typically, the functionality of the program modules may be combined or distributed as desired in various implementations. 
         [0060]    Referring again to  FIG. 4 , it will be appreciated that the computing device  210  is merely exemplary, and represents only one example of many possible environments (e.g. computing devices, architectures, etc.) that are suitable for use in accordance with the teachings of the present disclosure. Therefore, the computing device  210  shown in  FIG. 4  is not intended to suggest any limitation as to scope of use or functionality of the computing device and/or its possible architectures. Neither should computing device  210  be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the example computing device  210 . 
         [0061]    Various techniques may be described herein in the general context of software or program modules. Generally, software includes routines, programs, objects, components, data structures, and so forth that perform particular tasks or implement particular abstract data types. An implementation of these modules and techniques may be stored on or transmitted across some form of computer readable media. Computer readable media can be any available medium or media that can be accessed by a computing device. By way of example, and not limitation, computer readable media may comprise “computer storage media”. 
         [0062]    “Computer storage media” include volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, or other data. Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. 
       CONCLUSION 
       [0063]    Although embodiments of systems and methods for automated structural interpretation have been described in language specific to structural features and/or methods, it is to be understood that the subject of the appended claims is not necessarily limited to the specific features or methods described. Rather, the specific features and methods are disclosed as exemplary implementations of automated structural interpretation.