IET Seminar on Target Tracking and Data Fusion: Algorithms and Applications 2008
DOI: 10.1049/ic:20080053
|View full text |Cite
|
Sign up to set email alerts
|

Gaussian mixture implementations of probability hypothesis density filters for non-linear dynamical models

Abstract: The Probability Hypothesis Density (PHD) filter is a multipletarget filter for recursively estimating the number of targets and their state vectors from sets of observations. The filter is able to operate in environments with false alarms and missed detections. Two distinct algorithmic implementations of this technique have been developed. The first of which, called the Particle PHD filter, requires clustering techniques to provide target state estimates which can lead to inaccurate estimates and is computatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 20 publications
0
5
0
Order By: Relevance
“…In addition, to accommodate nonlinear dynamics and measurement models, several different nonlinear extensions of the GM-PHD are also proposed in the literature [40], [41]. These nonlinear extensions of the GM-PHD filter have successfully been used in many different applications, in which nonlinear target dynamics and measurement models are employed [42]- [48].…”
Section: The Gaussian Mixture Phd (Gm-phd) Filtermentioning
confidence: 99%
“…In addition, to accommodate nonlinear dynamics and measurement models, several different nonlinear extensions of the GM-PHD are also proposed in the literature [40], [41]. These nonlinear extensions of the GM-PHD filter have successfully been used in many different applications, in which nonlinear target dynamics and measurement models are employed [42]- [48].…”
Section: The Gaussian Mixture Phd (Gm-phd) Filtermentioning
confidence: 99%
“…The algorithm has high complexity order due to performing complete data association. Remedies to reduce the number of hypotheses and computational costs have been presented in [Zhao et al, 2005] and [Clark et al, 2008]. JPDAF uses joint probability of measurement-to-object associations in order to find corresponding pairs.…”
Section: Related Workmentioning
confidence: 99%
“…However, these multi-target trackers are not analytical. In [22] and [23], Vo et al propose the particle and Gaussian mixture implementation of these algorithms [24][25][26]. A large number of particles or Gaussian elements are used to approximate the multi-target state distribution.…”
Section: Multi-target Tracking Based On Unlabeled Rfsmentioning
confidence: 99%