Variable resolution block kriging using a hierarchical spatial data structure
- 1 September 1994
- journal article
- research article
- Published by Taylor & Francis in International Journal of Geographical Information Science
- Vol. 8 (5) , 429-449
- https://doi.org/10.1080/02693799408902012
Abstract
Kriging is an optimal method of spatial interpolation that produces an error for each interpolated value. Block kriging is a form of kriging that computes averaged estimates over blocks (areas or volumes) within the interpolation space. If this space is sampled sparsely, and divided into blocks of a constant size, a variable estimation error is obtained for each block, with blocks near to sample points having smaller errors than blocks farther away. An alternative strategy for sparsely sampled spaces is to vary the sizes of blocks in such away that a block's interpolated value is just sufficiently different from that of an adjacent block given the errors on both blocks. This has the advantage of increasing spatial resolution in many regions, and conversely reducing it in others where maintaining a constant size of block is unjustified (hence achieving data compression). Such a variable subdivision of space can be achieved by regular recursive decomposition using a hierarchical data structure. An implementation of this alternative strategy employing a split-and-merge algorithm operating on a hierarchical data structure is discussed. The technique is illustrated using an oceanographic example involving the interpolation of satellite sea surface temperature data. Consideration is given to the problem of error propagation when combining variable resolution interpolated fields in GIS modelling operations.Keywords
This publication has 13 references indexed in Scilit:
- Tesseral amalgamators and hierarchical tessellationsImage and Vision Computing, 1991
- Kriging: a method of interpolation for geographical information systemsInternational Journal of Geographical Information Science, 1990
- Propagation of errors in spatial modelling with GISInternational Journal of Geographical Information Science, 1989
- Efficient component labeling of images of arbitrary dimension represented by linear bintreesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Dilation algorithm for a linear quadtreeImage and Vision Computing, 1987
- Comment on Quad- and OcttreesCommunications of the ACM, 1984
- An effective way to represent quadtreesCommunications of the ACM, 1982
- OPTIMAL INTERPOLATION AND ISARITHMIC MAPPING OF SOIL PROPERTIES III CHANGING DRIFT AND UNIVERSAL KRIGINGEuropean Journal of Soil Science, 1980
- OPTIMAL INTERPOLATION AND ISARITHMIC MAPPING OF SOIL PROPERTIESEuropean Journal of Soil Science, 1980
- OPTIMAL INTERPOLATION AND ISARITHMIC MAPPING OF SOIL PROPERTIESEuropean Journal of Soil Science, 1980