Spatial Kalman Filter
Spatial Kalman Filter for Spatio-Temporal State-Space Models · Also known as: spatial state-space filter, spatio-temporal Kalman filter, SKF, spatial dynamic linear model
The spatial Kalman filter applies classical Kalman filtering to spatio-temporal state-space models, treating a spatially distributed latent field as the hidden state that evolves over time. At each time step, the filter recursively predicts the spatial field forward and then updates the prediction with new spatial observations, producing optimal linear estimates of the field and its uncertainty across all locations.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use the spatial Kalman filter when you have repeated measurements from a spatial network over time and want to (1) reconstruct the full spatial field at all locations, (2) propagate and quantify spatial uncertainty, and (3) update estimates sequentially as data arrive. It is particularly suited to environmental monitoring, remote sensing gap-filling, and geophysical data assimilation. Do not use it when the spatial field is truly static (use kriging instead), when observations are not sequential in time, when non-Gaussian or nonlinear dynamics dominate without a particle filter extension, or when the spatial dimension is so large that even reduced-rank approximations are impractical.
Strengths & limitations
- Provides optimal linear estimates of the spatially distributed field and its full uncertainty covariance at each time step.
- Sequential updating is computationally efficient: new data are assimilated without reprocessing all past observations.
- Naturally handles missing observations at any time step — the predict step still runs, and the update step simply uses whatever sensors are available.
- Reduced-rank and basis-function variants scale to continental or global spatial domains.
- Produces spatially smooth, physically coherent reconstructions because the covariance structure encodes spatial continuity.
- Assumes linear state and observation equations and Gaussian noise; nonlinear or non-Gaussian settings require extended variants (EKF, UKF, or particle filter).
- The state covariance matrix grows quadratically with the number of spatial locations, making exact computation infeasible for large grids without approximations.
- Results depend on the correct specification of the spatial covariance structure (Q_t, H_t, P_0); misspecification leads to over- or under-smoothed fields.
- Estimating unknown model parameters (transition matrices, covariance hyperparameters) requires an outer optimisation loop (maximum likelihood or MCMC), which can be expensive.
Frequently asked
How does the spatial Kalman filter differ from ordinary kriging?
Kriging produces a single optimal spatial interpolation from a static dataset, with no temporal dynamics. The spatial Kalman filter extends this to a time-series setting: the spatial field evolves according to a dynamic model and estimates are updated each time step as new observations arrive. Kriging is a special case of the spatial Kalman filter's update step when the field is treated as static.
What if the spatial domain is very large (thousands of grid cells)?
The exact Kalman filter is computationally infeasible for large grids because the state covariance matrix scales as O(n^2). Common solutions include reduced-rank representations using a small number of spatial basis functions (e.g., empirical orthogonal functions or fixed-rank kriging), sparse precision matrices exploiting the SPDE/Matern connection, or Vecchia approximations that condition on only nearby neighbours.
Can the spatial Kalman filter handle nonlinear dynamics?
Not directly. The standard filter assumes linear Gaussian dynamics. For nonlinear state equations you can linearise locally using the Extended Kalman Filter (EKF) or use the Unscented Kalman Filter (UKF) for smoother approximations. For strongly non-Gaussian or highly nonlinear problems, ensemble Kalman filters or particle filters are preferred.
What is the difference between filtering and smoothing?
Filtering provides the best estimate of the spatial field at time t using only data up to t — this is the online, real-time estimate. Smoothing uses all data (past and future) to produce retrospective estimates at each time step, which are more accurate but require storing and reprocessing the full time series in a backward pass (e.g., the Kalman smoother / RTS smoother).
How do I estimate the covariance parameters (Q, H, P0)?
These hyperparameters are typically estimated by maximising the marginal likelihood (the log-likelihood computed via the innovations from the prediction step), which can be done with gradient-based optimisation. Alternatively, a fully Bayesian approach places priors on the hyperparameters and samples them via MCMC alongside the latent states.
Sources
- Cressie, N. & Wikle, C. K. (2011). Statistics for Spatio-Temporal Data. Wiley. ISBN: 978-0-471-69274-4
- Kalman, R. E. (1960). A new approach to linear filtering and prediction problems. Journal of Basic Engineering, 82(1), 35-45. DOI: 10.1115/1.3662552 ↗
How to cite this page
ScholarGate. (2026, June 3). Spatial Kalman Filter for Spatio-Temporal State-Space Models. ScholarGate. https://scholargate.app/en/bayesian/spatial-kalman-filter
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Dynamic Bayesian InferenceBayesian↔ compare
- Kalman FilterBayesian↔ compare
- Particle FilterBayesian↔ compare
- Sequential Monte CarloBayesian↔ compare
- Spatial Bayesian InferenceBayesian↔ compare
- Spatial MCMCBayesian↔ compare