Home
Scholarly Works
OPTIMAL DISTRIBUTED DETECTION OF MULTIPLE...
Conference

OPTIMAL DISTRIBUTED DETECTION OF MULTIPLE HYPOTHESES USING BLIND ALGORITHM

Abstract

In a parallel distributed detection in order to design the optimal fusion rule, the fusion center needs to have perfect knowledge of the performance of the local detectors as well as the prior probabilities of the hypotheses. Such knowledge is not available in most practical cases. In this paper, we propose a blind technique for the $M$-ary distributed detection problem. We derive the probability mass function of the local decisions and use this result to develop maximum likelihood estimates of unknown parameters. We also derive analytically the overall detection performance for both binary and $M$-ary distributed detection and discuss the difference of the overall detection performance obtained using the estimated values of unknown parameters and their true values. Finally, we demonstrate the applicability of our results through numerical examples.

Authors

Jeremic A; Wong KM; Liu B

Pagination

pp. 2241-2244

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Publication Date

April 1, 2009

DOI

10.1109/icassp.2009.4960065

Name of conference

2009 IEEE International Conference on Acoustics, Speech and Signal Processing
View published work (Non-McMaster Users)

Contact the Experts team