Matrix permanent inequalities for approximating joint assignment matrices in tracking systems (Q1771051)
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: Matrix permanent inequalities for approximating joint assignment matrices in tracking systems |
scientific article; zbMATH DE number 2153813
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Matrix permanent inequalities for approximating joint assignment matrices in tracking systems |
scientific article; zbMATH DE number 2153813 |
Statements
Matrix permanent inequalities for approximating joint assignment matrices in tracking systems (English)
0 references
7 April 2005
0 references
The paper describes the optimal solution for a large class of data association problems involving the calculation of permanents of submatrices of the original association matrix. A number of algorithms have been developed for the calculation of the Joint Assignment Matrix (JAM), which can be used to optimally rank associations for hypothesis selection. The approximations given by these algorithms are suitable for hypothesis generation in large-scale tracking and correlation applications.
0 references
assignment problem
0 references
target tracking
0 references
data association
0 references
multiple-hypothesis tracking
0 references
calculation of permanents
0 references
association matrix
0 references
Joint Assignment Matrix
0 references
correlation applications
0 references
0 references
