2001
DOI: 10.1109/7.913665
|View full text |Cite
|
Sign up to set email alerts
|

m-best S-D assignment algorithm with application to multitarget tracking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
60
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 136 publications
(60 citation statements)
references
References 31 publications
0
60
0
Order By: Relevance
“…The fused tracks produced at the global node constitute the output of the tracking system. The local trackers were implementations of N-scan sliding window multiple hypothesis tracking (MHT) with a hypothesis depth of N=1 previous scan [16]. Track fusion was implemented in the global node using the information fusion method [17].…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The fused tracks produced at the global node constitute the output of the tracking system. The local trackers were implementations of N-scan sliding window multiple hypothesis tracking (MHT) with a hypothesis depth of N=1 previous scan [16]. Track fusion was implemented in the global node using the information fusion method [17].…”
Section: Simulation Resultsmentioning
confidence: 99%
“…We do not consider the possibility of missed detections in this paper, and as a result there is not a need to add dummy measurements at each scan as in [8]. The candidate measurements are generated as follows: assuming the measurement was generated from a return r due to a ping p, we can obtain the range of the contact point of the ping (with either a target or clutter) as shown below:…”
Section: A Mpda Cost Generationmentioning
confidence: 99%
“…For the case of S is equal to 2, well-known 2-D assignment methods are the Jonker-Volgenant-Castanon (JVC) algorithm [44]. This method also provides a measure of accuracy for the solution found [45]. While finding the optimal assignment for S > 2 is an NPhard problem [46], a number of near-optimal modifications with polynomial complexity have been proposed [47].…”
Section: Bayesian Approachesmentioning
confidence: 99%