English
Related papers

Related papers: A strong restricted isometry property, with an app…

200 papers

The expicit restricted isometry property (RIP) measurement matrices are needed in practical application of compressed sensing in signal processing. RIP matrices from Reed-Solomon codes, BCH codes, orthogonal codes, expander graphs have been…

Information Theory · Computer Science 2015-06-15 Liqing Xu , Hao Chen

Compressed sensing was proposed by E. J. Cand\'es, J. Romberg, T. Tao, and D. Donoho for efficient sampling of sparse signals in 2006 and has vast applications in signal processing. The expicit restricted isometry property (RIP) measurement…

Information Theory · Computer Science 2015-05-29 Hao Chen

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 this paper, we provide a new approach to estimating the error of reconstruction from $\Sigma\Delta$ quantized compressed sensing measurements. Our method is based on the restricted isometry property (RIP) of a certain projection of the…

Information Theory · Computer Science 2015-06-19 Joe-Mei Feng , Felix Krahmer

Compressive sensing involves the inversion of a mapping $SD \in \mathbb{R}^{m \times n}$, where $m < n$, $S$ is a sensing matrix, and $D$ is a sparisfying dictionary. The restricted isometry property is a powerful sufficient condition for…

Information Theory · Computer Science 2022-07-13 Jinn Ho , Wen-Liang Hwang

This paper establishes a sharp condition on the restricted isometry property (RIP) for both the sparse signal recovery and low-rank matrix recovery. It is shown that if the measurement matrix $A$ satisfies the RIP condition…

Information Theory · Computer Science 2013-02-07 T. Tony Cai , Anru Zhang

Recently, the statistical restricted isometry property (RIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this paper, we propose the usage of orthogonal symmetric Toeplitz…

Information Theory · Computer Science 2015-03-17 Kezhi Li , Lu Gan , Cong Ling

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

This paper studies the convergence of the adaptively iterative thresholding (AIT) algorithm for compressed sensing. We first introduce a generalized restricted isometry property (gRIP). Then we prove that the AIT algorithm converges to the…

Optimization and Control · Mathematics 2015-12-17 Yu Wang , Jinshan Zeng , Zhimin Peng , Xiangyu Chang , Zongben Xu

This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a probability distribution F; it includes all models - e.g.…

Information Theory · Computer Science 2010-11-23 Emmanuel J. Candes , Yaniv Plan

Compressed sensing is a celebrated framework in signal processing and has many practical applications. One of challenging problems in compressed sensing is to construct deterministic matrices having restricted isometry property (RIP). So…

Information Theory · Computer Science 2020-10-29 Shohei Satake , Yujie Gu

Dimension reduction plays an essential role when decreasing the complexity of solving large-scale problems. The well-known Johnson-Lindenstrauss (JL) Lemma and Restricted Isometry Property (RIP) admit the use of random projection to reduce…

Information Theory · Computer Science 2018-03-14 Gen Li , Yuantao Gu

The restricted isometry property (RIP) is a universal tool for data recovery. We explore the implication of the RIP in the framework of generalized sparsity and group measurements introduced in the Part I paper. It turns out that for a…

Machine Learning · Statistics 2017-07-03 Marius Junge , Kiryung Lee

The Restricted Isometry Property (RIP) is a fundamental property of a matrix enabling sparse recovery. Informally, an m x n matrix satisfies RIP of order k in the l_p norm if ||Ax||_p \approx ||x||_p for any vector x that is k-sparse, i.e.,…

Data Structures and Algorithms · Computer Science 2014-04-29 Piotr Indyk , Ilya Razenshteyn

In the context of compressed sensing (CS), both Subspace Pursuit (SP) and Compressive Sampling Matching Pursuit (CoSaMP) are very important iterative greedy recovery algorithms which could reduce the recovery complexity greatly comparing…

Information Theory · Computer Science 2015-06-17 Chao-Bing Song , Shu-Tao Xia , Xin-ji Liu

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

A matrix is said to possess the Restricted Isometry Property (RIP) if it acts as an approximate isometry when restricted to sparse vectors. Previous work has shown it to be NP-hard to determine whether a matrix possess this property, but…

Computational Complexity · Computer Science 2018-07-04 Jonathan Weed

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

Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all $\boldsymbol{k}$-sparse…

Information Theory · Computer Science 2009-10-18 Robert Calderbank , Stephen Howard , Sina Jafarpour

We study a class of real robust phase retrieval problems under a Gaussian assumption on the coding matrix when the received signal is sparsely corrupted by noise. The goal is to establish conditions on the sparsity under which the input…

Information Theory · Computer Science 2019-05-27 Aleksandr Aravkin , James Burke , Daiwei He