1999
DOI: 10.1002/(sici)1520-6424(199912)82:12<84::aid-ecja10>3.0.co;2-b
|View full text |Cite
|
Sign up to set email alerts
|

A track-oriented multiple hypothesis multitarget tracking algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…To account for this data association problem, two different approaches are proposed. The first one is based on a Track-Oriented Multi-Hypothesis Tracking (TOMHT) method [20], [21] combined with an Extended Kalman Filter (EKF), which relies on the assumption that the motion model of the target is known. In the second approach instead, an agnostic approach for robust tracking based on Expectation Maximisation (EM) is adopted both to estimate the model parameters and to track the target [22], [23].…”
Section: Motion Tracking Solutionsmentioning
confidence: 99%
“…To account for this data association problem, two different approaches are proposed. The first one is based on a Track-Oriented Multi-Hypothesis Tracking (TOMHT) method [20], [21] combined with an Extended Kalman Filter (EKF), which relies on the assumption that the motion model of the target is known. In the second approach instead, an agnostic approach for robust tracking based on Expectation Maximisation (EM) is adopted both to estimate the model parameters and to track the target [22], [23].…”
Section: Motion Tracking Solutionsmentioning
confidence: 99%
“…The MHT algorithm assumes that each new measurement may originate from an existing target, a new target or a clutter, then establish multiple hypotheses in one time, and finally achieve multi-target tracking by hypothesis evaluation, deletion and merging. However, the calculation amount of the algorithm increases exponentially with the increase of the number of targets and clutters [8]. In order to reduce the computation of JPDA, some improved JPDA algorithms have been proposed.…”
Section: Introductionmentioning
confidence: 99%
“…However, the HOMHT proposed by Reid [8] forms and expands a large number of hypotheses from scan to scan for data association. In contrary to the HOMHT, the TOMHT maintains track trees for incompatible tracks on last scans and prunes all the unreliable tree branches (track hypotheses) to obtain the best global hypothesis [9]. Recent research on MHT algorithms has mainly focused on improving the association algorithm in MHT [10,11,12,13,14].…”
Section: Introductionmentioning
confidence: 99%