Study on the Hungarian algorithm for the maximum likelihood data association problem (Q3395375)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Study on the Hungarian algorithm for the maximum likelihood data association problem |
scientific article; zbMATH DE number 5600787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Study on the Hungarian algorithm for the maximum likelihood data association problem |
scientific article; zbMATH DE number 5600787 |
Statements
Study on the Hungarian algorithm for the maximum likelihood data association problem (English)
0 references
1 September 2009
0 references
Hungarian forest (HF) algorithm
0 references
tracking
0 references
data association
0 references
linear programming
0 references
missed detection
0 references
0.7913220524787903
0 references
0.7654799818992615
0 references
0.7609589695930481
0 references
0.7371751070022583
0 references
