English
Related papers

Related papers: Shannon Theoretic Limits on Noisy Compressive Samp…

200 papers

Compressed sensing aims at reconstructing sparse signals from significantly reduced number of samples, and a popular reconstruction approach is $\ell_1$-norm minimization. In this correspondence, a method called orthonormal expansion is…

Information Theory · Computer Science 2015-05-30 Zai Yang , Cishen Zhang , Jun Deng , Wenmiao Lu

Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on…

Information Theory · Computer Science 2009-11-26 Ali Hormati , Amin Karbasi , Soheil Mohajer , Martin Vetterli

Sparse modeling has been widely and successfully used in many applications such as computer vision, machine learning, and pattern recognition. Accompanied with those applications, significant research has studied the theoretical limits and…

Information Theory · Computer Science 2016-10-04 Yuki Itoh , Marco F. Duarte , Mario Parente

The problem of detecting the sparsity pattern of a k-sparse vector in R^n from m random noisy measurements is of interest in many areas such as system identification, denoising, pattern recognition, and compressed sensing. This paper…

Information Theory · Computer Science 2010-09-03 Alyson K. Fletcher , Sundeep Rangan , Vivek K. Goyal

We consider the problem of sparse signal recovery from noisy measurements. Many of frequently used recovery methods rely on some sort of tuning depending on either noise or signal parameters. If no estimates for either of them are…

Information Theory · Computer Science 2020-10-20 Hendrik Bernd Petersen , Peter Jung

In this paper we present a linear programming solution for sign pattern recovery of a sparse signal from noisy random projections of the signal. We consider two types of noise models, input noise, where noise enters before the random…

Information Theory · Computer Science 2015-03-13 V. Saligrama , M. Zhao

In this paper, we study the problem of sparse vector recovery at the fusion center of a sensor network from linear sensor measurements when there is missing data. In the presence of missing data, the random sampling approach employed in…

Signal Processing · Electrical Eng. & Systems 2021-02-24 Geethu Joseph , Pramod K. Varshney

We consider the problem of recovering signals from their power spectral density. This is a classical problem referred to in literature as the phase retrieval problem, and is of paramount importance in many fields of applied sciences. In…

Information Theory · Computer Science 2013-11-12 Kishore Jaganathan , Samet Oymak , Babak Hassibi

We study the recovery of sparse signals from underdetermined linear measurements when a potentially erroneous support estimate is available. Our results are twofold. First, we derive necessary and sufficient conditions for signal recovery…

Information Theory · Computer Science 2014-12-05 Hassan Mansour , Rayan Saab

Many applications concern sparse signals, for example, detecting anomalies from the differences between consecutive images taken by surveillance cameras. This paper focuses on the problem of recovering a K-sparse signal x in N dimensions.…

Machine Learning · Statistics 2013-02-06 Ping Li , Cun-Hui Zhang

We consider the problem of exact recovery of a $k$-sparse binary vector from generalized linear measurements (such as logistic regression). We analyze the linear estimation algorithm (Plan, Vershynin, Yudovina, 2017), and also show…

Machine Learning · Statistics 2025-02-25 Arya Mazumdar , Neha Sangwan

Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is…

Information Theory · Computer Science 2015-07-24 Yuanxin Li , Yuejie Chi

The problem of recovering a structured signal from its linear measurements in the presence of speckle noise is studied. This problem appears in many imaging systems such as synthetic aperture radar and optical coherence tomography. The…

Information Theory · Computer Science 2021-08-03 Wenda Zhou , Shirin Jalali , Arian Maleki

Compressed Sensing (CS) is a signal processing technique which can accurately recover sparse signals from linear measurements with far fewer number of measurements than those required by the classical Shannon-Nyquist theorem. Block sparse…

Information Theory · Computer Science 2019-01-30 Haifeng Li , Jinming Wen

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

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

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a limited number of noisy linear measurements is an important problem in compressed sensing. In the high-dimensional setting, it is known that recovery with a…

Information Theory · Computer Science 2012-06-26 Galen Reeves , Michael Gastpar

Given a linear system in a real or complex domain, linear regression aims to recover the model parameters from a set of observations. Recent studies in compressive sensing have successfully shown that under certain conditions, a linear…

Statistics Theory · Mathematics 2016-11-15 Henrik Ohlsson , Allen Y. Yang , Roy Dong , S. Shankar Sastry

We investigate conditions for the unique recoverability of sparse integer-valued signals from a small number of linear measurements. Both the objective of minimizing the number of nonzero components, the so-called $\ell_0$-norm, as well as…

Information Theory · Computer Science 2019-09-18 Jan-Hendrik Lange , Marc E. Pfetsch , Bianca M. Seib , Andreas M. Tillmann

Sparse signals (i.e., vectors with a small number of non-zero entries) build the foundation of most kernel (or nullspace) results, uncertainty relations, and recovery guarantees in the sparse signal processing and compressive sensing…

Information Theory · Computer Science 2015-07-13 Christoph Studer