English
Related papers

Related papers: Sparse Recovery with Very Sparse Compressed Counti…

200 papers

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

We investigate a power-constrained sensing matrix design problem for a compressed sensing framework. We adopt a mean square error (MSE) performance criterion for sparse source reconstruction in a system where the source-to-sensor channel…

Information Theory · Computer Science 2014-09-29 Amirpasha Shirazinia , Subhrakanti Dey

Compressed sensing and its extensions have recently triggered interest in randomized signal acquisition. A key finding is that random measurements provide sparse signal reconstruction guarantees for efficient and stable algorithms with a…

Information Theory · Computer Science 2014-07-08 Felix Krahmer , Holger Rauhut

Sparse signals (i.e., vectors with a small number of non-zero entries) build the foundation of most kernel (or nullspace) results, uncertainty relations, and recovery guarantees in the sparse signal processing and compressive sensing…

Information Theory · Computer Science 2015-07-13 Christoph Studer

Sparse support recovery arises in many applications in communications and signal processing. Existing methods tackle sparse support recovery problems for a given measurement matrix, and cannot flexibly exploit the properties of sparsity…

Information Theory · Computer Science 2019-10-11 Shuaichao Li , Wanqing Zhang , Ying Cui , Hei Victor Cheng , Wei Yu

In this paper we present a linear programming solution for sign pattern recovery of a sparse signal from noisy random projections of the signal. We consider two types of noise models, input noise, where noise enters before the random…

Information Theory · Computer Science 2015-03-13 V. Saligrama , M. Zhao

We analyze the asymptotic performance of sparse signal recovery from noisy measurements. In particular, we generalize some of the existing results for the Gaussian case to subgaussian and other ensembles. An achievable result is presented…

Information Theory · Computer Science 2009-04-30 Paul Tune , Sibiraj Bhaskaran Pillai , Stephen Hanly

Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all $\boldsymbol{k}$-sparse…

Information Theory · Computer Science 2009-10-18 Robert Calderbank , Stephen Howard , Sina Jafarpour

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

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

In this paper, we consider the problem of sparse signal detection based on partial support set estimation with compressive measurements in a distributed network. Multiple nodes in the network are assumed to observe sparse signals which…

Applications · Statistics 2016-08-10 Thakshila Wimalajeewa , Pramod K. Varshney

Sparse modeling has been widely and successfully used in many applications such as computer vision, machine learning, and pattern recognition. Accompanied with those applications, significant research has studied the theoretical limits and…

Information Theory · Computer Science 2016-10-04 Yuki Itoh , Marco F. Duarte , Mario Parente

This paper considers compressed sensing and affine rank minimization in both noiseless and noisy cases and establishes sharp restricted isometry conditions for sparse signal and low-rank matrix recovery. The analysis relies on a key…

Information Theory · Computer Science 2013-10-23 T. Tony Cai , Anru Zhang

A host of problems involve the recovery of structured signals from a dimensionality reduced representation such as a random projection; examples include sparse signals (compressive sensing) and low-rank matrices (matrix completion). Given…

Information Theory · Computer Science 2012-05-22 Shirin Jalali , Arian Maleki , Richard Baraniuk

We consider compressed sampling over finite fields and investigate the number of compressed measurements needed for successful L0 recovery. Our results are obtained while the sparseness of the sensing matrices as well as the size of the…

Information Theory · Computer Science 2012-11-26 Jin-Taek Seong , Heung-No Lee

In this paper, we consider a compressed sensing problem of reconstructing a sparse signal from an undersampled set of noisy linear measurements. The regularized least squares or least absolute shrinkage and selection operator (LASSO)…

Information Theory · Computer Science 2014-10-30 Chao-Kai Wen , Jun Zhang , Kai-Kit Wong , Jung-Chieh Chen , Chau Yuen

To strike a balance between energy efficiency and data quality control, this paper proposes a sensor censoring scheme for distributed sparse signal recovery via compressive-sensing based wireless sensor networks. In the proposed approach,…

Information Theory · Computer Science 2018-01-16 Jwo-Yuh Wu , Ming-Hsun Yang , Tsang-Yi Wang

Compressive sensing has been receiving a great deal of interest from researchers in many areas because of its ability in speeding up data acquisition. This framework allows fast signal acquisition and compression when signals are sparse in…

Information Theory · Computer Science 2020-03-17 Fatima Salahdine , Elias Ghribi , Naima Kaabouch

Compressed sensing of simultaneously sparse and low-rank matrices enables recovery of sparse signals from a few linear measurements of their bilinear form. One important question is how many measurements are needed for a stable…

Information Theory · Computer Science 2016-07-01 Kiryung Lee , Yihong Wu , Yoram Bresler

We introduce a \emph{batch} version of sparse recovery, where the goal is to report a sequence of vectors $A_1',\ldots,A_m' \in \mathbb{R}^n$ that estimate unknown signals $A_1,\ldots,A_m \in \mathbb{R}^n$ using a few linear measurements,…

Data Structures and Algorithms · Computer Science 2018-07-24 Alexandr Andoni , Lior Kamma , Robert Krauthgamer , Eric Price