solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看3906次
Distributed Hypothesis Testing with Collaborative Detection. (arXiv:1810.03427v1 [cs.IT])
来源于:arXiv
A detection system with a single sensor and two detectors is considered,
where each of the terminals observes a memoryless source sequence, the sensor
sends a message to both detectors and the first detector sends a message to the
second detector. Communication of these messages is assumed to be error-free
but rate-limited. The joint probability mass function (pmf) of the source
sequences observed at the three terminals depends on an $\mathsf{M}$-ary
hypothesis $(\mathsf{M} \geq 2)$, and the goal of the communication is that
each detector can guess the underlying hypothesis. Detector $k$, $k=1,2$, aims
to maximize the error exponent \textit{under hypothesis} $i_k$, $i_k \in
\{1,\ldots,\mathsf{M}\}$, while ensuring a small probability of error under all
other hypotheses. We study this problem in the case in which the detectors aim
to maximize their error exponents under the \textit{same} hypothesis (i.e.,
$i_1=i_2$) and in the case in which they aim to maximize their error exponents
und 查看全文>>