English
Related papers

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

200 papers

Model-based compressed sensing refers to compressed sensing with extra structure about the underlying sparse signal known a priori. Recent work has demonstrated that both for deterministic and probabilistic models imposed on the signal,…

Information Theory · Computer Science 2015-09-07 Sidhant Misra , Pablo A. Parrilo

Expressing a matrix as the sum of a low-rank matrix plus a sparse matrix is a flexible model capturing global and local features in data popularized as Robust PCA (Candes et al., 2011; Chandrasekaran et al., 2009). Compressed sensing,…

Numerical Analysis · Mathematics 2022-04-28 Jared Tanner , Simon Vary

Compressive sensing (CS) is a signal processing technique that enables sub-Nyquist sampling and near lossless reconstruction of a sparse signal. The technique is particularly appealing for neural signal processing since it avoids the issues…

Signal Processing · Electrical Eng. & Systems 2021-02-02 Hyunseok Park , Xilin Liu

Pooled testing is a common strategy for public health disease screening under limited testing resources, allowing multiple biological samples to be tested together with the resources of a single test, at the cost of reduced individual…

Computer Science and Game Theory · Computer Science 2026-02-02 Nicholas Lopez , Francisco Marmolejo-Cossío , Jose Roberto Tello Ayala , David C. Parkes

This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a…

Probability · Mathematics 2010-11-10 Holger Rauhut , Karin Schnass , Pierre Vandergheynst

Recovering low-rank and sparse matrices from incomplete or corrupted observations is an important problem in machine learning, statistics, bioinformatics, computer vision, as well as signal and image processing. In theory, this problem can…

Machine Learning · Computer Science 2014-09-04 Fanhua Shang , Yuanyuan Liu , Hanghang Tong , James Cheng , Hong Cheng

This article presents novel results concerning the recovery of signals from undersampled data in the common situation where such signals are not sparse in an orthonormal basis or incoherent dictionary, but in a truly redundant dictionary.…

Numerical Analysis · Mathematics 2015-03-17 Emmanuel J. Candes , Yonina C. Eldar , Deanna Needell , Paige Randall

We consider the compressed sensing problem, where the object $x_0 \in \bR^N$ is to be recovered from incomplete measurements $y = Ax_0 + z$; here the sensing matrix $A$ is an $n \times N$ random matrix with iid Gaussian entries and $n < N$.…

Information Theory · Computer Science 2011-03-25 David Donoho , Iain Johnstone , Arian Maleki , Andrea Montanari

Non-convex constraints have recently proven a valuable tool in many optimisation problems. In particular sparsity constraints have had a significant impact on sampling theory, where they are used in Compressed Sensing and allow structured…

Information Theory · Computer Science 2012-05-09 Thomas Blumensath

We study the Compressed Sensing (CS) problem, which is the problem of finding the most sparse vector that satisfies a set of linear measurements up to some numerical tolerance. We introduce an $\ell_2$ regularized formulation of CS which we…

Signal Processing · Electrical Eng. & Systems 2024-07-15 Dimitris Bertsimas , Nicholas A. G. Johnson

Although probing frozen models has become a standard evaluation paradigm, self-supervised learning in audio defaults to fine-tuning when pursuing state-of-the-art on AudioSet. A key reason is that global pooling creates an information…

Compressed sensing (CS) is a concept that allows to acquire compressible signals with a small number of measurements. As such it is very attractive for hardware implementations. Therefore, correct calibration of the hardware is a central…

Information Theory · Computer Science 2015-04-30 Christophe Schülke , Francesco Caltagirone , Florent Krzakala , Lenka Zdeborová

The support recovery problem consists of determining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as compressive sensing, and subset selection in…

Information Theory · Computer Science 2016-08-31 Jonathan Scarlett , Volkan Cevher

Non-linear mixed effects modeling and simulation (NLME M&S) is evaluated to be used for standardization with longitudinal data in presence of confounders. Standardization is a well-known method in causal inference to correct for confounding…

The paper analyses the possibility to recover different biomedical signals if limited number of samples is available. Having in mind that monitoring of health condition is done by measuring and observing key parameters such as heart…

Signal Processing · Electrical Eng. & Systems 2018-02-02 Ivan Martinovic , Vesna Mandic

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

Pooling specimens, a well-accepted sampling strategy in biomedical research, can be applied to reduce the cost of studying biomarkers. Even if the cost of a single assay is not a major restriction in evaluating biomarkers, pooling can be a…

Applications · Statistics 2012-03-01 Enrique F. Schisterman , Albert Vexler , Aijun Ye , Neil J. Perkins

With the aim to propose a non parametric hypothesis test, this paper carries out a study on the Matching Error (ME), a comparison index of two partitions obtained from the same data set, using for example two clustering methods. This index…

Methodology · Statistics 2019-07-31 Mathias Bourel , Badih Ghattas , Meliza González

This paper studies the problem of reconstructing sparse or compressible signals from compressed sensing measurements that have undergone nonuniform quantization. Previous approaches to this Quantized Compressed Sensing (QCS) problem based…

Information Theory · Computer Science 2013-05-17 L. Jacques , D. K. Hammond , M. J. Fadili

Non-adaptive group testing refers to the problem of inferring a sparse set of defectives from a larger population using the minimum number of simultaneous pooled tests. Recent positive results for noiseless group testing have motivated the…

Information Theory · Computer Science 2021-07-16 Gabriel Arpino , Nicolò Grometto , Afonso S. Bandeira