On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions

We present a general class of compressed sensing matrices which are then demonstrated to have associated sublinear-time sparse approximation algorithms. We then develop methods for constructing specialized matrices from this class which are sparse when multiplied with a discrete Fourier transform ma...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on matrix analysis and applications 2012-01, Vol.33 (1), p.263-289
Hauptverfasser:	Bailey, J., Iwen, M. A., Spencer, C. V.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied mathematics Approximation Competition Design optimization Fourier transforms
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!