VBEM algorithm for the Log Gaussian Cox process
2014
Radoszycki, Julia | Dubois-Peyrard, Nathalie | Sabbadin, Regis
The log Gaussian Cox process [4] is a classical model to represent spatial interactions in count-based maps. For example, it has been used to model weeds counts in crop elds divided into quadrats [2,3]. A MCMC algorithm has been proposed by [2] to estimate jointly the a posteriori mode of the parameters vector and of the hidden Gaussian eld which captures the spatial structure of weed repartition. The drawback of MCMC algorithms is the required computational time. Hence, we propose here a faster algorithm based on a variational principle. The generic VBEM (Variational Bayesian Expectation Maximization, [1]) algorithm has been proposed recently. Inpractice, it is necessary to specify the E and the M steps of the VBEM algorithm for the log gaussian Cox process. We propose a speci cation based on a mean eld hypothesis and on Monte-Carlo simulations in the case of an exponential covariance function. Experiments on simulated data show that the proposed VBEM algorithm is as e cient (except for the estimation of the covariance parameter) and much faster than the MCMC algorithm presented in [2]. Weeds counts are usually only available for a sample of quadrats, since observations are costly to acquire. A future direction of this work will be to consider estimation of the log Gaussian Cox process' parameters from a limited size sample.
显示更多 [+] 显示较少 [-]