Optimal deterministic compressed sensing matrices.
Lists
Only you see this
Abstract
We present the first deterministic measurement matrix construction with an order-optimal number of rows for sparse signal reconstruction. This improves the measurements required in prior constructions and addresses a known open problem in the theory of sparse signal recovery. Our construction uses adjacency matrices of bipartite graphs that have large girth. The main result is that girth (the length of the shortest cycle in the graph) can be used as a certificate that a measurement matrix can recover almost all sparse signals. Specifically, our matrices guarantee recovery “for-each” sparse signal under basis pursuit. Our techniques are coding theoretic and rely on a recent connection of compressed sensing to LP relaxations for channel decoding.
BibTeX
@inproceedings{tehrani2013optimal,
author = {Arash Saber Tehrani and Alexandros G. Dimakis and Giuseppe Caire},
title = {{Optimal deterministic compressed sensing matrices.}},
booktitle = {ICASSP},
year = {2013},
url = {https://openreview.net/forum?id=9mCSNMiJUa7},
}Loading related content...