-
2
-
-
33750383209
-
K-SVD: An algorithm for designining of overcomplete dictionaries for sparse representation
-
M. Aharon, E. Elad, and A.M. Bruckstein, "K-SVD: an algorithm for designining of overcomplete dictionaries for sparse representation," IEEE Trans. on Signal Processing, vol. 54, no. 11, pp. 4311-4322, 2006.
-
(2006)
IEEE Trans. on Signal Processing
, vol.54
, Issue.11
, pp. 4311-4322
-
-
Aharon, M.1
Elad, E.2
Bruckstein, A.M.3
-
3
-
-
66849115117
-
Dictionary learning for sparse approximations with the majorization method
-
M. Yaghoobi, T. Blumensath, and M. Davies, "Dictionary learning for sparse approximations with the majorization method," IEEE Trans. on Signal Processing, vol. 57, no. 6, pp. 2178-2191, 2009.
-
(2009)
IEEE Trans. on Signal Processing
, vol.57
, Issue.6
, pp. 2178-2191
-
-
Yaghoobi, M.1
Blumensath, T.2
Davies, M.3
-
5
-
-
0035504028
-
Uncertainty principles and ideal atomic decomposition
-
D.L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. on Information Theory, vol. 47, no. 7, pp. 2845-2862, 2001.
-
(2001)
IEEE Trans. on Information Theory
, vol.47
, Issue.7
, pp. 2845-2862
-
-
Donoho, D.L.1
Huo, X.2
-
7
-
-
0242323185
-
Grassmannian frames with applications to coding and communication
-
T. Strohmer and R.W. Heath, "Grassmannian frames with applications to coding and communication," Applied and Computational Harmonic Analysis, vol. 14, no. 3, pp. 257-275, 2003.
-
(2003)
Applied and Computational Harmonic Analysis
, vol.14
, Issue.3
, pp. 257-275
-
-
Strohmer, T.1
Heath, R.W.2
-
8
-
-
12444320397
-
Designing structural tight frames via an alternating projection method
-
J.A. Tropp, I.S. Dhillon, R.W. Heath Jr., and T. Strohmer, "Designing structural tight frames via an alternating projection method," IEEE Trans. on Information Theory, vol. 51, no. 1, pp. 188-209, 2005.
-
(2005)
IEEE Trans. on Information Theory
, vol.51
, Issue.1
, pp. 188-209
-
-
Tropp, J.A.1
Dhillon, I.S.2
Heath Jr., R.W.3
Strohmer, T.4
-
9
-
-
78049408699
-
Geometric distance and mean for positive semi-definite matrices of fixed rank
-
Accepted for publication in Available at
-
S. Bonnabel and R. Sepulchre, "Geometric distance and mean for positive semi-definite matrices of fixed rank," Accepted for publication in SIAM Journal of Matrix Analysis. Available at http://arxiv.org/abs/0807.4462.
-
SIAM Journal of Matrix Analysis
-
-
Bonnabel, S.1
Sepulchre, R.2
-
10
-
-
72349093578
-
Embedded geometry of the set of symmetric positive semidefinite matrices of fixed rank
-
B. Vandereycken, P.-A. Absil, and S. Vandewalle, "Embedded geometry of the set of symmetric positive semidefinite matrices of fixed rank," in IEEE Workshop on Statistical Signal Processing, Cardiff, UK, September 2009, pp. 389-392.
-
IEEE Workshop on Statistical Signal Processing, Cardiff, UK, September 2009
, pp. 389-392
-
-
Vandereycken, B.1
Absil, P.-A.2
Vandewalle, S.3
-
12
-
-
0142056390
-
-
Tech. Rep., APU Report
-
R.D. Patterson, I. Nimmo-Smith, J. Holdsworth, and P. Rice, "An efficient auditory filterbank based on the Gammatone function," Tech. Rep., APU Report, 1988.
-
(1988)
An Efficient Auditory Filterbank Based on the Gammatone Function
-
-
Patterson, R.D.1
Nimmo-Smith, I.2
Holdsworth, J.3
Rice, P.4
-
13
-
-
33644513420
-
Efficient auditory coding
-
E.C. Smith and M. S. Lewicki, "Efficient auditory coding," Nature, vol. 439, pp. 978-982, 2006.
-
(2006)
Nature
, vol.439
, pp. 978-982
-
-
Smith, E.C.1
Lewicki, M.S.2
|