Multisensor Multitarget Mixture Reduction Algorithms for Tracking
نویسنده
چکیده
A single-sensor single-target Mixture Reduction (MR) data association algorithm is extended for use in multisensor multitarget tracking situations. MR is extended for tracking an arbitrary number of targets using an arbitrary number of sensors under the assumption that the sensor measurement errors are independent across sensors. Like the single-sensor single-target MR algorithm, which gives better performance than the Probabilistic Data Association (PDA) lter, the multisensor multitarget MR extensions give similar improvements in performance compared to the Joint Prob-abilistic Data Association (JPDA) and Multisensor JPDA (MSJPDA) algorithms. Further, in the formulations for the multisensor and multitarget MR algorithms, the equations for the calculation of the data association probabilities have been put in the same form as for the JPDA, thus allowing previously developed fast JPDA computational techniques to be applicable.
منابع مشابه
Performance Prediction of Multisensor Tracking Systems for Single Maneuvering Targets
Studying the performance of multisensor tracking systems against maneuvering targets involves Monte Carlo simulations with the tracking algorithms implemented in a sophisticated computer simulation of the multisensor system [2], [1]. However, a simplified method for predicting the performance of a multisensor tracking system against maneuvering targets is needed to confirm the results of comput...
متن کامل"Statistics 102" for Multisource-Multitarget Detection and Tracking
This tutorial paper summarizes the motivations, concepts and techniques of finite-set statistics (FISST), a systemlevel, “top-down,” direct generalization of ordinary single-sensor, single-target engineering statistics to the realm of multisensor, multitarget detection and tracking. Finite-set statistics provides powerful new conceptual and computational methods for dealing with multisensor-mul...
متن کاملAn Efficient Computational Approach for Multitarget Tracking from Bearings-only Measurements by Decentralized Cooperative Processing
This paper firstly has proved that the well known Hungarian type assignment algorithms [14, 4] embedded in the relaxation-based maximum-likelihood (ML) solution for a bearings-only passive multitarget-multisensor tracking problem can be replaced by a much simpler sorting algorithm of O(N logN) complexity, provided that the sensor system is ideal such that the system has no cluttering points nor...
متن کاملApplication of the EM algorithm for the multitarget/multisensor tracking problem
An important problem in surveillance and reconnaissance systems is the tracking of multiple moving targets in cluttered noise environments using outputs from a number of sensors possessing wide variations in individual characteristics and accuracies. A number of approaches have been proposed for this multitarget/multisensor tracking problem ranging from reasonably simple, though ad-hoc, schemes...
متن کاملPassive Multisensor Multitarget Feature-aided Unconstrained Tracking : A Geometric Perspective
Novel, targets-to-sensors’ geometry-based performance measure, bootstrap estimation algorithm and feature-aided association are described for the passive multisensor multitarget data association, position and velocity measurement estimation and coupled unconstrained association/tracking problem. The approach reduces computational complexity and ghost targets, and provides dynamically changing g...
متن کامل