English
Related papers

Related papers: Improved Coherence Index-Based Bound in Compressiv…

200 papers

Many practical sensing applications involve multiple sensors simultaneously acquiring measurements of a single object. Conversely, most existing sparse recovery guarantees in compressed sensing concern only single-sensor acquisition…

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

This paper investigates two parameters that measure the coherence of a frame: worst-case and average coherence. We first use worst-case and average coherence to derive near-optimal probabilistic guarantees on both sparse signal detection…

Functional Analysis · Mathematics 2018-03-06 Waheed U. Bajwa , Robert Calderbank , Dustin G. Mixon

Compressive sensing (CS) is a promising technology for realizing energy-efficient wireless sensors for long-term health monitoring. However, conventional model-driven CS frameworks suffer from limited compression ratio and reconstruction…

Machine Learning · Computer Science 2016-12-19 Kai Xu , Yixing Li , Fengbo Ren

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 work considers recovery of signals that are sparse over two bases. For instance, a signal might be sparse in both time and frequency, or a matrix can be low rank and sparse simultaneously. To facilitate recovery, we consider minimizing…

Information Theory · Computer Science 2012-02-17 Samet Oymak , Babak Hassibi

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 aims to undersample certain high-dimensional signals, yet accurately reconstruct them by exploiting signal characteristics. Accurate reconstruction is possible when the object to be recovered is sufficiently sparse in a…

Information Theory · Computer Science 2015-05-13 David L. Donoho , Arian Maleki , Andrea Montanari

Compressive Sensing (CS) is a new paradigm for the efficient acquisition of signals that have sparse representation in a certain domain. Traditionally, CS has provided numerous methods for signal recovery over an orthonormal basis. However,…

Information Theory · Computer Science 2019-05-08 Jianchen Zhu , Shengjie Zhao , Qingjiang Shi , Gonzalo R. Arce

Compressed Sensing (CS) is an appealing framework for applications such as Magnetic Resonance Imaging (MRI). However, up-to-date, the sensing schemes suggested by CS theories are made of random isolated measurements, which are usually…

Information Theory · Computer Science 2016-06-14 Claire Boyer , Jérémie Bigot , Pierre Weiss

We demonstrate that a sparse signal can be estimated from the phase of complex random measurements, in a "phase-only compressive sensing" (PO-CS) scenario. With high probability and up to a global unknown amplitude, we can perfectly recover…

Information Theory · Computer Science 2020-11-13 Laurent Jacques , Thomas Feuillen

In this work we address the problem of blindly reconstructing compressively sensed signals by exploiting the co-sparse analysis model. In the analysis model it is assumed that a signal multiplied by an analysis operator results in a sparse…

Information Theory · Computer Science 2013-03-27 Julian Wörmann , Simon Hawe , Martin Kleinsteuber

Compressive sensing (CS) can effectively recover a signal when it is sparse in some discrete atoms. However, in some applications, signals are sparse in a continuous parameter space, e.g., frequency space, rather than discrete atoms.…

Signal Processing · Electrical Eng. & Systems 2018-08-30 Tianyao Huang , Yimin Liu , Huadong Meng , Xiqin Wang

In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is…

Information Theory · Computer Science 2012-11-22 Mohammad Golbabaee , Pierre Vandergheynst

Radio interferometry has always faced the problem of incomplete sampling of the Fourier plane. A possible remedy can be found in the promising new theory of compressed sensing (CS), which allows for the accurate recovery of sparse signals…

Instrumentation and Methods for Astrophysics · Physics 2015-12-22 Clara Fannjiang

Sparse coding in learned dictionaries has been established as a successful approach for signal denoising, source separation and solving inverse problems in general. A dictionary learning method adapts an initial dictionary to a particular…

Machine Learning · Statistics 2012-10-18 Christian D. Sigg , Tomas Dikk , Joachim M. Buhmann

In this paper, we study the problem of compressed sensing using binary measurement matrices and $\ell_1$-norm minimization (basis pursuit) as the recovery algorithm. We derive new upper and lower bounds on the number of measurements to…

Machine Learning · Statistics 2020-04-28 Mahsa Lotfi , Mathukumalli Vidyasagar

Blind Compressed Sensing (BCS) is an extension of Compressed Sensing (CS) where the optimal sparsifying dictionary is assumed to be unknown and subject to estimation (in addition to the CS sparse coefficients). Since the emergence of BCS,…

Information Theory · Computer Science 2015-08-11 Mohammad Aghagolzadeh , Hayder Radha

Compressed sensing (CS) provides an elegant framework for recovering sparse signals from compressed measurements. For example, CS can exploit the structure of natural images and recover an image from only a few random measurements. CS is…

Machine Learning · Computer Science 2019-05-21 Yan Wu , Mihaela Rosca , Timothy Lillicrap

In many compressive sensing problems today, the relationship between the measurements and the unknowns could be nonlinear. Traditional treatment of such nonlinear relationships have been to approximate the nonlinearity via a linear model…

Information Theory · Computer Science 2013-02-12 Henrik Ohlsson , Allen Y. Yang , Roy Dong , Michel Verhaegen , S. Shankar Sastry

We consider the compressive sensing of a sparse or compressible signal ${\bf x} \in {\mathbb R}^M$. We explicitly construct a class of measurement matrices, referred to as the low density frames, and develop decoding algorithms that produce…

Information Theory · Computer Science 2009-03-05 Mehmet Akçakaya , Jinsoo Park , Vahid Tarokh