English
Related papers

Related papers: Recoverability Analysis for Modified Compressive S…

200 papers

Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm…

Information Theory · Computer Science 2012-06-05 Yipeng Liu , Ivan Gligorijevic , Vladimir Matic , Maarten De Vos , Sabine Van Huffel

Compressive Sensing (CS) exploits the surprising fact that the information contained in a sparse signal can be preserved in a small number of compressive, often random linear measurements of that signal. Strong theoretical guarantees have…

Information Theory · Computer Science 2014-05-02 Armin Eftekhari , Michael B. Wakin

Compressed sensing (sparse signal recovery) has been a popular and important research topic in recent years. By observing that natural signals are often nonnegative, we propose a new framework for nonnegative signal recovery using…

Methodology · Statistics 2013-10-04 Ping Li , Cun-Hui Zhang , Tong Zhang

Compressed sensing (CS) demonstrates that sparse signals can be recovered from underdetermined linear measurements. We focus on the joint sparse recovery problem where multiple signals share the same common sparse support sets, and they are…

Information Theory · Computer Science 2011-02-17 Jongmin Kim , Woohyuk Chang , Bangchul Jung , Dror Baron , Jong Chul Ye

The paper introduces a framework for the recoverability analysis in compressive sensing for imaging applications such as CI cameras, rapid MRI and coded apertures. This is done using the fact that the Spherical Section Property (SSP) of a…

Information Theory · Computer Science 2012-12-07 Mahdi S. Hosseini , Konstantinos N. Plataniotis

Most of compressed sensing (CS) theory to date is focused on incoherent sensing, that is, columns from the sensing matrix are highly uncorrelated. However, sensing systems with naturally occurring correlations arise in many applications,…

Information Theory · Computer Science 2017-08-29 Tobias Birnbaum , Yonina C. Eldar , Deanna Needell

Recent research in off-the-grid compressed sensing (CS) has demonstrated that, under certain conditions, one can successfully recover a spectrally sparse signal from a few time-domain samples even though the dictionary is continuous. In…

Information Theory · Computer Science 2013-11-08 Kumar Vijay Mishra , Myung Cho , Anton Kruger , Weiyu Xu

Compressed sensing (CS) with prior information concerns the problem of reconstructing a sparse signal with the aid of a similar signal which is known beforehand. We consider a new approach to integrate the prior information into CS via…

Information Theory · Computer Science 2017-05-23 Xu Zhang , Wei Cui , Yulong Liu

In this paper, we consider the problem of compressive sensing (CS) recovery with a prior support and the prior support quality information available. Different from classical works which exploit prior support blindly, we shall propose novel…

Information Theory · Computer Science 2015-10-28 Xiongbin Rao , Vincent K. N. Lau

We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy linear measurements. The sparsity pattern is assumed to…

Information Theory · Computer Science 2010-07-28 Namrata Vaswani

This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative intensities whose measurements are corrupted by Poisson noise. In this…

Information Theory · Computer Science 2015-05-14 Maxim Raginsky , Rebecca M. Willett , Zachary T. Harmany , Roummel F. Marcia

This paper proposes a verification-based decoding approach for reconstruction of a sparse signal with incremental sparse measurements. In its first step, the verification-based decoding algorithm is employed to reconstruct the signal with a…

Information Theory · Computer Science 2013-02-12 Xiaofu Wu , Zhen Yang , Lu Gan

We consider compressed sensing of block-sparse signals, i.e., sparse signals that have nonzero coefficients occurring in clusters. An uncertainty relation for block-sparse signals is derived, based on a block-coherence measure, which we…

Information Theory · Computer Science 2015-05-13 Yonina C. Eldar , Patrick Kuppinger , Helmut Bölcskei

Compressed Sensing (CS) is an appealing framework for applications such as Magnetic Resonance Imaging (MRI). However, up-to-date, the sensing schemes suggested by CS theories are made of random isolated measurements, which are usually…

Information Theory · Computer Science 2016-06-14 Claire Boyer , Jérémie Bigot , Pierre Weiss

We demonstrate that a sparse signal can be estimated from the phase of complex random measurements, in a "phase-only compressive sensing" (PO-CS) scenario. With high probability and up to a global unknown amplitude, we can perfectly recover…

Information Theory · Computer Science 2020-11-13 Laurent Jacques , Thomas Feuillen

One-bit compressed sensing (1bCS) addresses the recovery of sparse signals from highly quantized measurements, retaining only the sign of each linear measurement. In the support recovery setting, the goal is to identify $\text{supp}(x)$,…

Information Theory · Computer Science 2026-04-14 Xiaxin Li , Arya Mazumdar

We study the recovery conditions of weighted $\ell_1$ minimization for real-valued signal reconstruction from phaseless compressive sensing measurements when partial support information is available. A strong restricted isometry property…

Information Theory · Computer Science 2017-12-14 Zhiyong Zhou , Jun Yu

Compressed sensing (CS) demonstrates that a sparse, or compressible signal can be acquired using a low rate acquisition process below the Nyquist rate, which projects the signal onto a small set of vectors incoherent with the sparsity…

Information Theory · Computer Science 2014-02-25 Yuli Sun , Jinxu Tao

This article presents novel results concerning the recovery of signals from undersampled data in the common situation where such signals are not sparse in an orthonormal basis or incoherent dictionary, but in a truly redundant dictionary.…

Numerical Analysis · Mathematics 2015-03-17 Emmanuel J. Candes , Yonina C. Eldar , Deanna Needell , Paige Randall

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