An improved assignment algorithm based rotational angular sorting methods

Authors:
Qiang Hua;Bin Wu;Liang Chen
Affiliations:
Faculty of Mathematics and Computer Science, Hebei University, Baoding, P. R. China;Faculty of Mathematics and Computer Science, Hebei University, Baoding, P. R. China;Math and Computer Science Program, University of Northern British Columbia, Prince George, Canada
Venue:
MATH'07 Proceedings of the 12th WSEAS International Conference on Applied Mathematics
Year:
2007

Citing 3
Cited 0

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

Mathematics and Computers in Simulation
n-Tokyoites' loop-line commuter problem

Discrete Mathematics
Multiple target tracking using maximum likelihood principle

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The data assignment problem occurs for multiple targets tracking application. It is crucial for the overall performance. In this paper, two observations of date assignment are considered, and then a new rotational sorting algorithm based on maximum likelihood principle was presented. The given algorithm of O(logN) and O(N2) complexity developed is faster than the more popularly used Hungarian type O(N3) algorithm.