Analysis of parallelizable resampling algorithms for particle filtering

DOI10.1016/J.SIGPRO.2007.06.011MaRDI QIDQ971152zbMATH OpenOpenAlexFDO

Authors Joaquín Míguez

Publication date 19 May 2010

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.sigpro.2007.06.011

zbMATH Keywords

sequential Monte Carloresamplingparticle filteringparallelizationdynamic systems

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Resampling algorithms for particle filters: a computational complexity perspective
• Design and implementation of flexible resampling mechanism for high-speed parallel particle filters
• Resampling algorithms and architectures for distributed particle filters
• scientific article; zbMATH DE number 2044131
• Parallel particle filtering
• An Improvement on Resampling Algorithm of Particle Filters
• Generic hardware architectures for sampling and resampling in particle filters

Cited in

(10)

• Parallel particle filtering
• Fluctuations, stability and instability of a distributed particle filter with local exchange
• Design and implementation of flexible resampling mechanism for high-speed parallel particle filters
• On resampling schemes for particle filters with weakly informative observations
• Extended Kalman and particle filtering for sensor fusion in motion control of mobile robots
• Computational Science - ICCS 2004
• A low-power memory-efficient resampling architecture for particle filters
• Particle filtering: the need for speed
• scientific article; zbMATH DE number 2044131 (Why is no real title available?)
• Resampling algorithms for particle filters: a computational complexity perspective

This page was built for publication: Analysis of parallelizable resampling algorithms for particle filtering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971152)