English
Related papers

Related papers: Stable and robust $\ell_p$-constrained compressive…

200 papers

Compressive sensing (CS) allows for acquisition of sparse signals at sampling rates significantly lower than the Nyquist rate required for bandlimited signals. Recovery guarantees for CS are generally derived based on the assumption that…

Information Theory · Computer Science 2014-10-22 Adam C. Polak , Marco F. Duarte , Dennis L. Goeckel

The problem of recovering a structured signal $\mathbf{x} \in \mathbb{C}^p$ from a set of dimensionality-reduced linear measurements $\mathbf{b} = \mathbf {A}\mathbf {x}$ arises in a variety of applications, such as medical imaging,…

Information Theory · Computer Science 2016-05-25 Luca Baldassarre , Yen-Huan Li , Jonathan Scarlett , Baran Gözcü , Ilija Bogunovic , Volkan Cevher

The goal of this short note is to present a refined analysis of the modified Basis Pursuit ($\ell_1$-minimization) approach to signal recovery in Compressed Sensing with partially known support, as introduced by Vaswani and Lu. The problem…

Statistics Theory · Mathematics 2015-09-07 Stephane Chretien

Recent breakthrough results in compressed sensing (CS) have established that many high dimensional objects can be accurately recovered from a relatively small number of non- adaptive linear projection observations, provided that the objects…

Machine Learning · Statistics 2011-11-30 Akshay Soni , Jarvis Haupt

We study the recovery of sparse vectors from subsampled random convolutions via $\ell_1$-minimization. We consider the setup in which both the subsampling locations as well as the generating vector are chosen at random. For a subgaussian…

Information Theory · Computer Science 2018-03-28 Shahar Mendelson , Holger Rauhut , Rachel Ward

From many fewer acquired measurements than suggested by the Nyquist sampling theory, compressive sensing (CS) theory demonstrates that, a signal can be reconstructed with high probability when it exhibits sparsity in some domain. Most of…

Computer Vision and Pattern Recognition · Computer Science 2014-05-01 Jian Zhang , Chen Zhao , Debin Zhao , Wen Gao

In this paper, we consider recovering the signal $\bm{x}\in\mathbb{R}^{n}$ from its few noisy measurements $\bm{b}=A\bm{x}+\bm{z}$, where $A\in\mathbb{R}^{m\times n}$ with $m\ll n$ is the measurement matrix, and $\bm{z}\in\mathbb{R}^{m}$ is…

Numerical Analysis · Computer Science 2018-12-11 Wendong Wang , Feng Zhang , Zhi Wang , Jianjun Wang

Phase-only compressed sensing (PO-CS) concerns the recovery of sparse signals from the phases of complex measurements. Recent results show that sparse signals in the standard sphere $\mathbb{S}^{n-1}$ can be exactly recovered from complex…

Information Theory · Computer Science 2026-04-07 Junren Chen , Michael K. Ng , Jonathan Scarlett

Compressive sensing (CS) is a promising technology for realizing energy-efficient wireless sensors for long-term health monitoring. However, conventional model-driven CS frameworks suffer from limited compression ratio and reconstruction…

Machine Learning · Computer Science 2016-12-19 Kai Xu , Yixing Li , Fengbo Ren

In structural health monitoring (SHM) systems, massive amounts of data are often generated that need data compression techniques to reduce the cost of signal transfer and storage. Compressive sensing (CS) is a novel data acquisition method…

Applications · Statistics 2014-12-16 Yong Huang , James L. Beck , Stephen Wu , Hui Li

Compressive sensing is a methodology for the reconstruction of sparse or compressible signals using far fewer samples than required by the Nyquist criterion. However, many of the results in compressive sensing concern random sampling…

Information Theory · Computer Science 2013-06-11 Atul Divekar , Deanna Needell

Reliable and energy-efficient wireless data transmission remains a major challenge in resource-constrained wireless neural recording tasks, where data compression is generally adopted to relax the burdens on the wireless data link.…

Information Theory · Computer Science 2016-02-02 Biao Sun , Wenfeng Zhao , Xinshan Zhu

In the context of compressed sensing, the nonconvex $\ell_q$ minimization with $0<q<1$ has been studied in recent years. In this paper, by generalizing the sharp bound for $\ell_1$ minimization of Cai and Zhang, we show that the condition…

Information Theory · Computer Science 2015-06-17 Chao-Bing Song , Shu-Tao Xia

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

Recovery of the initial state of a high-dimensional system can require a large number of measurements. In this paper, we explain how this burden can be significantly reduced when randomized measurement operators are employed. Our work…

Systems and Control · Computer Science 2013-07-17 Borhan M. Sanandaji , Michael B. Wakin , Tyrone L. Vincent

We propose novel necessary and sufficient conditions for a sensing matrix to be "$s$-good" - to allow for exact $\ell_1$-recovery of sparse signals with $s$ nonzero entries when no measurement noise is present. Then we express the error…

Optimization and Control · Mathematics 2014-04-11 Anatoli Juditsky , Arkadii S. Nemirovski

Recently, the 1-bit compressive sensing (1-bit CS) has been studied in the field of sparse signal recovery. Since the amplitude information of sparse signals in 1-bit CS is not available, it is often the support or the sign of a signal that…

Information Theory · Computer Science 2015-07-23 Yun-Bin Zhao , Chunlei XU

In compressed sensing (CS) framework, a signal is sampled below Nyquist rate, and the acquired compressed samples are generally random in nature. However, for efficient estimation of the actual signal, the sensing matrix must preserve the…

Information Theory · Computer Science 2015-07-28 V. Abrol , P. Sharma , A. K Sao

Compressive sensing (CS) has recently emerged as a powerful framework for acquiring sparse signals. The bulk of the CS literature has focused on the case where the acquired signal has a sparse or compressible representation in an…

Information Theory · Computer Science 2013-06-24 Mark A. Davenport , Deanna Needell , Michael B. Wakin

There are well-known relationships between compressed sensing and the geometry of the finite-dimensional $\ell_p$ spaces. A result of Kashin and Temlyakov can be described as a characterization of the stability of the recovery of sparse…

Functional Analysis · Mathematics 2015-06-22 Javier Alejandro Chávez-Domínguez , Denka Kutzarova