English
Related papers

Related papers: Phaseless compressive sensing using partial suppor…

200 papers

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

The goal of phaseless compressed sensing is to recover an unknown sparse or approximately sparse signal from the magnitude of its measurements. However, it does not take advantage of any support information of the original signal.…

Information Theory · Computer Science 2022-05-18 Haiye Huo

We study the recovery of sparse signals from underdetermined linear measurements when a potentially erroneous support estimate is available. Our results are twofold. First, we derive necessary and sufficient conditions for signal recovery…

Information Theory · Computer Science 2014-12-05 Hassan Mansour , Rayan Saab

In this paper we address the recovery conditions of weighted $\ell_p$ minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that weighted $\ell_p$ minimization…

Information Theory · Computer Science 2013-11-18 Navid Ghadermarzy , Hassan Mansour , Ozgur Yilmaz

Weighted $\ell_1$-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In…

Information Theory · Computer Science 2016-12-09 Deanna Needell , Rayan Saab , Tina Woolf

The aim of this paper is to build up the theoretical framework for the recovery of sparse signals from the magnitude of the measurement. We first investigate the minimal number of measurements for the success of the recovery of sparse…

Information Theory · Computer Science 2013-10-07 Yang Wang , Zhiqiang Xu

In this paper, we study the support recovery conditions of weighted $\ell_1$ minimization for signal reconstruction from compressed sensing measurements when multiple support estimate sets with different accuracy are available. We identify…

Information Theory · Computer Science 2012-06-01 Hassan Mansour , Ozgur Yilmaz

We study the recovery conditions of weighted mixed $\ell_2/\ell_p\,(0<p\leq 1)$ minimization for block sparse signal reconstruction from compressed measurements when partial block support information is available. We show that the block…

Information Theory · Computer Science 2017-10-19 Zhiyong Zhou , Jun Yu

In this paper, we introduce a weighted $\ell_2/\ell_1$ minimization to recover block sparse signals with arbitrary prior support information. When partial prior support information is available, a sufficient condition based on the high…

Information Theory · Computer Science 2017-06-30 Wengu Chen , Huanmin Ge

The aim of this paper is to study the stability of the $\ell_1$ minimization for the compressive phase retrieval and to extend the instance-optimality in compressed sensing to the real phase retrieval setting. We first show that the…

Functional Analysis · Mathematics 2016-01-12 Bing Gao , Yang Wang , Zhiqiang Xu

Model-based compressed sensing refers to compressed sensing with extra structure about the underlying sparse signal known a priori. Recent work has demonstrated that both for deterministic and probabilistic models imposed on the signal,…

Information Theory · Computer Science 2015-09-07 Sidhant Misra , Pablo A. Parrilo

In this paper we study the compressed sensing problem of recovering a sparse signal from a system of underdetermined linear equations when we have prior information about the probability of each entry of the unknown signal being nonzero. In…

Information Theory · Computer Science 2009-01-20 M. Amin Khajehnejad , Weiyu Xu , Salman Avestimehr , Babak Hassibi

Numerical experiments in literature on compressed sensing have indicated that the reweighted $l_1$ minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for…

Information Theory · Computer Science 2014-06-17 Shenglong Zhou , Naihua Xiu , Yingnan Wang , Lingchen Kong

It is well known that $\ell_1$ minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio between the system dimensions,…

Information Theory · Computer Science 2010-04-06 M. Amin Khajehnejad , Weiyu Xu , Salman Avestimehr , Babak Hassibi

We study the stable recovery of complex $k$-sparse signals from as few phaseless measurements as possible. The main result is to show that one can employ $\ell_1$ minimization to stably recover complex $k$-sparse signals from $m\geq O(k\log…

Functional Analysis · Mathematics 2019-11-27 Yu Xia , Zhiqiang Xu

We investigate conditions for the unique recoverability of sparse integer-valued signals from a small number of linear measurements. Both the objective of minimizing the number of nonzero components, the so-called $\ell_0$-norm, as well as…

Information Theory · Computer Science 2019-09-18 Jan-Hendrik Lange , Marc E. Pfetsch , Bianca M. Seib , Andreas M. Tillmann

In this work, we consider the problem of recovering analysis-sparse signals from under-sampled measurements when some prior information about the support is available. We incorporate such information in the recovery stage by suitably tuning…

Information Theory · Computer Science 2019-01-30 Sajad Daei , Farzan Haddadi , Arash Amini

Signal reconstruction is a crucial aspect of compressive sensing. In weighted cases, there are two common types of weights. In order to establish a unified framework for handling various types of weights, the sparse function is introduced.…

Classical Analysis and ODEs · Mathematics 2024-10-10 Xiaotong Liu , Yiyu Liang

This paper study recovery conditions of weighted L1 minimization for signal reconstruction from compressed sensing measurements. A sufficient condition for exact recovery by using the general weighted L1 minimization is derived, which…

Information Theory · Computer Science 2015-09-29 Jun Zhang , Urbashi Mitra , Kuan-Wen Huang , Nicolo Michelusi

$\ell_1$ minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity (the size of the support set), under which with high probability a sparse signal…

Information Theory · Computer Science 2011-03-17 Weiyu Xu , Ao Tang
‹ Prev 1 2 3 10 Next ›