DocumentCode
567529
Title
Calculating some exact MMOSPA estimates for particle distributions
Author
Baum, Marcus ; Willett, P. ; Hanebeck, Uwe D.
Author_Institution
Intell. Sensor-Actuator-Syst. Lab. (ISAS), Karlsruhe Inst. of Technol. (KIT), Karlsruhe, Germany
fYear
2012
fDate
9-12 July 2012
Firstpage
847
Lastpage
853
Abstract
In this work, we present some exact algorithms for calculating the minimum mean optimal sub-pattern assignment (MMOSPA) estimate for probability densities that are represented with particles. First, a polynomial-time algorithm for two targets is derived by reducing the problem to the enumeration of the cells of a hyperplane arrangement. Second, we present a linear-time algorithm for an arbitrary number of scalar target states, which is based on the insight that the MMOSPA estimate coincides with the mean of the order statistics.
Keywords
least mean squares methods; polynomials; probability; target tracking; MMOSPA estimates; arbitrary number; hyperplane arrangement; linear-time algorithm; minimum mean optimal sub-pattern assignment estimate; particle distributions; polynomial-time algorithm; probability densities; scalar target states; Approximation methods; Complexity theory; Estimation; Optimized production technology; Target tracking; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Fusion (FUSION), 2012 15th International Conference on
Conference_Location
Singapore
Print_ISBN
978-1-4673-0417-7
Electronic_ISBN
978-0-9824438-4-2
Type
conf
Filename
6289890
Link To Document