English
Related papers

Related papers: Quantitative recovery conditions for tree-based co…

200 papers

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a small number of noisy linear measurements is an important problem in compressed sensing. In this paper, the high-dimensional setting is considered. It is shown…

Information Theory · Computer Science 2013-02-06 Galen Reeves , Michael Gastpar

Standard compressive sensing results state that to exactly recover an s sparse signal in R^p, one requires O(s. log(p)) measurements. While this bound is extremely useful in practice, often real world signals are not only sparse, but also…

Machine Learning · Statistics 2011-10-19 Nikhil Rao , Benjamin Recht , Robert Nowak

Increasing the imaging speed is a central aim in photoacoustic tomography. This issue is especially important in the case of sequential scanning approaches as applied for most existing optical detection schemes. In this work we address this…

Numerical Analysis · Mathematics 2016-11-23 Markus Haltmeier , Thomas Berer , Sunghwan Moon , Peter Burgholzer

As a signal recovery algorithm, compressed sensing is particularly useful when the data has low-complexity and samples are rare, which matches perfectly with the task of quantum phase estimation (QPE). In this work we present a new…

Quantum Physics · Physics 2025-01-01 Changhao Yi , Cunlu Zhou , Jun Takahashi

In compressed sensing, one wishes to acquire an approximately sparse high-dimensional signal $x\in\mathbb{R}^n$ via $m\ll n$ noisy linear measurements, then later approximately recover $x$ given only those measurement outcomes. Various…

Information Theory · Computer Science 2016-06-07 Tom Morgan , Jelani Nelson

Compressed sensing (CS) or sparse signal reconstruction (SSR) is a signal processing technique that exploits the fact that acquired data can have a sparse representation in some basis. One popular technique to reconstruct or approximate the…

Information Theory · Computer Science 2014-05-08 Esa Ollila , Hyon-Jung Kim , Visa Koivunen

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

We study compressive sensing in the spatial domain to achieve target localization, specifically direction of arrival (DOA), using multiple-input multiple-output (MIMO) radar. A sparse localization framework is proposed for a MIMO array in…

Information Theory · Computer Science 2014-07-03 Marco Rossi , Alexander M. Haimovich , Yonina C. Eldar

Compressive phase retrieval is a popular variant of the standard compressive sensing problem in which the measurements only contain magnitude information. In this paper, motivated by recent advances in deep generative models, we provide…

Machine Learning · Statistics 2021-10-19 Zhaoqiang Liu , Subhroshekhar Ghosh , Jonathan Scarlett

We study the problem of corrupted sensing, a generalization of compressed sensing in which one aims to recover a signal from a collection of corrupted or unreliable measurements. While an arbitrary signal cannot be recovered in the face of…

Information Theory · Computer Science 2014-02-05 Rina Foygel , Lester Mackey

Compressed sensing is a new scheme which shows the ability to recover sparse signal from fewer measurements, using $l_1$ minimization. Recently, Chartrand and Staneva shown in \cite{CS1} that the $l_p$ minimization with $0<p<1$ recovers…

Functional Analysis · Mathematics 2011-03-02 Yi Shen , Song Li

The application of compressive sensing (CS) to structural health monitoring is an emerging research topic. The basic idea in CS is to use a specially-designed wireless sensor to sample signals that are sparse in some basis (e.g. wavelet…

Applications · Statistics 2015-03-31 Yong Huang , James L. Beck , Stephen Wu , Hui Li

Compressed sensing is by now well-established as an effective tool for extracting sparsely distributed information, where sparsity is a discrete concept, referring to the number of dominant nonzero signal components in some basis for the…

Information Theory · Computer Science 2015-06-15 Dinesh Ramasamy , Sriram Venkateswaran , Upamanyu Madhow

Commonly employed reconstruction algorithms in compressed sensing (CS) use the $L_2$ norm as the metric for the residual error. However, it is well-known that least squares (LS) based estimators are highly sensitive to outliers present in…

Information Theory · Computer Science 2013-11-28 Rafael E. Carrillo , Kenneth E. Barner

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

We propose a novel method for compressed sensing recovery using untrained deep generative models. Our method is based on the recently proposed Deep Image Prior (DIP), wherein the convolutional weights of the network are optimized to match…

Compressed sensing was proposed by E. J. Cand\'es, J. Romberg, T. Tao, and D. Donoho for efficient sampling of sparse signals in 2006 and has vast applications in signal processing. The expicit restricted isometry property (RIP) measurement…

Information Theory · Computer Science 2015-05-29 Hao Chen

Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large)…

Information Theory · Computer Science 2013-04-04 Jean Barbier , Florent Krzakala , Marc Mézard , Lenka Zdeborová

In this paper, we provide a new approach to estimating the error of reconstruction from $\Sigma\Delta$ quantized compressed sensing measurements. Our method is based on the restricted isometry property (RIP) of a certain projection of the…

Information Theory · Computer Science 2015-06-19 Joe-Mei Feng , Felix Krahmer

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