2020
DOI: 10.1016/j.sigpro.2019.107367
|View full text |Cite
|
Sign up to set email alerts
|

Sequential Monte Carlo Cardinalized probability hypothesized density filter based on Track-Before-Detect for fluctuating targets in heavy-tailed clutter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…The multi-target Bayes filter is typically complicated due to the considerable dimensionality of the multi-target state and observation space. 12 Traditional MTT algorithms, such as joint probabilistic data association (JPDA) filtering 13 and MHT, 14 assign measurements to targets via data association processing, and then perform multiple independent single-target Bayesian filtering in parallel. The problem of coupled explosion frequently happens when there is much clutter.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The multi-target Bayes filter is typically complicated due to the considerable dimensionality of the multi-target state and observation space. 12 Traditional MTT algorithms, such as joint probabilistic data association (JPDA) filtering 13 and MHT, 14 assign measurements to targets via data association processing, and then perform multiple independent single-target Bayesian filtering in parallel. The problem of coupled explosion frequently happens when there is much clutter.…”
Section: Introductionmentioning
confidence: 99%
“…Most target motion and measurement models are nonlinear, such as missile re-entry velocity and target detection by passive radar and infrared sensors. In Cao et al, 12 a Gaussian mixture particle probability hypothesis density (GMP-PHD) algorithm is given to address the nonlinear problem. GMP-PHD utilizes a combination of particle filters, but it also introduces additional issues, such as the conflict between filter estimation accuracy and real-time tracking.…”
Section: Introductionmentioning
confidence: 99%
“…As such, rather than declaring the presence of targets relying on the measurements collected in a single scan, measurements received in multiple scans are jointly processed, keeping record of a number of candidate trajectories, and confirming only a subset of them (hence detecting the associated targets). Several TBD approaches are available in the literature (e.g., [12]- [41]), each tailored to specific tracking problems. For example, in the TBD framework, the issue of extended target has been addressed through point voting in Hough transform [20], [30] or particle filter based probability density estimation of extended target state [24].…”
Section: Introductionmentioning
confidence: 99%
“…Dynamic programming based TBD [25]- [27], [38]: DP-TBD is a grid-based method that estimates target trajectories by searching all physically admissible paths in a discrete state space. Some grid-based TBD techniques [39]- [41] perform target detection via sliding time window and multi-frame tests.…”
Section: Introductionmentioning
confidence: 99%
“…In the PHD and CPHD filter, the clutter process is modeled as Poisson and IIDC RFS, respectively. But these two models are unable to describe some complicated clutter process [21,22]. Particularly when the target is submerged in the clutter background, the distribution of clutter process is more complicated [23].…”
mentioning
confidence: 99%