Analysis of Theoretical Bounds in Noisy Threshold Group Testing

被引:0
|
作者
Seong J.-T. [1 ]
机构
[1] Department of Convergence Software, Mokpo National University, Muan
来源
Journal of Computing Science and Engineering | 2022年 / 16卷 / 03期
关键词
Defective sample; Fano’s inequality; Lower bound; Noisy threshold group testing;
D O I
10.5626/JCSE.2022.16.3.121
中图分类号
学科分类号
摘要
The objective of this study was to describe a noisy threshold group testing model where positive and negative cases could occur depending on virus concentration in coronavirus disease 2019 (COVID-19) diagnosis with output results flipped due to measurement noise. We investigated lower bounds for successful reconstruction of a small set of defective samples in the noisy threshold group testing framework. To this end, using Fano’s inequality, we derived the minimum number of tests required to find unknown signals with defective samples. Our results showed that the minimum number of tests on probability of error for reconstruction of unknown signals was a function of the defective rate and noise probability. We obtained lower bounds for on performance of the noisy threshold group testing framework with respect to noise intervals. In addition, the relationship between defective rate of signals and sparsity of group matrices to design optimal noisy threshold group testing systems is presented. © 2022. The Korean Institute of Information Scientists and Engineers
引用
收藏
页码:121 / 128
页数:7
相关论文
共 50 条
  • [1] Theoretical Bounds on the Number of Tests in Noisy Threshold Group Testing Frameworks
    Seong, Jin-Taek
    MATHEMATICS, 2022, 10 (14)
  • [2] Theoretical Bounds on Performance in Threshold Group Testing Schemes
    Seong, Jin-Taek
    MATHEMATICS, 2020, 8 (04)
  • [3] Noisy Adaptive Group Testing: Bounds and Algorithms
    Scarlett, Jonathan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (06) : 3646 - 3661
  • [4] Bounds for Threshold and Majority Group Testing
    Ahlswede, Rudolf
    Deppe, Christian
    Lebedev, Vladimir
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 69 - 73
  • [5] Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices
    Scarlett, Jonathan
    Cevher, Volkan
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2868 - 2872
  • [6] Threshold bounds for noisy bipartite states
    Loubenets, ER
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2006, 39 (18): : 5115 - 5123
  • [7] Improved Bounds for Noisy Group Testing With Constant Tests per Item
    Gebhard, Oliver
    Johnson, Oliver
    Loick, Philipp
    Rolvien, Maurice
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (04) : 2604 - 2621
  • [8] SOME THEORETICAL DEVELOPMENTS ON THRESHOLD ANALYSIS AND TESTING
    SIMPSON, B
    URBAN STUDIES, 1977, 14 (01) : 79 - 88
  • [9] Threshold group testing
    Damaschke, P.
    General Theory of Information Transfer and Combinatorics, 2006, 4123 : 707 - 718
  • [10] Efficient Algorithms for Noisy Group Testing
    Cai, Sheng
    Jahangoshahi, Mohammad
    Bakshi, Mayank
    Jaggi, Sidharth
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (04) : 2113 - 2136