Distributed decision fusion using the Neyman-Pearson criterion

Sayandeep Acharya, Ji Wang, Moshe Kam

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

6 Scopus citations

Abstract

Performance of a parallel binary decision fusion architecture is considered where both the local detectors and the Decision Fusion Center use the Neyman-Pearson criterion. The architecture comprises N local detectors in parallel, each sending a binary decision to a fusion center for integration. The algorithm designed here fixes the global false alarm rate and attempts to compute the local detector thresholds and the global fusion rule that achieve the maximum global detection probability. The key computational requirement is to find the roots of a certain Nth order polynomial. We compare the performance of our method with the performance of the Person-by-Person Optimization (PBPO) approach and that of a centralized detection scheme.

Original languageEnglish (US)
Title of host publicationFUSION 2014 - 17th International Conference on Information Fusion
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9788490123553
StatePublished - Oct 3 2014
Externally publishedYes
Event17th International Conference on Information Fusion, FUSION 2014 - Salamanca, Spain
Duration: Jul 7 2014Jul 10 2014

Publication series

NameFUSION 2014 - 17th International Conference on Information Fusion

Other

Other17th International Conference on Information Fusion, FUSION 2014
Country/TerritorySpain
CitySalamanca
Period7/7/147/10/14

All Science Journal Classification (ASJC) codes

  • Information Systems

Keywords

  • Decentralized Decision Fusion
  • Neyman-Pearson criterion
  • Optimal Detection
  • Person-by-Person Optimization

Fingerprint

Dive into the research topics of 'Distributed decision fusion using the Neyman-Pearson criterion'. Together they form a unique fingerprint.

Cite this