English
Related papers

Related papers: The Restricted Isometry Property for Measurements …

200 papers

The restricted isometry property (RIP) has become well-known in the compressed sensing community. Recently, a weaken version of RIP was proposed for exact sparse recovery under weak moment assumptions. In this note, we prove that the weaken…

Information Theory · Computer Science 2015-04-02 Hui Zhang

This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entries. We show that properly constrained nuclear-norm…

Information Theory · Computer Science 2010-01-05 Emmanuel J. Candes , Yaniv Plan

We consider the problem of recovering sparse vectors from underdetermined linear measurements via $\ell_p$-constrained basis pursuit. Previous analyses of this problem based on generalized restricted isometry properties have suggested that…

Information Theory · Computer Science 2015-04-21 Sjoerd Dirksen , Guillaume Lecué , Holger Rauhut

For an unknown finite group $G$ of automorphisms of a finite-dimensional Hilbert space, we find sharp bounds on the number of generic $G$-orbits needed to recover $G$ up to group isomorphism, as well as the number needed to recover $G$ as a…

Representation Theory · Mathematics 2024-11-27 Dustin G. Mixon , Brantley Vose

We prove that iid random vectors that satisfy a rather weak moment assumption can be used as measurement vectors in Compressed Sensing, and the number of measurements required for exact reconstruction is the same as the best possible…

Statistics Theory · Mathematics 2016-02-22 Guillaume Lecué , Shahar Mendelson

Consider the problem of recovering an unknown signal from undersampled measurements, given the knowledge that the signal has a sparse representation in a specified dictionary $D$. This problem is now understood to be well-posed and…

Information Theory · Computer Science 2015-06-09 Felix Krahmer , Deanna Needell , Rachel Ward

Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on…

Information Theory · Computer Science 2009-11-26 Ali Hormati , Amin Karbasi , Soheil Mohajer , Martin Vetterli

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

Signal models formed as linear combinations of few atoms from an over-complete dictionary or few frame vectors from a redundant frame have become central to many applications in high dimensional signal processing and data analysis. A core…

Information Theory · Computer Science 2024-08-30 Xuemei Chen , Christian Kümmerle , Rongrong Wang

We study the restricted isometry property of a matrix that is built from the discrete Fourier transform matrix by collecting rows indexed by quadratic residues. We find an $\epsilon>0$ such that, conditioned on a folklore conjecture in…

Functional Analysis · Mathematics 2014-10-24 Afonso S. Bandeira , Dustin G. Mixon , Joel Moreira

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

The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistical learning. This property is particularly important for…

Machine Learning · Computer Science 2016-06-01 Tengyao Wang , Quentin Berthet , Yaniv Plan

In this paper, we develop verifiable and computable performance analysis of sparsity recovery. We define a family of goodness measures for arbitrary sensing matrices as a set of optimization problems, and design algorithms with a…

Information Theory · Computer Science 2011-10-06 Gongguo Tang , Arye Nehorai

The problem of estimating the frequencies of an exponential sum has been studied extensively over the last years. It can be understood as a sparse estimation problem, as it strives to identify the sparse representation of a signal using…

Numerical Analysis · Mathematics 2019-05-21 Benedikt Diederichs

We study the stable recovery of complex $k$-sparse signals from as few phaseless measurements as possible. The main result is to show that one can employ $\ell_1$ minimization to stably recover complex $k$-sparse signals from $m\geq O(k\log…

Functional Analysis · Mathematics 2019-11-27 Yu Xia , Zhiqiang Xu

Randomized measurements are useful for analyzing quantum systems especially when quantum control is not fully perfect. However, their practical realization typically requires multiple rotations in the complex space due to the adoption of…

Quantum Physics · Physics 2025-08-28 Jin-Min Liang , Satoya Imai , Shuheng Liu , Shao-Ming Fei , Otfried Gühne , Qiongyi He

When the linear measurements of an instance of low-rank matrix recovery satisfy a restricted isometry property (RIP)---i.e. they are approximately norm-preserving---the problem is known to contain no spurious local minima, so exact recovery…

Machine Learning · Computer Science 2018-11-01 Richard Y. Zhang , Cédric Josz , Somayeh Sojoudi , Javad Lavaei

It is now well known that sparse or compressible vectors can be stably recovered from their low-dimensional projection, provided the projection matrix satisfies a Restricted Isometry Property (RIP). We establish new implications of the RIP…

Functional Analysis · Mathematics 2012-11-09 Rémi Gribonval , Morten Nielsen

Compressed sensing and its extensions have recently triggered interest in randomized signal acquisition. A key finding is that random measurements provide sparse signal reconstruction guarantees for efficient and stable algorithms with a…

Information Theory · Computer Science 2014-07-08 Felix Krahmer , Holger Rauhut

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