English
Related papers

Related papers: Quantized Compressed Sensing by Rectified Linear U…

200 papers

Existing convex relaxation-based approaches to reconstruction in compressed sensing assume that noise in the measurements is independent of the signal of interest. We consider the case of noise being linearly correlated with the signal and…

Information Theory · Computer Science 2014-01-03 Thomas Arildsen , Torben Larsen

We study the problem of approximately recovering signals on a manifold from one-bit linear measurements drawn from either a Gaussian ensemble, partial circulant ensemble, or bounded orthonormal ensemble and quantized using Sigma-Delta or…

Information Theory · Computer Science 2019-04-25 Mark Iwen , Eric Lybrand , Aaron Nelson , Rayan Saab

There have been a number of studies on sparse signal recovery from one-bit quantized measurements. Nevertheless, little attention has been paid to the choice of the quantization thresholds and its impact on the signal recovery performance.…

Information Theory · Computer Science 2013-05-21 Jun Fang , Yanning Shen , Hongbin Li

Corrupted sensing concerns the problem of recovering a high-dimensional structured signal from a collection of measurements that are contaminated by unknown structured corruption and unstructured noise. In the case of linear measurements,…

Information Theory · Computer Science 2022-02-16 Zhongxing Sun , Wei Cui , Yulong Liu

We provide the first analysis of a non-trivial quantization scheme for compressed sensing measurements arising from structured measurements. Specifically, our analysis studies compressed sensing matrices consisting of rows selected at…

Information Theory · Computer Science 2017-02-16 Joe-Mei Feng , Felix Krahmer , Rayan Saab

We consider the problem of recovering a high-dimensional structured signal from independent Gaussian linear measurements each of which is quantized to $b$ bits. Our interest is in linear approaches to signal recovery, where "linear" means…

Information Theory · Computer Science 2016-07-12 Martin Slawski , Ping Li

This work theoretically studies the problem of estimating a structured high-dimensional signal $x_0 \in \mathbb{R}^n$ from noisy $1$-bit Gaussian measurements. Our recovery approach is based on a simple convex program which uses the hinge…

Statistics Theory · Mathematics 2020-06-02 Martin Genzel , Alexander Stollenwerk

In this paper we study the quantization stage that is implicit in any compressed sensing signal acquisition paradigm. We propose using Sigma-Delta quantization and a subsequent reconstruction scheme based on convex optimization. We prove…

Information Theory · Computer Science 2015-04-02 Rayan Saab , Rongrong Wang , Ozgur Yilmaz

In this paper, we consider the problem of signal recovery from 1-bit noisy measurements. We present an efficient method to obtain an estimation of the signal of interest when the measurements are corrupted by white or colored noise. To the…

Information Theory · Computer Science 2019-03-13 Shahin Khobahi , Mojtaba Soltanalian

We give the first computationally tractable and almost optimal solution to the problem of one-bit compressed sensing, showing how to accurately recover an s-sparse vector x in R^n from the signs of O(s log^2(n/s)) random linear measurements…

Information Theory · Computer Science 2015-03-19 Yaniv Plan , Roman Vershynin

This paper addresses the classical problem of one-bit compressed sensing using a deep learning-based reconstruction algorithm that leverages a trained generative model to enhance the signal reconstruction performance. The generator, a…

Machine Learning · Computer Science 2025-02-19 Swatantra Kafle , Geethu Joseph , Pramod K. Varshney

This paper studies the problem of recovering a signal from one-bit compressed sensing measurements under a manifold model; that is, assuming that the signal lies on or near a manifold of low intrinsic dimension. We provide a convex recovery…

Information Theory · Computer Science 2020-07-24 Mark A. Iwen , Felix Krahmer , Sara Krause-Solberg , Johannes Maly

In this work, we show that reconstructing a sparse signal from quantized compressive measurement can be achieved in an unified formalism whatever the (scalar) quantization resolution, i.e., from 1-bit to high resolution assumption. This is…

Information Theory · Computer Science 2013-05-09 Laurent Jacques , Kévin Degraux , Christophe De Vleeschouwer

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

This paper studies the problem of reconstructing sparse or compressible signals from compressed sensing measurements that have undergone nonuniform quantization. Previous approaches to this Quantized Compressed Sensing (QCS) problem based…

Information Theory · Computer Science 2013-05-17 L. Jacques , D. K. Hammond , M. J. Fadili

Compressed sensing is a technique for recovering a high-dimensional signal from lower-dimensional data, whose components represent partial information about the signal, utilizing prior knowledge on the sparsity of the signal. For further…

Information Theory · Computer Science 2014-02-18 Yingying Xu , Yoshiyuki Kabashima

Consider the recovery of an unknown signal ${x}$ from quantized linear measurements. In the one-bit compressive sensing setting, one typically assumes that ${x}$ is sparse, and that the measurements are of the form…

Machine Learning · Statistics 2016-01-20 Karin Knudson , Rayan Saab , Rachel Ward

Influence of the finite-length registers and quantization effects on the reconstruction of sparse and approximately sparse signals is analyzed in this paper. For the nonquantized measurements, the compressive sensing (CS) framework provides…

Information Theory · Computer Science 2019-07-03 Isidora Stankovic , Milos Brajovic , Milos Dakovic , Cornel Ioana , Ljubisa Stankovic

In one-bit compressed sensing, previous results state that sparse signals may be robustly recovered when the measurements are taken using Gaussian random vectors. In contrast to standard compressed sensing, these results are not extendable…

Information Theory · Computer Science 2013-04-10 Albert Ai , Alex Lapanowski , Yaniv Plan , Roman Vershynin

In the problem of structured signal recovery from high-dimensional linear observations, it is commonly assumed that full-precision measurements are available. Under this assumption, the recovery performance of the popular Generalized Lasso…

Information Theory · Computer Science 2018-07-19 Christos Thrampoulidis , Ankit Singh Rawat
‹ Prev 1 2 3 10 Next ›