2016
DOI: 10.1109/taes.2016.150343
|View full text |Cite
|
Sign up to set email alerts
|

Track-before-detect labeled multi-bernoulli particle filter with label switching

Abstract: Abstract-This paper presents a multitarget tracking particle filter (PF) for general track-before-detect measurement models. The PF is presented in the random finite set framework and uses a labelled multi-Bernoulli approximation. We also present a label switching improvement algorithm based on Markov chain Monte Carlo that is expected to increase filter performance if targets get in close proximity for a sufficiently long time. The PF is tested in two challenging numerical examples.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
18
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 36 publications
(19 citation statements)
references
References 36 publications
(89 reference statements)
1
18
0
Order By: Relevance
“…The marginal density of π k|k−1 (·) is denoted as b τ (·). In the following, we show that it is equal to π k|k−1 τ (·), see (38). Using Theorem 11, b τ (y) = δ τ k (X) (y) π k|k−1 (X) δX…”
Section: B Updatementioning
confidence: 89%
See 1 more Smart Citation
“…The marginal density of π k|k−1 (·) is denoted as b τ (·). In the following, we show that it is equal to π k|k−1 τ (·), see (38). Using Theorem 11, b τ (y) = δ τ k (X) (y) π k|k−1 (X) δX…”
Section: B Updatementioning
confidence: 89%
“…Classical MHT algorithms [5], [6], [10] were developed for the standard measurement model but not for general trackbefore-detect models [38]. They rely on enumerating multiple target/measurement association hypotheses, calculating their probabilities and the density of the current target state given a hypothesis.…”
Section: B Relation With Mht Algorithmsmentioning
confidence: 99%
“…Since the traditional algorithms require complex data association and high computational complexity, the tracking algorithms based on the random finite set (RFS) have attracted extensive attention recently. Many RFS tracking algorithms have been proposed, such as the Bernoulli filter [5], the probability hypothesis density (PHD) filter [6,7], the cardinality balanced multitarget multi-Bernoulli (CBMeMBer) filter [8,9], and the labeled multi-Bernoulli (LMB) filter [10][11][12][13].…”
Section: Introductionmentioning
confidence: 99%
“…Since the random finite set (RFS) algorithms can avoid the data association, which have attracted extensive attention recently. Many target tracking algorithms based on RFS have been proposed, such as the Bernoulli filter [5], the probability hypothesis density (PHD) filter [6][7][8], the cardinality balanced multitarget multi-Bernoulli (CBMeMBer) filter [9,10], and the labeled multi-Bernoulli (LMB) filter [11][12][13][14].…”
Section: Introductionmentioning
confidence: 99%