On Generalized Optimal Hard Decision Fusion

2017/06/21 by Mohammad, Fayazur Rahaman, Mohammed, Zafar Ali Khan
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1707.08206

Abstract

In this letter, we formulate a generalized decision fusion problem (GDFP) for sensing with centralized hard decision fusion. We show that various new and existing decision fusion rules are special cases of the proposed GDFP. We then relate our problem to the classical 0-1 Knapsack problem (KP). Consequently, we apply dynamic programming to solve the exponentially complex GDFP in polynomial time. Numerical results are presented to verify the effectiveness of the proposed solution.

Related

• D-optimal Data Fusion: Exact and Approximation Algorithms
• Distributed Detection Fusion via Monte Carlo Importance Sampling
• On Generalized Bayesian Data Fusion with Complex Models in Large Scale Networks
• A Message Passing Approach for Decision Fusion in Adversarial Multi-Sensor Networks
• Decentralized Detection with Many Sensors: Optimality of Exchangeable and Identical Encoding Policies