2013
DOI: 10.1109/tsp.2012.2230168
|View full text |Cite
|
Sign up to set email alerts
|

Offline Performance Prediction of PDAF With Bayesian Detection for Tracking in Clutter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…Using the parametric PDA [4], the association probability is as follows: βi(k)={ei/(b+truej=1mkej)i=1,mkb/(b+truej=1mkej)i=0 where eiexp(12boldnormalviT(k)S1(k)vi(k)); bλ|2πboldnormalS(k)|12(1PdPg/Pd), Pd is the probability of detection, and Pg is the probability that the target measurement falls into the validation region.…”
Section: A Novel Probabilistic Data Associationmentioning
confidence: 99%
See 1 more Smart Citation
“…Using the parametric PDA [4], the association probability is as follows: βi(k)={ei/(b+truej=1mkej)i=1,mkb/(b+truej=1mkej)i=0 where eiexp(12boldnormalviT(k)S1(k)vi(k)); bλ|2πboldnormalS(k)|12(1PdPg/Pd), Pd is the probability of detection, and Pg is the probability that the target measurement falls into the validation region.…”
Section: A Novel Probabilistic Data Associationmentioning
confidence: 99%
“…Due to the sea clutter, filter algorithms, such as a Kalman filter, and a series of improved filter algorithms like EKF (extended Kalman filtering) and UKF (unscented Kalman filter), are used in target tracking systems [2], and the data association is also adopted which can confirm the probability of measurement coming from the target. Previous studies have shown that the nearest-neighbor (NN) [3] algorithm works reasonably well with targets in sparse scenarios, and the probabilistic data association (PDA) [4] is suitable to track a single target in a cluttered environment, which, considering all of the measurements, falls into the validation gate. For the case of more than one target in the cluttered environment, an extension of probabilistic data association (PDA) was derived, called joint probabilistic data association (JPDA) [5], where the association probabilities are computed from the joint likelihood functions corresponding to the joint hypotheses associating all of the returns to different permutations of the targets and clutter points.…”
Section: Introductionmentioning
confidence: 99%
“…To mitigate these problems, we proposed an HYCA method for the PDAF-BD algorithm [79]. For a Direct data-association…”
Section: Integrated Detection and Tracking Algorithmmentioning
confidence: 99%
“…In other words, the integration of detection with the target tracking method supplies the detector with feedback information from the tracker, and the feedback has the form of a posterior distribution on the target location. This couple relationship between the detector and the tracker was revealed in [7,8,9,10] by analyzing the Riccati equation iterative operation and track results, which demonstrated that the prior information from the tracker can be used to determine the optimal detection threshold. One advantage of integrating detection with tracking is that the Bayesian detector can use the feedback from the tracker as a priori information for its hypothesis test.…”
Section: Introductionmentioning
confidence: 99%