pith. sign in

arxiv: 1301.2298 · v1 · pith:NJCONPARnew · submitted 2013-01-10 · 💻 cs.AI · cs.CV

Lattice Particle Filters

classification 💻 cs.AI cs.CV
keywords particlefiltersfilterlatticeparticlesresultsstate-spacealgorithm
0
0 comments X
read the original abstract

A standard approach to approximate inference in state-space models isto apply a particle filter, e.g., the Condensation Algorithm.However, the performance of particle filters often varies significantlydue to their stochastic nature.We present a class of algorithms, called lattice particle filters, thatcircumvent this difficulty by placing the particles deterministicallyaccording to a Quasi-Monte Carlo integration rule.We describe a practical realization of this idea, discuss itstheoretical properties, and its efficiency.Experimental results with a synthetic 2D tracking problem show that thelattice particle filter is equivalent to a conventional particle filterthat has between 10 and 60% more particles, depending ontheir "sparsity" in the state-space.We also present results on inferring 3D human motion frommoving light displays.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.