English
Related papers

Related papers: Dictionary-Sparse Recovery From Heavy-Tailed Measu…

200 papers

Sparse linear regression with ill-conditioned Gaussian random designs is widely believed to exhibit a statistical/computational gap, but there is surprisingly little formal evidence for this belief, even in the form of examples that are…

Data Structures and Algorithms · Computer Science 2022-03-08 Jonathan A. Kelner , Frederic Koehler , Raghu Meka , Dhruv Rohatgi

In this paper we present a new algorithm for compressive sensing that makes use of binary measurement matrices and achieves exact recovery of ultra sparse vectors, in a single pass and without any iterations. Due to its noniterative nature,…

Information Theory · Computer Science 2018-05-22 Mahsa Lotfi , Mathukumalli Vidyasagar

Classical results in sparse recovery guarantee the exact reconstruction of $s$-sparse signals under assumptions on the dictionary that are either too strong or NP-hard to check. Moreover, such results may be pessimistic in practice since…

Information Theory · Computer Science 2019-04-04 Mengnan Zhao , M. Devrim Kaba , René Vidal , Daniel P. Robinson , Enrique Mallada

We consider two theorems from the theory of compressive sensing. Mainly a theorem concerning uniform recovery of random sampling matrices, where the number of samples needed in order to recover an $s$-sparse signal from linear measurements…

Information Theory · Computer Science 2013-06-05 Joel Andersson , Jan-Olov Strömberg

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li

We consider the problem of estimating the support of a vector $\beta^* \in \mathbb{R}^{p}$ based on observations contaminated by noise. A significant body of work has studied behavior of $\ell_1$-relaxations when applied to measurement…

Machine Learning · Statistics 2008-05-21 Dapo Omidiran , Martin J. Wainwright

We consider the recovery of sparse signals subject to sparse interference, as introduced in Studer et al., IEEE Trans. IT, 2012. We present novel probabilistic recovery guarantees for this framework, covering varying degrees of knowledge of…

Information Theory · Computer Science 2012-09-27 Graeme Pope , Annina Bracher , Christoph Studer

Signals sparse in a transformation domain can be recovered from a reduced set of randomly positioned samples by using compressive sensing algorithms. Simple re- construction algorithms are presented in the first part of the paper. The…

Information Theory · Computer Science 2015-12-08 Ljubisa Stankovic , Isidora Stankovic

In the problem of multiple support recovery, we are given access to linear measurements of multiple sparse samples in $\mathbb{R}^{d}$. These samples can be partitioned into $\ell$ groups, with samples having the same support belonging to…

Information Theory · Computer Science 2022-05-25 Lekshmi Ramesh , Chandra R. Murthy , Himanshu Tyagi

This paper develops new theory and algorithms to recover signals that are approximately sparse in some general dictionary (i.e., a basis, frame, or over-/incomplete matrix) but corrupted by a combination of interference having a sparse…

Information Theory · Computer Science 2013-09-06 Christoph Studer , Richard G. Baraniuk

We consider the problem of sparse signal recovery from noisy measurements. Many of frequently used recovery methods rely on some sort of tuning depending on either noise or signal parameters. If no estimates for either of them are…

Information Theory · Computer Science 2020-10-20 Hendrik Bernd Petersen , Peter Jung

We consider the problem of exact support recovery of sparse signals via noisy measurements. The main focus is the sufficient and necessary conditions on the number of measurements for support recovery to be reliable. By drawing an analogy…

Information Theory · Computer Science 2010-03-04 Yuzhe Jin , Young-Han Kim , Bhaskar D. Rao

We study high-dimensional signal recovery from non-linear measurements with design vectors having elliptically symmetric distribution. Special attention is devoted to the situation when the unknown signal belongs to a set of low statistical…

Statistics Theory · Mathematics 2016-11-14 Larry Goldstein , Stanislav Minsker , Xiaohan Wei

This article presents new results concerning the recovery of a signal from magnitude only measurements where the signal is not sparse in an orthonormal basis but in a redundant dictionary. To solve this phaseless problem, we analyze the $…

Numerical Analysis · Mathematics 2016-06-03 Bing Gao

In this paper, we consider the problem of recovering a sparse signal from noisy linear measurements using the so called LASSO formulation. We assume a correlated Gaussian design matrix with additive Gaussian noise. We precisely analyze the…

Statistics Theory · Mathematics 2020-09-18 Ayed M. Alrashdi , Houssem Sifaou , Abla Kammoun , Mohamed-Slim Alouini , Tareq Y. Al-Naffouri

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via multiplicative…

Information Theory · Computer Science 2010-11-12 Nam Yul Yu

In this paper we study recovery conditions of weighted $\ell_1$ minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that if at least 50% of the (partial) support…

Information Theory · Computer Science 2011-07-26 Michael P. Friedlander , Hassan Mansour , Rayan Saab , Ozgur Yilmaz

In many areas of imaging science, it is difficult to measure the phase of linear measurements. As such, one often wishes to reconstruct a signal from intensity measurements, that is, perform phase retrieval. In several applications the…

Information Theory · Computer Science 2015-06-16 Afonso S. Bandeira , Dustin G. Mixon

In compressed sensing, a small number of linear measurements can be used to reconstruct an unknown signal. Existing approaches leverage assumptions on the structure of these signals, such as sparsity or the availability of a generative…

Machine Learning · Statistics 2018-08-02 Manik Dhar , Aditya Grover , Stefano Ermon

In compressed sensing, one wishes to acquire an approximately sparse high-dimensional signal $x\in\mathbb{R}^n$ via $m\ll n$ noisy linear measurements, then later approximately recover $x$ given only those measurement outcomes. Various…

Information Theory · Computer Science 2016-06-07 Tom Morgan , Jelani Nelson
‹ Prev 1 3 4 5 6 7 10 Next ›