Sparse signal recovery using sparse random projections

نویسندگان

  • Wei Wang
  • Kannan Ramchandran
چکیده

Sparse signal recovery using sparse random projections

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

ثبت نام

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

منابع مشابه

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

متن کامل

Sparse Recovery with Very Sparse Compressed Counting

Compressed1 sensing (sparse signal recovery) often encounters nonnegative data (e.g., images). Recently [11] developed the methodology of using (dense) Compressed Counting for recovering nonnegative Ksparse signals. In this paper, we adopt very sparse Compressed Counting for nonnegative signal recovery. Our design matrix is sampled from a maximally-skewed α-stable distribution (0 < α < 1), and ...

متن کامل

Compressed Sensing with Very Sparse Gaussian Random Projections

We study the use of very sparse random projections [12, 11] for compressed sensing (sparse signal recovery) when the nonzero coordinates of signals can be either positive or negative. In our setting, the entries of a Gaussian design matrix are randomly sparsified so that only a very small fraction of entries are nonzero. Our proposed decoding algorithm is simple and efficient in that the major ...

متن کامل

Machine Learning and Non-Negative Compressive Sampling

The new emerging theory of compressive sampling demonstrates that by exploiting the structure of a signal, it is possible to sample a signal below the Nyquist rate—using random projections—and achieve perfect reconstruction. In this paper, we consider a special case of compressive sampling where the uncompressed signal is non-negative, and propose a number of sparse recovery algorithms—which ut...

متن کامل

Chirp Sensing Codes: Deterministic Compressed Sensing Measurements for Fast Recovery

Compressed sensing is a novel technique to acquire sparse signals with few measurements. Normally, compressed sensing uses random projections as measurements. Here we design deterministic measurements and an algorithm to accomplish signal recovery with computational efficiently. A measurement matrix is designed with chirp sequences forming the columns. Chirps are used since an efficient method ...

متن کامل

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


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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009