English
Related papers

Related papers: Compressed Sensing off the Grid

200 papers

This letter investigates the joint recovery of a frequency-sparse signal ensemble sharing a common frequency-sparse component from the collection of their compressed measurements. Unlike conventional arts in compressed sensing, the…

Information Theory · Computer Science 2015-06-22 Zhenqi Lu , Rendong Ying , Sumxin Jiang , Peilin Liu , Wenxian Yu

Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is…

Information Theory · Computer Science 2015-07-24 Yuanxin Li , Yuejie Chi

Compressed sensing is a technique for recovering an unknown sparse signal from a small number of linear measurements. When the measurement matrix is random, the number of measurements required for perfect recovery exhibits a phase…

Optimization and Control · Mathematics 2016-12-30 Mateo Díaz , Mauricio Junca , Felipe Rincón , Mauricio Velasco

Compressed Sensing (CS) is an effective approach to reduce the required number of samples for reconstructing a sparse signal in an a priori basis, but may suffer severely from the issue of basis mismatch. In this paper we study the problem…

Information Theory · Computer Science 2014-02-04 Yuejie Chi

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

Information Theory · Computer Science 2015-05-18 Dmitry Malioutov , Sujay Sanghavi , Alan Willsky

Recent research in off-the-grid compressed sensing (CS) has demonstrated that, under certain conditions, one can successfully recover a spectrally sparse signal from a few time-domain samples even though the dictionary is continuous. In…

Information Theory · Computer Science 2013-12-03 Weiyu Xu , Jian-Feng Cai , Kumar Vijay Mishra , Myung Cho , Anton Kruger

This paper establishes a nearly optimal algorithm for estimating the frequencies and amplitudes of a mixture of sinusoids from noisy equispaced samples. We derive our algorithm by viewing line spectral estimation as a sparse recovery…

Information Theory · Computer Science 2013-04-02 Gongguo Tang , Badri Narayan Bhaskar , Benjamin Recht

Many empirical studies suggest that samples of continuous-time signals taken at locations randomly deviated from an equispaced grid (i.e., off-the-grid) can benefit signal acquisition, e.g., undersampling and anti-aliasing. However,…

Information Theory · Computer Science 2025-09-10 Oscar López , Özgür Yılmaz

Atomic norm minimization is a convex optimization framework to recover point sources from a subset of their low-pass observations, or equivalently the underlying frequencies of a spectrally-sparse signal. When the amplitudes of the sources…

Information Theory · Computer Science 2021-02-24 Maxime Ferreira Da Costa , Yuejie Chi

Efficient estimation of wideband spectrum is of great importance for applications such as cognitive radio. Recently, sub-Nyquist sampling schemes based on compressed sensing have been proposed to greatly reduce the sampling rate. However,…

Signal Processing · Electrical Eng. & Systems 2018-05-23 Haoyu Fu , Yuejie Chi

In some applications of frequency estimation, the frequencies of multiple sinusoids are required to be estimated from sub-Nyquist sampling sequences. In this paper, we propose a novel method based on subspace techniques to estimate the…

Information Theory · Computer Science 2016-01-05 Shan Huang , Hong Sun , Haijian Zhang , Lei Yu

The line spectral estimation problem consists in recovering the frequencies of a complex valued time signal that is assumed to be sparse in the spectral domain from its discrete observations. Unlike the gridding required by the classical…

Information Theory · Computer Science 2021-10-18 Maxime Ferreira Da Costa , Wei Dai

The theory of Compressed Sensing, the emerging sampling paradigm 'that goes against the common wisdom', asserts that 'one can recover signals in Rn from far fewer samples or measurements, if the signal has a sparse representation in some…

Information Theory · Computer Science 2013-11-01 Ankit Kundu , Pradosh K. Roy

The use of multichannel data in line spectral estimation (or frequency estimation) is common for improving the estimation accuracy in array processing, structural health monitoring, wireless communications, and more. Recently proposed…

Information Theory · Computer Science 2018-10-15 Zai Yang , Jinhui Tang , Yonina C. Eldar , Lihua Xie

Frequency recovery/estimation from discrete samples of superimposed sinusoidal signals is a classic yet important problem in statistical signal processing. Its research has recently been advanced by atomic norm techniques which exploit…

Information Theory · Computer Science 2016-05-31 Zai Yang , Lihua Xie

A heuristic procedure based on novel recursive formulation of sinusoid (RFS) and on regression with predictive least-squares (LS) enables to decompose both uniformly and nonuniformly sampled 1-d signals into a sparse set of sinusoids (SSS).…

Information Theory · Computer Science 2017-04-13 Ivan Maric

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

Compressed sensing is a theory which guarantees the exact recovery of sparse signals from a small number of linear projections. The sampling schemes suggested by current compressed sensing theories are often of little practical relevance…

Information Theory · Computer Science 2014-07-22 Jérémie Bigot , Claire Boyer , Pierre Weiss

We consider the problem of recovering a single or multiple frequency-sparse signals, which share the same frequency components, from a subset of regularly spaced samples. The problem is referred to as continuous compressed sensing (CCS) in…

Information Theory · Computer Science 2014-10-24 Zai Yang , Lihua Xie

We consider the problem of recovering the superposition of $R$ distinct complex exponential functions from compressed non-uniform time-domain samples. Total Variation (TV) minimization or atomic norm minimization was proposed in the…

Information Theory · Computer Science 2017-11-07 Weiyu Xu , Jirong Yi , Soura Dasgupta , Jian-Feng Cai , Mathews Jacob , Myung Cho
‹ Prev 1 2 3 10 Next ›