2017
DOI: 10.1109/taes.2017.2704698
|View full text |Cite
|
Sign up to set email alerts
|

A Bootstrapped PMHT with Feature Measurements

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…How to assist the association by exploiting the target-feature information is essential for improving the target tracking performance [85,86]. Previous studies have incorporated the feature information into PMHT [87][88][89][90][91][92][93][94][95][96][97]. In some of these studies [92][93][94], the target is spatially expanded by the ellipsoid model and the tracking is assisted by the structural information of the target.…”
Section: Multiple Target Tracking With Switching Of Attribute Statesmentioning
confidence: 99%
“…How to assist the association by exploiting the target-feature information is essential for improving the target tracking performance [85,86]. Previous studies have incorporated the feature information into PMHT [87][88][89][90][91][92][93][94][95][96][97]. In some of these studies [92][93][94], the target is spatially expanded by the ellipsoid model and the tracking is assisted by the structural information of the target.…”
Section: Multiple Target Tracking With Switching Of Attribute Statesmentioning
confidence: 99%
“…The PMHT algorithm is based on the expectation maximization (EM) algorithm which is suitable for multitarget tracking in dense clutter environment [25]. For the bearings-only multitarget tracking problem, define the following:…”
Section: A Basic Pmht Algorithmmentioning
confidence: 99%
“…The JPDA makes multiple hypotheses into a single hypothesis and performs the Kalman update with composite measurements. The PMHT is based on the expectation maximization (EM), which optimizes the multipletarget states' maximum a posteriori (MAP) estimation [34][35][36]. Different from the data association algorithms, the PHD, CPHD, and MBF are based on the random finite set theory, which makes all the measurements a measurement set and all the targets a target set.…”
Section: Introductionmentioning
confidence: 99%