22,755 research outputs found
INLA or MCMC? A Tutorial and Comparative Evaluation for Spatial Prediction in log-Gaussian Cox Processes
We investigate two options for performing Bayesian inference on spatial
log-Gaussian Cox processes assuming a spatially continuous latent field: Markov
chain Monte Carlo (MCMC) and the integrated nested Laplace approximation
(INLA). We first describe the device of approximating a spatially continuous
Gaussian field by a Gaussian Markov random field on a discrete lattice, and
present a simulation study showing that, with careful choice of parameter
values, small neighbourhood sizes can give excellent approximations. We then
introduce the spatial log-Gaussian Cox process and describe MCMC and INLA
methods for spatial prediction within this model class. We report the results
of a simulation study in which we compare MALA and the technique of
approximating the continuous latent field by a discrete one, followed by
approximate Bayesian inference via INLA over a selection of 18 simulated
scenarios. The results question the notion that the latter technique is both
significantly faster and more robust than MCMC in this setting; 100,000
iterations of the MALA algorithm running in 20 minutes on a desktop PC
delivered greater predictive accuracy than the default \verb=INLA= strategy,
which ran in 4 minutes and gave comparative performance to the full Laplace
approximation which ran in 39 minutes.Comment: This replaces the previous version of the report. The new version
includes results from an additional simulation study, and corrects an error
in the implementation of the INLA-based method
Sparse density estimation on the multinomial manifold
A new sparse kernel density estimator is introduced based
on the minimum integrated square error criterion for the finite mixture model. Since the constraint on the mixing coefficients of the finite mixture model is on the multinomial manifold, we use the well-known Riemannian trust-region (RTR) algorithm for solving this problem. The first- and second-order Riemannian geometry of the
multinomial manifold are derived and utilized in the RTR algorithm. Numerical examples are employed to demonstrate that the proposed approach is effective in constructing sparse kernel density estimators with an accuracy competitive with those of existing kernel density
estimators
Collaborative sparse regression using spatially correlated supports - Application to hyperspectral unmixing
This paper presents a new Bayesian collaborative sparse regression method for
linear unmixing of hyperspectral images. Our contribution is twofold; first, we
propose a new Bayesian model for structured sparse regression in which the
supports of the sparse abundance vectors are a priori spatially correlated
across pixels (i.e., materials are spatially organised rather than randomly
distributed at a pixel level). This prior information is encoded in the model
through a truncated multivariate Ising Markov random field, which also takes
into consideration the facts that pixels cannot be empty (i.e, there is at
least one material present in each pixel), and that different materials may
exhibit different degrees of spatial regularity. Secondly, we propose an
advanced Markov chain Monte Carlo algorithm to estimate the posterior
probabilities that materials are present or absent in each pixel, and,
conditionally to the maximum marginal a posteriori configuration of the
support, compute the MMSE estimates of the abundance vectors. A remarkable
property of this algorithm is that it self-adjusts the values of the parameters
of the Markov random field, thus relieving practitioners from setting
regularisation parameters by cross-validation. The performance of the proposed
methodology is finally demonstrated through a series of experiments with
synthetic and real data and comparisons with other algorithms from the
literature
- …