English
Related papers

Related papers: Stable and robust $\ell_p$-constrained compressive…

200 papers

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 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

The sparse signal recovery in the standard compressed sensing (CS) problem requires that the sensing matrix be known a priori. Such an ideal assumption may not be met in practical applications where various errors and fluctuations exist in…

Information Theory · Computer Science 2015-06-03 Zai Yang , Cishen Zhang , Lihua Xie

Parallel acquisition systems are employed successfully in a variety of different sensing applications when a single sensor cannot provide enough measurements for a high-quality reconstruction. In this paper, we consider compressed sensing…

Information Theory · Computer Science 2023-08-31 Il Yong Chun , Ben Adcock

Compressed sensing seeks to invert an underdetermined linear system by exploiting additional knowledge of the true solution. Over the last decade, several instances of compressed sensing have been studied for various applications, and for…

Information Theory · Computer Science 2014-08-20 Jameson Cahill , Dustin G. Mixon

Compressed sensing (CS) shows that a signal having a sparse or compressible representation can be recovered from a small set of linear measurements. In classical CS theory, the sampling matrix and representation matrix are assumed to be…

Information Theory · Computer Science 2015-07-03 Yipeng Liu

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

Compressed sensing is a new scheme which shows the ability to recover sparse signal from fewer measurements, using $l_1$ minimization. Recently, Chartrand and Staneva shown in \cite{CS1} that the $l_p$ minimization with $0<p<1$ recovers…

Functional Analysis · Mathematics 2011-03-02 Yi Shen , Song Li

Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for the acquisition of sparse or compressible signals that can be well approximated by just K << N elements from an N-dimensional basis. Instead of taking periodic…

Information Theory · Computer Science 2016-11-17 Richard G. Baraniuk , Volkan Cevher , Marco F. Duarte , Chinmay Hegde

The application of compressive sensing (CS) to structural health monitoring is an emerging research topic. The basic idea in CS is to use a specially-designed wireless sensor to sample signals that are sparse in some basis (e.g. wavelet…

Applications · Statistics 2015-03-31 Yong Huang , James L. Beck , Stephen Wu , Hui Li

Random sampling in compressive sensing (CS) enables the compression of large amounts of input signals in an efficient manner, which is useful for many applications. CS reconstructs the compressed signals exactly with overwhelming…

Information Theory · Computer Science 2016-03-22 Dongeun Lee , Rafael Lima , Jaesik Choi

$\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

Compressed Sensing (CS) seeks to recover an unknown vector with $N$ entries by making far fewer than $N$ measurements; it posits that the number of compressed sensing measurements should be comparable to the information content of the…

Information Theory · Computer Science 2010-04-29 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner

Recently, Cahill and Mixon completely characterized the sensing operators in many compressed sensing instances with a robust width property. The proposed property allows uniformly stable and robust reconstruction of certain solutions from…

Information Theory · Computer Science 2016-04-05 Hui Zhang

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 study the $\ell_p$-analysis optimization ($0<p\leq1$) problem for cosparse signal recovery. We establish a bound for recovery error via the restricted $p$-isometry property over any subspace. We further prove that the…

Information Theory · Computer Science 2018-08-28 Shubao Zhang , Hui Qian , Xiaojin Gong , Jianying Zhou

Compressed sensing deals with the reconstruction of sparse signals using a small number of linear measurements. One of the main challenges in compressed sensing is to find the support of a sparse signal. In the literature, several bounds on…

Information Theory · Computer Science 2009-11-26 Ali Hormati , Amin Karbasi , Soheil Mohajer , Martin Vetterli

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 paper introduces a framework for the recoverability analysis in compressive sensing for imaging applications such as CI cameras, rapid MRI and coded apertures. This is done using the fact that the Spherical Section Property (SSP) of a…

Information Theory · Computer Science 2012-12-07 Mahdi S. Hosseini , Konstantinos N. Plataniotis

In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is…

Information Theory · Computer Science 2012-11-22 Mohammad Golbabaee , Pierre Vandergheynst
‹ Prev 1 2 3 10 Next ›