Recovery of Binary Sparse Signals From Compressed Linear Measurements via Polynomial Optimization

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

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

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

منابع مشابه

Sparse Signal Recovery from Nonadaptive Linear Measurements

The theory of Compressed Sensing , the emerging sampling paradigm ‘that goes against the common wisdom’ , asserts that ‘one can recover signals in R from far fewer samples or measurements , if the signal has a sparse representation in some orthonormal basis, from m ≈ O(klogn), k ≪ n nonadaptive measurements . The accuracy of the recovered signal is as good as that attainable with direct knowled...

متن کامل

Pruning-Based Sparse Recovery for Electrocardiogram Reconstruction from Compressed Measurements

Due to the necessity of the low-power implementation of newly-developed electrocardiogram (ECG) sensors, exact ECG data reconstruction from the compressed measurements has received much attention in recent years. Our interest lies in improving the compression ratio (CR), as well as the ECG reconstruction performance of the sparse signal recovery. To this end, we propose a sparse signal reconstr...

متن کامل

Recovery of Clustered Sparse Signals from Compressive Measurements

We introduce a new signal model, called (K,C)-sparse, to capture K-sparse signals in N dimensions whose nonzero coefficients are contained within at most C clusters, with C < K ≪ N . In contrast to the existing work in the sparse approximation and compressive sensing literature on block sparsity, no prior knowledge of the locations and sizes of the clusters is assumed. We prove that O (K + C lo...

متن کامل

Stochastic Recovery Of Sparse Signals From Random Measurements

Sparse signal recovery from a small number of random measurements is a well known NP-hard to solve combinatorial optimization problem, with important applications in signal and image processing. The standard approach to the sparse signal recovery problem is based on the basis pursuit method. This approach requires the solution of a large convex optimization problem, and therefore suffers from h...

متن کامل

Performance Analysis of Joint-Sparse Recovery from Multiple Measurements and Prior Information via Convex Optimization

We address the problem of compressed sensing with multiple measurement vectors associated with prior information in order to better reconstruct an original sparse matrix signal. l2,1− l2,1 minimization is used to emphasize co-sparsity property and similarity between matrix signal and prior information. We then derive the necessary and sufficient condition of successfully reconstructing the orig...

متن کامل

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


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

ژورنال

عنوان ژورنال: IEEE Signal Processing Letters

سال: 2019

ISSN: 1070-9908,1558-2361

DOI: 10.1109/lsp.2019.2919943