English
Related papers

Related papers: Uniform Recovery Guarantees for Quantized Corrupte…

200 papers

The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse vector from binary-valued measurements, each indicating the sign of a linear function of the vector. Motivated by recent advances in compressive…

Machine Learning · Statistics 2020-06-23 Zhaoqiang Liu , Selwyn Gomes , Avtansh Tiwari , Jonathan Scarlett

Conventional priors used for signal recovery are often limited by the assumption that the type of a signal's variability, such as piecewise constant or linear behavior, is known and fixed. This assumption is problematic for complex signals…

Numerical Analysis · Mathematics 2025-10-24 Yao Xiao , Anne Gelb

In compressed sensing, it is often desirable to consider signals possessing additional structure beyond sparsity. One such structured signal model - which forms the focus of this paper - is the local sparsity in levels class. This class has…

Information Theory · Computer Science 2017-06-05 Chen Li , Ben Adcock

The problem of multiple sensors simultaneously acquiring measurements of a single object can be found in many applications. In this paper, we present the optimal recovery guarantees for the recovery of compressible signals from multi-sensor…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Chen Li , Ben Adcock

This paper provides new error bounds on "consistent" reconstruction methods for signals observed from quantized random projections. Those signal estimation techniques guarantee a perfect matching between the available quantized data and a…

Information Theory · Computer Science 2016-04-21 Laurent Jacques

In phase-only compressive sensing (PO-CS), our goal is to recover low-complexity signals (e.g., sparse signals, low-rank matrices) from the phase of complex linear measurements. While perfect recovery of signal direction in PO-CS was…

Information Theory · Computer Science 2023-07-10 Junren Chen , Michael K. Ng

This paper considers signal recovery in the framework of cumulative coherence. First, we show that the Lasso estimator and the Dantzig selector exhibit similar behavior under the cumulative coherence. Then we estimate the approximation…

Information Theory · Computer Science 2021-05-28 Peng Li , Wengu Chen

Compressed sensing with subsampled unitary matrices benefits from \emph{optimized} sampling schemes, which feature improved theoretical guarantees and empirical performance relative to uniform subsampling. We provide, in a first of its kind…

Machine Learning · Statistics 2025-04-03 Yaniv Plan , Matthew S. Scott , Xia Sheng , Ozgur Yilmaz

This paper provides a unified treatment to the recovery of structured signals living in a star-shaped set from general quantized measurements $\mathcal{Q}(\mathbf{A}\mathbf{x}-\mathbf{\tau})$, where $\mathbf{A}$ is a sensing matrix,…

Information Theory · Computer Science 2025-04-29 Junren Chen , Ming Yuan

In this paper, we investigate the theoretical guarantees of penalized $\lun$ minimization (also called Basis Pursuit Denoising or Lasso) in terms of sparsity pattern recovery (support and sign consistency) from noisy measurements with…

Information Theory · Computer Science 2011-09-13 Charles Dossal , Marie-Line Chabanol , Gabriel Peyré , Jalal Fadili

This article considers recovery of signals that are sparse or approximately sparse in terms of a (possibly) highly overcomplete and coherent tight frame from undersampled data corrupted with additive noise. We show that the properly…

Information Theory · Computer Science 2013-09-10 Junhong Lin , Song Li

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

In this paper we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present a new class of convex optimization programs, or decoders, coined Basis Pursuit DeQuantizer of moment $p$…

Optimization and Control · Mathematics 2015-03-13 Laurent Jacques , David K. Hammond , M. Jalal Fadili

Infinite-dimensional compressed sensing deals with the recovery of analog signals (functions) from linear measurements, often in the form of integral transforms such as the Fourier transform. This framework is well-suited to many real-world…

Information Theory · Computer Science 2021-05-25 Ben Adcock , Vegard Antun , Anders C. Hansen

Deep generative modeling has led to new and state of the art approaches for enforcing structural priors in a variety of inverse problems. In contrast to priors given by sparsity, deep models can provide direct low-dimensional…

Optimization and Control · Mathematics 2018-12-12 Wen Huang , Paul Hand , Reinhard Heckel , Vladislav Voroninski

We investigate the recovery of signals exhibiting a sparse representation in a general (i.e., possibly redundant or incomplete) dictionary that are corrupted by additive noise admitting a sparse representation in another general dictionary.…

Information Theory · Computer Science 2011-12-08 Christoph Studer , Patrick Kuppinger , Graeme Pope , Helmut Bölcskei

Parametric and non-parametric classifiers often have to deal with real-world data, where corruptions like noise, occlusions, and blur are unavoidable - posing significant challenges. We present a probabilistic approach to classify strongly…

Machine Learning · Computer Science 2023-04-24 Philipp Joppich , Sebastian Dorn , Oliver De Candido , Wolfgang Utschick , Jakob Knollmüller

Randomized (dithered) quantization is a method capable of achieving white reconstruction error independent of the source. Dithered quantizers have traditionally been considered within their natural setting of uniform quantization. In this…

Information Theory · Computer Science 2017-04-26 Emrah Akyol , Kenneth Rose

In this paper, we investigate a trade-off between the number of radar observations (or measurements) and their resolution in the context of radar range estimation. To this end, we introduce a novel estimation scheme that can deal with…

Signal Processing · Electrical Eng. & Systems 2018-11-29 Thomas Feuillen , Chunlei Xu , Jérôme Louveaux , Luc Vandendorpe , Laurent Jacques

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