CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

D Needell, JA Tropp - Applied and computational harmonic analysis, 2009 - Elsevier
Compressive sampling offers a new paradigm for acquiring signals that are compressible
with respect to an orthonormal basis. The major algorithmic challenge in compressive …

Convolutional sparse support estimator-based COVID-19 recognition from X-ray images

M Yamac, M Ahishali, A Degerli… - … on Neural Networks …, 2021 - ieeexplore.ieee.org
Coronavirus disease (COVID-19) has been the main agenda of the whole world ever since it
came into sight. X-ray imaging is a common and easily accessible tool that has great …

Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting

MJ Wainwright - IEEE transactions on information theory, 2009 - ieeexplore.ieee.org
The problem of sparsity pattern or support set recovery refers to estimating the set of
nonzero coefficients of an unknown vector beta* isin Ropf p based on a set of n noisy …

Energy efficient coded random access for the wireless uplink

SS Kowshik, K Andreev, A Frolov… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
We discuss the problem of designing channel access architectures for enabling fast, low-
latency, grant-free, and uncoordinated uplink for densely packed wireless nodes …

Instance-optimal compressed sensing via posterior sampling

A Jalal, S Karmalkar, AG Dimakis, E Price - arXiv preprint arXiv …, 2021 - arxiv.org
We characterize the measurement complexity of compressed sensing of signals drawn from
a known prior distribution, even when the support of the prior is the entire space (rather than …

The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact

G Reeves, HD Pfister - 2016 IEEE International Symposium on …, 2016 - ieeexplore.ieee.org
This paper considers the fundamental limit of compressed sensing for iid signal distributions
and iid Gaussian measurement matrices. Its main contribution is a rigorous characterization …

Support recovery with sparsely sampled free random matrices

AM Tulino, G Caire, S Verdú… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
Consider a Bernoulli-Gaussian complex n-vector whose components are V i= X i B i, with X
i~ CN (0, P x) and binary B i mutually independent and iid across i. This random q-sparse …

Information theoretic bounds for compressed sensing

S Aeron, V Saligrama, M Zhao - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
In this paper, we derive information theoretic performance bounds to sensing and
reconstruction of sparse phenomena from noisy projections. We consider two settings …

Energy efficient random access for the quasi-static fading MAC

SS Kowshik, K Andreev, A Frolov… - … on Information Theory …, 2019 - ieeexplore.ieee.org
We discuss the problem of designing channel access architectures for enabling fast, low-
latency, grant-free and uncoordinated uplink for densely packed wireless nodes …

Optimal phase transitions in compressed sensing

Y Wu, S Verdú - IEEE Transactions on Information Theory, 2012 - ieeexplore.ieee.org
Compressed sensing deals with efficient recovery of analog signals from linear encodings.
This paper presents a statistical study of compressed sensing by modeling the input signal …