Proceeding of 1st Australian Data Fusion Symposium
DOI: 10.1109/adfs.1996.581104
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic multi-hypothesis tracking in a multi-sensor, multi-target environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(7 citation statements)
references
References 2 publications
0
6
0
Order By: Relevance
“…In the case of multiple targets, additional data association is required to map multiple tracks to respective targets. Various solutions exist to solve this problem like Joint Probabilistic Data Association [22], Probability Hypothesis Density (PHD) filter [23] and Multi Hypothesis Tracking [24]. Within the frameworks presented by these techniques, the computational complexity increases exponentially as the number of targets.…”
Section: Factor Graphs a Overview Of Factor Graphsmentioning
confidence: 99%
“…In the case of multiple targets, additional data association is required to map multiple tracks to respective targets. Various solutions exist to solve this problem like Joint Probabilistic Data Association [22], Probability Hypothesis Density (PHD) filter [23] and Multi Hypothesis Tracking [24]. Within the frameworks presented by these techniques, the computational complexity increases exponentially as the number of targets.…”
Section: Factor Graphs a Overview Of Factor Graphsmentioning
confidence: 99%
“…Various solutions exist for the same like Joint Probabilistic Data Association (JPDA) [10] by Fortmann et al, Probability Hypothesis Density (PHD) filter [11] by Mahler and Multi Hypothesis Tracking [12] by Reid. And there exist various improvements of these solutions like [13], [14] and [15]. But using these additional data association algorithms not only increases the complexity of the task but at times also can increase the execution time.…”
Section: A Overviewmentioning
confidence: 99%
“…After obtaining probability expression for an individual histogram point measurement (shots) falls in a cell, derivation of H-PMHT algorithm is started. H-PMHT stems from PMHT [15], [16], and all derivations of PMHT are based on Expectation Maximization (EM) method. Thus H-PMHT algorithm can be outlined according to expectation (E) and maximization (M) steps.…”
Section: Basic Structure Of H-pmhtmentioning
confidence: 99%