English
Related papers

Related papers: Recovery analysis for weighted mixed $\ell_2/\ell_…

200 papers

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

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

We study the recovery conditions of weighted $\ell_1$ minimization for real-valued signal reconstruction from phaseless compressive sensing measurements when partial support information is available. A strong restricted isometry property…

Information Theory · Computer Science 2017-12-14 Zhiyong Zhou , Jun Yu

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

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

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

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

Compressed sensing shows that a sparse signal can stably be recovered from incomplete linear measurements. But, in practical applications, some signals have additional structure, where the nonzero elements arise in some blocks. We call such…

Information Theory · Computer Science 2023-11-29 Jianwen Huang , Hailin Wang , Feng Zhang , Jianjun Wang , Jinping Jia

This paper establishes a sharp condition on the restricted isometry property (RIP) for both the sparse signal recovery and low-rank matrix recovery. It is shown that if the measurement matrix $A$ satisfies the RIP condition…

Information Theory · Computer Science 2013-02-07 T. Tony Cai , Anru Zhang

In this paper we study the recovery conditions of weighted $l_{1}$ minimization for signal reconstruction from incomplete linear measurements when partial prior support information is available. We obtain that a high order RIP condition can…

Information Theory · Computer Science 2016-03-14 Wengu Chen , Yaling Li

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 constrained $\ell_p^p/\ell_q^p$ ratio model is scale invariant and is therefore attractive for sparse signal recovery. However, its nonconvex, nonsmooth, and fractional structure makes a unified theoretical and algorithmic analysis…

Optimization and Control · Mathematics 2026-05-26 Lang Yu , Nan-jing Huang

This paper concentrates on the recovery of block-sparse signals, which is not only sparse but also nonzero elements are arrayed into some blocks (clusters) rather than being arbitrary distributed all over the vector, from linear…

Information Theory · Computer Science 2020-06-12 Jianwen Huang , Xinling Liu , Jinyao Hou , Jianjun Wang

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

The Restricted Isometry Property (RIP) is a fundamental property of a matrix enabling sparse recovery. Informally, an m x n matrix satisfies RIP of order k in the l_p norm if ||Ax||_p \approx ||x||_p for any vector x that is k-sparse, i.e.,…

Data Structures and Algorithms · Computer Science 2014-04-29 Piotr Indyk , Ilya Razenshteyn

We study the problem of recovering a block-sparse signal from under-sampled observations. The non-zero values of such signals appear in few blocks, and their recovery is often accomplished using a $\ell_{1,2}$ optimization problem. In…

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

The restricted isometry property (RIP) has become well-known in the compressed sensing community. Recently, a weaken version of RIP was proposed for exact sparse recovery under weak moment assumptions. In this note, we prove that the weaken…

Information Theory · Computer Science 2015-04-02 Hui Zhang

We consider the problem of recovering sparse vectors from underdetermined linear measurements via $\ell_p$-constrained basis pursuit. Previous analyses of this problem based on generalized restricted isometry properties have suggested that…

Information Theory · Computer Science 2015-04-21 Sjoerd Dirksen , Guillaume Lecué , Holger Rauhut

In this paper, we consider the recovery of block sparse signals, whose nonzero entries appear in blocks (or clusters) rather than spread arbitrarily throughout the signal, from incomplete linear measurement. A high order sufficient…

Information Theory · Computer Science 2016-10-21 Wengu Chen , Yaling Li

We derived the first sparse recovery guarantees for weighted $\ell_1$ minimization with sparse random matrices and the class of weighted sparse signals, using a weighted versions of the null space property to derive these guarantees. These…

Numerical Analysis · Mathematics 2016-05-10 Bubacarr Bah
‹ Prev 1 2 3 10 Next ›