DocumentCode
1139435
Title
Decentralized sequential detection
Author
Hashemi, H.R. ; Rhodes, Ian B.
Author_Institution
Univ. of Miami Sch. of Med., Coral Gables, FL, USA
Volume
35
Issue
3
fYear
1989
fDate
5/1/1989 12:00:00 AM
Firstpage
509
Lastpage
520
Abstract
A class of decentralized sequential detection problems is investigated. Under appropriate independence assumptions, it is shown that at each time instant the optimal local strategies are given by threshold tests on the likelihood of ratios. Furthermore, local decisions depend not only on the present and past observations, but on the past local decision as well. That is, for each local processor a different threshold exists for every different sequence of past decisions. Examples, computational techniques, discussions of the difficulties at hand, and suggestions for further exploration of the problem are presented
Keywords
decision theory; information theory; signal detection; decentralized sequential detection; likelihood of ratios; local decisions; optimal local strategies; threshold tests; Bandwidth; Decision making; Detectors; Face detection; Helium; Object detection; Reliability; Statistics; Testing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.30973
Filename
30973
Link To Document