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

Penalized Gaussian mixture probability hypothesis density filter for multiple target tracking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
25
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(25 citation statements)
references
References 17 publications
0
25
0
Order By: Relevance
“…Before penalization, the weight matrix should be analysed first to determine the ambiguous weights. In the CGM-PHD tracker [ 20 ], PGM-PHD tracker [ 21 ] and CPGM-PHD tracker [ 22 ], the weight of target i is determined as an ambiguous weight once the total weight of the i -th row is greater than one. However, this method is not applicable to Case 2 (as stated in Section 2.3 ) since the total weight may be less than one when targets approach each other.…”
Section: Improved Gm-phd Tracker With Weight Penalizationmentioning
confidence: 99%
See 1 more Smart Citation
“…Before penalization, the weight matrix should be analysed first to determine the ambiguous weights. In the CGM-PHD tracker [ 20 ], PGM-PHD tracker [ 21 ] and CPGM-PHD tracker [ 22 ], the weight of target i is determined as an ambiguous weight once the total weight of the i -th row is greater than one. However, this method is not applicable to Case 2 (as stated in Section 2.3 ) since the total weight may be less than one when targets approach each other.…”
Section: Improved Gm-phd Tracker With Weight Penalizationmentioning
confidence: 99%
“…In other words, the efficiency of the GM-PHD tracker may degrade when targets come near each other. To remedy this, Yazdian-Dehkordi et al proposed a competitive GM-PHD (CGM-PHD) tracker [ 20 ] and a penalized GM-PHD (PGM-PHD) tracker [ 21 ] to refine the weights of the close moving targets in the update step in the GM-PHD filter. However, they did not provide continuous trajectories for the targets.…”
Section: Introductionmentioning
confidence: 99%
“…Unfortunately, the labeled RFSs filters required super-exponential growth of the number of components to adequately represent the multi-target states, and more complexity than the PHD filter. In [13,14], a PGM-PHD filter is proposed to solve the problem of tracking closely spaced targets, where a penalized weight competition method is adopted under the framework of the GM-PHD filter. The penalized method is used to refine the weights of closely spaced targets in the update step of the GM-PHD filter, and the PGM-PHD filter gets over the defect of the GM-PHD filter.…”
Section: Introductionmentioning
confidence: 99%
“…Three criteria are adopted, which are the estimated target number, the mean number of targets estimation error (NTE) [14], and the optimal sub-pattern assignment (OSPA) [15]. The OSPA distance and NTE can be described as…”
mentioning
confidence: 99%
“…The PHD and CPHD filters were proposed as Poisson RFS density approximations of the multi-target posterior, which can be used to estimate the target states by recursively computing the first-order moment of the multi-target posterior probability distribution. The existing closed-form solutions of PHD mainly include particle filter PHD (PF-PHD) [4,5] and the Gaussian mixture PHD (GM-PHD) filter [6], which have opened the door to numerous novel extensions and applications as shown in [7][8][9][10][11][12][13]. Moreover, being different from the PHD and CPHD filters, the multi-target multi-Bernoulli (MeMBer) [1] recursion was recently proposed by Mahler as a tractable approximation to the Bayesian multi-target recursion under low clutter density scenarios, which can achieve multitarget tracking by directly propagating the approximate posterior density of the targets.…”
Section: Introductionmentioning
confidence: 99%