返回
Adaptive Bayesian group testing: Algorithms and performance
DOI:10.1016/j.sigpro.2018.11.006.png)
摘要
En 中文
Group testing is applied to recover a small defective subset of items by a number of tests much smaller than the total population. In this paper, we study group testing from the Bayesian perspective. The state of all the items is manipulated as a random variable, the probability function of which is updated iteratively. We also propose an algorithm which designs the measurement vectors adaptively to decrease the number of tests, compared to non-adaptive methods. The measurement vector is chosen by maximizing the expectation of update gain in each test. We also propose a fast approximation method, which updates the probability function of each item independently to decrease the computational cost when designing the measurement vector within each test. Furthermore, the expected value of the required numbers of tests for the proposed methods are deduced theoretically. The deduced results are appropriate for both the noise-free case and the case with noise, even in the situation where both the additive noise and dilution noise exist. We also carry out simulations to compare the proposed algorithms and existing algorithms in the literature, the results of which reveal that the proposed algorithms require fewer tests and are robust in the presence of noise. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Adaptive methods
Bayes methods
Compressive sensing
Group testing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
Terrestrial‐aquatic linkage in stream food webs along a forest chronosequence: multi‐isotopic evidence
Ecology
IF0
Normative pediatric visual acuity using single surrounded HOTV optotypes on the Electronic Visual Acuity Tester following the Amblyopia Treatment Study protocol根据弱视治疗研究方案,在电子视力测试仪上使用单个包围的HOTV视标的儿童视力

