Low density frames for compressive sensing

Mehmet Akçakaya, Jinsoo Park, Vahid TarokhICASSP 2010 · OpenReview

Abstract

We consider the compressive sensing of a sparse or compressible signal x ∈ ℝ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</sup> . We explicitly construct a class of measurement matrices, referred to as the low density frames, and develop decoding algorithms that produce an accurate estimate x even in the presence of additive noise. Low density frames are sparse matrices and have small storage requirements. Our decoding algorithms for these frames can be implemented in O(Md <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">v</sub> d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> ) complexity, where d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c</sub> and d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">v</sub> are the row and column weight of the frame respectively. Simulation results are provided, demonstrating that our approach significantly outperforms state-of-the-art recovery algorithms for numerous cases of interest.
BibTeX
@inproceedings{akcakaya2010low,
  author = {Mehmet Akçakaya and Jinsoo Park and Vahid Tarokh},
  title = {{Low density frames for compressive sensing}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2010},
  url = {https://openreview.net/forum?id=GoSO0_9T5w},
}

Loading related content...

Figure