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 language | English (US) |
---|---|
Title of host publication | FUSION 2014 - 17th International Conference on Information Fusion |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
ISBN (Electronic) | 9788490123553 |
State | Published - Jan 1 2014 |
Externally published | Yes |
Event | 17th International Conference on Information Fusion, FUSION 2014 - Salamanca, Spain Duration: Jul 7 2014 → Jul 10 2014 |
Other
Other | 17th International Conference on Information Fusion, FUSION 2014 |
---|---|
Country | Spain |
City | Salamanca |
Period | 7/7/14 → 7/10/14 |
All Science Journal Classification (ASJC) codes
- Information Systems