English
Related papers

Related papers: Small coherence implies the weak Null Space Proper…

200 papers

The existence and uniqueness conditions are a prerequisite for reliable reconstruction of sparse signals from reduced sets of measurements within the Compressive Sensing (CS) paradigm. However, despite their underpinning role for practical…

Information Theory · Computer Science 2019-03-28 Ljubisa Stankovic , Danilo Mandic , Milos Dakovic , Ilya Kisil

This paper considers approximately sparse signal and low-rank matrix's recovery via truncated norm minimization $\min_{x}\|x_T\|_q$ and $\min_{X}\|X_T\|_{S_q}$ from noisy measurements. We first introduce truncated sparse approximation…

Information Theory · Computer Science 2021-05-28 Wengu Chen , Peng Li

The theory of compressed sensing tells us that recovering all k-sparse signals requires a sensing matrix to satisfy that its spark is greater than 2k, or its order of the null space property (NSP) or the restricted isometry property (RIP)…

Information Theory · Computer Science 2015-02-11 Jiawang Yi , Guanzheng Tan

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 this paper we formulate and prove a statistical version of the Candes-Tao restricted isometry property (SRIP for short) which holds in general for any incoherent dictionary which is a disjoint union of orthonormal bases. In addition, we…

Information Theory · Computer Science 2009-03-24 Shamgar Gurevich , Ronny Hadani

Random subspaces $X$ of $\mathbb{R}^n$ of dimension proportional to $n$ are, with high probability, well-spread with respect to the $\ell_2$-norm. Namely, every nonzero $x \in X$ is "robustly non-sparse" in the following sense: $x$ is…

Computational Complexity · Computer Science 2024-07-11 Venkatesan Guruswami , Peter Manohar , Jonathan Mosheiff

The Null-Space Property (NSP) is a necessary and sufficient condition for the recovery of the largest coefficients of solutions to an under-determined system of linear equations. Interestingly, this property governs also the success and the…

Statistics Theory · Mathematics 2015-10-09 J. -M Azaïs , Y. De Castro , S. Mourareau

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

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

Consider the problem of recovering an unknown signal from undersampled measurements, given the knowledge that the signal has a sparse representation in a specified dictionary $D$. This problem is now understood to be well-posed and…

Information Theory · Computer Science 2015-06-09 Felix Krahmer , Deanna Needell , Rachel Ward

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

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

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

Compressed sensing is a new scheme which shows the ability to recover sparse signal from fewer measurements, using $l_1$ minimization. Recently, Chartrand and Staneva shown in \cite{CS1} that the $l_p$ minimization with $0<p<1$ recovers…

Functional Analysis · Mathematics 2011-03-02 Yi Shen , Song Li

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

We present a detailed analysis of the unconstrained $\ell_1$-weighted LASSO method for recovery of sparse data from its observation by randomly generated matrices, satisfying the Restricted Isometry Property (RIP) with constant $\delta<1$,…

Information Theory · Computer Science 2022-03-16 Simon Foucart , Eitan Tadmor , Ming Zhong

In this work we establish the Restricted Isometry Property (RIP) of the centered column-wise self Khatri-Rao (KR) products of $n\times N$ matrix with iid columns drawn either uniformly from a sphere or with iid sub-Gaussian entries. The…

Information Theory · Computer Science 2019-05-23 Alexander Fengler , Peter Jung

We investigate the sign-linear embeddings of 1-bit compressed sensing given by Gaussian measurements. One can give short arguments concerning a Restricted Isometry Property of such maps using Vapnik-Chervonenkis dimension of sparse…

Classical Analysis and ODEs · Mathematics 2016-04-13 Scott Spencer

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

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