Approximate equiangular tight frames for compressed sensing and CDMA applications
暂无分享,去创建一个
Aggelos K. Katsaggelos | Lisimachos P. Kondi | Evaggelia Tsiligianni | A. Katsaggelos | L. Kondi | Evaggelia Tsiligianni
[1] S. Mallat,et al. Adaptive greedy approximations , 1997 .
[2] Robert W. Heath,et al. Designing structured tight frames via an alternating projection method , 2005, IEEE Transactions on Information Theory.
[3] Gennian Ge,et al. Deterministic Construction of Sparse Sensing Matrices via Finite Geometry , 2014, IEEE Transactions on Signal Processing.
[4] David L Donoho,et al. Compressed sensing , 2006, IEEE Transactions on Information Theory.
[5] A. J. Scott. Tight informationally complete quantum measurements , 2006, quant-ph/0604049.
[6] John J. Benedetto,et al. Finite Normalized Tight Frames , 2003, Adv. Comput. Math..
[7] Heinz H. Bauschke,et al. The Method of Alternating Relaxed Projections for Two Nonconvex Sets , 2013, Vietnam Journal of Mathematics.
[8] Thomas Strohmer,et al. GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.
[9] J. Massey,et al. Welch’s Bound and Sequence Sets for Code-Division Multiple-Access Systems , 1993 .
[10] Yiming Pi,et al. Optimized Projection Matrix for Compressive Sensing , 2010, EURASIP J. Adv. Signal Process..
[11] Guillermo Sapiro,et al. Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization , 2009, IEEE Transactions on Image Processing.
[12] R. DeVore,et al. A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .
[13] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[14] J. Tropp. On the conditioning of random subdictionaries , 2008 .
[15] Mátyás A. Sustik,et al. On the existence of equiangular tight frames , 2007 .
[16] V. Paulsen,et al. Optimal frames for erasures , 2004 .
[17] Dustin G. Mixon,et al. The Road to Deterministic Matrices with the Restricted Isometry Property , 2012, Journal of Fourier Analysis and Applications.
[18] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[19] Georgios B. Giannakis,et al. Achieving the Welch bound with difference sets , 2005, IEEE Transactions on Information Theory.
[20] Shayne Waldron,et al. On the construction of equiangular frames from graphs , 2009 .
[21] Nuria González Prelcic,et al. Optimized Compressed Sensing via Incoherent Frames Designed by Convex Optimization , 2015, ArXiv.
[22] Aggelos K. Katsaggelos,et al. Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing , 2014, IEEE Transactions on Information Theory.
[23] Andrzej Cegielski,et al. Relaxed Alternating Projection Methods , 2008, SIAM J. Optim..
[24] Sheng Li,et al. Sensing Matrix Optimization Based on Equiangular Tight Frames With Consideration of Sparse Representation Error , 2016, IEEE Transactions on Multimedia.
[25] Roy D. Yates,et al. Iterative construction of optimum signature sequence sets in synchronous CDMA systems , 2001, IEEE Trans. Inf. Theory.
[26] Peter G. Casazza,et al. Finite Frames: Theory and Applications , 2012 .
[27] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[28] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[29] Michael Elad,et al. Optimized Projections for Compressed Sensing , 2007, IEEE Transactions on Signal Processing.
[30] G. Golub,et al. Inverse Eigenvalue Problems: Theory, Algorithms, and Applications , 2005 .
[31] V. Paulsen,et al. Frames, graphs and erasures , 2004, math/0406134.
[32] Aggelos K. Katsaggelos,et al. Use of tight frames for optimized compressed sensing , 2012, 2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO).
[33] Robert Orsi. Numerical Methods for Solving Inverse Eigenvalue Problems for Nonnegative Matrices , 2006, SIAM J. Matrix Anal. Appl..
[34] Venkat Anantharam,et al. Optimal sequences and sum capacity of synchronous CDMA systems , 1999, IEEE Trans. Inf. Theory.
[35] Dustin G. Mixon,et al. Tables of the existence of equiangular tight frames , 2015, ArXiv.
[36] Dustin G. Mixon,et al. Steiner equiangular tight frames , 2010, 1009.5730.
[37] Bernhard G. Bodmann,et al. Equiangular tight frames from complex Seidel matrices containing cube roots of unity , 2008, 0805.2014.
[38] Gennian Ge,et al. Deterministic Sensing Matrices Arising From Near Orthogonal Systems , 2014, IEEE Transactions on Information Theory.
[39] Robert W. Heath,et al. On quasi-orthogonal signatures for CDMA systems , 2006, IEEE Transactions on Information Theory.
[40] Robert W. Heath,et al. Finite-step algorithms for constructing optimal CDMA signature sequences , 2004, IEEE Transactions on Information Theory.
[41] Bernhard G. Bodmann,et al. The road to equal-norm Parseval frames , 2010 .
[42] Aggelos K. Katsaggelos,et al. Preconditioning for Underdetermined Linear Systems with Sparse Solutions , 2015, IEEE Signal Processing Letters.
[43] Joseph M. Renes,et al. Symmetric informationally complete quantum measurements , 2003, quant-ph/0310075.