|
|
|
|||||||||||||||||
| JOURNAL HOME | HELP | CONTACT PUBLISHER | SUBSCRIBE | ARCHIVE | SEARCH | TABLE OF CONTENTS |
1 Geosciences Department, University of Texas at Dallas, P.O. Box 830688, Mail Station FO21, Richardson, Texas 75083-0688, USA
2 Real Earth Models LLC, 4100 McEwen Road, Suite 240, Dallas, Texas 75244-5184, USA
| ABSTRACT |
|---|
|
|
|---|
This huge volume of data calls for an automated and objective method of analysis. We have developed a surface classification algorithm based on a multipass partitioning of the point cloud. The method makes use of both spatial proximity and the orientation of an initial coarse-grained model of the point cloud. Unsupervised classification of surface sets is demonstrated herein using the new algorithm.
Both previously mentioned types of scanners have been used to map the Jackfork sandstone outcrop at Big Rock Quarry in Little Rock, Arkansas. We apply the surface classification algorithm to these data to extract fracture surface orientations from the point cloud. The effectiveness of these new technologies when applied to fracture analysis is clearly demonstrated in this example. It is also shown that the low-density, low-resolution type of scanner is adequate to define general geomorphology but is inadequate for fracture definition. The surface classification algorithm can be used to reliably extract fracture and bedding strike and dip angles from the three-dimensional point locations acquired using centimeter-accurate, high-density laser scanner systems.
Keywords: cluster analysis fractures turbidite outcrop lidar laser scanner laser
| INTRODUCTION |
|---|
|
|
|---|
Typical methodology involves a detailed survey of fractures, in outcrop, by visual observation. This technique, although precise, is labor and time intensive and is hampered by the limited amount of data obtained, especially from large exposures, to be used for statistical analysis. Three-dimensional (3-D) geological structures such as faults, folds, fractures, and deformed sedimentary strata can be mapped using the global positioning system (GPS). This data-capture strategy consists of walking along faults, fractures, exposed contacts between formations, as well as other significant stratigraphic markers (Maerten et al., 2001), which is time consuming and effort demanding. Although fracture systems occupy three-dimensional volumes, they are most often studied in one-dimensional transects or two-dimensional maps and cross sections.
The approach of this paper is to use 3-D point clouds from ground-based laser scanners to identify fracture orientations in outcrops. Ground-based laser scanners have proven very useful for acquisition of high-quality, high-resolution, three-dimensional terrain data from outcrops (Xu et al., 2000; Bellian et al., 2002, 2005; McCaffrey et al., 2005). Surface geometry of the outcrop is remotely captured in the form of dense 3-D point clouds. Laser data have been used in other studies for 3-D modeling and mapping techniques as well as for fracture and fault recognition (Ahlgren et al., 2002; Ahlgren and Holmlund, 2003). The enormous volume of data produced by a laser scanner system demands an automated and objective processing technique. We have developed an unsupervised pattern classification technique that can extract surface orientation information directly from the point cloud. The result is the equivalent of taking hundreds of conventional strike and dip measurements in even the most inaccessible parts of an outcrop. This new surface classification algorithm is described in detail and demonstrated on synthetic data and on the Jackfork outcrop.
The methodology described in this paper provides a direct and easily interpretable visualization of the location, orientation, and geometry of zones of fracturing. Since outcrop geometry helps in identification and interpretation of fracture zones, our 3-D analysis of terrain surfaces of the outcrop at Big Rock Quarry shows how fractures with different orientations are distributed within the rock volume. Direct visualization of the 3-D fracture planes provides complementary information to the traditional stereonets, rose diagrams, and histogram plots.
| METHODOLOGY |
|---|
|
|
|---|
In this study, a mid-range laser measurement system (LMS), the Riegl Z360i scanner, and a long-range laser profile measuring (LPM) system, the Riegl LPM-i800HA, provided by Real Earth Models, LLC, were used to sample the outcrop topography. Laser scanner accuracy depends on both angle and range accuracy, and resolution depends on the ability to discriminate between objects in a point cloud. The resolution is determined by the smallest angle increment between successive samples (user definable) and the laser beam divergence rate. The LMS-Z360i scanner has an accuracy of 6 mm over a distance of 200 m and can capture up to 12,000 data points per second, with a resolution of 5 mm. The LPM-i800HA scanner has an accuracy of 15 mm over a distance of 800 m and can capture up to 1000 data points per second with a resolution of 1 cm. These systems produced a finely resolved data set with more than 1000 points per square meter.
Coarse-scale (decimeter-resolution), low-density (less than 15 points per 10 m2) capture of the same outcrop was accomplished using a Measurement Devices Ltd. robotic laser rangefinding system with a typical accuracy of 10 cm at 600 m. This system has a very low acquisition rate of
250 points per second. The high- and low-resolution data sets will be compared.
For a better definition of the outcrop surface geometry, the cliff faces were scanned from different locations (different angles) with both types of scanners. The multiple low-density scans (Measurement Devices Ltd. scanner) were aligned to each other and registered in the same coordinate system using the method described by Olariu et al. (2005). The PolyworksTM software (Alba and Scaioni, 2007) was used on the high-resolution point clouds from the Riegl scanners. The PolyworksTM alignment technique is based on the geometrical shape in overlapping scan areas, and, therefore, it does not require the use of reflective targets in each scan to align the point clouds. Overlapping portions of adjacent high-resolution scans should contain at least three features in common. Once these features are extracted, a six-parameter transformation (three rotations and three translations) can be estimated, and all the points of a scan can be transformed into a common coordinate system. The best sets of nonredundant data points in the overlapping regions are identified in the aligned 3-D scans and merged into a unified data set.
Surface Classification Algorithm Development
The laser scanner produces a 3-D point cloud that samples the outcrop topography at high spatial resolution at many thousands of individual points. With airborne lidar data, the quasi-normal direction to the surface is known to be vertical, and 2-D processing techniques may be applied. In ground-based 3-D scanner data for both natural and manmade objects, there can be many highly variable facet-normal directions. An automatic and objective method is desirable for the classification of the point data into discrete surface facets with well-defined orientations. The topography normal to each facet can be processed using well-known 2-D techniques for smoothing, decimation, and modeling, which do not readily generalize to 3-D. In some cases, such as fracture surfaces, a further analysis of the facet orientations themselves is of interest.
Unsupervised classification methods recognize patterns without the requirement for training data and with a minimal amount of human interaction. Many pattern recognition techniques make use of some form of cluster analysis. There are hundreds of published clustering algorithms (Hartigan, 1975; Spath, 1980; Kaufman and Rousseeuw, 1990) based on a wide variety of geometric, statistical, and heuristic concepts. The surface classification algorithm demonstrated here makes use of two different clustering methods, applied in two (or three) passes over the data in an unsupervised classification scheme.
A partition of a set of points in n dimensions is a division into k subsets. If a model, such as the subset centroid n-vector, characterizes each subset, then the partition can be optimized with respect to some measure of the model misfit to the data points. Optimized partitions for different integers, k, can be compared to each other, leading to the notion of partitioning into a certain number of clusters. Data points can be tested for membership in any particular cluster.
The surface classification method employs two partitioning steps. The first step (pass 1) is simply a coarse-graining of the data into groups, which are compact in 3-D configuration space (see Fig. 1A). These groups should be roughly equal in size (Navg) and have at least a minimum (Nmin < Navg) and no more than a maximum (Nmax > Navg) number of points. The parameter Nmin is determined by the requirement to compute cluster orientations for pass 2; Nmax must be small enough to prevent loss of spatial resolution after pass 1. This partitioning method does not need to have a well-defined cluster model but must be very economical to compute in order to cope with large point cloud data sets (Ntot >> Navg). The number of pass 1 clusters is k1 = Ntot/Navg. The improved, many-pass leader (multileader) algorithm (Hartigan, 1975) has been found to be a satisfactory pass 1 partitioning method. The second partitioning step (pass 2) must have a well-defined cluster model, but it can be less efficient in terms of computer resources since it will operate on a data set reduced in size by a factor of 1/Navg. The second partition will be created in six-dimensional space taking into account both the 3-D location and the 3-D orientation of the k1 clusters produced in pass 1. The partition in pass 2 is optimized with respect to an objective measure of model fit to produce a good descriptive model using the fewest number of surfaces (k2), as shown in Figure 1B.
|
The k-means algorithm is a partitioning method that produces a specified number, k, of clusters, where each cluster is represented by its centroid vector in n dimensions (Hartigan, 1975). An iterative procedure is used to move points from cluster to cluster until a scalar error measure (least sum squared error) is approximately minimized. There are a number of variations on the basic idea that substitute different norms for the Euclidean distance (and least squares) used in the original method (Kaufman and Rousseeuw, 1990). Note that if k is equal to N, the number of points, the error can be made zero, and each point is its own cluster. The scalar error measure can be modified by the introduction of a penalty for the use of too many parameters (increasing k). Several such measures are available (Sakamoto et al., 1986; Hurvich, 1997). Bozdogan and Sclove (1984) applied one of these criteria (Akaike's information criteria or AIC) to cluster analysis. Possibly the best measure defined to date is the minimum description length (MDL) statistic (Rissanen, 1978, 1986; Barron et al., 1998). Minimization of MDL produces a parsimonious model with the minimum number of parameters. Use of this objective criterion permits the surface classification algorithm to function in an unsupervised mode.
The specific steps in the surface classification algorithm are:
(1) For Ntot data points in three dimensions, define the cluster size measures Nmin < Navg < Nmax and k1 = int(Ntot/Navg).
(2) Pass 1: Partition into k1 clusters using the multileader algorithm. Split any clusters larger than Nmax by application of the multileader algorithm. Determine the cluster medoids (the central data point in each cluster). Combine any cluster smaller than Nmin with the cluster having the smallest intermedoid distance. Adjust k1 as necessary.
(3) For each of k1 clusters, compute the centroid vectors, covariance matrices, and their eigenvalues and eigenvectors. Determine the cluster normal direction (eigenvector associated with the smallest eigenvalue). Normalize the centroid vectors and combine with the unit-normal vectors in a k1 by 6 data matrix. A weight factor can be used to favor either the location or orientation elements of the data. Note that without the normalization, the location will be favored over the orientation due to the large relative size of the 3-D coordinates (|(x,y,z)| >> 1).
(4) Pass 2: For a range of possible values kmin < k2 < kmax apply the k-means algorithm to the new data matrix. Use the minimum description length (MDL) statistic to find an optimal value of k2. Assign each of the original Ntot points to the appropriate cluster identified in pass 2.
The particular cluster methods (multileader and k-means) were chosen here for their availability as well as their effectiveness. There is currently a lot of work being done on new cluster analysis methods for application to very large data sets in data mining (Agarwal and Procopiuc, 2002; Baeza-Yates et al., 2003; Guha et al., 2003). Substitution of some of these new methods could greatly expand the applicability of the surface classification algorithm in practice.
Surface Classification Algorithm Applied to Synthetic Data
The algorithm was first tested and verified on synthetic data: 1338 points on six unfolded faces of a cube with known orientations, each of which had
223 uniformly distributed points (Fig. 1). Four faces of the cube were vertical planes; two of them were oriented north-south, and the other two were oriented east-west. The other two faces were horizontal planes. Therefore, we expected the final partition to produce three clusters corresponding to the three known orientations.
The first partition produced uniform clusters of about the same size (Fig. 1A). The algorithm was tested for different cluster sizes, but it produced better results for smaller clusters. A larger number of clusters for each face (fewer points in each cluster) proved to work better, especially in describing the face geometry at the edges. The second partition took into consideration the orientation of the clusters produced in the first partition and grouped the clusters with similar orientation together (Fig. 1B). The optimum number of clusters in the final partition was determined by the L-shaped break value of MDL criterion (Fig. 1C). Three clusters, corresponding to the three orientations of the six faces of the test shape, were identified. Parallel faces were assigned to the same cluster since they had the same orientation. Clusters located at the edges between faces were assigned to the face for which the cluster had the most points. Each pair of faces was correctly identified, and also their orientations were correctly estimated. Equal-area stereographic projection of the orientation data (Fig. 1D), showing the distribution of poles to the planes defined in the pass 1 partition, indicates that there is a strong clustering about the mean for each orientation.
| GEOLOGIC SETTING AND STRUCTURAL DEFORMATION OF THE JACKFORK GROUP |
|---|
|
|
|---|
Big Rock Quarry is located in the southeastern part of the Ouachita Mountains along the north bank of the Arkansas River in North Little Rock, Arkansas (Fig. 2). The cliff faces of the quarry expose a 3-D view of the lower part of the upper Jackfork Group (Jordan et al., 1993). The exposure has variable orientation and is almost 1 km long. The upper Jackfork at Big Rock forms an
60-m-thick succession preserved in the vicinity of Big Rock syncline, which extends over 16 km along the southern margin of the Maumelle zone of the northeastern Ouachita Mountains. The syncline trends N65E at its eastern extent but curves to an approximately N115E trend to the west (Hale and Connelly, 2002, 2003).
|
The sandstones exposed in the western part of the outcrop, which was the focus of our study, are predominantly well-cemented, fractured, amalgamated, and thick to very thick (several meters), tabular to irregular-bedded, fine-grained, and massive quartz arenite turbidites. The brittle, sandstone beds are bounded by thin (centimeter), ductile shale layers.
| FRACTURE MAPPING AT BIG ROCK QUARRY |
|---|
|
|
|---|
3-D Analysis of Terrain Surfaces Applied to the Low-Resolution Outcrop Data
The orientations of the cliff faces exposed on the western part of the quarry (Fig. 3) were determined using the surface classification algorithm. The 3-D point cloud that maps the entire northwest wall of the quarry (length 250 m, height 50 m) is made up of
3000 points. When compared with the high-density data set (Fig. 4C), the same number of points would define a surface only 2 m2. Due to the low resolution of the terrain data, the fracture pattern could not be identified, but the algorithm worked well in describing the overall cliff-face orientations (Fig. 5). Equal-area stereographic projection of the orientation data (Fig. 5D), showing the distribution of poles to the planes defined in the pass 1 partition, indicates that the clusters are oriented NS or NE-SW, which reflects the trend of the outcrop as can be seen in the map view in Figure 3.
|
|
|
Fracture orientation measurements indicate that three major sets persist across the outcrop, and all of them are nearly perpendicular to bedding. The three identified orientations are: northeast (N21E/77E), northwest (N43W/79W), and north-northwest (N20W/81W). The NNW- and NE-striking fractures are subparallel to the regional northward compression during the Ouachita orogeny. The other fracture set is thought to have an orientation controlled by the principal stress axes that were active during folding in the region. Not all orientations were detected at every location. The NNW-striking one has smoother, more planar surfaces compared to the others, which have more irregular surfaces.
| DISCUSSION |
|---|
|
|
|---|
|
|
|
|
50 cm thick. Distinct planar orientations are shown as color-coded point clouds, where each color represents a particular orientation (Fig. 6C). All three fracture orientations were observed at this section of the outcrop: NE- (red), NNW- (yellow), and NW-striking (green points) fractures. All of them are nearly perpendicular to bedding (black points). The bedding plane surfaces strike approximately N26E and dip
6° to the east (Fig. 6E). The vector mean of the NE fracture strikes N23E. The NNW fracture set strikes N16W, and the NW fractures strike N53W. In addition to extracting the main fracture orientations, the surface classification algorithm also gives the distribution of the identified orientations, which is of interest for reservoir modeling and simulation (Lorenz et al., 2002). The distribution of poles to fracture planes on the equal-area stereographic projection (Fig. 6E) indicates that there is more variation in strike orientation within each cluster than there is in dip variation, and the bedding planes have the highest variation in strike. We used the circular standard error (95% confidence cone semi-angle about the mean in degrees) as a measure of the dispersion of orientation about the mean; lower dispersion values result in tighter clusters in orientation about the mean (Fisher, 1993).
The NNW-striking fractures are more consistent in orientation (a smaller standard error) when compared to the other fracture sets (Table 1). For the NNW- and NW-oriented fracture surfaces, the strike dispersion exceeds dip dispersion, and, therefore, they are more planar when compared to the ones that strike NE (Fig. 6).
|
Fracture Attitudes and Bed Thickness
The acquisition of data for different bed thicknesses resulted in fracture sets that had different distributions of both size and spacing resulting from the varied thickness of the sandstone beds. Fractures in the thin-bedded sandstone layers are densely spaced and confined to distinct layers. The relatively close spacing of the fractures in thinner beds is consistent with the relatively small bed thickness (centimeter to decimeter), while the thicker sandstone beds show an increase in fracture spacing with increasing bed thickness. The fractured, amalgamated sandstones comprise more than one stratigraphic bed, and the fractures are not limited to one single layer. The boundaries of the fractured sandstone layers are thin beds (centimeters) of shale.
The higher density of the fracture planes and the smaller scales for the thin-bedded (centimeters to decimeters) sandstone layers in area 2 made it more difficult to identify specific orientations (Fig. 7). The dispersion values (Table 1) for this section of the outcrop are higher when compared with the other locations where the sandstone layers are thicker. It was especially difficult to extract the orientation of the bedding planes. Even so, all three fracture orientations were identified, and the trends are close to the ones extracted from the previous locations.
For the thicker sandstone beds (thickness of amalgamated units is
2 m) in area 3 (Fig. 8) and area 4 (Fig. 9), it was easier to identify the fracture planes and to extract their orientations because of the larger number of points in the cloud to define particular surfaces. There was less variation along strike and dip for the larger-scale features. The NNW-striking fractures are more consistent in orientation (a smaller standard error) when compared to the other fracture sets (Table 1). The NW-striking fracture set has the highest dispersion, as was noticed also for the previous areas.
Measurements of orientations of the fracture surfaces at various locations along the quarry walls showed little variation of fracture orientation, even between widely separated areas (Fig. 10). The NNW- and NE-oriented fracture surfaces are more planar when compared to the ones striking NW, which have a rougher surface, and, therefore, they have lower dispersion values (Table 1).
|
Our results validate the previous findings about fracture variations with bed thickness, and the orientation information obtained from the 3-D outcrop can be extrapolated in the subsurface.
| CONCLUSIONS |
|---|
|
|
|---|
The method proved especially successful with this type of outcrop—the exposure at Big Rock Quarry has a blocky aspect due to preferential weathering on the fracture planes. The blocky pattern of the terrain surface of the outcrop reveals the geometry of fractures and is easily captured by laser scanners. Although surface roughness noise is somewhat greater than for the larger-scale surfaces, the smaller-scale fractures in centimeter-thick beds can still be captured. More detailed point clouds are required for a better definition of the small surface facets.
| ACKNOWLEDGMENTS |
|---|
| Footnotes |
|---|
MANUSCRIPT RECEIVED BY THE SOCIETY 20 June 2007
REVISED MANUSCRIPT RECEIVED 2 October 2007
MANUSCRIPT ACCEPTED 5 October 2007
| REFERENCES CITED |
|---|
|
|
|---|
Agarwal, P.K., and Procopiuc, C.M., 2002, Exact and approximate algorithms for clustering: Algorithmica, v. 33 p. 201-226 doi: 10.1007/s00453-001-0110-y.
Ahlgren, S., and Holmlund, J., 2003, Using 3-D outcrop laser scan for fracture analysis: American Association of Petroleum Geologists (AAPG) Search and Discovery Article 40099 (http://www.searchanddiscovery.net/documents/geophysical/2003/ahlgren/index.htm).
Ahlgren, S., Holmlund, J., Griffiths, P., and Smallshire, R., 2002, Fracture model analysis is simple: American Association of Petroleum Geologists Explorer, v. 23 p. 30-31.
Alba, M., and Scaioni, M., 2007, Comparison of techniques for terrestrial laser scanning data georeferencing applied to 3-D modeling of cultural heritage: in Remondino, F., and El-Hakim, S., eds., International Society of Photogrammetry and Remote Sensing Proceedings of the 2nd ISPRS International Workshop on 3-D Virtual Reconstruction and Visualization of Complex Structures: Zurich, Switzerland, ETH, International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences, v. XXXVI-5/W47 (http://www.commission5.isprs.org/3darch07/pdf/alba_scaioni.pdf).
Baeza-Yates, R., Bustos, B., Chavez, E., Herrera, N., and Navarro, G., 2003, Clustering in metric spaces with applications to information retrieval: in Wu, W., Xiong, H., and Shekar, S., eds., Clustering and Information Retrieval: New York, Kluwer Academic Publishers. 34 p.
Barron, A., Rissanen, J., and Yu, B., 1998, The minimum description length principle in coding and modeling: Institute of Electrical and Electronics Engineers (IEEE) Transactions on Information Theory, v. 44 p. 2743-2760 doi: 10.1109/18.720554.
Bellian, J.A., Jennette, D.C., Kerans, C., Gibeaut, J., Andrews, J., Yssldyk, B., and Larue, D., 2002, 3-Dimensional digital outcrop data collection and analysis using eye-safe laser (LIDAR) technology: American Association of Petroleum Geologists (AAPG) Search and Discovery Article 40056, (http://www.searchanddiscovery.net/documents/beg3d/index.htm).
Bellian, J.A., Kerans, C., and Jennette, D.C., 2005, Digital outcrop models: Applications of terrestrial scanning lidar technology in stratigraphic modelling: Journal of Sedimentary Research, v. 75 p. 166-176 doi: 10.2110/jsr.2005.013.
Bozdogan, H., and Sclove, S.L., 1984, Multi-sample cluster analysis using Akaike's information criterion: Annals of the Institute of Statistical Mathematics, v. 36 Part B, p. 163-180.
Coleman, J.L., Jr., 2000, Carboniferous submarine basin development of the Ouachita Mountains of Arkansas and Oklahoma: in Bouma, A.H., and Stone, C.G., eds., Fine-Grained Turbidite Systems: American Association of Petroleum Geologists (AAPG) Memoir 72 and Society of Sedimentary Geology (SEPM) Special Publication 68, p. 21-32.
Combs-Scott, K.D., and Smart, K.J., 2002, Surface fracture characterization of Jackfork Group turbidite sandstones in the Ouachita Mountains, Oklahoma: Shale Shaker, v. 52 p. 71-78.
Engelder, T., 1993, Stress Regimes in the Lithosphere: New Jersey, Princeton University Press. 451 p.
Fisher, N.I., 1993, Statistical Analysis of Circular Data: Cambridge University Press, New York. 277 p.
Guha, S., Ratogi, R., and Shim, K., 2003, Techniques for clustering massive data sets: in Wu, W., Xiong, H., and Shekar, S., eds., Clustering and Information Retrieval: New York, Kluwer Academic Publishers, p. 35-82.
Hale, C.R., and Connelly, J.B., 2002, Cleavage development within a folded sequence of Jackfork Sandstone, eastern Ouachita Mountains, Arkansas: Geological Society of America Abstracts with Programs, v. 34, no. 3 p. 37.
Hale, C.R., and Connelly, J.B., 2003, Complex structural history indicated by cleavage transection of the Big Rock syncline, eastern Ouachita Mountains, Arkansas: Geological Society of America Abstracts with Program, v. 35, no. 1 p. 24.
Hartigan, J.A., 1975, Clustering Algorithms: New York, John Wiley & Sons. 351 p.
Hurvich, C.M., 1997, Mean square over degrees of freedom: New perspectives on a model selection treasure: in Brillinger, D.R., Fernholz, L.T., and Morgenthaler, S., eds., The Practice of Data Analysis: Essays in Honor of John W. Tukey: Princeton, New Jersey, Princeton University Press. 352 p.
Jordan, D.W., Lowe, D.R., Slatt, R.M., D'Agostino, A., Scheihing, M.H., Gillespie, R.H., and Stone, C.G., 1993, Scales of geological heterogeneity of the Pennsylvanian Jackfork Group, Ouachita Mountains, Arkansas: Applications to Field Development and Exploration for Deep-Water Sandstones: Dallas, Dallas Geological Society, Field Trip Guidebook, no. 3. 142 p.
Kaufman, L., and Rousseeuw, P.J., 1990, Finding Groups in Data: An Introduction to Cluster Analysis: New York, Wiley-Interscience. 342 p.
Laubach, S.E., 1997, A method to detect natural fracture strike in sandstones: American Association of Petroleum Geologists (AAPG) Bulletin, v. 81 p. 604-623.
Lorenz, J.C., Sterling, J.L., Schechter, D.S., Whigham, C.L., and Jensen, J.L., 2002, Natural fractures in the Spraberry Formation, Midland Basin, Texas; the effects of mechanical stratigraphy on fracture variability and reservoir behavior: American Association of Petroleum Geologists (AAPG) Bulletin, v. 86 p. 505-524.
Maerten, L., Pollard, D.D., and Maerten, F., 2001, Digital mapping of three-dimensional structures of the Chimney Rock fault system, central Utah: Journal of Structural Geology, v. 23 p. 585-592 doi: 10.1016/S0191-8141(00)00142-5.[GeoRef]
McCaffrey, K.J.W., Jones, R.R., Holdsworth, R.E., Wilson, R.W., Clegg, P., Imber, J., Holliman, N., and Trinks, I., 2005, Unlocking the spatial dimension: Digital technologies and the future of geoscience fieldwork: Journal of the Geological Society of London, v. 162, no. 6 p. 927-938 doi: 10.1144/0016-764905-017.
Narr, W., 1991, Fracture density in the deep subsurface: Techniques with application to Point Arguello oil field: American Association of Petroleum Geologists (AAPG) Bulletin, v. 75 p. 1300-1323.
Narr, W., and Lerche, I., 1984, A method for estimating subsurface fracture density in core: American Association of Petroleum Geologists (AAPG) Bulletin, v. 68 p. 637-648.
Olariu, C., Bhattacharya, J.P., Xu, X., Aiken, C.L.V., Zeng, X., and McMechan, G.A., 2005, Integrated study of ancient delta-front deposits, using outcrop, ground-penetrating radar, and three-dimensional photorealistic data: Cretaceous Panther Tongue sandstone, Utah, U.S.A: in Giosan, L., and Bhattacharya, J.P., eds., River Deltas—Concepts, Models, and Examples: Tulsa, Oklahoma, Society for Sedimentary Geology (SEPM), p. 155-177.
Ortega, O., and Marrett, R., 2000, Prediction of macro-fracture properties using microfracture information, Mesaverde Group sandstones, San Juan basin, New Mexico: Journal of Structural Geology, v. 22 p. 571-588 doi: 10.1016/S0191-8141(99)00186-8.[GeoRef]
Ortega, O.J., Marrett, R.A., and Laubach, S.E., 2006, A scale-independent approach to fracture intensity and average spacing measurement: American Association of Petroleum Geologists (AAPG) Bulletin, v. 90 p. 193-208 doi: 10.1306/08250505059.
Plumb, R.A., 1982, The Relationship Between Fractures and In Situ Stress [Ph. D. dissertation]: New York, Columbia University. 149 p.
Price, N.J., 1966, Fault and Joint Development in Brittle and Semi-Brittle Rock: New York, Pergamon Press. 176 p.
Price, N.J., 1990, Analysis of Geological Structures: New York, Cambridge University Press. 502 p.
Rissanen, J., 1978, Modeling by shortest data description: Automatica, v. 14 p. 465-471 doi: 10.1016/0005-1098(78)90005-5.
Rissanen, J., 1986, A predictive least-squares principle: Institute of Mathematics and Its Applications (IMA): Journal of Mathematical Control & Information, v. 3 p. 211-222 doi: 10.1093/imamci/3.2-3.211.
Sakamoto, Y., Ishiguro, M., and Kitagawa, G., 1986, Akaike Information Criterion Statistics: Boston, Massachusetts, Kluwer Academic Publishers. 290 p.
Slatt, R.M., and Stone, C.G., 2001, Deepwater (turbidite) sandstone elements of the Jackfork Group in Arkansas: Application to exploration and development in eastern Oklahoma: Shale Shaker, v. 51 p. 93-101.[GeoRef]
Spath, H., 1980, Cluster Analysis Algorithms: For Data Reduction and Classification of Objects: New York, Wiley. 226 p.
Suppe, J., 1985, Principles of Structural Geology: Englewood Cliffs, New Jersey, Prentice-Hall. 537 p.
Whitaker, A.E., and Engelder, T., 2006, Plate-scale stress fields driving the tectonic evolution of the central Ouachita salient, Oklahoma and Arkansas: Geological Society of America Bulletin, v. 118 p. 710-723 doi: 10.1130/B25780.1.
Wu, H., and Pollard, D.D., 2002, Imaging 3-D fracture networks around boreholes: American Association of Petroleum Geologists (AAPG) Bulletin, v. 86 p. 593-604.
Xu, X., Aiken, C., Bhattacharya, J.P., Corbeanu, R.M., Nielsen, K.C., McMechan, G.A., and Abdelsalam, M.G., 2000, Creating virtual 3-D outcrops: The Leading Edge, v. 19 p. 197-202 doi: 10.1190/1.1438576.
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| JOURNAL HOME | HELP | CONTACT PUBLISHER | SUBSCRIBE | ARCHIVE | SEARCH | TABLE OF CONTENTS |