Hierarchical Recovery in Compressive Sensing

نویسندگان

  • Charles J. Colbourn
  • Daniel Horsley
  • Violet R. Syrotiuk
چکیده

A combinatorial approach to compressive sensing based on a deterministic column replacement technique is proposed. Informally, it takes as input a pattern matrix and ingredient measurement matrices, and results in a larger measurement matrix by replacing elements of the pattern matrix with columns from the ingredient matrices. This hierarchical technique yields great flexibility in sparse signal recovery. Specifically, recovery for the resulting measurement matrix does not depend on any fixed algorithm but rather on the recovery scheme of each ingredient matrix. In this paper, we investigate certain trade-offs for signal recovery, considering the computational investment required. Coping with noise in signal recovery requires additional conditions, both on the pattern matrix and on the ingredient measurement matrices. Index Terms compressive sensing, hierarchical signal recovery, deterministic column replacement, hash families

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

ثبت نام

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

منابع مشابه

Simultaneous Sparse Approximation and Common Component Extraction using Fast Distributed Compressive Sensing

Simultaneous sparse approximation is a generalization of the standard sparse approximation, for simultaneously representing a set of signals using a common sparsity model. Generalizing the compressive sensing concept to the simultaneous sparse approximation yields distributed compressive sensing (DCS). DCS finds the sparse representation of multiple correlated signals using the common + innovat...

متن کامل

WSNs Data Acquisition by Combining Hierarchical Routing Method and Compressive Sensing

We address the problem of data acquisition in large distributed wireless sensor networks (WSNs). We propose a method for data acquisition using the hierarchical routing method and compressive sensing for WSNs. Only a few samples are needed to recover the original signal with high probability since sparse representation technology is exploited to capture the similarities and differences of the o...

متن کامل

q-ary Compressive Sensing

We introduce q-ary compressive sensing, an extension of 1-bit compressive sensing. We propose a novel sensing mechanism and a corresponding recovery procedure. The recovery properties of the proposed approach are analyzed both theoretically and empirically. Results in 1-bit compressive sensing are recovered as a special case. Our theoretical results suggest a tradeoff between the quantization p...

متن کامل

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

Bayesian compressive sensing for cluster structured sparse signals

In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. Other than sparse prior, structures on the sparse pattern of the signal have also been used as an additional prior, called modelbased compressive sensing, such as clustered structure and tree structure on wavelet coeff...

متن کامل

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


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

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

ثبت نام

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

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

دوره abs/1403.1835  شماره 

صفحات  -

تاریخ انتشار 2014