12 March 1999 Convex optimization approach to the fusion of identity information
Author Affiliations +
Abstract
We consider the problem of identity fusion for a multi- sensor target tracking system whereby sensors generate reports on the target identities. Since the sensor reports are typically fuzzy, 'incomplete' and inconsistent, the fusion approach based on the minimization of inconsistencies between the sensor reports by using a convex Quadratic Programming (QP) and linear programming (LP) formulation. In contrast to the Dempster-Shafer's evidential reasoning approach which suffers from exponentially growing completely, our approach is highly efficient. Moreover, our approach is capable of fusing 'ratio type' sensor reports, thus it is more general than the evidential reasoning theory. When the sensor reports are consistent, the solution generated by the new fusion method can be shown to converge to the true probability distribution. Simulation work shows that our method generates reasonable fusion results, and when only 'Subset type' sensor reports are presented, it produces fusion results similar to that obtained via the evidential reasoning theory.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lingjie Li, Lingjie Li, Zhi-Quan Luo, Zhi-Quan Luo, Kon Max Wong, Kon Max Wong, Eloi Bosse, Eloi Bosse, } "Convex optimization approach to the fusion of identity information", Proc. SPIE 3719, Sensor Fusion: Architectures, Algorithms, and Applications III, (12 March 1999); doi: 10.1117/12.341362; https://doi.org/10.1117/12.341362
PROCEEDINGS
9 PAGES


SHARE
Back to Top