Download presentation

Presentation is loading. Please wait.

Published byNathan Figueroa Modified over 2 years ago

1
Introduction to Spatial modelling Statistics for Environmental Evaluation Duncan Lee and Marian Scott March / April 2009

2
Outline 1.Geostatistics 2.Areal unit data 3.Spatial point processes 4.Spatio-temporal modelling

3
1. Geostatistical data For a fixed region A, the variable of interest could be measured at any location. However due to time/cost constraints it has only been measured at n locations u 1,…, u n, which are typically chosen and not random. The random variables measured at all n locations are denoted by Z(u 1 ),…, Z(u n ). Examples of geostatistical data include air pollution, temperature, water quality.

4
Example – Air pollution Location of the pollution monitors in Greater London.

5
Goals of geostatistics Given observations Z(u 1 ),…, Z(u n ), there are two stages in a general geostatistical analysis. 1.How do I best to model the data? 2.How do I use my model to estimate quantities of interest? For example: 1.How do I estimate Z(u 0 ) where u 0 is an unobserved location? 2.How do I draw a map of Z(u) for all points u in my region? 3.How do I estimate the average value over the region?

6
Modelling geostatistical data When modelling geostatistical data we need to consider the following: Are the observations Z(u 1 ),….Z(u n ) Gaussian or do I need to transform them? Is there a pronounced spatial trend that needs to be modelled – e.g. regression variables or other trends. Are the responses spatially dependent – i.e. how are observations close to each other in space related? Which method of analysis should I use – e.g. frequentist or Bayesian methods?

7
General geostatistical model A general model for data Z=(Z(u 1 ),…, Z(u n )), is Z = µ + S Where The data Z are assumed to be normally distributed. µ is the mean function and models spatial trend. S is a stochastic process and models spatial dependence.

8
Modelling the spatial trend µ A spatial trend is a systematic change in the mean function µ over the area of interest. It is generally smooth, although it may change abruptly in response to environmental forcing variables (e.g., bedrock geology, presence of mountains, etc). It can be modelled in numerous ways. Regression variables such as geology or altitude. Polynomials or smooth functions in the co-ordinates u 1 …u n. Modelled within the spatial dependence component S, although we wont discuss this here.

9
Types of spatial dependence 1 Spatial dependence quantifies how the values of Z(u 1 ),…, Z(u n ) are related to each other. Three types of spatial dependence are possible. Independence - the values of Z(u 1 ),…, Z(u n ) are not related. Negative dependence – if locations u 1 and u 2 are close together then Z(u 1 ) and Z(U 2 ) will have different values. Positive dependence – if locations u 1 and u 2 are close together then Z(u 1 ) and Z(U 2 ) will have similar values.

10
Types of spatial dependence 2 There are two common simplifying assumptions that are made when modelling spaital dependence in Geostatistical data. Stationarity – Spatial dependence is stationary over a region R if the dependence between [Z(u 0 ),Z(U 1 )] is the same as the dependence between [Z(u 0 +m), Z(U 1 +m)] for any location shift m. Isotropy – Spatial dependence is isotropic if the dependence between observations at two locations a distance d apart, is the same no matter what direction you have to travel to get from the first to the second location.

11
Common spatial dependence The most common type of spatial dependence is positive, i.e. the closer two locations are the more similar their values will be. Therefore, for the remainder of this course we: 1.assume positive spatial dependence rather than negative. 2.assume that any spatial trend has been removed by the mean function µ. 3.assume that the spatial dependence is stationary and isotropic.

12
Modelling spatial dependence A common model for spatial dependence is given by S ~ N(0, V) which implies the data are normally distributed. Here V is the variance-covariance matrix, and is a transformed correlation matrix. If all observations have the same variance, then we can write V=σ 2 C C is the correlation matrix. σ 2 is the common variance of each observation.

13
Structure of the correlation matrix 1 The correlation matrix C typically has the following characteristics. 1.The diagonal elements equal 1, as they represent the correlation of an observation with itself. 2.The ijth element of C is close to one if locations u i and u j are close. 3.As locations u i and u j get further apart, the ijth element gets closer to zero. 4.Negative dependence (i.e. negative values in C) is rarely seen in geostatistical data.

14
Structure of the correlation matrix 2 As we focus only on stationary and isotropic spatial dependence in this course, it means that: 1.The correlation between observations at two locations only depends on their distance and direction from each other not the actual locations (stationarity). 2.The correlation between observations at two locations only depends on their distance apart and not the direction between them (Isotropy).

15
Assuming the spatial dependence is stationary and isotropic, the covariance function between 2 points Z(u) and Z(u + t) simplifies to a function of the scalar distance, t, between the two points. Similarly the correlation function is given by Where σ 2 is the variance and also denoted by V(0).

16
Semi-variogram modelling However in the geostatistical literature spatial dependence is typically modelled in terms of a transformation of the variance or correlation function V(t) or C(t). This function is given by γ(t) = 0.5Var(Z(u+t) – Z(u)) = C(0) – C(t) = σ 2 - C(t) and is called the semi-variogram.

17
Estimating the semi-variogram The semi-variogram is given by γ(t) = σ 2 - C(t), and is a function of the distance between two points t. There are two general approaches to estimating it. 1.Estimate and plot (t, γ(t)) from observations at all pairs of locations. 2.For each value t, estimate the average value γ(t) from all sets of observations that have locations a distance t apart.

18
Semi-variogram cloud The first option is the semi-variogram cloud, which for all pairs of points is a plot of against This form gives more than one value γ(t) for each value t, and so gives a scatterplot. Note the formula for semi-variogram again is γ(t) = 0.5Var(Z(u+t) – Z(u)) = σ 2 - C(t)

19
Semi-variogram estimator The semi-variogram for data Z(u 1 ),…, Z(u n ) can be estimated by calculating for any value of t. Here N(t) is the set of points (u i, u j ) that are distance t apart. This function is called the empirical semi- variogram, and it can be plotted against t to see the general shape.

20
But what should γ(t) look like? γ(t) = σ 2 - C(t)

21
The nugget is the limiting value of the semi-variogram as the distance t approaches zero. It quantifies the amount of spatial variability at very small spatial scales (those less than the separation between observations) and also measurement error. The sill is the horizontal asymptote of the variogram, if it exists, and represents the overall variance of the random process, σ 2. The range is the distance t* at which the semi-variogram reaches the sill. Pairs of points that are further apart than the sill are uncorrelated

22
But what about in practice? Sometimes the semi- variogram only approaches the sill asymptotically, and in this case we define the practical range as the lag t* at which γ(t) = 0.95* sill = 0.95* σ 2

23
Examples in R To see how the shape of the semi-variogram corresponds to the smoothness and variation in a spatial surface, we use the R package rpanel for illustration.

24
Semi-variogram models A number of semi-variogram models exist that can be used. Although these models may not fit the data particularly well. Nugget - random data Spherical Exponential

25
Modelling spatial dependence This gives us a three stage process by which to model spatial data. 1.Determine the form of the mean function and subtract it from the observed data to form residuals. 2.Plot the empirical semi-variogram and determine which family of semi-variogram models it resembles. 3.Estimate the parameters of the mean function and the chosen semi-variogram model (sill, nugget, range) by least squares methods.

26
Goals of spatial prediction Once a trend and spatial dependence model have been fitted, it is of interest to estimate the variable Z at some unobserved location u 0. This could be because: 1.You want to know the value at an unobserved location of particular interest. 2.You want to draw a map of the levels of the variable across a region – e.g. a city or country. 3.You want to estimate the average level of a variable across a region.

27
Implementing spatial prediction There are many methods for carrying out spatial prediction, including: Regression modelling using generalised least squares. Inverse distance weighted interpolation. Kriging. Bayesian spatial prediction Most of these can be relatively easily implemented in modern statistical packages such as R.

28
Form of spatial prediction The majority of these approaches predict z*(u 0 ) the variable at location u 0 by a weighted average of the form The main difference between the methods is how the weights are estimated. A map can then be produced by predicting the surface at a regular grid of points.

29
Estimating a spatial average Estimating the average value of a variable across a region (e.g. a electoral ward, city or country) can be done in numerous ways. One of the most straightforward is to extend single point prediction. 1.Predict the value of the variable at a set of locations P 1,…..P m that form a grid of equally spaced points across the region of interest. 2.Estimate the spatial average value as the average of these m prediction locations.

30
Example 137Cs deposition maps in SW Scotland prepared by different European teams (ECCOMAGS, 2002)

31
Ordinary Kriging One popular method of spatial prediction is ordinary Kriging. It is implemented in a number of stages. 1.Estimate the spatial trend using least squares methods. 2.De-trend the observed values by subtracting off the trend, to obtain residuals that have no spatial trend. 3.Choose and fit a model for the variogram to the residuals, which produces the weights for the prediction. The idea behind kriging is to predict Z*(u 0 ) from its conditional distribution given the observed data Z(u 1 ),…..,Z(u n ).

32
Extending Kriging There are a number of other kriging methods, such as: – Universal Kriging – block kriging, The accuracy of the predictions will be unknown, so we can use kriging to produce uncertainty maps. Recent work has been to develop approaches to incorporate this prediction uncertainty in the variogram model.

33
Kriging in R There are routines to do kriging in the R libraries:- geoR fields gstat sgeostat spatstat spatdat

34
Choosing the locations Suppose you can choose the locations u 1,….,u n at which you measure the variable of interest Z. Where should you choose to measure? The desired set of locations depends on the goal of the analysis. Point prediction – Locate points on a regular grid so that all prediction locations will be highly correlated with a few observed data points. Average estimation – If the aim is to estimate the average value of Z over the region A, then correlated points provides redundant information. Therefore you want the distance between pairs of points to be roughly the variogram range.

35
2. Areal unit data Suppose the region of interest A is split up into n non- overlapping sub-regions A 1,….,A n. The variable of interest is only available as an aggregated average or total for each sub-region A i. The data are denoted Z 1,….Z n. The lack of geostatistical data may be due to confidentiality reasons (e.g. personal data) or that the exact locations are just not recorded (e.g. election voting).

36
Motivating example Lip cancer rates for the 56 counties in Scotland. Two possible questions of interest: 1.Does any environmental variable affect the number of new cases? 2.Is there an outbreak of lip cancer cases in any part of Scotland? Map taken from a paper by Wakefield from Biostatistics 2007,

37
Modelling areal unit data When modelling areal unit data Z 1,….,Z n from sub-regions A 1,…,A n consider the following: Response distribution – normal, Poisson, binomial, etc. Regression variables – e.g. sunlight in the lip cancer example. Spatial dependence – how to model the spatial dependence? Method of analysis – frequentist or Bayesian methods.

38
Modelling spatial dependence In common with geostatistical data, spatial dependence will typically be positive rather than negative, I.e. the closer two areas (A i, A j ) are, the more similar their values (Z i, Z j ) will be. There are two common methods for modelling spatial dependence in areal unit data: Use a geostatistical model, where the locations of the data are assumed to come from the centre of the areal unit. Use a model that is based on the notion of neighbours.

39
Defining neighbours A common method for modelling positive dependence is based on an n by n neighbourhood or weight matrix W. It comprises 1s and 0s, where element ij is 1 if areas i and j are neighbours and 0 otherwise. Possible neighbours rules include Areas sharing a common border. Areas less than a distance d apart. Area i is one of the closest areas in terms of distance to area j. A border specification

40
Conditional autoregressive models For simplicity, assume that z 1,…z n are normally distributed and there are no covariates (these assumptions can be relaxed). Then a conditional autoregressive (CAR) model is given by Where Z -i is the vector including all the elements of Z except the i th. is the mean of Z in neighbouring areas of area i. n i is the number of neighbours that area i has.

41
3. Spatial point processes In Geostatistical and areal unit data types, observations are made at fixed locations or sub-regions across a region A. For spatial point process data, it is the locations of the observations within the region A that are random and comprise the data. Additional data may be collected at each location (marked point process). Examples include lightning strikes and the locations of trees in a forest. A realisation from a spatial point process is termed a spatial point pattern – a countable collection of events at locations u 1,…u n.

42
Notation A spatial point process is defined for a region A. Sub-regions within A are denoted A 1, A 2,…… Single locations within A are denoted u 1,u 2,…… Let N(A) be the random variable representing the number of events in the region A. Similar defnitions apply to N(A k ) and N(u k ).

43
Question of interest The key question of interest for spatial point process data is Does the point pattern have any spatial dependence? Three general types of structure are possible. Complete spatial randomness (CSR) – events occur at random. Clustered process – events occur close to existing events. Regular process – events occur away from existing events.

44
Example 1 Location of 65 Japanese black pine saplings in a square region of 5.7 metres squared.

45
Example 2 The locations of the centres of 42 biological cells observed under an optical microscope

46
How do you tell? So, having seen two examples of point processes, its not easy to determine whether a process is completely spatially random, clustered or regular. So how do you tell? The general idea is to Develop a statistical model for complete spatial randomness and see if the point process seem likely under that model. If they are then complete spatial randomness can be assumed. If not then we determine whether the point process looks more clustered or regular (the two opposite ends) than complete spatial randomness.

47
A model for CSR Complete Spatial Randomness (CSR) asserts that: (i) For any subregion A k, N(A k )~Poisson( |A k |). (ii) For disjoint sub-regions (A 1, A 2 ), N(A 1 ) and N(A 2 ) are independent. is termed the intensity and is the expected number of events per unit of area, so that |A| is the expected number of events in A. A process satisfying (i) and (ii) is called a homogeneous Poisson process (with intensity ).

48
Mean and covariance For a CSR process N(A)~Poisson( |A|). Mean – The mean number of occurrences of a process is constant across the region A. Therefore at a single location u 1, with unit area 1, the mean of N(u 1 ) equals. Variance – The variance of the number of occurrences equals the mean number of occurrences as a Poisson distribution is assumed. Covariance – The spatial dependence of the process between two points (u 1, u 2 ) is determined by the second order intensity function 2 (u 1, u 2 ). However the latter is hard to work with.

49
The K function Instead of working with the second order intensity function 2 (u 1, u 2 ) to measure spatial dependence, we work with the K function K(t) = E{N 0 (t)} / where N 0 (t) is the number of events within a distance t of an arbitrary event. So for a fixed for large t, K(t) will be large for small t, K(t) will be small t

50
Why is the K function useful? Recall that K(t) = E(n 0 of events within t of an arbitrary event) / For a CSR process - K(t) = t 2 / = t 2 - the area of a circle For a clustered process we would expect more points close together than under CSR, so for small t, K(t) > t2. For a regular process we would expect less points close together than under CSR, so for small t, K(t) < t2.

51
Determining whether CSR holds? Step 1 - estimate the intensity by hat = N(A)/|A|. Step 2 - estimate K(t) for a given distance t, by calculating the average number of events (over all points in the pattern) within distance t of that event. Step 3 – Plot the theoretical function for CSR, K(t) = t 2, against t, and add a second line for the estimated K function for the point process. If CSR is reasonable they will be very similar.

52
Some examples K(t) t

53
Further models for point processes If CSR does not hold for the data in question there are other models that can be used. For example Poisson cluster process – Models clusters. Inhomogeneous Poisson process – spatially varying intensity. Cox process – incorporating time-varying intensity. Inhibition process – models regular processes.

54
A final example Clustered process

55
Implementing point process models Point process models (including CRS and others) can be implemented in R using the add on libraries spatstat Splancs For further details see

56
4. Spatio-temporal modelling Now consider data collected at many locations over a number of points in time. Such data are a challenge to model because: usually very large data sets and typically one dimension is much richer than the other, i.e. lots of stations but only a few time points. few stations but monitored very frequently. Requires a choice in how to model the data, i.e. treat the data as a number of separate time series treat the data as a number of separate spatial processes combine spatial and time series methods.

57
Modelling dependence One major difficulty concerns how to jointly model correlation through time correlation over space Is correlation through space constant over time, and correlation through time constant over space? if yes, then we have a separable and stationary process. if not, then we need to build a space-time correlation structure (hard work).

58
General approach We focus on geostatistical data here. The general approach to spatio-temporal models is through stochastic spatio-temporal processes Z(u,t) - where u represents space and t represents time which may be a combination of a spatial and a time series process.

59
Simplifying assumptions Stationarity – natural extension from time series and spatial models. Isotropy – natural extension from spatial models. Separability – The covariance function of Z(u,t) can be split into space and time parts, i.e. cov[Z(u 1, t 1 ), Z(u 2, t 2 )] = Cov(u 1,u 2 )Cov(t 1,t 2 ) which means we can use the tools we have met previously. Separability corresponds to correlation through space is constant over time and correlation through time is constant over space

60
Example SO 2 in Europe

61
Non-separable processes Much harder problem, still the basis of much statistical research.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google