Rao-Blackwellized particle filter for multiple target tracking

2007 ◽  
Vol 8 (1) ◽  
pp. 2-15 ◽  
Author(s):  
Simo Särkkä ◽  
Aki Vehtari ◽  
Jouko Lampinen
2021 ◽  
Author(s):  
◽  
Praveen Babu Choppala

<p>This thesis addresses several challenges in Bayesian target tracking, particularly for array signal processing applications, and for multiple targets.  The optimal method for multiple target tracking is the Bayes’ joint filter that operates by hypothesising all the targets collectively using a joint state. As a consequence, the computational complexity of the filter increases rapidly with the number of targets. The probability hypothesis density and the multi-Bernoulli filters that overcome this complexity do not possess a suitable framework to operate directly on phased sensor array data. Instead, such data is converted into beamformer images in which close targets may not be effectively resolved and much information is lost. This thesis develops a multiple signal classification (MUSIC) based multi-target particle filter that improves upon the filters mentioned above. A MUSIC based multi-Bernoulli particle filter is also developed, that operates more directly on array data.  The above mentioned particle filters require a resampling step which impedes information accumulation over successive observations, and affects the detection of very covert targets. This thesis develops soft resampling and soft systematic resampling to overcome this problem without affecting the accuracy of approximation. Additionally, modified Kolmogorov-Smirnov testing is proposed, to numerically evaluate the accuracy of the particle filter approximation.</p>


2021 ◽  
Author(s):  
◽  
Praveen Babu Choppala

<p>This thesis addresses several challenges in Bayesian target tracking, particularly for array signal processing applications, and for multiple targets.  The optimal method for multiple target tracking is the Bayes’ joint filter that operates by hypothesising all the targets collectively using a joint state. As a consequence, the computational complexity of the filter increases rapidly with the number of targets. The probability hypothesis density and the multi-Bernoulli filters that overcome this complexity do not possess a suitable framework to operate directly on phased sensor array data. Instead, such data is converted into beamformer images in which close targets may not be effectively resolved and much information is lost. This thesis develops a multiple signal classification (MUSIC) based multi-target particle filter that improves upon the filters mentioned above. A MUSIC based multi-Bernoulli particle filter is also developed, that operates more directly on array data.  The above mentioned particle filters require a resampling step which impedes information accumulation over successive observations, and affects the detection of very covert targets. This thesis develops soft resampling and soft systematic resampling to overcome this problem without affecting the accuracy of approximation. Additionally, modified Kolmogorov-Smirnov testing is proposed, to numerically evaluate the accuracy of the particle filter approximation.</p>


Author(s):  
Tao Yang ◽  
Prashant G. Mehta

This paper is concerned with the problem of tracking single or multiple targets with multiple nontarget-specific observations (measurements). For such filtering problems with data association uncertainty, a novel feedback control-based particle filter algorithm is introduced. The algorithm is referred to as the probabilistic data association-feedback particle filter (PDA-FPF). The proposed filter is shown to represent a generalization—to the nonlinear non-Gaussian case—of the classical Kalman filter-based probabilistic data association filter (PDAF). One remarkable conclusion is that the proposed PDA-FPF algorithm retains the error-based feedback structure of the classical PDAF algorithm, even in the nonlinear non-Gaussian case. The theoretical results are illustrated with the aid of numerical examples motivated by multiple target tracking (MTT) applications.


2020 ◽  
Author(s):  
Ronald Milton ◽  
Andrew Guetierrez ◽  
Bobby Bradbury ◽  
Sidney Cherry ◽  
Brian Cummings

In this paper, we propose an approximate Bayesian computation approach to perform a multiple target tracking within a binary sensor network. The nature of the binary sensors (\emph{getting closer - moving away} information) do not allow the use of the classical tools (e.g. Kalman Filter, Particle Filer), because the exact likelihood is intractable. To overcome this, we use the particular feature of the likelihood-free algorithms to produce an efficient multiple target tracking methodology.


Sign in / Sign up

Export Citation Format

Share Document