English
Related papers

Related papers: Compressive sensing by white random convolution

200 papers

For wideband spectrum sensing, compressive sensing has been proposed as a solution to speed up the high dimensional signals sensing and reduce the computational complexity. Compressive sensing consists of acquiring the essential information…

Signal Processing · Electrical Eng. & Systems 2018-02-13 Fatima Salahdine , Naima Kaabouch , Hassan El Ghazi

Compressed sensing is a signal processing technique in which data is acquired directly in a compressed form. There are two modeling approaches that can be considered: the worst-case (Hamming) approach and a statistical mechanism, in which…

Information Theory · Computer Science 2016-01-20 Wasim Huleihel , Neri Merhav

An appealing requirement from the well-known diffraction tomography (DT) exists for success reconstruction from few-view and limited-angle data. Inspired by the well-known compressive sensing (CS), the accurate super-resolution…

Computational Engineering, Finance, and Science · Computer Science 2009-04-20 Lianlin Li , Wenji Zhang , Fang Li

It is well known that the performance of sparse vector recovery algorithms from compressive measurements can depend on the distribution underlying the non-zero elements of a sparse vector. However, the extent of these effects has yet to be…

Data Structures and Algorithms · Computer Science 2011-07-18 Bob L. Sturm

Many of the applications of compressed sensing have been based on variable density sampling, where certain sections of the sampling coefficients are sampled more densely. Furthermore, it has been observed that these sampling schemes are…

Information Theory · Computer Science 2015-09-24 Clarice Poon

Adaptive sampling results in dramatic improvements in the recovery of sparse signals in white Gaussian noise. A sequential adaptive sampling-and-refinement procedure called Distilled Sensing (DS) is proposed and analyzed. DS is a form of…

Statistics Theory · Mathematics 2010-05-31 Jarvis Haupt , Rui Castro , Robert Nowak

In this paper we study the reconstruction of binary sparse signals from partial random circulant measurements. We show that the reconstruction via the least-squares algorithm is as good as the reconstruction via the usually used program…

Information Theory · Computer Science 2020-06-29 Sandra Keiper

Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm…

Information Theory · Computer Science 2012-06-05 Yipeng Liu , Ivan Gligorijevic , Vladimir Matic , Maarten De Vos , Sabine Van Huffel

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a limited number of noisy linear measurements is an important problem in compressed sensing. In the high-dimensional setting, it is known that recovery with a…

Information Theory · Computer Science 2012-06-26 Galen Reeves , Michael Gastpar

Compressive Sensing (CS) theory shows that a signal can be decoded from many fewer measurements than suggested by the Nyquist sampling theory, when the signal is sparse in some domain. Most of conventional CS recovery approaches, however,…

Computer Vision and Pattern Recognition · Computer Science 2014-04-30 Jian Zhang , Debin Zhao , Feng Jiang , Wen Gao

Compressed sensing (sparse signal recovery) often encounters nonnegative data (e.g., images). Recently we developed the methodology of using (dense) Compressed Counting for recovering nonnegative K-sparse signals. In this paper, we adopt…

Methodology · Statistics 2014-01-03 Ping Li , Cun-Hui Zhang , Tong Zhang

In compressed sensing, a small number of linear measurements can be used to reconstruct an unknown signal. Existing approaches leverage assumptions on the structure of these signals, such as sparsity or the availability of a generative…

Machine Learning · Statistics 2018-08-02 Manik Dhar , Aditya Grover , Stefano Ermon

Compressed sensing deals with the recovery of sparse signals from linear measurements. Without any additional information, it is possible to recover an $s$-sparse signal using $m \gtrsim s \log(d/s)$ measurements in a robust and stable way.…

Functional Analysis · Mathematics 2016-05-25 Axel Flinth

We study the recovery of sparse vectors from subsampled random convolutions via $\ell_1$-minimization. We consider the setup in which both the subsampling locations as well as the generating vector are chosen at random. For a subgaussian…

Information Theory · Computer Science 2018-03-28 Shahar Mendelson , Holger Rauhut , Rachel Ward

We consider a structured estimation problem where an observed matrix is assumed to be generated as an $s$-sparse linear combination of $N$ given $n\times n$ positive-semidefinite matrices. Recovering the unknown $N$-dimensional and…

Information Theory · Computer Science 2020-03-27 Fabian Jaensch , Peter Jung

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 paper, the design of universal compressive sensing filter based on normal filters including the lowpass, highpass, bandpass, and bandstop filters with different cutoff frequencies (or bandwidth) has been developed to enable signal…

Computational Engineering, Finance, and Science · Computer Science 2008-11-18 Lianlin Li , Wenji Zhang , Yin Xiang , Fang Li

A compressed sensing scheme for near-field imaging of corrugations of relative sparse Fourier components is proposed. The scheme employs random sparse measurement of near field to recover the angular spectrum of the scattered field. It is…

Optics · Physics 2015-05-30 Albert Fannjiang , Hsiao-Chieh Tseng

We consider the problem of reconstructing a sparse signal $x^0\in\R^n$ from a limited number of linear measurements. Given $m$ randomly selected samples of $U x^0$, where $U$ is an orthonormal matrix, we show that $\ell_1$ minimization…

Statistics Theory · Mathematics 2009-11-11 Emmanuel Candes , Justin Romberg

We study the problem of jointly sparse support recovery with 1-bit compressive measurements in a sensor network. Sensors are assumed to observe sparse signals having the same but unknown sparse support. Each sensor quantizes its measurement…

Information Theory · Computer Science 2015-06-02 Vipul Gupta , Bhavya Kailkhura , Thakshila Wimalajeewa , Pramod K. Varshney
‹ Prev 1 3 4 5 6 7 10 Next ›