A sublinear algorithm for sparse reconstruction with ℓ2/ ℓ2 recovery guarantees

Journal Article

Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Candès and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all k-sparse signals. This property holds with overwhelming probability if the entries of the matrix are generated by an iid Gaussian or Bernoulli process. There has been significant recent interest in an alternative signal processing framework; exploiting deterministic sensing matrices that with overwhelming probability act as a near isometry on k-sparse vectors with uniformly random support, a geometric condition that is called the Statistical Restricted Isometry Property or StRIP. This paper considers a family of deterministic sensing matrices satisfying the StRIP that are based on Delsarte-Goethals Codes codes (binary chirps) and a k-sparse reconstruction algorithm with sublinear complexity. In the presence of stochastic noise in the data domain, this paper derives bounds on the ℓ2 accuracy of approximation in terms of the ℓ2 norm of the measurement noise and the accuracy of the best k-sparse approximation, also measured in the ℓ2 norm. This type of ℓ2/ℓ2 bound is tighter than the standard ℓ2/ℓ1 or ℓ1/ℓ1 bounds. © 2009 IEEE.

Full Text

Duke Authors

Cited Authors

  • Calderbank, R; Howard, S; Jafarpour, S

Published Date

  • December 1, 2009

Published In

  • Camsap 2009 2009 3rd Ieee International Workshop on Computational Advances in Multi Sensor Adaptive Processing

Start / End Page

  • 209 - 212

Digital Object Identifier (DOI)

  • 10.1109/CAMSAP.2009.5413298

Citation Source

  • Scopus