Supplementary Material: Efficient Algorithms for Robust One-bit Compressive Sensing
نویسندگان
چکیده
We consider the following general optimization problem min x2≤1 −x ⊤ y + γx 1. (15) Before we proceed, we need the following lemma. Lemma 6. The solution to the optimization problem min x 1 2 (x − y) 2 + γ|x| is given by P γ (y) = 0, if |y| ≤ γ; sign(y)(|y| − γ), otherwise. where P γ (·) is the soft-thresholding operator defined in (7) (Donoho, 1995).
منابع مشابه
One-Bit Compressive Sensing with Partial Support Information
This work develops novel algorithms for incorporating prior-support information into the field of One-Bit Compressed Sensing. Traditionally, Compressed Sensing is used for acquiring high-dimensional signals from few linear measurements. In applications, it is often the case that we have some knowledge of the structure of our signal(s) beforehand, and thus we would like to leverage it to attain ...
متن کاملEfficient Algorithms for Robust One-bit Compressive Sensing
While the conventional compressive sensing assumes measurements of infinite precision, onebit compressive sensing considers an extreme setting where each measurement is quantized to just a single bit. In this paper, we study the vector recovery problem from noisy one-bit measurements, and develop two novel algorithms with formal theoretical guarantees. First, we propose a passive algorithm, whi...
متن کاملNon-convex Penalties with Analytical Solutions for One-bit Compressive Sensing
One-bit measurements widely exist in the real world and can be used to recover sparse signals. This task is known as one-bit compressive sensing (1bit-CS). In this paper, we propose novel algorithms based on both convex and nonconvex sparsity-inducing penalties for robust 1bit-CS. We consider the dual problem, which has only one variable and provides a sufficient condition to verify whether a s...
متن کاملOne-Bit Compressive Sensing of Dictionary-Sparse Signals
One-bit compressive sensing has extended the scope of sparse recovery by showing that sparse signals can be accurately reconstructed even when their linear measurements are subject to the extreme quantization scenario of binary samples—only the sign of each linear measurement is maintained. Existing results in one-bit compressive sensing rely on the assumption that the signals of interest are s...
متن کاملRobust 1-bit Compressive Sensing via Gradient Support Pursuit
This paper studies a formulation of 1-bit Compressive Sensing (CS) problem based on the maximum likelihood estimation framework. In order to solve the problem we apply the recently proposed Gradient Support Pursuit algorithm, with a minor modification. Assuming the proposed objective function has a Stable Restricted Hessian, the algorithm is shown to accurately solve the 1-bit CS problem. Furth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014