English
Related papers

Related papers: Performance bounds on compressed sensing with Pois…

200 papers

This paper demonstrates how new principles of compressed sensing, namely asymptotic incoherence, asymptotic sparsity and multilevel sampling, can be utilised to better understand underlying phenomena in practical compressed sensing and…

Functional Analysis · Mathematics 2014-07-08 Bogdan Roman , Anders Hansen , Ben Adcock

We propose an image deconvolution algorithm when the data is contaminated by Poisson noise. The image to restore is assumed to be sparsely represented in a dictionary of waveforms such as the wavelet or curvelet transforms. Our key…

Applications · Statistics 2009-11-13 François-Xavier Dupé , Jalal Fadili , Jean Luc Starck

Compressed sensing is a technique for recovering an unknown sparse signal from a small number of linear measurements. When the measurement matrix is random, the number of measurements required for perfect recovery exhibits a phase…

Optimization and Control · Mathematics 2016-12-30 Mateo Díaz , Mauricio Junca , Felipe Rincón , Mauricio Velasco

In this paper, we consider a compressed sensing problem of reconstructing a sparse signal from an undersampled set of noisy linear measurements. The regularized least squares or least absolute shrinkage and selection operator (LASSO)…

Information Theory · Computer Science 2014-10-30 Chao-Kai Wen , Jun Zhang , Kai-Kit Wong , Jung-Chieh Chen , Chau Yuen

In this work, we consider an estimation method in sparse Poisson models inspired by [1] and provide novel sign consistency results under mild conditions.

Statistics Theory · Mathematics 2023-03-27 Marina Gomtsyan , Céline Lévy-Leduc , Sarah Ouadah , Laure Sansonnet

Previous work regarding low-rank matrix recovery has concentrated on the scenarios in which the matrix is noise-free and the measurements are corrupted by noise. However, in practical application, the matrix itself is usually perturbed by…

Information Theory · Computer Science 2020-03-09 Jianwen Huang , Jianjun Wang , Feng Zhang , Hailin Wang , Wendong Wang

We present a computationally-efficient method for recovering sparse signals from a series of noisy observations, known as the problem of compressed sensing (CS). CS theory requires solving a convex constrained minimization problem. We…

Information Theory · Computer Science 2010-06-22 Avishy Carmi , Pini Gurfil

Compressed sensing is a paradigm within signal processing that provides the means for recovering structured signals from linear measurements in a highly efficient manner. Originally devised for the recovery of sparse signals, it has become…

Information Theory · Computer Science 2021-12-09 Jens Eisert , Axel Flinth , Benedikt Groß , Ingo Roth , Gerhard Wunder

Compressed sensing is the art of reconstructing a sparse vector from its inner products with respect to a small set of randomly chosen measurement vectors. It is usually assumed that the ensemble of measurement vectors is in isotropic…

Information Theory · Computer Science 2014-02-25 Richard Kueng , David Gross

Goal: This paper deals with the problems that some EEG signals have no good sparse representation and single channel processing is not computationally efficient in compressed sensing of multi-channel EEG signals. Methods: An optimization…

Information Theory · Computer Science 2015-06-30 Yipeng Liu , Maarten De Vos , Sabine Van Huffel

Compressed sensing is a novel research area, which was introduced in 2006, and since then has already become a key concept in various areas of applied mathematics, computer science, and electrical engineering. It surprisingly predicts that…

Information Theory · Computer Science 2012-08-29 Gitta Kutyniok

We study the information-theoretic limits of exactly recovering the support of a sparse signal using noisy projections defined by various classes of measurement matrices. Our analysis is high-dimensional in nature, in which the number of…

Statistics Theory · Mathematics 2008-06-04 Wei Wang , Martin J. Wainwright , Kannan Ramchandran

A popular approach within the signal processing and machine learning communities consists in modelling signals as sparse linear combinations of atoms selected from a learned dictionary. While this paradigm has led to numerous empirical…

Machine Learning · Statistics 2012-10-03 Rodolphe Jenatton , Rémi Gribonval , Francis Bach

Sparse linear regression with ill-conditioned Gaussian random designs is widely believed to exhibit a statistical/computational gap, but there is surprisingly little formal evidence for this belief, even in the form of examples that are…

Data Structures and Algorithms · Computer Science 2022-03-08 Jonathan A. Kelner , Frederic Koehler , Raghu Meka , Dhruv Rohatgi

Assume that we observe a sample of size n composed of p-dimensional signals, each signal having independent entries drawn from a scaled Poisson distribution with an unknown intensity. We are interested in estimating the sum of the n unknown…

Statistics Theory · Mathematics 2018-01-19 Olivier Collier , Arnak Dalalyan

In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the…

Information Theory · Computer Science 2013-04-15 Maria Chiara Angelini , Federico Ricci-Tersenghi , Yoshiyuki Kabashima

The practice of compressed sensing suffers importantly in terms of the efficiency/accuracy trade-off when acquiring noisy signals prior to measurement. It is rather common to find results treating the noise affecting the measurements,…

Numerical Analysis · Mathematics 2014-11-25 Marco Artina , Massimo Fornasier , Steffen Peter

Many applications have benefited remarkably from low-dimensional models in the recent decade. The fact that many signals, though high dimensional, are intrinsically low dimensional has given the possibility to recover them stably from a…

Information Theory · Computer Science 2015-07-29 Raja Giryes , Yaniv Plan , Roman Vershynin

We demonstrate that a sparse signal can be estimated from the phase of complex random measurements, in a "phase-only compressive sensing" (PO-CS) scenario. With high probability and up to a global unknown amplitude, we can perfectly recover…

Information Theory · Computer Science 2020-11-13 Laurent Jacques , Thomas Feuillen

Randomized experiments are the gold standard for evaluating the effects of changes to real-world systems. Data in these tests may be difficult to collect and outcomes may have high variance, resulting in potentially large measurement error.…

Machine Learning · Statistics 2018-06-27 Benjamin Letham , Brian Karrer , Guilherme Ottoni , Eytan Bakshy