English
Related papers

Related papers: Improved Bounds on Restricted Isometry Constants f…

200 papers

Restricted Isometry Constants (RICs) provide a measure of how far from an isometry a matrix can be when acting on sparse vectors. This, and related quantities, provide a mechanism by which standard eigen-analysis can be applied to topics…

Numerical Analysis · Mathematics 2013-07-16 Bubacarr Bah , Jared Tanner

We develop a method for evaluating restricted isometry constants (RICs). This evaluation is reduced to the identification of the zero-points of entropy, which is defined for submatrices that are composed of columns selected from a given…

Information Theory · Computer Science 2015-06-24 Ayaka Sakata , Yoshiyuki Kabashima

This article provides a new toolbox to derive sparse recovery guarantees from small deviations on extreme singular values or extreme eigenvalues obtained in Random Matrix Theory. This work is based on Restricted Isometry Constants (RICs)…

Statistics Theory · Mathematics 2018-11-15 Sandrine Dallaporta , Yohann De Castro

One of the key issues in the acquisition of sparse data by means of compressed sensing (CS) is the design of the measurement matrix. Gaussian matrices have been proven to be information-theoretically optimal in terms of minimizing the…

Information Theory · Computer Science 2018-11-26 Ahmed Elzanaty , Andrea Giorgetti , Marco Chiani

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 columnwise Khatri-Rao product of two matrices is an important matrix type, reprising its role as a structured sensing matrix in many fundamental linear inverse problems. Robust signal recovery in such inverse problems is often…

Information Theory · Computer Science 2018-07-25 Saurabh Khanna , Chandra R Murthy

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

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

Compressed Sensing (CS) is an emerging field that enables reconstruction of a sparse signal $x \in {\mathbb R} ^n$ that has only $k \ll n$ non-zero coefficients from a small number $m \ll n$ of linear projections. The projections are…

Information Theory · Computer Science 2011-03-29 Shriram Sarvotham , Richard G. Baraniuk

We shall show that if the restricted isometry constant (RIC) $\delta_{s+1}(A)$ of the measurement matrix $A$ satisfies $$ \delta_{s+1}(A) < \frac{1}{\sqrt{s + 1}}, $$ then the greedy algorithm Orthogonal Matching Pursuit(OMP) will succeed.…

Information Theory · Computer Science 2015-01-09 Qun Mo

In this paper we look at isometry properties of random matrices. During the last decade these properties gained a lot attention in a field called compressed sensing in first place due to their initial use in \cite{CRT,CT}. Namely, in…

Optimization and Control · Mathematics 2015-07-17 Mihailo Stojnic

In this paper, we aim to generalize the notion of restricted isometry constant (RIC) in compressive sensing (CS) to restricted isometry random variable (RIV). Associated with a deterministic encoder there are two RICs, namely, the left and…

Information Theory · Computer Science 2015-02-20 Oliver James , Heung-No Lee

In this paper, we study the restricted isometry property of partial random circulant matrices. For a bounded subgaussian generator with independent entries, we prove that the partial random circulant matrices satisfy $s$-order RIP with high…

Information Theory · Computer Science 2018-08-23 Meng Huang , Yuxuan Pang , Zhiqiang Xu

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

Given a matrix $A$ with $n$ rows, a number $k<n$, and $0<\delta < 1$, $A$ is $(k,\delta)$-RIP (Restricted Isometry Property) if, for any vector $x \in \mathbb{R}^n$, with at most $k$ non-zero co-ordinates, $$(1-\delta) \|x\|_2 \leq \|A…

Computational Complexity · Computer Science 2014-06-24 Abhiram Natarajan , Yi Wu

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

The Restricted Invertibility problem is the problem of selecting the largest subset of columns of a given matrix $X$, while keeping the smallest singular value of the extracted submatrix above a certain threshold. In this paper, we address…

Probability · Mathematics 2015-12-07 Stephane Chretien

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

Compressed Sensing (CS) seeks to recover an unknown vector with $N$ entries by making far fewer than $N$ measurements; it posits that the number of compressed sensing measurements should be comparable to the information content of the…

Information Theory · Computer Science 2010-04-29 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner

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
‹ Prev 1 2 3 10 Next ›