Deterministic matrices with the restricted isometry property

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 8138, Issue , 2011, Pages

  Fickus, Matthew ^a   Mixon, Dustin G ^b  

^a AIR FORCE INSTITUTE OF TECHNOLOGY   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

compressed sensing; deterministic constructions; restricted isometry property

Indexed keywords

COMPRESSED SENSING; DETERMINISTIC CONSTRUCTIONS; HIGH PROBABILITY; RESTRICTED ISOMETRY PROPERTY; STATE OF THE ART;

SIGNAL RECONSTRUCTION;

MATRIX ALGEBRA;

EID: 80055039365     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.895080     Document Type: Conference Paper

References (15)

1. L. Applebaum, S.D. Howard, S. Searle and R. Calderbank, Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery, Appl. Comp. Harmon. Anal. 26 (2009) 283-290.
2. R. Baraniuk, M. Davenport, R. DeVore and M. Wakin, A simple proof of the restricted isometry property for random matrices, Constr. Approx. 28 (2008) 253-263.
3. J. Bourgain, S. Dilworth, K. Ford, S. Konyagin and D. Kutzarova, Explicit constructions of RIP matrices and related problems, Duke Math. J. 159 (2011) 145-185.
4. E.J. Candès and T. Tao, Decoding by linear programming, IEEE Trans. Inform. Theory 44 (2005) 4203-4215. (Pubitemid 41800353)
5. M.A. Davenport, M.F. Duarte, Y.C. Eldar and G. Kutyniok, Introduction to compressed sensing, in: Compressed sensing: Theory and applications, Y.C. Eldar and G. Kutyniok, eds., Cambridge University Press, 2011.
6. R.A. DeVore, Deterministic constructions of compressed sensing matrices, J. Complexity 23 (2007) 918-925. (Pubitemid 350122965)
7. D.L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization, Proc. Nat. Acad. Sci. USA 100 (2003) 2197-2202. (Pubitemid 36297476)
8. M. Fickus, D.G. Mixon and J.C. Tremain, Steiner equiangular tight frames, submitted, arXiv:1009.5730.
9. S. Gerschgorin, Über die Abgrenzung der Eigenwerte einer Matrix, Izv. Akad. Nauk. USSR Otd. Fiz.-Mat. 7 (1931) 749-754.
10. B.K. Natarajan, Sparse approximate solutions to linear systems, SIAM J. Comput. 24 (1995) 227-234.
11. M. Rudelson and R. Vershynin, On sparse reconstruction from Fourier and Gaussian measurements, Comm. Pure Appl. Math. 61 (2008) 1025-1045.
12. J.J. Seidel, A survey of two-graphs, in: Proc. Intern. Coll. Teorie Combinatorie (1973) 481-511.
13. T. Strohmer and R.W. Heath, Grassmannian frames with applications to coding and communication, Appl. Comp. Harmon. Anal. 14 (2003) 257-275.
14. L.R. Welch, Lower bounds on the maximum cross correlation of signals, IEEE Trans. Inform. Theory 20 (1974) 397-399.
15. P. Xia, S. Zhou and G.B Giannakis, Achieving the Welch bound with difference sets, IEEE Trans. Inform. Theory 51 (2005) 1900-1907. (Pubitemid 40654465)