English
Related papers

Related papers: Improved bounds for the RIP of Subsampled Circulan…

200 papers

In Compressive Sensing, the Restricted Isometry Property (RIP) ensures that robust recovery of sparse vectors is possible from noisy, undersampled measurements via computationally tractable algorithms. It is by now well-known that Gaussian…

Information Theory · Computer Science 2014-02-17 Armin Eftekhari , Han Lun Yap , Christopher J. Rozell , Michael B. Wakin

This paper considers compressed sensing matrices and neighborliness of a centrally symmetric convex polytope generated by vectors $\pm X_1,...,\pm X_N\in\R^n$, ($N\ge n$). We introduce a class of random sampling matrices and show that they…

Probability · Mathematics 2009-05-01 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

Let $A$ be an $N \times N$ Fourier matrix over $\mathbb{F}_p^{\log{N}/\log{p}}$ for some prime $p$. We improve upon known lower bounds for the number of rows of $A$ that must be sampled so that the resulting matrix $M$ satisfies the…

Information Theory · Computer Science 2019-03-29 Shravas Rao

We prove that quaternion Gaussian random matrices satisfy the restricted isometry property (RIP) with overwhelming probability. We also explain why the restricted isometry random variables (RIV) approach is not appropriate for drawing…

Probability · Mathematics 2017-05-01 Agnieszka Badeńska , Łukasz Błaszczyk

A matrix $\Phi \in \mathbb{R}^{Q \times N}$ satisfies the restricted isometry property if $\|\Phi x\|_2^2$ is approximately equal to $\|x\|_2^2$ for all $k$-sparse vectors $x$. We give a construction of RIP matrices with the optimal $Q =…

Information Theory · Computer Science 2024-12-19 Shravas Rao

The restricted isometry property (RIP) is essential for the linear map to guarantee the successful recovery of low-rank matrices. The existing works show that the linear map generated by the measurement matrices with independent and…

Information Theory · Computer Science 2024-05-08 Wei Zhang , Zhenni Wang

Matrices satisfying the Restricted Isometry Property (RIP) play an important role in the areas of compressed sensing and statistical learning. RIP matrices with optimal parameters are mainly obtained via probabilistic arguments, as explicit…

Machine Learning · Computer Science 2019-11-01 Shiva Prasad Kasiviswanathan , Mark Rudelson

In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse and compressible signals. Many recovery algorithms are known to…

Information Theory · Computer Science 2014-04-29 Holger Rauhut , Justin Romberg , Joel A. Tropp

In compressed sensing, the "restricted isometry property" (RIP) is a sufficient condition for the efficient reconstruction of a nearly k-sparse vector x in C^d from m linear measurements Phi x. It is desirable for m to be small, and for Phi…

Data Structures and Algorithms · Computer Science 2012-11-07 Jelani Nelson , Eric Price , Mary Wootters

We study statistical restricted isometry, a property closely related to sparse signal recovery, of deterministic sensing matrices of size $m \times N$. A matrix is said to have a statistical restricted isometry property (StRIP) of order $k$…

Information Theory · Computer Science 2016-11-17 Alexander Barg , Arya Mazumdar , Rongrong Wang

A matrix $A \in \mathbb{C}^{q \times N}$ satisfies the restricted isometry property of order $k$ with constant $\varepsilon$ if it preserves the $\ell_2$ norm of all $k$-sparse vectors up to a factor of $1\pm \varepsilon$. We prove that a…

Data Structures and Algorithms · Computer Science 2015-10-14 Ishay Haviv , Oded Regev

The restricted isometry property (RIP) is a well-known matrix condition that provides state-of-the-art reconstruction guarantees for compressed sensing. While random matrices are known to satisfy this property with high probability,…

Functional Analysis · Mathematics 2012-02-24 Afonso S. Bandeira , Matthew Fickus , Dustin G. Mixon , Percy Wong

In this paper we consider memoryless one-bit compressed sensing with randomly subsampled Gaussian circulant matrices. We show that in a small sparsity regime and for small enough accuracy $\delta$, $m\sim \delta^{-4} s\log(N/s\delta)$…

Information Theory · Computer Science 2017-10-11 Sjoerd Dirksen , Hans Christian Jung , Holger Rauhut

The study of the restricted isometry property (RIP) of corrupted random matrices is particularly important in the field of compressed sensing (CS) with corruptions. If a matrix still satisfies the RIP after that a certain portion of rows…

Probability · Mathematics 2019-03-22 Ran Lu

In compressed sensing, the restricted isometry property (RIP) on $M \times N$ sensing matrices (where $M < N$) guarantees efficient reconstruction of sparse vectors. A matrix has the $(s,\delta)$-$\mathsf{RIP}$ property if behaves as a…

Statistics Theory · Mathematics 2021-04-23 Yunzi Ding , Dmitriy Kunisky , Alexander S. Wein , Afonso S. Bandeira

It is known that sparse recovery by measurements from random circulant matrices provides good recovery bounds. We generalize this to measurements that arise as a random orbit of a group representation for some finite group G. We derive…

Information Theory · Computer Science 2025-09-17 Hartmut Führ , Timm Gilles

Restricted Isometry Property (RIP) is of fundamental importance in the theory of compressed sensing and forms the base of many exact and robust recovery guarantees in this field. A quantitative description of RIP involves bounding the…

Information Theory · Computer Science 2020-07-15 Gen Li , Xingyu Xu , Yuantao Gu

The Restricted Isometry Property (RIP) is a fundamental property of a matrix which enables sparse recovery. Informally, an $m \times n$ matrix satisfies RIP of order $k$ for the $\ell_p$ norm, if $\|Ax\|_p \approx \|x\|_p$ for every vector…

Data Structures and Algorithms · Computer Science 2015-02-24 Zeyuan Allen-Zhu , Rati Gelashvili , Ilya Razenshteyn

We investigate two-sided bounds for operator norms of random matrices with unhomogenous independent entries. We formulate a lower bound for Rademacher matrices and conjecture that it may be reversed up to a universal constant. We show that…

Probability · Mathematics 2024-05-24 Rafał Latała , Witold Świątkowski

We study the recovery of sparse vectors from subsampled random convolutions via $\ell_1$-minimization. We consider the setup in which both the subsampling locations as well as the generating vector are chosen at random. For a subgaussian…

Information Theory · Computer Science 2018-03-28 Shahar Mendelson , Holger Rauhut , Rachel Ward
‹ Prev 1 2 3 10 Next ›