Stable recovery of sparse signals via lp-minimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stable Recovery of Sparse Signals via $l_p-$Minimization

In this paper, we show that, under the assumption that ‖e‖2 ≤ ǫ, every k−sparse signal x ∈ R can be stably (ǫ 6= 0) or exactly recovered (ǫ = 0) from y = Ax+ e via lp−mnimization with p ∈ (0, p̄], where

متن کامل

Recovery of High-Dimensional Sparse Signals via l1-Minimization

We consider the recovery of high-dimensional sparse signals via l 1 -minimization under mutual incoherence condition, which is shown to be sufficient for sparse signals recovery in the noiseless and noise cases. We study both l 1 -minimization under the l 2 constraint and the Dantzig selector. Using the two l 1 -minimization methods and a technical inequality, some results are obtained. They im...

متن کامل

On recovery of sparse signals via l1 minimization

This article considers constrained l1 minimization methods for the recovery of high dimensional sparse signals in three settings: noiseless, bounded error and Gaussian noise. A unified and elementary treatment is given in these noise settings for two l1 minimization methods: the Dantzig selector and l1 minimization with an l2 constraint. The results of this paper improve the existing results in...

متن کامل

On Recovery of Sparse Signals via ℓ1 Minimization

This paper considers constrained minimization methods in a unified framework for the recovery of high-dimensional sparse signals in three settings: noiseless, bounded error, and Gaussian noise. Both minimization with an constraint (Dantzig selector) and minimization under an constraint are considered. The results of this paper improve the existing results in the literature by weakening the cond...

متن کامل

Exact and stable recovery of sequences of signals with sparse increments via differential [subscript 1]- minimization

We consider the problem of recovering a sequence of vectors, (xk)k=0, for which the increments xk−xk−1 are Sk-sparse (with Sk typically smaller than S1), based on linear measurements (yk = Akxk + ek)k=1, where Ak and ek denote the measurement matrix and noise, respectively. Assuming each Ak obeys the restricted isometry property (RIP) of a certain order—depending only on Sk—we show that in the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied and Computational Harmonic Analysis

سال: 2015

ISSN: 1063-5203

DOI: 10.1016/j.acha.2014.06.003