A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements

Mathematics and Computers in Simulation

Volumn 57, Issue 1-2, 2001, Pages 109-120

  Chen, Liang ^a   Tokuda, Naoyuki ^a  

^a UTSUNOMIYA UNIVERSITY   (Japan)

Author keywords

Bearings only measurement; Data association problem; Hungarian algorithm; Multitarget motion tracking

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; EMBEDDED SYSTEMS; MAXIMUM LIKELIHOOD ESTIMATION; RADAR CLUTTER; TRACKING (POSITION);

MULTITARGET MOTION TRACKING; ROTATIONAL SORTING ALGORITHMS;

RADAR TARGET RECOGNITION;

EID: 0034905123     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-4754(01)00293-2     Document Type: Article

References (20)

1. Multitarget motion analysis in a DSN
2. Tracking the direction of arrival of multiple moving targets
3. Multitarget motion analysis by cooperative multiagent system
4. A new relaxation algorithm and passive sensor data association
5. Strategies for selecting communication structures in cooperative search
6. Multiple target tracking using maximum likelihood principle
7. The Hungarian method for the assignment problem
8. Variants of the Hungarian method for the assignment problem
9. Algorithm 548: Solution of the assignment problem [H]
10. A unified framework for primal-dual methods in minimum cost network flow problems
11. The auction algorithm: A distributed relaxation method for the assignment problem
12. Signature methods for the assignment problem
13. Efficient dual simplex algorithm for the assignment problem
14. Comparison of 2-D assignment algorithms for rectangular, floating point cost matrices
15. Distributed processing for multitarget motion analysis
16. Multitarget motion analysis by distributed cooperation
17. Shared-memory parallelization of the data association problem in multitarget tracking