Detection performance vs. complexity in parallel decentralized Bayesian decision fusion

Weiqiang Dong, Moshe Kam

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

We review several existing approaches for the design of parallel binary decentralized detection architectures. Such architectures employ a bank of n parallel binary local detectors (LDs) and a Data Fusion Center (DFC). The kth LD compresses its local observations yk with a local decision rule Γk() into a local decision, uk, and sends it to the DFC. The DFC collects all local decisions U, U = lu1, u2,..., unr, and fuses them into a global decision, u0, using a global fusion rule Γ0(). When the local observations at the local detectors are statistically independent conditioned on the hypothesis, both the local decision rule and the global fusion rule become likelihood ratio tests (LRTs). Some architectures allow for possible feedback from the decision of the DFC (back into itself or into the LDs). There are several alternatives for the design of such systems. We review several architectures without and with feedback, and discuss design alternatives. These include fixing the local decision rule (without feedback [1] or with feedback [2]); solving simultaneously for the local decision rule and the global fusion rule (without feedback [3] or with feedback [4]); solving exhaustively for the local decision rule and the global fusion rule when the number of alternatives is finite and small [5]; and solving for the local decision rule and the global fusion rule with feedback by using one of several greedy scheme (e.g., [6]). The discussion highlights the tradeoff between performance and design complexity of parallel decision fusion systems.

Original languageEnglish (US)
Title of host publication2017 51st Annual Conference on Information Sciences and Systems, CISS 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509047802
DOIs
StatePublished - May 10 2017
Event51st Annual Conference on Information Sciences and Systems, CISS 2017 - Baltimore, United States
Duration: Mar 22 2017Mar 24 2017

Publication series

Name2017 51st Annual Conference on Information Sciences and Systems, CISS 2017

Other

Other51st Annual Conference on Information Sciences and Systems, CISS 2017
CountryUnited States
CityBaltimore
Period3/22/173/24/17

All Science Journal Classification (ASJC) codes

  • Information Systems and Management
  • Information Systems
  • Signal Processing
  • Computer Networks and Communications

Keywords

  • Data Fusion
  • Decentralized Detection
  • Decision Fusion
  • Likelihood Ratio Test

Fingerprint Dive into the research topics of 'Detection performance vs. complexity in parallel decentralized Bayesian decision fusion'. Together they form a unique fingerprint.

  • Cite this

    Dong, W., & Kam, M. (2017). Detection performance vs. complexity in parallel decentralized Bayesian decision fusion. In 2017 51st Annual Conference on Information Sciences and Systems, CISS 2017 [7926143] (2017 51st Annual Conference on Information Sciences and Systems, CISS 2017). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CISS.2017.7926143