Skip to main navigation Skip to search Skip to main content

Learning by simplified cost-reference particle filtering using biased data

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper we address the problem of online learning by cost-reference particle filtering combined with Kalman filtering. We propose an efficient learning scheme applicable to problems where some of the unknowns of a dynamic system of interest are linear given the remaining unknowns, which are nonlinear. To that end, we exploit a concept that is analogous to Rao-Blackwellization, and we implement it by using only one Kalman filter. The resulting algorithm is tested and compared to standard particle filtering for the problem of target tracking using bearings-only measurements acquired by two sensors.

Original languageEnglish
Title of host publicationMachine Learning for Signal Processing 17 - Proceedings of the 2007 IEEE Signal Processing Society Workshop, MLSP
Pages402-407
Number of pages6
DOIs
StatePublished - 2007
Event17th IEEE International Workshop on Machine Learning for Signal Processing, MLSP-2007 - Thessaloniki, Greece
Duration: Aug 27 2007Aug 29 2007

Publication series

NameMachine Learning for Signal Processing 17 - Proceedings of the 2007 IEEE Signal Processing Society Workshop, MLSP

Conference

Conference17th IEEE International Workshop on Machine Learning for Signal Processing, MLSP-2007
Country/TerritoryGreece
CityThessaloniki
Period08/27/0708/29/07

Fingerprint

Dive into the research topics of 'Learning by simplified cost-reference particle filtering using biased data'. Together they form a unique fingerprint.

Cite this