|
Volumn 31, Issue 1, 1995, Pages 486-489
|
On Finding Ranked Assignments with Application to Multitarget Tracking and Motion Correspondence
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
LINEARIZATION;
OPTIMIZATION;
POLYNOMIALS;
PROBABILITY;
PROBLEM SOLVING;
SIGNAL FILTERING AND PREDICTION;
TRACKING (POSITION);
ASSOCIATION COST MATRIX;
DATA ASSOCIATION;
JOINT PROBABILISTIC ASSOCIATION FILTER;
LINEAR ASSIGNMENT PROBLEM;
MOTION CORRESPONDENCE;
MULTIPLE HYPOTHESIS FILTER;
MULTITARGET TRACKING;
RANKED ASSIGNMENTS;
ALGORITHMS;
|
EID: 0029221641
PISSN: 00189251
EISSN: None
Source Type: Journal
DOI: 10.1109/7.366332 Document Type: Article |
Times cited : (120)
|
References (11)
|