Paper
31 July 2002 Weighted interacting particle-based nonlinear filter
David J. Ballantyne, Surrey Kim, Michael A. Kouritzin
Author Affiliations +
Abstract
Particle-based nonlinear filters have proven to be effective and versatile methods for computing approximations to difficult filtering problems. We introduce a novel hybrid particle method, thought to possess an excellent compromise between the unadaptive nature of the weighted particle methods and the overly random resampling in classical interactive particle methods, and compare this new method to our previously introduced refining branching particle filter. Our experiments involve various fixed numbers of particles and compare computational efficiency of our new method to the incumbent. The hybrid method is demonstrated to outperform two previous particle filters on our simulated test problems. To highlight the flexibility of particle filters, we choose to test our methods on a rectangularly-constrained Markov signal that does not satisfy a typical stochastic equation but rather a Skorohod, local time formulation. Whereas normal diffusive behavior occurs in the interior of the rectangular domain, immediate reflections are enforced at the boundary. The test problems involve a fish signal with boundary reflections and is motivated by the fish farming industry.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David J. Ballantyne, Surrey Kim, and Michael A. Kouritzin "Weighted interacting particle-based nonlinear filter", Proc. SPIE 4729, Signal Processing, Sensor Fusion, and Target Recognition XI, (31 July 2002); https://doi.org/10.1117/12.477609
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications and 2 patents.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Particles

Particle filters

Digital filtering

Nonlinear filtering

Error analysis

Electronic filtering

Raster graphics

Back to Top