English
Related papers

Related papers: Batch Sparse Recovery, or How to Leverage the Aver…

200 papers

Motivated by the well-known Papoulis-Gerchberg algorithm, an iterative thresholding algorithm for recovery of sparse signals from few observations is proposed. The sequence of iterates turns out to be similar to that of the thresholded…

Information Theory · Computer Science 2009-02-13 M. H. Kayvanrad , D. Zonoobi , A. A. Kassim

In this paper a new result of recovery of sparse vectors from deterministic and noisy measurements by l1 minimization is given. The sparse vector is randomly chosen and follows a generic p-sparse model introduced by Candes and al. The main…

Optimization and Control · Mathematics 2012-12-04 Charles Dossal , Rémi Tesson

Multistage design has been used in a wide range of scientific fields. By allocating sensing resources adaptively, one can effectively eliminate null locations and localize signals with a smaller study budget. We formulate a…

Methodology · Statistics 2024-06-17 Weinan Wang , Bowen Gang , Wenguang Sun

The choice of the sensing matrix is crucial in compressed sensing. Random Gaussian sensing matrices satisfy the restricted isometry property, which is crucial for solving the sparse recovery problem using convex optimization techniques.…

Signal Processing · Electrical Eng. & Systems 2023-12-29 Kartheek Kumar Reddy Nareddy , Abijith Jagannath Kamath , Chandra Sekhar Seelamantula

A {\em universal 1-bit compressive sensing (CS)} scheme consists of a measurement matrix $A$ such that all signals $x$ belonging to a particular class can be approximately recovered from $\textrm{sign}(Ax)$. 1-bit CS models extreme…

Information Theory · Computer Science 2022-05-19 Sidhant Bansal , Arnab Bhattacharyya , Anamay Chaturvedi , Jonathan Scarlett

We consider compressed sensing of block-sparse signals, i.e., sparse signals that have nonzero coefficients occuring in clusters. Based on an uncertainty relation for block-sparse signals, we define a block-coherence measure and we show…

Information Theory · Computer Science 2008-12-02 Yonina C. Eldar , Helmut Bolcskei

Sparse representations have emerged as a powerful tool in signal and information processing, culminated by the success of new acquisition and processing techniques such as Compressed Sensing (CS). Fusion frames are very rich new signal…

Information Theory · Computer Science 2011-06-20 Petros T. Boufounos , Gitta Kutyniok , Holger Rauhut

Regularization plays an important role in solving ill-posed problems by adding extra information about the desired solution, such as sparsity. Many regularization terms usually involve some vector norm, e.g., $L_1$ and $L_2$ norms. In this…

Numerical Analysis · Mathematics 2021-03-10 Weihong Guo , Yifei Lou , Jing Qin , Ming Yan

One-bit compressed sensing (1bCS) is an extremely quantized signal acquisition method that has been proposed and studied rigorously in the past decade. In 1bCS, linear samples of a high dimensional signal are quantized to only one bit per…

Information Theory · Computer Science 2022-11-01 Namiko Matsumoto , Arya Mazumdar , Soumyabrata Pal

We consider the problem of recovering fusion frame sparse signals from incomplete measurements. These signals are composed of a small number of nonzero blocks taken from a family of subspaces. First, we show that, by using a-priori…

Information Theory · Computer Science 2014-07-30 Ulaş Ayaz , Sjoerd Dirksen , Holger Rauhut

This work addresses the robust reconstruction problem of a sparse signal from compressed measurements. We propose a robust formulation for sparse reconstruction which employs the $\ell_1$-norm as the loss function for the residual error and…

Information Theory · Computer Science 2017-03-30 Fei Wen , Yuan Yang , Ling Pei , Wenxian Yu , Peilin Liu

This paper investigates total variation minimization in one spatial dimension for the recovery of gradient-sparse signals from undersampled Gaussian measurements. Recently established bounds for the required sampling rate state that uniform…

Information Theory · Computer Science 2022-04-12 Martin Genzel , Maximilian März , Robert Seidel

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

This paper studies the problem of support recovery of sparse signals based on multiple measurement vectors (MMV). The MMV support recovery problem is connected to the problem of decoding messages in a Single-Input Multiple-Output (SIMO)…

Information Theory · Computer Science 2011-09-12 Yuzhe Jin , Bhaskar D. Rao

Affine phase retrieval is the problem of recovering signals from the magnitude-only measurements with a priori information. In this paper, we use the $\ell_1$ minimization to exploit the sparsity of signals for affine phase retrieval,…

Information Theory · Computer Science 2022-09-20 Meng Huang , Shixiang Sun , Zhiqiang Xu

In this paper, we study the sample complexity and develop efficient optimal algorithms for 1-bit phase retrieval: recovering a signal $\mathbf{x}\in\mathbb{R}^n$ from $m$ phaseless bits…

Information Theory · Computer Science 2025-12-18 Junren Chen , Ming Yuan

One-bit compressed sensing (1bCS) is a method of signal acquisition under extreme measurement quantization that gives important insights on the limits of signal compression and analog-to-digital conversion. The setting is also equivalent to…

Information Theory · Computer Science 2021-05-12 Larkin Flodin , Venkata Gandikota , Arya Mazumdar

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li

While most existing sparse recovery results allow only minimal structure within the measurement scheme, many practical problems possess significant structure. To address this gap, we present a framework for structured measurements that are…

Information Theory · Computer Science 2025-07-28 Timm Gilles , Hartmut Führ

Weighted $\ell_1$-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In…

Information Theory · Computer Science 2016-12-09 Deanna Needell , Rayan Saab , Tina Woolf