English
Related papers

Related papers: Approximately certifying the restricted isometry p…

200 papers

Some consequences of the Restricted Isometry Property (RIP) of matrices have been applied to develop a greedy algorithm called "ROMP" (Regularized Orthogonal Matching Pursuit) to recover sparse signals and to approximate non-sparse ones.…

Information Theory · Computer Science 2013-05-31 Eugenio Hernández , Daniel Vera

In the field of compressed sensing, a key problem remains open: to explicitly construct matrices with the restricted isometry property (RIP) whose performance rivals those generated using random matrix theory. In short, RIP involves…

Functional Analysis · Mathematics 2012-10-02 Matthew Fickus , John Jasper , Dustin G. Mixon , Jesse Peterson

This paper is concerned with low-rank matrix optimization, which has found a wide range of applications in machine learning. This problem in the special case of matrix sensing has been studied extensively through the notion of Restricted…

Optimization and Control · Mathematics 2023-03-17 Ziye Ma , Somayeh Sojoudi

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

The restricted isometry property (RIP) is a well-known condition that guarantees the absence of spurious local minima in low-rank matrix recovery problems with linear measurements. In this paper, we introduce a novel property named bound…

Optimization and Control · Mathematics 2020-12-14 Yingjie Bi , Javad Lavaei

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

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

Leveraging recent advances in additive combinatorics, we exhibit explicit matrices satisfying the Restricted Isometry Property with better parameters. Namely, for $\varepsilon=3.26\cdot 10^{-7}$, large $k$ and $k^{2-\varepsilon} \le N\le…

Combinatorics · Mathematics 2023-11-01 Kevin Ford , Denka Kutzarova , George Shakan

Structures play a significant role in the field of signal processing. As a representative of structural data, low rank matrix along with its restricted isometry property (RIP) has been an important research topic in compressive signal…

Information Theory · Computer Science 2015-06-23 Xinyue Shen , Yuantao Gu

Efficient algorithms for the sparse solution of under-determined linear systems $Ax = b$ are known for matrices $A$ satisfying suitable assumptions like the restricted isometry property (RIP). Without such assumptions little is known and…

Machine Learning · Computer Science 2021-01-22 G. Welper

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

We will show that tight frames satisfying the restricted isometry property give rise to nearly tight fusion frames which are nearly orthogonal and hence are nearly equi-isoclinic. We will also show how to replace parts of the RIP frame with…

Functional Analysis · Mathematics 2011-12-02 Bernhard Bodmann , Jameson Cahill , Peter G. Casazza

It is well known that sparse approximation problem is \textsf{NP}-hard under general dictionaries. Several algorithms have been devised and analyzed in the past decade under various assumptions on the \emph{coherence} $\mu$ of the…

Computational Complexity · Computer Science 2017-02-10 Ali Çivril

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

In the context of sketching for compressive mixture modeling, we revisit existing proofs of the Restricted Isometry Property of sketching operators with respect to certain mixtures models. After examining the shortcomings of existing…

Machine Learning · Statistics 2024-06-14 Ayoub Belhadji , Rémi Gribonval

The fields of compressed sensing (CS) and matrix completion have shown that high-dimensional signals with sparse or low-rank structure can be effectively projected into a low-dimensional space (for efficient acquisition or processing) when…

Information Theory · Computer Science 2013-05-16 Han Lun Yap , Michael B. Wakin , Christopher J. Rozell

The angle between two compressed sparse vectors subject to the norm/distance constraints imposed by the restricted isometry property (RIP) of the sensing matrix plays a crucial role in the studies of many compressive sensing (CS) problems.…

Information Theory · Computer Science 2016-11-18 Ling-Hua Chang , Jwo-Yuh Wu

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

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

We study constructions of $k \times n$ matrices $A$ that both (1) satisfy the restricted isometry property (RIP) at sparsity $s$ with optimal parameters, and (2) are efficient in the sense that only $O(n\log n)$ operations are required to…

Numerical Analysis · Computer Science 2013-02-19 Nir Ailon , Holger Rauhut