English
Related papers

Related papers: Restricted Isometry Property under High Correlatio…

200 papers

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

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

The purpose of this paper is twofold. The first is to point out that the Restricted Isometry Property (RIP) does not hold in many applications where compressed sensing is successfully used. This includes fields like Magnetic Resonance…

Information Theory · Computer Science 2015-10-19 Alexander Bastounis , Anders C. Hansen

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

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

Recently, many works have focused on the characterization of non-linear dimensionality reduction methods obtained by quantizing linear embeddings, e.g., to reach fast processing time, efficient data compression procedures, novel…

Information Theory · Computer Science 2016-12-30 Laurent Jacques , Valerio Cambareri

Random matrices are widely used in sparse recovery problems, and the relevant properties of matrices with i.i.d. entries are well understood. The current paper discusses the recently introduced Restricted Eigenvalue (RE) condition, which is…

Statistics Theory · Mathematics 2011-06-07 Mark Rudelson , Shuheng Zhou

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

Over the past years, there are increasing interests in recovering the signals from undersampling data where such signals are sparse under some orthogonal dictionary or tight framework, which is referred to be sparse synthetic model. More…

Information Theory · Computer Science 2012-02-10 Lianlin Li

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

Compressed sensing (CS) theory considers the restricted isometry property (RIP) as a sufficient condition for measurement matrix which guarantees the recovery of any sparse signal from its compressed measurements. The RIP condition also…

Other Computer Science · Computer Science 2013-09-24 Seyed Hossein Hosseini , Mahrokh G. Shayesteh , Mehdi Chehel Amirani

In [8] the author of this paper continued the research on the complex-valued discrete random variables $X_l(m,N)$ ($0\le l\le N-1$, $1\le M\le N)$ recently introduced and studied in [24]. Here we extend our results by considering $X_l(m,N)$…

Probability · Mathematics 2018-03-14 Romeo Meštrović

Many inverse problems in signal processing deal with the robust estimation of unknown data from underdetermined linear observations. Low dimensional models, when combined with appropriate regularizers, have been shown to be efficient at…

Information Theory · Computer Science 2016-12-07 Yann Traonmilin , Rémi Gribonval

In this paper, we study a general low-rank matrix recovery problem with linear measurements corrupted by some noise. The objective is to understand under what conditions on the restricted isometry property (RIP) of the problem local search…

Optimization and Control · Mathematics 2023-07-26 Ziye Ma , Yingjie Bi , Javad Lavaei , Somayeh Sojoudi

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

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 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

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

We give a new explicit construction of $n\times N$ matrices satisfying the Restricted Isometry Property (RIP). Namely, for some c>0, large N and any n satisfying N^{1-c} < n < N, we construct RIP matrices of order k^{1/2+c}. This overcomes…

Number Theory · Mathematics 2019-12-19 Jean Bourgain , S. J. Dilworth , Kevin Ford , Sergei Konyagin , Denka Kutzarova

Several important families of computational and statistical results in machine learning and randomized algorithms rely on uniform bounds on quadratic forms of random vectors or matrices. Such results include the Johnson-Lindenstrauss (J-L)…

Machine Learning · Computer Science 2019-12-06 Arindam Banerjee , Qilong Gu , Vidyashankar Sivakumar , Zhiwei Steven Wu