English
Related papers

Related papers: Sparsity in time-frequency representations

200 papers

With the aim of measuring the sparsity of a real signal, Donoho and Logan introduced the concept of maximum Nyquist density, and used it to extend Bombieri's principle of the large sieve to bandlimited functions. This led to several…

Functional Analysis · Mathematics 2017-02-28 Luis Daniel Abreu , Michael Speckbacher

The problem of super-resolution compressive sensing (SR-CS) is crucial for various wireless sensing and communication applications. Existing methods often suffer from limited resolution capabilities and sensitivity to hyper-parameters,…

Signal Processing · Electrical Eng. & Systems 2025-08-12 Yufan Zhou , Jingyi Li , Wenkang Xu , An Liu

We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of…

Numerical Analysis · Computer Science 2009-01-08 Wei Dai , Olgica Milenkovic

Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on…

Information Theory · Computer Science 2009-11-26 Ali Hormati , Amin Karbasi , Soheil Mohajer , Martin Vetterli

Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large)…

Information Theory · Computer Science 2013-04-04 Jean Barbier , Florent Krzakala , Marc Mézard , Lenka Zdeborová

We develop fast and memory efficient numerical methods for learning functions of many variables that admit sparse representations in terms of general bounded orthonormal tensor product bases. Such functions appear in many applications…

Numerical Analysis · Mathematics 2020-05-11 Bosu Choi , Mark Iwen , Felix Krahmer

In compressed sensing one measures sparse signals directly in a compressed form via a linear transform and then reconstructs the original signal. However, it is often the case that the linear transform itself is known only approximately, a…

Information Theory · Computer Science 2013-11-13 Florent Krzakala , Marc Mézard , Lenka Zdeborová

Compressed sensing is a signal processing technique whereby the limits imposed by the Shannon--Nyquist theorem can be exceeded provided certain conditions are imposed on the signal. Such conditions occur in many real-world scenarios, and…

Information Theory · Computer Science 2018-02-16 Fintan Hegarty , Padraig Ó Catháin , Yunbin Zhao

We propose a simple and efficient time-series clustering framework particularly suited for low Signal-to-Noise Ratio (SNR), by simultaneous smoothing and dimensionality reduction aimed at preserving clustering information. We extend the…

Machine Learning · Computer Science 2015-10-20 Tom Hope , Avishai Wagner , Or Zuk

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

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

This paper exploits recent developments in compressive sensing (CS) to efficiently perform the direction finding via amplitude comprarison. The new method is proposed based on unimodal characteristic of antenna pattern and sparse property…

Information Theory · Computer Science 2010-06-25 Ruiming Yang , Yipeng Liu , Qun Wan , Wanlin Yang

The sparse signal recovery in the standard compressed sensing (CS) problem requires that the sensing matrix be known a priori. Such an ideal assumption may not be met in practical applications where various errors and fluctuations exist in…

Information Theory · Computer Science 2015-06-03 Zai Yang , Cishen Zhang , Lihua Xie

The achievable and converse regions for sparse representation of white Gaussian noise based on an overcomplete dictionary are derived in the limit of large systems. Furthermore, the marginal distribution of such sparse representations is…

Information Theory · Computer Science 2017-02-13 Ori Shental

We study the support recovery problem for compressed sensing, where the goal is to reconstruct the a high-dimensional $K$-sparse signal $\mathbf{x}\in\mathbb{R}^N$, from low-dimensional linear measurements with and without noise. Our key…

Information Theory · Computer Science 2018-02-27 Xiao Li , Dong Yin , Sameer Pawar , Ramtin Pedarsani , Kannan Ramchandran

Wideband spectrum sensing detects the unused spectrum holes for dynamic spectrum access (DSA). Too high sampling rate is the main problem. Compressive sensing (CS) can reconstruct sparse signal with much fewer randomized samples than…

Information Theory · Computer Science 2012-04-16 Yipeng Liu , Qun Wan

A new framework of compressive sensing (CS), namely statistical compressive sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribution and achieving accurate reconstruction on average, is…

Computer Vision and Pattern Recognition · Computer Science 2010-10-22 Guoshen Yu , Guillermo Sapiro

Wideband spectrum sensing is a critical component of a functioning cognitive radio system. Its major challenge is the too high sampling rate requirement. Compressive sensing (CS) promises to be able to deal with it. Nearly all the current…

Information Theory · Computer Science 2011-06-21 Yipeng Liu , Qun Wan

Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical…

Statistics Theory · Mathematics 2015-06-05 Ahmed A. Quadeer , Tareq Y. Al-Naffouri

Detection of a signal under noise is a classical signal processing problem. When monitoring spatial phenomena under a fixed budget, i.e., either physical, economical or computational constraints, the selection of a subset of available…

Signal Processing · Electrical Eng. & Systems 2018-08-01 Mario Coutino , Sundeep Prabhakar Chepuri , Geert Leus
‹ Prev 1 3 4 5 6 7 10 Next ›