Fast computation of spatially adaptive kernel estimates
MetadataShow full item record
© 2017 Springer Science+Business Media, LLC Kernel smoothing of spatial point data can often be improved using an adaptive, spatially varying bandwidth instead of a fixed bandwidth. However, computation with a varying bandwidth is much more demanding, especially when edge correction and bandwidth selection are involved. This paper proposes several new computational methods for adaptive kernel estimation from spatial point pattern data. A key idea is that a variable-bandwidth kernel estimator for d-dimensional spatial data can be represented as a slice of a fixed-bandwidth kernel estimator in (Formula presented.)-dimensional scale space, enabling fast computation using Fourier transforms. Edge correction factors have a similar representation. Different values of global bandwidth correspond to different slices of the scale space, so that bandwidth selection is greatly accelerated. Potential applications include estimation of multivariate probability density and spatial or spatiotemporal point process intensity, relative risk, and regression functions. The new methods perform well in simulations and in two real applications concerning the spatial epidemiology of primary biliary cirrhosis and the alarm calls of capuchin monkeys.
Showing items related by title, author, creator and subject.
Davies, T.; Baddeley, Adrian (2017)© 2017 Springer Science+Business Media, LLC Kernel smoothing of spatial point data can often be improved using an adaptive, spatially varying bandwidth instead of a fixed bandwidth. However, computation with a varying ...
Mcswiggan, G.; Baddeley, Adrian; Nair, G. (2016)© 2016 Board of the Foundation of the Scandinavian Journal of Statistics.This paper develops a statistically principled approach to kernel density estimation on a network of lines, such as a road network. Existing heuristic ...
Hirt, Christian; Featherstone, Will; Claessens, Sten (2011)In the numerical evaluation of geodetic convolution integrals, whether by quadrature or discrete/fast Fourier transform (D/FFT) techniques, the integration kernel is sometimes computed at the centre of the discretised ...