Two are better than one: Fundamental parameters of frame coherence

Applied and Computational Harmonic Analysis

Volumn 33, Issue 1, 2012, Pages 58-78

  Bajwa, Waheed U ^a   Calderbank, Robert ^b,c   Mixon, Dustin G ^c  

^a RUTGERS UNIVERSITY   (United States)

^b Duke University   (United States)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

Average coherence; Frames; Sparse signal processing; Welch bound; Worst case coherence

Indexed keywords

A-FRAMES; FRAMES; FUNDAMENTAL PARAMETERS; LOWER BOUNDS; PROBABILISTIC GUARANTEES; SPECTRAL NORMS; TIGHT FRAME; TWO PARAMETER; WELCH BOUNDS;

HARMONIC ANALYSIS; MATHEMATICAL TECHNIQUES;

SIGNAL PROCESSING;

EID: 84860378304     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2011.09.005     Document Type: Article

References (56)

1. W. Alltop Complex sequences with low periodic correlations IEEE Trans. Inform. Theory 26 1980 350 354
2. N. Alon Problems and results in extremal combinatorics - I Discrete Math. 273 2003 31 53
3. N. Alon, and J.H. Spencer The Probabilistic Method second ed. 2000 Wiley New York
4. W.U. Bajwa, New information processing theory and methods for exploiting sparsity in wireless systems, Ph.D. thesis, University of Wisconsin-Madison, 2009.
5. W.U. Bajwa, R. Calderbank, and S. Jafarpour Why Gabor frames? Two fundamental measures of coherence and their role in model selection J. Commun. Netw. 12 2010 289 307
6. R. Baraniuk, M. Davenport, R.A. DeVore, and M.B. Wakin A simple proof of the restricted isometry property for random matrices Constr. Approx. 28 2008 253 263
7. J.J. Benedetto, and J.D. Kolesar Geometric properties of Grassmannian frames for R 2 and R 3 EURASIP J. Appl. Signal Process. 2006 2006 Article ID 49850, pp. 1-17, doi:10.1155/ASP/2006/49850
8. G. Bennett Probability inequalities for the sum of independent random variables J. Amer. Statist. Assoc. 57 1962 33 45
9. E.R. Berlekamp The weight enumerators for certain subcodes of the second order binary Reed-Muller codes Inform. Control 17 1970 485 500
10. E.J. Candès, Y. Eldar, D. Needell, and P. Randall Compressed sensing with coherent and redundant dictionaries Appl. Comput. Harmon. Anal. 31 2010 59 73
11. E.J. Candès, and Y. Plan Near-ideal model selection by ℓ 1 minimization Ann. Statist. 37 2009 2145 2177
12. E.J. Candès, J. Romberg, and T. Tao Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inform. Theory 52 2006 489 509 (Pubitemid 43174093)
13. E.J. Candès, and T. Tao Decoding by linear programming IEEE Trans. Inform. Theory 51 2005 4203 4215 (Pubitemid 41800353)
14. E.J. Candès, and T. Tao Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inform. Theory 52 2006 5406 5425 (Pubitemid 46445381)
15. B.G. Bodmann, and P.G. Casazza The road to equal-norm Parseval frames J. Funct. Anal. 258 2010 397 420
16. P.G. Casazza, and M. Fickus Fourier transforms of finite chirps EURASIP J. Appl. Signal Process. 2006 2006 Article ID 70204, pp. 1-7, doi:10.1155/ASP/2006/70204
17. S.S. Chen, D.L. Donoho, and M.A. Saunders Atomic decomposition by basis pursuit SIAM J. Sci. Comput. 20 1998 33 61 (Pubitemid 128689501)
18. J.H. Conway, R.H. Hardin, and N.J.A. Sloane Packing lines, planes, etc.: Packings in Grassmannian spaces Experiment. Math. 5 1996 139 159
19. M.A. Davenport, P.T. Boufounos, M.B. Wakin, and R.G. Baraniuk Signal processing with compressive measurements IEEE J. Select. Topics Signal Process. 4 2010 445 460
20. D.L. Donoho, and M. Elad Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization Proc. Natl. Acad. Sci. USA 100 2003 2197 2202 (Pubitemid 36297476)
21. D.L. Donoho, M. Elad, and V.N. Temlyakov Stable recovery of sparse overcomplete representations in the presence of noise IEEE Trans. Inform. Theory 52 2006 6 18 (Pubitemid 43263116)
22. D.L. Donoho, and J. Tanner Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing Philos. Trans. R. Soc. Ser. A 367 2009 4273 4293
23. M. Elad, and A.M. Bruckstein A generalized uncertainty principle and sparse representation in pairs of bases IEEE Trans. Inform. Theory 48 2002 2558 2567 (Pubitemid 35032680)
24. M. Fickus, D.G. Mixon, and J.C. Tremain Steiner equiangular tight frames arXiv:1009.5730v1
25. R. Gribonval, M. Nielsen, Sparse representations in unions of bases, Technical Report 1499, Institut de Recherche en Informatique et Systèmes Aléatoires, 2002, 15 pp.
26. J. Haupt, W.U. Bajwa, G. Raz, and R. Nowak Toeplitz compressed sensing matrices with applications to sparse channel estimation IEEE Trans. Inform. Theory 56 2010 5862 5875
27. J. Haupt, R. Nowak, Compressive sampling for signal detection, in: Proc. IEEE Int. Conf. Acoust. Speech Signal Process., 2007, pp. 1509-1512.
28. A. Hayashi, T. Hashimoto, and M. Horibe Reexamination of optimal quantum state estimation of pure states Phys. Rev. A 72 2005 5 pp
29. M.A. Herman, and T. Strohmer High-resolution radar via compressed sensing IEEE Trans. Signal Process. 57 2009 2275 2284
30. W. Hoeffding Probability inequalities for sums of bounded random variables J. Amer. Statist. Assoc. 58 1963 13 30
31. R.B. Holmes, and V.I. Paulsen Optimal frames for erasures Linear Algebra Appl. 377 2004 31 51
32. D. Hsu, S. Kakade, J. Langford, and T. Zhang Multi-label prediction via compressed sensing Proc. Adv. Neural Inf. Process. Syst. 2009 772 780
33. S.M. Kay Fundamentals of Statistical Signal Processing: Detection Theory 1998 Prentice-Hall Upper Saddle River
34. B. Laurent, and P. Massart Adaptive estimation of a quadratic functional by model selection Ann. Statist. 28 2000 1302 1338 (Pubitemid 33244915)
35. J. Lawrence, G.E. Pfander, and D. Walnut Linear independence of Gabor systems in finite dimensional vector spaces J. Fourier Anal. Appl. 11 2005 715 726 (Pubitemid 43022793)
36. Y. Mimura A construction of spherical 2-designs Graphs Combin. 6 1990 369 372
37. D.G. Mixon, C. Quinn, N. Kiyavash, M. Fickus, Equiangular tight frame fingerprinting codes, in: Proc. IEEE Int. Conf. Acoust. Speech Signal Process., 2011, pp. 1856-1859, doi:10.1109/ICASSP.2011.5946867.
38. K. Mukkavilli, A. Sabharwal, E. Erkip, and B.A. Aazhang On beam-forming with finite rate feedback in multiple antenna systems IEEE Trans. Inform. Theory 49 2003 2562 2579
39. J. Nelson, and V.N. Temlyakov On the size of incoherent systems J. Approx. Theory 163 2011 1238 1245
40. G.E. Pfander, H. Rauhut, and J. Tanner Identification of matrices having a sparse representation IEEE Trans. Signal Process. 56 2008 5376 5388
41. M. Rudelson, R. Vershynin, Non-asymptotic theory of random matrices: Extreme singular values, in: Proc. Int. Congr. Math., 2010, 25 pp.
42. M. Rudelson, and R. Vershynin On sparse reconstruction from Fourier and Gaussian measurements Comm. Pure Appl. Math. 61 2008 1025 1045
43. A.J. Scott, and M. Grassl Symmetric informationally complete positive-operator-valued measures: A new computer study J. Math. Phys. 51 2010 16 pp
44. J.J. Seidel, A survey of two-graphs, in: Proc. Int. Coll. Teorie Combin., 1973, pp. 481-511.
45. J.J. Seidel Strongly regular graphs with (- 1, 1, 0) adjacency matrix having eigenvalue 3 Linear Algebra Appl. 1 1968 281 298
46. T. Strohmer, and R.W. Heath Grassmannian frames with applications to coding and communication Appl. Comput. Harmon. Anal. 14 2003 257 275
47. J.A. Tropp Greed is good: Algorithmic results for sparse approximation IEEE Trans. Inform. Theory 50 2004 2231 2242
48. J.A. Tropp Just relax: convex programming methods for identifying sparse signals in noise IEEE Trans. Inform. Theory 52 2006 1030 1051 (Pubitemid 46444890)
49. J.A. Tropp Norms of random submatrices and sparse approximation C. R. Acad. Sci. 346 2008 1271 1274
50. J.A. Tropp On the conditioning of random subdictionaries Appl. Comput. Harmon. Anal. 25 2008 1 24 (Pubitemid 351721018)
51. J.H. van Lint, and J.J. Seidel Equilateral point sets in elliptic geometry Indag. Math. 28 1966 335 348
52. M.J. Wainwright Sharp thresholds for high-dimensional and noisy sparsity recovery using ℓ 1 -constrained quadratic programming (lasso) IEEE Trans. Inform. Theory 55 2009 2183 2202
53. P.J. Wolfe, M. Dörfler, S.J. Godsill, Multi-Gabor dictionaries for audio time-frequency analysis, in: Proc. IEEE Workshop Signal Process. Audio Acoust., 2001, pp. 43-46. (Pubitemid 34080590)
54. 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)
55. N.Y. Yu, and G. Gong A new binary sequence family with low correlation and large size IEEE Trans. Inform. Theory 52 2006 1624 1636
56. R. Zahedi, A. Pezeshki, E.K.P. Chong, Robust measurement design for detecting sparse signals: Equiangular uniform tight frames and Grassmannian packings, in: American Control Conference, 2010, 6 pp.