English
Related papers

Related papers: Simultaneous Sparse Recovery and Blind Demodulatio…

200 papers

This paper introduces recovery thresholding hyperinterpolations, a novel class of methods for sparse signal reconstruction in the presence of noise. We develop a framework that integrates thresholding operators--including hard thresholding,…

Numerical Analysis · Mathematics 2025-07-25 Congpei An , Jiashu Ran

This article presents novel results concerning the recovery of signals from undersampled data in the common situation where such signals are not sparse in an orthonormal basis or incoherent dictionary, but in a truly redundant dictionary.…

Numerical Analysis · Mathematics 2015-03-17 Emmanuel J. Candes , Yonina C. Eldar , Deanna Needell , Paige Randall

Recovering a sparse signal from its low-pass projections in the Fourier domain is a problem of broad interest in science and engineering and is commonly referred to as super-resolution. In many cases, however, Fourier domain may not be the…

Information Theory · Computer Science 2019-02-20 Ayush Bhandari , Yonina C. Eldar

In this paper, we study the missing sample recovery problem using methods based on sparse approximation. In this regard, we investigate the algorithms used for solving the inverse problem associated with the restoration of missed samples of…

Machine Learning · Statistics 2017-06-29 Amirhossein Javaheri , Hadi Zayyani , Farokh Marvasti

Multipath propagation is a common phenomenon in wireless communication. Knowledge of propagation path parameters such as complex channel gain, propagation delay or angle-of-arrival provides valuable information on the user position and…

Information Theory · Computer Science 2016-03-18 Christian Steffens , Yang Yang , Marius Pesavento

We study the problem of recovering sparse signals from compressed linear measurements. This problem, often referred to as sparse recovery or sparse reconstruction, has generated a great deal of interest in recent years. To recover the…

Methodology · Statistics 2016-01-01 Jian Wang , Ping Li

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

Phaseless diffraction measurements recorded by a CCD detector are often affected by Poisson noise. In this paper, we propose a dictionary learning model by employing patches based sparsity to denoise Poisson phaseless measurement. The model…

Optimization and Control · Mathematics 2019-06-10 Huibin Chang , Stefano Marchesini

Super-resolution theory aims to estimate the discrete components lying in a continuous space that constitute a sparse signal with optimal precision. This work investigates the potential of recent super-resolution techniques for spectral…

Information Theory · Computer Science 2016-11-24 M. Ferreira Da Costa , W. Dai

This note considers the unstructured sparse recovery problems in a general form. Examples include rational approximation, spectral function estimation, Fourier inversion, Laplace inversion, and sparse deconvolution. The main challenges are…

Numerical Analysis · Mathematics 2024-03-11 Lexing Ying

Dictionary learning is a challenge topic in many image processing areas. The basic goal is to learn a sparse representation from an overcomplete basis set. Due to combining the advantages of generic multiscale representations with learning…

Computer Vision and Pattern Recognition · Computer Science 2017-04-17 Rui Chen , Huizhu Jia , Xiaodong Xie , Wen Gao

In this paper, we study the problem of recovering two unknown signals from their convolution, which is commonly referred to as blind deconvolution. Reformulation of blind deconvolution as a low-rank recovery problem has led to multiple…

Information Theory · Computer Science 2023-03-20 Julia Kostin , Felix Krahmer , Dominik Stöger

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 standard approach to compressive sampling considers recovering an unknown deterministic signal with certain known structure, and designing the sub-sampling pattern and recovery algorithm based on the known structure. This approach…

Information Theory · Computer Science 2016-02-03 Yen-Huan Li , Volkan Cevher

We consider composite linear inverse problems where the signal to recover is modeled as a sum of two functions. We study a variational framework formulated as an optimization problem over the pairs of components using two regularization…

Optimization and Control · Mathematics 2026-05-25 Adrian Jarret , Julien Fageot

This article considers recovery of signals that are sparse or approximately sparse in terms of a (possibly) highly overcomplete and coherent tight frame from undersampled data corrupted with additive noise. We show that the properly…

Information Theory · Computer Science 2013-09-10 Junhong Lin , Song Li

We address the recovery of sparse vectors in an overcomplete, linear and noisy multiple measurement framework, where the measurement matrix is known upto a permutation of its rows. We derive sparse Bayesian learning (SBL) based updates for…

Information Theory · Computer Science 2018-02-05 Ranjitha Prasad

We investigate the sparse recovery problem of reconstructing a high-dimensional non-negative sparse vector from lower dimensional linear measurements. While much work has focused on dense measurement matrices, sparse measurement schemes are…

Information Theory · Computer Science 2009-02-25 M. Amin Khajehnejad , Alexandros G. Dimakis , Weiyu Xu , Babak Hassibi

This paper discusses the recovery of an unknown signal $x\in \mathbb{R}^L$ through the result of its convolution with an unknown filter $h \in \mathbb{R}^L$. This problem, also known as blind deconvolution, has been studied extensively by…

Information Theory · Computer Science 2017-09-28 Augustin Cosse

In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a method for obtaining sparse solutions of underdetermined systems of linear equations, and its applications…

Information Theory · Computer Science 2009-11-13 Hossein Mohimani , Massoud Babaie-Zadeh , Christian Jutten