English
Related papers

Related papers: Limits on Sparse Data Acquisition: RIC Analysis of…

200 papers

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 a class of real robust phase retrieval problems under a Gaussian assumption on the coding matrix when the received signal is sparsely corrupted by noise. The goal is to establish conditions on the sparsity under which the input…

Information Theory · Computer Science 2019-05-27 Aleksandr Aravkin , James Burke , Daiwei He

We analyze a multiple-input multiple-output (MIMO) radar model and provide recovery results for a compressed sensing (CS) approach. In MIMO radar different pulses are emitted by several transmitters and the echoes are recorded at several…

Information Theory · Computer Science 2015-09-14 Dominik Dorsch , Holger Rauhut

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

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

Numerical experiments in literature on compressed sensing have indicated that the reweighted $l_1$ minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for…

Information Theory · Computer Science 2014-06-17 Shenglong Zhou , Naihua Xiu , Yingnan Wang , Lingchen Kong

Compressive sensing has been receiving a great deal of interest from researchers in many areas because of its ability in speeding up data acquisition. This framework allows fast signal acquisition and compression when signals are sparse in…

Information Theory · Computer Science 2020-03-17 Fatima Salahdine , Elias Ghribi , Naima Kaabouch

The MUSIC algorithm, with its extension for imaging sparse {\em extended} objects, is analyzed by compressed sensing (CS) techniques. The notion of restricted isometry property (RIP) and an upper bound on the restricted isometry constant…

Information Theory · Computer Science 2015-05-19 Albert C. Fannjiang

As shown in [Blumensath and Davies 2009, Baraniuk et al. 2010], signals whose wavelet coefficients exhibit a rooted tree structure can be recovered using specially-adapted compressed sensing algorithms from just n=O(k) measurements, where k…

Information Theory · Computer Science 2016-09-08 Coralia Cartis , Andrew Thompson

We consider the scenario in which multiple sensors send spatially correlated data to a fusion center (FC) via independent Rayleigh-fading channels with additive noise. Assuming that the sensor data is sparse in some basis, we show that the…

Information Theory · Computer Science 2015-06-12 Gang Yang , Vincent Y. F. Tan , Chin Keong Ho , See Ho Ting , Yong Liang Guan

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via additive…

Information Theory · Computer Science 2010-10-04 Nam Yul Yu

Compressed Sensing aims to capture attributes of $k$-sparse signals using very few measurements. In the standard Compressed Sensing paradigm, the $\m\times \n$ measurement matrix $\A$ is required to act as a near isometry on the set of all…

Information Theory · Computer Science 2015-05-14 Robert Calderbank , Stephen Howard , Sina Jafarpour

While it is well known that the restricted isometry property (RIP) guarantees uniform sparse recovery from noisy linear measurements, uniform recovery of structured signals from nonlinear observations remains much less understood. This…

Information Theory · Computer Science 2026-04-23 Pedro Abdalla , Radu Balan , Junren Chen

Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as $\ell_1$-minimization find the sparsest solution to certain systems of equations. Random…

Information Theory · Computer Science 2011-08-17 Ulaş Ayaz , Holger Rauhut

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

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

Non-convex constraints have recently proven a valuable tool in many optimisation problems. In particular sparsity constraints have had a significant impact on sampling theory, where they are used in Compressed Sensing and allow structured…

Information Theory · Computer Science 2012-05-09 Thomas Blumensath

Practical applications of compressed sensing often restrict the choice of its two main ingredients. They may (i) prescribe using particular redundant dictionaries for certain classes of signals to become sparsely represented, or (ii)…

Signal Processing · Electrical Eng. & Systems 2024-07-31 Jinn Ho , Wen-Liang Hwang , Andreas Heinecke

The restricted isometry constants (RICs) play an important role in exact recovery theory of sparse signals via l_q(0<q<=1) relaxations in compressed sensing. Recently, Cai and Zhang[6] have achieved a sharp bound \delta_tk<\sqrt{1-1/t} for…

Information Theory · Computer Science 2013-08-05 Shenglong Zhou , Lingchen Kong , Ziyan Luo , Naihua Xiu

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