Geostatistics Flashcards

1
Q

Tobler’s first law

A

everything is related to everything else, but near things are more related than distant

spatial autocorellation (values of nearby things tend to be related)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Spatial interpolation

A

estimate of unknown values between sampled values within a convex hull

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

polygon enclosing all points in a dataset

A

convex hull

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

4 types of spatial interpolation

A

global, local, exact, inexact

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

global spatial interpolation

A

uses all input points for each cells calculation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

local spatial interpolation

A

uses a localized subset of input

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

trend surface analysis

global

A

calculate a single function describing a surface that covers the entire map area

essentially a line of best fit but a surface

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

coefficients of a polynomial in trend surface analysis are determined through …

A

“least-squares” optimization

plane minimizes the sum of squared deviations between the sampled and estimated data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Euclidean allocation

local

A

each cell takes the value of the nearest input feature

geometry of output is determined by spatial distirbution of input

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Thiessen/Voronoi polygons

A

value at an unknown location is equal to the value at the closest known location

unknown locations become the lines/borders of the polygons (as opposed to cell values changing in Euclidean allocation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

how many values does a Thiessen/Voronoi polygon have

A

1, assigned from the contained point

area under polygon is closest to contained point than any other point in input

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

inverse distance weighting (IDW)

local

A

interpolates value at a POI as a weighted average of nearby points

unknown value to be interpolated by average of surrounding points

weighted - assumes spatial dependency

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

is IDW exact

A

Yes, interpolated results must match the value at a sampled point

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Kernel density estimators

A

represent density change away from a known point

summit of kernel is point and pile around represents diminishing influence away from location

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

smaller search radius yields ____ density

A

peakier

no influence from outside the search radius

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

density maps

A

summed density of overlapping kernels to show estimated density on a map

17
Q

Kriging

local

A

process of determining properties of a surface by measured values, and apply to estimate missing parts of the surface

18
Q

which is smoother: kriging or IDW

A

kriging

IDW retains the sample distribution representation