Document Type
Article
Publication Date
2013
Abstract
The restricted isometry property (RIP) is a well-known matrix condition that provides state-of-the-art reconstruction guarantees for compressed sensing. While random matrices are known to satisfy this property with high probability, deterministic constructions have found less success. In this paper, we consider various techniques for demonstrating RIP deterministically, some popular and some novel, and we evaluate their performance. In evaluating some techniques, we apply random matrix theory and inadvertently find a simple alternative proof that certain random matrices are RIP. Later, we propose a particular class of matrices as candidates for being RIP, namely, equiangular tight frames (ETFs). Using the known correspondence between real ETFs and strongly regular graphs, we investigate certain combinatorial implications of a real ETF being RIP. Specifically, we give probabilistic intuition for a new bound on the clique number of Paley graphs of prime order, and we conjecture that the corresponding ETFs are RIP in a manner similar to random matrices.
DOI
10.1007/s00041-013-9293-2
Source Publication
Journal of Fourier Analysis and Applications
Recommended Citation
Bandeira, A. S., Fickus, M., Mixon, D. G., & Wong, P. (2013). The Road to Deterministic Matrices with the Restricted Isometry Property. Journal of Fourier Analysis and Applications, 19(6), 1123–1149. https://doi.org/10.1007/s00041-013-9293-2
arXiv:1202.1234 [math.FA]
Comments
Copyright statement: © Springer Science+Business Media New York 2013.
The Download button furnishes the preprint as sourced from arXiv:1202.1234.
The version of record for this article is cited below.
Mathematical Reviews (MathSciNet): MR3132908
A read-only copy of the version of record is available to view from the Springer Nature SharedIt program.