GMS:Kriging: Difference between revisions
No edit summary |
|||
(32 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
__TOC__ | |||
Kriging is a method of interpolation named after a South African mining engineer named D. G. Krige who developed the technique in an attempt to more accurately predict ore reserves. Over the past several decades kriging has become a fundamental tool in the field of geostatistics. | Kriging is a method of interpolation named after a South African mining engineer named D. G. Krige who developed the technique in an attempt to more accurately predict ore reserves. Over the past several decades kriging has become a fundamental tool in the field of geostatistics. | ||
Kriging is based on the assumption that the parameter being interpolated can be treated as a regionalized variable. A regionalized variable is intermediate between a truly random variable and a completely deterministic variable in that it varies in a continuous manner from one location to the next and therefore points that are near each other have a certain degree of spatial correlation, but points that are widely separated are statistically independent (Davis, 1986). Kriging is a set of linear regression routines which minimize estimation variance from a predefined covariance model. | Kriging is based on the assumption that the parameter being interpolated can be treated as a regionalized variable. A regionalized variable is intermediate between a truly random variable and a completely deterministic variable in that it varies in a continuous manner from one location to the next and therefore points that are near each other have a certain degree of spatial correlation, but points that are widely separated are statistically independent (Davis, 1986). Kriging is a set of linear regression routines which minimize estimation variance from a predefined covariance model. | ||
The kriging routines implemented in GMS are based on the Geostatistical Software Library (GSLIB) routines published by Deutsch and Journel (1992). Since kriging is a rather complex interpolation technique and includes numerous options, a complete description of kriging is beyond the scope of this reference manual. | The kriging routines implemented in GMS are based on the Geostatistical Software Library (GSLIB) routines published by Deutsch and Journel (1992). Since kriging is a rather complex interpolation technique and includes numerous options, a complete description of kriging is beyond the scope of this reference manual. It is strongly encouraged to refer the GSLIB textbook for more information: | ||
Deutsch, C.V., & A.G. Journel. ''GSLIB: Geostatistical Software Library and User's Guide''. Oxford University Press, New York, 1992. | *Deutsch, C.V., & A.G. Journel. ''GSLIB: Geostatistical Software Library and User's Guide''. Oxford University Press, New York, 1992. | ||
Other good references on kriging include: | Other good references on kriging include: | ||
Royle, A.G., F.L. Clausen, & P. Frederiksen. Practical Universal Kriging and Automatice Contouring. ''Geo-Processing'', Vol. 1, No. 4, 1981. | *Royle, A.G., F.L. Clausen, & P. Frederiksen. Practical Universal Kriging and Automatice Contouring. ''Geo-Processing'', Vol. 1, No. 4, 1981. | ||
*Davis, J.C. ''Statistics and Data Analysis in Geology''. John Wiley & Sons, New York, 1986. | |||
*Lam, N.S. Spatial Interpolation Methods: A Review. ''The American Cartographer''. Vol. 10, No. 2, 1983. | |||
*Heine, G.W., A Controlled Study of Some Two-Dimensional Interpolation Methods, ''COGS Computer Contributions'', Vol. 2, No. 2. | |||
*Olea, T.A., Optimal Contour Mapping using Universal Kriging. ''J. Geophys. Research'', Vol. 79, No. 5, 1974. | |||
*Journel, A.G., & Huijbregts, C.J. ''Mining Geostatistics''. Academic Press, New York, NY, 1978. | |||
A powerful set of kriging techniques with varying degrees of sophistication have been implemented in GMS. The selection of the Kriging method and the definition of the variograms are accomplished using the [[GMS:Kriging Options|''Kriging Options'']] dialog. There are several differences between 2D and [[GMS:3D Kriging|3D Kriging]]. The supported techniques include: | |||
==Ordinary Kriging== | |||
The first step in ordinary kriging is to construct a variogram from the scatter point set to be interpolated. A variogram consists of two parts: an experimental variogram and a model variogram. Suppose that the value to be interpolated is referred to as f. The experimental variogram is found by calculating the variance (g) of each point in the set with respect to each of the other points and plotting the variances versus distance (h) between the points. Several formulas can be used to compute the variance, but it is typically computed as one half the difference in ''f'' squared. | |||
[[File:variogram.jpg|thumb|center|300 px|Experimental and model variogram used in Kriging]] | |||
Once the experimental variogram is computed, the next step is to define a model variogram. A model variogram is a simple mathematical function that models the trend in the experimental variogram. | Once the experimental variogram is computed, the next step is to define a model variogram. A model variogram is a simple mathematical function that models the trend in the experimental variogram. | ||
As can be seen in the above figure, the shape of the variogram indicates that at small separation distances, the variance in f is small. In other words, points that are close together have similar f values. After a certain level of separation, the variance in the f values becomes somewhat random and the model variogram flattens out to a value corresponding to the average variance. | As can be seen in the above figure, the shape of the variogram indicates that at small separation distances, the variance in ''f'' is small. In other words, points that are close together have similar ''f'' values. After a certain level of separation, the variance in the ''f'' values becomes somewhat random and the model variogram flattens out to a value corresponding to the average variance. | ||
Once the model variogram is constructed, it is used to compute the weights used in kriging. The basic equation used in ordinary kriging is as follows: | Once the model variogram is constructed, it is used to compute the weights used in kriging. The basic equation used in ordinary kriging is as follows: | ||
<!--{{only in print|[[Image:krigeq1.png|frame|center|''Equation 1''|100px]]}} | |||
<math>F(x,y) = \sum_{i=1}^n w_if_i</math>--> | |||
:[[Image:shep_eq1.jpg]] | |||
Where ''n'' is the number of scatter points in the set, ''f<sub>i</sub>'' are the values of the scatter points, and ''w<sub>i</sub>'' are weights assigned to each scatter point. | |||
This equation is essentially the same as the equation used for inverse distance weighted interpolation (equation 9.8) except that rather than using weights based on an arbitrary function of distance, the weights used in kriging are based on the model variogram. For example, to interpolate at a point ''P'' based on the surrounding points ''P<sub>1</sub>'', ''P<sub>2</sub>'', and ''P<sub>3</sub>'', the weights ''w<sub>1</sub>'', ''w<sub>2</sub>'', and ''w<sub>3</sub>'' must be found. The weights are found through the solution of the simultaneous equations: | |||
<!--{{only in print| [[Image:krigeq2.png|frame]]}} | |||
<math>\ w_1S(d_{11})+w_2S(d_{12})+w_3S(d_{13}) = S(d_{1p})</math>--> | |||
:[[Image:krigingeq1.jpg]] | |||
<!--{{only in print| [[Image:krigeq3.png|frame]]}} | |||
<math>\ w_1S(d_{21})+w_2S(d_{22})+w_3S(d_{23}) = S(d_{2p})</math>--> | |||
:[[Image:krigingeq2.jpg]] | |||
<!--{{only in print| [[Image:krigeq4.png|frame]]}} | |||
<math>\ w_1S(d_{31})+w_2S(d_{32})+w_3S(d_{33}) = S(d_{3p})</math>--> | |||
:[[Image:krigingeq3.jpg]] | |||
where ''S(d<sub>ij</sub>)'' is the model variogram evaluated at a distance equal to the distance between points ''i'' and ''j''. For example, ''S(d<sub>1p</sub>)'' is the model variogram evaluated at a distance equal to the separation of points ''P<sub>1</sub>'' and ''P''. Since it is necessary that the weights sum to unity, a fourth equation is added: | |||
where S(d<sub>ij</sub>) is the model variogram evaluated at a distance equal to the distance between points i and j. For example, S(d<sub>1p</sub>) is the model variogram evaluated at a distance equal to the separation of points P<sub>1</sub> and P. Since it is necessary that the weights sum to unity, a fourth equation is added: | |||
<!--{{only in print| [[Image:krigeq5.png|frame]]}} | |||
<math>\ w_1+w_2+w_3 = 1.0</math>--> | |||
:[[Image:krigingeq4.jpg]] | |||
Since there are now four equations and three unknowns, a slack variable, l, is added to the equation set. The final set of equations is as follows: | Since there are now four equations and three unknowns, a slack variable, l, is added to the equation set. The final set of equations is as follows: | ||
<!--{{only in print| [[Image:krigeq6.png|frame]]}} | |||
<math>\ w_1S(d_{11})+w_2S(d_{12})+w_3S(d_{13})+ \lambda = S(d_{1p})</math>--> | |||
:[[Image:krigingeq5.jpg]] | |||
{{only in print| [[Image: | <!--{{only in print| [[Image:krigeq7.png|frame]]}} | ||
<math>\ w_1S(d_{21})+w_2S(d_{22})+w_3S(d_{23})+ \lambda = S(d_{2p})</math>--> | |||
:[[Image:krigingeq6.jpg]] | |||
{{only in print| [[Image: | <!--{{only in print| [[Image:krigeq8.png|frame]]}} | ||
<math>\ w_1S(d_{31})+w_2S(d_{32})+w_3S(d_{33})+ \lambda = S(d_{3p})</math>--> | |||
:[[Image:krigingeq7.jpg]] | |||
{{only in print| [[Image: | <!--{{only in print| [[Image:krigeq9.png|frame]]}} | ||
<math>\ w_1+w_2+w_3+0 = 1.0</math>--> | |||
:[[Image:krigingeq8.jpg]] | |||
The equations are then solved for the weights ''w<sub>1</sub>'', ''w<sub>2</sub>'', and ''w<sub>3</sub>''. The ''f'' value of the interpolation point is then calculated as: | |||
The equations are then solved for the weights w<sub>1</sub>, w<sub>2</sub>, and w<sub>3</sub>. The f value of the interpolation point is then calculated as: | |||
<!--{{only in print| [[Image:krigeq10.png|frame]]}} | |||
<math>\ f_p = w_1f_1+w_2f_2+w_3f_3</math>--> | |||
:[[Image:krigingeq9.jpg]] | |||
By using the variogram in this fashion to compute the weights, the expected estimation error is minimized in a least squares sense. For this reason, kriging is sometimes said to produce the best linear unbiased estimate. However, minimizing the expected error in a least squared sense is not always the most important criteria and in some cases, other interpolation schemes give more appropriate results (Philip & Watson, 1986). | By using the variogram in this fashion to compute the weights, the expected estimation error is minimized in a least squares sense. For this reason, kriging is sometimes said to produce the best linear unbiased estimate. However, minimizing the expected error in a least squared sense is not always the most important criteria and in some cases, other interpolation schemes give more appropriate results (Philip & Watson, 1986). | ||
Line 89: | Line 85: | ||
An important feature of kriging is that the variogram can be used to calculate the expected error of estimation at each interpolation point since the estimation error is a function of the distance to surrounding scatter points. The estimation variance can be calculated as: | An important feature of kriging is that the variogram can be used to calculate the expected error of estimation at each interpolation point since the estimation error is a function of the distance to surrounding scatter points. The estimation variance can be calculated as: | ||
<!--{{only in print| [[Image:krigeq11.png|frame]]}} | |||
<math>\ s_z^2 = w_1S(d_{1p})+w_2S(d_{2p})+w_3S(d_{3p})+ \lambda</math>--> | |||
:[[Image:krigingeq10.jpg]] | |||
When interpolating to an object using the kriging method, an estimation variance dataset is always produced along with the interpolated dataset. As a result, a contour or isosurface plot of estimation variance can be generated on the target mesh or grid. | |||
When interpolating to an object using the kriging method, an estimation variance | |||
==Simple Kriging== | |||
Simple kriging is similar to | Simple kriging is similar to ordinary kriging except that the following equation is not added to the set of equations: | ||
<!--{{only in print| [[Image:krigeq5.png|frame]]}} | |||
<math>\ w_1+w_2+w_3 = 1.0</math>--> | |||
:[[Image:krigingeq4.jpg]] | |||
and the weights do not sum to unity. Simple kriging uses the average of the entire data set while ordinary kriging uses a local average (the average of the scatter points in the kriging subset for a particular interpolation point). As a result, simple kriging can be less accurate than ordinary kriging, but it generally produces a result that is "smoother" and more aesthetically pleasing. | and the weights do not sum to unity. Simple kriging uses the average of the entire data set while ordinary kriging uses a local average (the average of the scatter points in the kriging subset for a particular interpolation point). As a result, simple kriging can be less accurate than ordinary kriging, but it generally produces a result that is "smoother" and more aesthetically pleasing. | ||
==Universal Kriging== | |||
One of the assumptions made in kriging is that the data being estimated are stationary. That is, when moving from one region to the next in the scatter point set, the average value of the scatter points is relatively constant. Whenever there is a significant spatial trend in the data values such as a sloping surface or a localized flat region, this assumption is violated. In such cases, the stationary condition can be temporarily imposed on the data by use of a [[GMS:Kriging Options|drift]] term. The drift is a simple polynomial function that models the average value of the scatter points. The residual is the difference between the drift and the actual values of the scatter points. Since the residuals should be stationary, kriging is performed on the residuals and the interpolated residuals are added to the drift to compute the estimated values. Using a drift in this fashion is often called "universal kriging." | |||
One of the assumptions made in kriging is that the data being estimated are stationary. That is, | |||
==See also== | ==See also== | ||
Line 125: | Line 117: | ||
{{Navbox GMS}} | {{Navbox GMS}} | ||
[[Category:Interpolation|Kriging]] | |||
[[Category:Equations|Kriging]] | |||
[[Category:Citation]] |
Latest revision as of 14:06, 12 September 2017
Kriging is a method of interpolation named after a South African mining engineer named D. G. Krige who developed the technique in an attempt to more accurately predict ore reserves. Over the past several decades kriging has become a fundamental tool in the field of geostatistics.
Kriging is based on the assumption that the parameter being interpolated can be treated as a regionalized variable. A regionalized variable is intermediate between a truly random variable and a completely deterministic variable in that it varies in a continuous manner from one location to the next and therefore points that are near each other have a certain degree of spatial correlation, but points that are widely separated are statistically independent (Davis, 1986). Kriging is a set of linear regression routines which minimize estimation variance from a predefined covariance model.
The kriging routines implemented in GMS are based on the Geostatistical Software Library (GSLIB) routines published by Deutsch and Journel (1992). Since kriging is a rather complex interpolation technique and includes numerous options, a complete description of kriging is beyond the scope of this reference manual. It is strongly encouraged to refer the GSLIB textbook for more information:
- Deutsch, C.V., & A.G. Journel. GSLIB: Geostatistical Software Library and User's Guide. Oxford University Press, New York, 1992.
Other good references on kriging include:
- Royle, A.G., F.L. Clausen, & P. Frederiksen. Practical Universal Kriging and Automatice Contouring. Geo-Processing, Vol. 1, No. 4, 1981.
- Davis, J.C. Statistics and Data Analysis in Geology. John Wiley & Sons, New York, 1986.
- Lam, N.S. Spatial Interpolation Methods: A Review. The American Cartographer. Vol. 10, No. 2, 1983.
- Heine, G.W., A Controlled Study of Some Two-Dimensional Interpolation Methods, COGS Computer Contributions, Vol. 2, No. 2.
- Olea, T.A., Optimal Contour Mapping using Universal Kriging. J. Geophys. Research, Vol. 79, No. 5, 1974.
- Journel, A.G., & Huijbregts, C.J. Mining Geostatistics. Academic Press, New York, NY, 1978.
A powerful set of kriging techniques with varying degrees of sophistication have been implemented in GMS. The selection of the Kriging method and the definition of the variograms are accomplished using the Kriging Options dialog. There are several differences between 2D and 3D Kriging. The supported techniques include:
Ordinary Kriging
The first step in ordinary kriging is to construct a variogram from the scatter point set to be interpolated. A variogram consists of two parts: an experimental variogram and a model variogram. Suppose that the value to be interpolated is referred to as f. The experimental variogram is found by calculating the variance (g) of each point in the set with respect to each of the other points and plotting the variances versus distance (h) between the points. Several formulas can be used to compute the variance, but it is typically computed as one half the difference in f squared.
Once the experimental variogram is computed, the next step is to define a model variogram. A model variogram is a simple mathematical function that models the trend in the experimental variogram.
As can be seen in the above figure, the shape of the variogram indicates that at small separation distances, the variance in f is small. In other words, points that are close together have similar f values. After a certain level of separation, the variance in the f values becomes somewhat random and the model variogram flattens out to a value corresponding to the average variance.
Once the model variogram is constructed, it is used to compute the weights used in kriging. The basic equation used in ordinary kriging is as follows:
Where n is the number of scatter points in the set, fi are the values of the scatter points, and wi are weights assigned to each scatter point.
This equation is essentially the same as the equation used for inverse distance weighted interpolation (equation 9.8) except that rather than using weights based on an arbitrary function of distance, the weights used in kriging are based on the model variogram. For example, to interpolate at a point P based on the surrounding points P1, P2, and P3, the weights w1, w2, and w3 must be found. The weights are found through the solution of the simultaneous equations:
where S(dij) is the model variogram evaluated at a distance equal to the distance between points i and j. For example, S(d1p) is the model variogram evaluated at a distance equal to the separation of points P1 and P. Since it is necessary that the weights sum to unity, a fourth equation is added:
Since there are now four equations and three unknowns, a slack variable, l, is added to the equation set. The final set of equations is as follows:
The equations are then solved for the weights w1, w2, and w3. The f value of the interpolation point is then calculated as:
By using the variogram in this fashion to compute the weights, the expected estimation error is minimized in a least squares sense. For this reason, kriging is sometimes said to produce the best linear unbiased estimate. However, minimizing the expected error in a least squared sense is not always the most important criteria and in some cases, other interpolation schemes give more appropriate results (Philip & Watson, 1986).
An important feature of kriging is that the variogram can be used to calculate the expected error of estimation at each interpolation point since the estimation error is a function of the distance to surrounding scatter points. The estimation variance can be calculated as:
When interpolating to an object using the kriging method, an estimation variance dataset is always produced along with the interpolated dataset. As a result, a contour or isosurface plot of estimation variance can be generated on the target mesh or grid.
Simple Kriging
Simple kriging is similar to ordinary kriging except that the following equation is not added to the set of equations:
and the weights do not sum to unity. Simple kriging uses the average of the entire data set while ordinary kriging uses a local average (the average of the scatter points in the kriging subset for a particular interpolation point). As a result, simple kriging can be less accurate than ordinary kriging, but it generally produces a result that is "smoother" and more aesthetically pleasing.
Universal Kriging
One of the assumptions made in kriging is that the data being estimated are stationary. That is, when moving from one region to the next in the scatter point set, the average value of the scatter points is relatively constant. Whenever there is a significant spatial trend in the data values such as a sloping surface or a localized flat region, this assumption is violated. In such cases, the stationary condition can be temporarily imposed on the data by use of a drift term. The drift is a simple polynomial function that models the average value of the scatter points. The residual is the difference between the drift and the actual values of the scatter points. Since the residuals should be stationary, kriging is performed on the residuals and the interpolated residuals are added to the drift to compute the estimated values. Using a drift in this fashion is often called "universal kriging."
See also
GMS – Groundwater Modeling System | ||
---|---|---|
Modules: | 2D Grid • 2D Mesh • 2D Scatter Point • 3D Grid • 3D Mesh • 3D Scatter Point • Boreholes • GIS • Map • Solid • TINs • UGrids | |
Models: | FEFLOW • FEMWATER • HydroGeoSphere • MODAEM • MODFLOW • MODPATH • mod-PATH3DU • MT3DMS • MT3D-USGS • PEST • PHT3D • RT3D • SEAM3D • SEAWAT • SEEP2D • T-PROGS • ZONEBUDGET | |
Aquaveo |