English
Related papers

Related papers: Near-optimal compressed sensing guarantees for tot…

200 papers

The purpose of this paper is to report on recent approaches to reconstruction problems based on analog, or in other words, infinite-dimensional, image and signal models. We describe three main contributions to this problem. First, linear…

Numerical Analysis · Mathematics 2013-10-07 Ben Adcock , Anders Hansen , Bogdan Roman , Gerd Teschke

We consider the problem of recovering linear image of unknown signal belonging to a given convex compact signal set from noisy observation of another linear image of the signal. We develop a simple generic efficiently computable nonlinear…

Statistics Theory · Mathematics 2019-04-12 Anatoli Juditsky , Arkadi Nemirovski

An important theme in modern inverse problems is the reconstruction of time-dependent data from only finitely many measurements. To obtain satisfactory reconstruction results in this setting it is essential to strongly exploit temporal…

Numerical Analysis · Mathematics 2024-03-14 Martin Holler , Alexander Schlüter , Benedikt Wirth

This paper develops a new method for recovering m-sparse signals that is simultaneously uniform and quick. We present a reconstruction algorithm whose run time, O(m log^2(m) log^2(d)), is sublinear in the length d of the signal. The…

Data Structures and Algorithms · Computer Science 2007-05-23 A. C. Gilbert , M. J. Strauss , J. A. Tropp , R. Vershynin

We consider signal reconstruction from the norms of subspace components generalizing standard phase retrieval problems. In the deterministic setting, a closed reconstruction formula is derived when the subspaces satisfy certain cubature…

Probability · Mathematics 2017-09-04 Christine Bachoc , Martin Ehler

Many practical sensing applications involve multiple sensors simultaneously acquiring measurements of a single object. Conversely, most existing sparse recovery guarantees in compressed sensing concern only single-sensor acquisition…

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

It is well-known that point sources with sufficient mutual distance can be reconstructed exactly from finitely many Fourier measurements by solving a convex optimization problem with Tikhonov-regularization (this property is sometimes…

Optimization and Control · Mathematics 2023-12-13 Martin Holler , Benedikt Wirth

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

The problem of multiple sensors simultaneously acquiring measurements of a single object can be found in many applications. In this paper, we present the optimal recovery guarantees for the recovery of compressible signals from multi-sensor…

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

Numerous applications in signal processing have benefited from the theory of compressed sensing which shows that it is possible to reconstruct signals sampled below the Nyquist rate when certain conditions are satisfied. One of these…

Multimedia · Computer Science 2012-03-27 Cagdas Bilen , Yao Wang , Ivan Selesnick

We proposed a weighted l1 minimization to recover a sparse signal vector and the corrupted noise vector from a linear measurement when the sensing matrix A is an m by n row i.i.d subgaussian matrix. We obtain both uniform and nonuniform…

Information Theory · Computer Science 2016-01-25 Dongcai Su

The theory of Compressed Sensing, the emerging sampling paradigm 'that goes against the common wisdom', asserts that 'one can recover signals in Rn from far fewer samples or measurements, if the signal has a sparse representation in some…

Information Theory · Computer Science 2013-11-01 Ankit Kundu , Pradosh K. Roy

We consider the problem of estimating the frequency components of a mixture of s complex sinusoids from a random subset of n regularly spaced samples. Unlike previous work in compressed sensing, the frequencies are not assumed to lie on a…

Information Theory · Computer Science 2013-07-12 Gongguo Tang , Badri Narayan Bhaskar , Parikshit Shah , Benjamin Recht

We study the problem of reconstructing a signal from its projection on a subspace. The proposed signal reconstruction algorithms utilize a guiding subspace that represents desired properties of reconstructed signals. We show that optimal…

Information Theory · Computer Science 2016-06-13 Akshay Gadde , Andrew Knyazev , Dong Tian , Hassan Mansour

We propose a compressive sensing algorithm that exploits geometric properties of images to recover images of high quality from few measurements. The image reconstruction is done by iterating the two following steps: 1) estimation of normal…

Computer Vision and Pattern Recognition · Computer Science 2015-06-11 Virginia Estellers , Jean-Philippe Thiran , Xavier Bresson

Existing convex relaxation-based approaches to reconstruction in compressed sensing assume that noise in the measurements is independent of the signal of interest. We consider the case of noise being linearly correlated with the signal and…

Information Theory · Computer Science 2014-01-03 Thomas Arildsen , Torben Larsen

This paper study recovery conditions of weighted L1 minimization for signal reconstruction from compressed sensing measurements. A sufficient condition for exact recovery by using the general weighted L1 minimization is derived, which…

Information Theory · Computer Science 2015-09-29 Jun Zhang , Urbashi Mitra , Kuan-Wen Huang , Nicolo Michelusi

We address the ambiguities in the super-resolution problem under translation. We demonstrate that combinations of low-resolution images at different scales can be used to make the super-resolution problem well posed. Such differences in…

Computer Vision and Pattern Recognition · Computer Science 2026-04-24 Daniel Fu , Gabby Litterio , Pedro Felzenszwalb , Rashid Zia

In this paper, we expand the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction of an arbitrary number of non-zero parameters to be recovered. The topic touches on the concept of exact…

Information Theory · Computer Science 2026-05-08 Joonas Lahtinen

Compressed Sensing refers to extracting a low-dimensional structured signal of interest from its incomplete random linear observations. A line of recent work has studied that, with the extra prior information about the signal, one can…

Information Theory · Computer Science 2017-04-19 Sajad Daei , Farzan Haddadi