Structured and incoherent parametric dictionary design
暂无分享,去创建一个
[1] Xiaoming Huo,et al. Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.
[2] Silvere Bonnabel,et al. Riemannian Metric and Geometric Mean for Positive Semidefinite Matrices of Fixed Rank , 2008, SIAM J. Matrix Anal. Appl..
[3] Robert W. Heath,et al. Designing structured tight frames via an alternating projection method , 2005, IEEE Transactions on Information Theory.
[4] Bart Vandereycken,et al. Embedded geometry of the set of symmetric positive semidefinite matrices of fixed rank , 2009, 2009 IEEE/SP 15th Workshop on Statistical Signal Processing.
[5] R. Sepulchre,et al. Geometric distance and mean for positive semi-definite matrices of fixed rank , 2008 .
[6] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[7] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.
[8] Mike E. Davies,et al. Dictionary Learning for Sparse Approximations With the Majorization Method , 2009, IEEE Transactions on Signal Processing.
[9] Thomas Strohmer,et al. GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION , 2003, math/0301135.
[10] Michael S. Lewicki,et al. Efficient auditory coding , 2006, Nature.
[11] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .
[12] Stephen J. Wright,et al. Computational Methods for Sparse Solution of Linear Inverse Problems , 2010, Proceedings of the IEEE.
[13] Mike E. Davies,et al. Parametric Dictionary Design for Sparse Coding , 2009, IEEE Transactions on Signal Processing.