CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Compressive sampling offers a new paradigm for acquiring signals that are compressible
with respect to an orthonormal basis. The major algorithmic challenge in compressive …
with respect to an orthonormal basis. The major algorithmic challenge in compressive …
Convolutional sparse support estimator-based COVID-19 recognition from X-ray images
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 …
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 …
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
We discuss the problem of designing channel access architectures for enabling fast, low-
latency, grant-free, and uncoordinated uplink for densely packed wireless nodes …
latency, grant-free, and uncoordinated uplink for densely packed wireless nodes …
Instance-optimal compressed sensing via posterior sampling
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 …
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 …
and iid Gaussian measurement matrices. Its main contribution is a rigorous characterization …
Support recovery with sparsely sampled free random matrices
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 …
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
In this paper, we derive information theoretic performance bounds to sensing and
reconstruction of sparse phenomena from noisy projections. We consider two settings …
reconstruction of sparse phenomena from noisy projections. We consider two settings …
Energy efficient random access for the quasi-static fading MAC
We discuss the problem of designing channel access architectures for enabling fast, low-
latency, grant-free and uncoordinated uplink for densely packed wireless nodes …
latency, grant-free and uncoordinated uplink for densely packed wireless nodes …
Optimal phase transitions in compressed sensing
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 …
This paper presents a statistical study of compressed sensing by modeling the input signal …