English
Related papers

Related papers: A Trivial Observation related to Sparse Recovery

200 papers

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

Dimensionality reduction is a popular approach to tackle high-dimensional data with low-dimensional nature. Subspace Restricted Isometry Property, a newly-proposed concept, has proved to be a useful tool in analyzing the effect of…

Information Theory · Computer Science 2019-10-01 Xingyu Xv , Gen Li , Yuantao Gu

Sparse recovery is one of the most fundamental and well-studied inverse problems. Standard statistical formulations of the problem are provably solved by general convex programming techniques and more practical, fast (nearly-linear time)…

Data Structures and Algorithms · Computer Science 2022-03-09 Jonathan A. Kelner , Jerry Li , Allen Liu , Aaron Sidford , Kevin Tian

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

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 null space property (NSP) and the restricted isometry property (RIP) are two properties which have received considerable attention in the compressed sensing literature. As the name suggests, NSP is a property that depends solely on the…

Information Theory · Computer Science 2016-03-18 Jameson Cahill , Xuemei Chen , Rongrong Wang

This paper presents an average case denoising performance analysis for the Subspace Pursuit (SP), the CoSaMP and the IHT algorithms. This analysis considers the recovery of a noisy signal, with the assumptions that (i) it is corrupted by an…

Methodology · Statistics 2010-05-26 Raja Giryes , Michael Elad

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

In this article we present 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, under…

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

We consider the problem of recovering sparse vectors from underdetermined linear measurements via $\ell_p$-constrained basis pursuit. Previous analyses of this problem based on generalized restricted isometry properties have suggested that…

Information Theory · Computer Science 2015-04-21 Sjoerd Dirksen , Guillaume Lecué , Holger Rauhut

We study statistical restricted isometry, a property closely related to sparse signal recovery, of deterministic sensing matrices of size $m \times N$. A matrix is said to have a statistical restricted isometry property (StRIP) of order $k$…

Information Theory · Computer Science 2016-11-17 Alexander Barg , Arya Mazumdar , Rongrong Wang

A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many…

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

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

Signal reconstruction is a crucial aspect of compressive sensing. In weighted cases, there are two common types of weights. In order to establish a unified framework for handling various types of weights, the sparse function is introduced.…

Classical Analysis and ODEs · Mathematics 2024-10-10 Xiaotong Liu , Yiyu Liang

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 study the recovery conditions of weighted mixed $\ell_2/\ell_p\,(0<p\leq 1)$ minimization for block sparse signal reconstruction from compressed measurements when partial block support information is available. We show that the block…

Information Theory · Computer Science 2017-10-19 Zhiyong Zhou , Jun Yu

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

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

In compressed sensing, the "restricted isometry property" (RIP) is a sufficient condition for the efficient reconstruction of a nearly k-sparse vector x in C^d from m linear measurements Phi x. It is desirable for m to be small, and for Phi…

Data Structures and Algorithms · Computer Science 2012-11-07 Jelani Nelson , Eric Price , Mary Wootters

This letter analyzes the performances of a simple reconstruction method, namely the Projected Back-Projection (PBP), for estimating the direction of a sparse signal from its phase-only (or amplitude-less) complex Gaussian random…

Signal Processing · Electrical Eng. & Systems 2020-04-22 Thomas Feuillen , Mike E. Davies , Luc Vandendorpe , Laurent Jacques