Resampling algorithms for particle filters: a computational complexity perspective

DOI10.1155/S1110865704405149zbMath1072.93026MaRDI QIDQ1773796

Petar M. Djurić, Sangjin Hong, Miodrag Bolic

Publication date: 3 May 2005

Published in: EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)

zbMATH Keywords

computational complexitytrackingparticle filtersresampling methodsstratified resampling

Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11) Nonparametric statistical resampling methods (62G09) Complexity and performance of numerical algorithms (65Y20)

Related Items (8)

Efficient estimation of hybrid systems with applications to tracking ⋮ Non-pilot-aided sequential Monte Carlo method to joint signal, phase noise, and frequency offset estimation in multicarrier systems ⋮ Risk‐sensitive filtering for nonlinear Markov jump systems on the basis of particle approximation ⋮ A low-power memory-efficient resampling architecture for particle filters ⋮ Design and implementation of flexible resampling mechanism for high-speed parallel particle filters ⋮ Adaptive kernels in approximate filtering of state‐space models ⋮ Performance evaluation of particle filter resampling techniques for improved estimation of misalignment and trajectory deviation ⋮ Sequential Monte Carlo methods for contour tracking of contaminant clouds

This page was built for publication: Resampling algorithms for particle filters: a computational complexity perspective