Construction of incoherent unit norm tight frames with application to compressed sensing

IEEE Transactions on Information Theory

Volumn 60, Issue 4, 2014, Pages 2319-2330

  Tsiligianni, Evaggelia V ^a   Kondi, Lisimachos P ^a   Katsaggelos, Aggelos K ^b  

^a UNIVERSITY OF IOANNINA   (Greece)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

compressed sensing; Grassmannian frames; Unit norm tight frames

Indexed keywords

COMPRESSED SENSING; OPTIMIZATION;

COMPRESSIVE SENSING; EQUIANGULAR TIGHT FRAMES; GRASSMANNIAN; OPTIMIZATION TECHNIQUES; PROJECTION MATRIX; RECONSTRUCTION ACCURACY; SPARSE REPRESENTATION; TIGHT FRAME;

SIGNAL RECONSTRUCTION;

EID: 84896969175     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2308171     Document Type: Article

References (52)

1. O. Christensen, An Introduction to Frames and Riesz Bases. Boston, MA, USA: Birkhäuser, 2003.
2. J. Kovačevíc and A. Chebira, "Life beyond bases: The advent of frames (Part I)," IEEE Signal Process. Mag., vol. 24, no. 4, pp. 86-104, Jul. 2007. (Pubitemid 47316170)
3. A. M. Bruckstein, D. L. Donoho, and M. Elad, "From sparse solutions of systems of equations to sparse modeling of signals and images," SIAM Rev., vol. 51, no. 1, pp. 34-81, 2009.
4. R. J. Duffin and A. C. Schaeffer, "A class of nonharmonic fourier series," Trans. Amer. Math. Soc., vol. 72, no. 2, pp. 341-366, 1952.
5. I. Daubechies, Ten Lectures on Wavelets. Philadelphia, PA, USA: SIAM, 1992.
6. J. Kovačevíc and A. Chebira, "Life beyond bases: The advent of frames (Part II)," IEEE Signal Process. Mag., vol. 24, no. 5, pp. 115-125, Sep. 2007. (Pubitemid 350130509)
7. T. Strohmer and R. W. Heath, "Grassmannian frames with applications to coding and communication," Appl. Comput. Harmon. Anal., vol. 14, no. 3, pp. 257-275, 2003.
8. J. L. Massey and T. Mittelholzer, "Welch's bound and sequence sets for code-division multiple-access systems," in Sequences II: Methods in Communication, Security and Computer Science. Berlin, Germany: Springer-Verlag, 1991, pp. 63-78.
9. S. Waldron, "Generalized welch bound equality sequences are tight frames," IEEE Trans. Inf. Theory, vol. 49, no. 9, pp. 2307-2309, Sep. 2003.
10. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
11. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
12. P. Viswanath and V. Anantharam, "Optimal sequences and sum capacity of synchronous CDMA systems," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 1984-1991, Sep. 1999. (Pubitemid 32077623)
13. P. Viswanath and V. Anantharam, "Optimal sequences for CDMA under colored noise: A Schur-Saddle function property," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1295-1318, Jun. 2002. (Pubitemid 34759846)
14. N: Analysis, synthesis, and algorithms," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 16-31, Jan. 1998. (Pubitemid 128737877)
15. V. K. Goyal, J. Kovačevíc, and J. A. Kelner, "Quantized frame expansions with erasures," Appl. Comput. Harmon. Anal., vol. 10, no. 3, pp. 203-233, 2001. (Pubitemid 33675918)
16. P. G. Casazza and J. Kovačevíc, "Equal-norm tight frames with erasures," Adv. Comput. Math., vol. 18, nos. 2-4, pp. 387-430, 2003. (Pubitemid 38103611)
17. R. B. Holmes and V. I. Paulsen, "Optimal frames for erasures," Linear Algebra Appl., vol. 377, no. 1, pp. 31-51, 2004.
18. M. Fickus and D. G. Mixon, "Numerically erasure-robust frames," Linear Algebra Appl., vol. 437, no. 6, pp. 1394-1407, 2012.
19. M. Elad, Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. New York, NY, USA: Springer-Verlag, 2010.
20. Y. C. Eldar and G. D. Forney, "Optimal tight frames and quantum measurement," IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 599-610, Mar. 2002. (Pubitemid 34239790)
21. 1-minimization," Proc. Nat. Acad. Sci. USA, vol. 100, no. 5, pp. 2197-2202, 2003. (Pubitemid 36297476)
22. J. A. Tropp, "On the conditioning of random subdictionaries," Appl. Comput. Harmon. Anal., vol. 25, no. 1, pp. 1-24, 2008. (Pubitemid 351721018)
23. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
24. E. J. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, no. 8, pp. 1207-1223, 2006. (Pubitemid 43988295)
25. M. Elad, "Optimized projections for compressed sensing," IEEE Trans. Signal Process., vol. 55, no. 12, pp. 5695-5702, Dec. 2007. (Pubitemid 350201203)
26. E. Tsiligianni, L. P. Kondi, and A. K. Katsaggelos, "Use of tight frames for optimized compressed sensing," in Proc. EUSIPCO, Bucharest, Romania, Aug. 2012, pp. 1439-1443.
27. J. A. Tropp, I. S. Dhillon, R. W. Heath, and T. Strohmer, "Designing structured tight frames via an alternating projection method," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 188-209, Jan. 2005. (Pubitemid 40145995)
28. B. G. Bodmann and P. G. Casazza, "The road to equal-norm Parseval frames," J. Funct. Anal., vol. 258, no. 2, pp. 397-420, 2010.
29. P. G. Casazza, M. Fickus, and D. G. Mixon, "Auto-tuning unit norm frames," Appl. Comput. Harmon. Anal., vol. 32, no. 1, pp. 1-15, 2012.
30. P. Xia, S. Zhou, and G. B. Giannakis, "Achieving the Welch bound with difference sets," IEEE Trans. Inf. Theory, vol. 51, no. 5, pp. 1900-1907, May 2005. (Pubitemid 40654465)
31. S. Waldron, "On the construction of equiangular frames from graphs," Linear Algebra Appl., vol. 431, no. 11, pp. 2228-2242, 2009.
32. M. Fickus, D. G. Mixon, and J. C. Tremain, "Steiner equiangular tight frames," Linear Algebra Appl., vol. 436, no. 5, pp. 1014-1027, 2012.
33. R. Horn and C. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ Press, 1985.
34. H. H. Bauschke and J. M. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Rev., vol. 38, no. 3, pp. 367-426, 1996. (Pubitemid 126599619)
35. A. S. Lewis and J. Malick, "Alternating projections on manifolds," Math. Oper. Res., vol. 33, no. 1, pp. 216-234, 2008.
36. A. S. Lewis, D. R. Luke, and J. Malick, "Local convergence for alternating and averaged nonconvex projections," Found. Comput. Math., vol. 9, no. 4, pp. 485-513, Aug. 2009.
37. J. Xu, Y. Pi, and Z. Cao, "Optimized projection matrix for compressive sensing," EURASIP J. Adv. Signal Process., vol. 2010, pp. 43:1-43:8, Feb. 2010.
38. H. Huang and A. Makur, "Optimized measurement matrix for compressive sensing," Sampl. Theory Signal Image Process., 2013, to be published.
39. J. J. Benedetto and M. Fickus, "Finite normalized tight frames," Adv. Comput. Math., vol. 18, nos. 2-4, pp. 357-385, 2003. (Pubitemid 38117637)
40. S. G. Mallat and Z. Zhang, "Matching pursuits with timefrequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
41. G. Davis, S. Mallat, and M. Avellaneda, "Greedy adaptive approximation," Construct. Approx., vol. 13, no. 1, pp. 57-58, 1997.
42. S. S. Chen, D. L. Donoho, and M. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1999. (Pubitemid 128689501)
43. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?" IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006. (Pubitemid 46445381)
44. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, "A simple proof of the restricted isometry property for random matrices," Construct. Approx., vol. 28, no. 3, pp. 253-263, 2008.
45. M. F. Duarte and Y. C. Eldar, "Structured compressed sensing: From theory to applications," IEEE Trans. Signal Process., vol. 59, no. 9, pp. 4053-4085, Sep. 2011.
46. R. A. DeVore, "Deterministic constructions of compressed sensing matrices," J. Complex., vol. 23, nos. 4-6, pp. 918-925, 2007.
47. L. Applebaum, S. D. Howard, S. Searle, and R. Calderbank, "Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery," Appl. Comput. Harmon. Anal., vol. 26, no. 2, pp. 283-290, 2009.
48. J. Bourgain, S. Dilworth, K. Ford, S. Konyagin, and D. Kutzarova, "Explicit constructions of RIP matrices and related problems," Duke Math. J., vol. 159, no. 1, pp. 145-185, 2011.
49. A. S. Bandeira, M. Fickus, D. G. Mixon, and P. Wong, "The road to deterministic matrices with the restricted isometry property," J. Fourier Anal., Appl., vol. 19, pp. 1123-1149, 2013.
50. J. M. Duarte-Carvajalino and G. Sapiro, "Learning to sense sparse signals: Simultaneous sensing matrix and sparsifying dictionary optimization," IEEE Trans. Image Process., vol. 18, no. 7, pp. 1395-1408, Jul. 2009.
51. V. Abolghasemi, D. Jarchi, and S. Sanei, "A robust approach for optimization of the measurement matrix in compressed sensing," in Proc. 2nd Int. Workshop CIP, Jun. 2010, pp. 388-392.
52. M. Aharon, M. Elad, and A. Bruckstein, "K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4311-4322, Nov. 2006. (Pubitemid 44637761)