English
Related papers

Related papers: Correction of Pooling Matrix Mis-specifications in…

200 papers

Parallel acquisition systems arise in various applications in order to moderate problems caused by insufficient measurements in single-sensor systems. These systems allow simultaneous data acquisition in multiple sensors, thus alleviating…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Ben Adcock

The group testing problem asks for efficient pooling schemes and algorithms that allow to screen moderately large numbers of samples for rare infections. The goal is to accurately identify the infected samples while conducting the least…

Artificial Intelligence · Computer Science 2021-05-19 AminCoja-Oghlan , Max Hahn-Klimroth , Philipp Loick , Manuel Penschuck

Standard multiple testing procedures are designed to report a list of discoveries, or suspected false null hypotheses, given the hypotheses' p-values or test scores. Recently there has been a growing interest in enhancing such procedures by…

Methodology · Statistics 2025-10-29 Jack Freestone , William Stafford Noble , Uri Keich

In the pooled data problem, the goal is to identify the categories associated with a large collection of items via a sequence of pooled tests. Each pooled test reveals the number of items in the pool belonging to each category. A prominent…

Information Theory · Computer Science 2025-09-09 Nelvin Tan , Pablo Pascual Cobo , Ramji Venkataramanan

We study non-adaptive pooling strategies for detection of rare faulty items. Given a binary sparse N-dimensional signal x, how to construct a sparse binary MxN pooling matrix F such that the signal can be reconstructed from the smallest…

Information Theory · Computer Science 2013-12-17 Pan Zhang , Florent Krzakala , Marc Mézard , Lenka Zdeborová

Compressed sensing of simultaneously sparse and low-rank matrices enables recovery of sparse signals from a few linear measurements of their bilinear form. One important question is how many measurements are needed for a stable…

Information Theory · Computer Science 2016-07-01 Kiryung Lee , Yihong Wu , Yoram Bresler

The problem of compressing a real-valued sparse source using compressive sensing techniques is studied. The rate distortion optimality of a coding scheme in which compressively sensed signals are quantized and then reconstructed is…

Information Theory · Computer Science 2010-11-09 Rajiv Soundararajan , Sriram Vishwanath

This paper deals with the design of a sensing matrix along with a sparse recovery algorithm by utilizing the probability-based prior information for compressed sensing system. With the knowledge of the probability for each atom of the…

Machine Learning · Computer Science 2019-10-29 Q. Jiang , S. Li , Z. Zhu , H. Bai , X. He , R. C. de Lamare

Compressed sensing deals with the recovery of sparse signals from linear measurements. Without any additional information, it is possible to recover an $s$-sparse signal using $m \gtrsim s \log(d/s)$ measurements in a robust and stable way.…

Functional Analysis · Mathematics 2016-05-25 Axel Flinth

Estimating the prevalence of a disease is necessary for evaluating and mitigating risks of its transmission within or between populations. Estimates that consider how prevalence changes with time provide more information about these risks…

Applications · Statistics 2021-11-12 Braden Scherting , Alison Peel , Raina Plowright , Andrew Hoegh

We investigate a power-constrained sensing matrix design problem for a compressed sensing framework. We adopt a mean square error (MSE) performance criterion for sparse source reconstruction in a system where the source-to-sensor channel…

Information Theory · Computer Science 2014-09-29 Amirpasha Shirazinia , Subhrakanti Dey

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

Information Theory · Computer Science 2015-05-18 Dmitry Malioutov , Sujay Sanghavi , Alan Willsky

Compressed Sensing (CS) is an effective approach to reduce the required number of samples for reconstructing a sparse signal in an a priori basis, but may suffer severely from the issue of basis mismatch. In this paper we study the problem…

Information Theory · Computer Science 2014-02-04 Yuejie Chi

Compressed sensing is a theory which guarantees the exact recovery of sparse signals from a small number of linear projections. The sampling schemes suggested by current compressed sensing theories are often of little practical relevance…

Information Theory · Computer Science 2014-07-22 Jérémie Bigot , Claire Boyer , Pierre Weiss

In this paper, we study the pooled data problem of identifying the labels associated with a large collection of items, based on a sequence of pooled tests revealing the counts of each label within the pool. In the noiseless setting, we…

Machine Learning · Statistics 2017-10-19 Jonathan Scarlett , Volkan Cevher

We propose new compressive parameter estimation algorithms that make use of polar interpolation to improve the estimator precision. Our work extends previous approaches involving polar interpolation for compressive parameter estimation in…

Information Theory · Computer Science 2016-11-17 Karsten Fyhn , Marco F. Duarte , Søren Holdt Jensen

Compressed sensing (CS) demonstrates that sparse signals can be estimated from under-determined linear systems. Distributed CS (DCS) further reduces the number of measurements by considering joint sparsity within signal ensembles. DCS with…

Information Theory · Computer Science 2017-03-24 Junan Zhu , Dror Baron , Florent Krzakala

Clinical trials play important roles in drug development but often suffer from expensive, inaccurate and insufficient patient recruitment. The availability of massive electronic health records (EHR) data and trial eligibility criteria (EC)…

Machine Learning · Computer Science 2020-06-17 Junyi Gao , Cao Xiao , Lucas M. Glass , Jimeng Sun

This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible…

Information Theory · Computer Science 2014-04-30 Matthew L. Malloy , Robert D. Nowak

In this paper we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present a new class of convex optimization programs, or decoders, coined Basis Pursuit DeQuantizer of moment $p$…

Optimization and Control · Mathematics 2015-03-13 Laurent Jacques , David K. Hammond , M. Jalal Fadili