Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Digitized Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/24321
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorWong, Kon-
dc.contributor.advisorJeremic, Aleksandar-
dc.contributor.authorLiu, Bin-
dc.date.accessioned2019-05-01T20:17:41Z-
dc.date.available2019-05-01T20:17:41Z-
dc.date.issued2007-10-
dc.identifier.urihttp://hdl.handle.net/11375/24321-
dc.description.abstractIn a parallel distributed detection system each local detector makes a decision based on its own observations and transmits its local decision to a fusion center, where a global decision is made. Given fixed local decision rules, 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 thesis, we propose a blind technique for the general distributed detection problem with multiple hypotheses. We start by formulating the optimal M-ary fusion rule in the sense of minimizing the overall error probability when the local decision rules are fixed. The optimality can only be achieved if the prior probabilities of hypotheses and parameters describing the local detector performance are known. Next, we propose a blind technique to estimate the parameters aforementioned as in most cases they are unknown. The occurrence numbers of possible decision combinations at all local detectors are multinomially distributed with occurrence probabilities being nonlinear functions of the prior probabilities of hypotheses and the parameters describing the performance of local detectors. We derive nonlinear Least Squares (LS) and Maximum Likelihood (ML) estimates of unknown parameters respectively. The ML estimator accounts for the known parametric form of the likelihood function of the local decision combinations, hence has a better estimation accuracy. Finally, we present the closed-form expression of the overall detection performance for both binary and M-ary distributed detection and show that the overall detection performance using estimated values of unknown parameters approaches quickly to that using their true values. We also investigate various impacts to the overall detection. The simulation results show that the blind algorithm proposed in this thesis provides an efficient way to solve distributed detection problems.en_US
dc.language.isoenen_US
dc.subjectdetectionen_US
dc.subjectmultiple hypothesesen_US
dc.subjectblind algorithmsen_US
dc.titleOptimal Distributed Detection of Multiple Hypotheses Using Blind Algorithmsen_US
dc.typeThesisen_US
dc.contributor.departmentElectrical and Computer Engineeringen_US
dc.description.degreetypeThesisen_US
dc.description.degreeMaster of Applied Science (MASc)en_US
Appears in Collections:Digitized Open Access Dissertations and Theses

Files in This Item:
File Description SizeFormat 
liu_bin_2007Oct_masters.pdf
Open Access
4.83 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue