By Topic

Quasi-convexity and optimal binary fusion for distributed detection with identical sensors in generalized Gaussian noise

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wei Shi ; Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA ; T. W. Sun ; R. D. Wesel

We present a technique to find the optimal threshold τ for the binary hypothesis detection problem with n identical and independent sensors. The sensors all use an identical and single threshold τ to make local decisions, and the fusion center makes a global decision based on the n local binary decisions. For generalized Gaussian noise and some non-Gaussian noise distributions, we show that for any admissible fusion rule, the probability of error is a quasi-convex function of threshold τ. Hence, the problem decomposes into a series of n quasi-convex optimization problems that may be solved using well-known techniques. Assuming equal a priori probability, we give a sufficient condition of the non-Gaussian noise distribution g(x) for the probability of error to be quasi-convex. Furthermore, this technique is extended to Bayes risk and Neyman-Pearson criteria. We also demonstrate that, in practice, it takes fewer than twice as many binary sensors to give the performance of infinite precision sensors in our scenario

Published in:

IEEE Transactions on Information Theory  (Volume:47 ,  Issue: 1 )