Monte Carlo filtering using kernel embedding of distributions

7Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

Recent advances of kernel methods have yielded a framework for representing probabilities using a reproducing kernel Hilbert space, called kernel embedding of distributions. In this paper, we propose a Monte Carlo filtering algorithm based on kernel embeddings. The proposed method is applied to state-space models where sampling from the transition model is possible, while the observation model is to be learned from training samples without assuming a parametric model. As a theoretical basis of the proposed method, we prove consistency of the Monte Carlo method combined with kernel embeddings. Experimental results on synthetic models and real vision-based robot localization confirm the effectiveness of the proposed approach.

Cite

CITATION STYLE

APA

Kanagawa, M., Nishiyama, Y., Gretton, A., & Fukumizu, K. (2014). Monte Carlo filtering using kernel embedding of distributions. In Proceedings of the National Conference on Artificial Intelligence (Vol. 3, pp. 1897–1903). AI Access Foundation. https://doi.org/10.1609/aaai.v28i1.8984

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free