19 May 2006 Quasi-Monte Carlo particle filters: the JV filter
Author Affiliations +
Abstract
We describe a new particle filter that uses quasi-Monte Carlo (QMC) sampling with product measures rather than boring old Monte Carlo sampling or QMC with or without randomization. The product measures for QMC were recently invented by M. Junk and G. Venkiteswaran, and therefore we call this new nonlinear filter the "JV filter". Standard particle filters use boring old Monte Carlo sampling and suffer from the curse of dimensionality, and they converge at the sluggish rate of c(d)/√N in which N is the number of particles, and c(d) depends strongly on dimension of the state vector (d). Oh's theory and numerical experiments (by us) show that for good proposal densities, c(d) grows as d3, whereas for poor proposal densities c(d) grows exponentially with d. In contrast, for certain problems, QMC converges much faster than MC with N. In particular, QMC converges as k(d)/N, in which k(d) is logarithmic in N and its dependence on d is an interesting story.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Fred Daum, Fred Daum, } "Quasi-Monte Carlo particle filters: the JV filter", Proc. SPIE 6236, Signal and Data Processing of Small Targets 2006, 62360J (19 May 2006); doi: 10.1117/12.663914; https://doi.org/10.1117/12.663914
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT

Dynamic quasi-Monte Carlo for nonlinear filters
Proceedings of SPIE (August 24 2003)
Nonlinear filtering with quasi-Monte Carlo methods
Proceedings of SPIE (January 04 2004)
Spline filter for nonlinear/non-Gaussian Bayesian tracking
Proceedings of SPIE (September 24 2007)
Quasi-Monte Carlo hybrid particle filters
Proceedings of SPIE (August 24 2004)

Back to Top