메뉴 건너뛰기




Volumn , Issue , 2014, Pages 3963-3967

Tensor-based algorithms for learning multidimensional separable dictionaries

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; SIGNAL PROCESSING; TENSORS;

EID: 84905216167     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2014.6854345     Document Type: Conference Paper
Times cited : (60)

References (25)
  • 2
    • 85194972808 scopus 로고    scopus 로고
    • Regression shrinkage and selection via the lasso
    • R. Tibshirani, "Regression shrinkage and selection via the lasso," Journal of the Royal Statistical Society, vol. 58, no. 1, pp. 267-288, 1996.
    • (1996) Journal of the Royal Statistical Society , vol.58 , Issue.1 , pp. 267-288
    • Tibshirani, R.1
  • 4
    • 7044231546 scopus 로고    scopus 로고
    • An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
    • I. Daubechies, M. Defrise, and C. D. Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Comm. Pure Appl. Math., vol. 57, pp. 1413-1457, 2004.
    • (2004) Comm. Pure Appl. Math. , vol.57 , pp. 1413-1457
    • Daubechies, I.1    Defrise, M.2    Mol, C.D.3
  • 6
    • 0030779611 scopus 로고    scopus 로고
    • Sparse coding with an overcomplete basis set: A strategy employed by V1?
    • B. Olshausen and D. Field, "Sparse coding with an overcomplete basis set: A strategy employed by V1?" Vision Research, vol. 37, pp. 3311-3325, 1997.
    • (1997) Vision Research , vol.37 , pp. 3311-3325
    • Olshausen, B.1    Field, D.2
  • 7
    • 0034133184 scopus 로고    scopus 로고
    • Learning overcomplete respresentations
    • M. S. Lewicki and T. J. Sejnowski, "Learning overcomplete respresentations," Neural Computation, vol. 12, no. 2, pp. 337-365, 2000.
    • (2000) Neural Computation , vol.12 , Issue.2 , pp. 337-365
    • Lewicki, M.S.1    Sejnowski, T.J.2
  • 9
    • 0034299822 scopus 로고    scopus 로고
    • Multi-frame compression: Theory and design
    • K. Engan, S. O. Aase, and J. H. Husy, "Multi-frame compression: Theory and design," EURASIP Signal Process., vol. 90, no. 10, pp. 2121-2140, 2000.
    • (2000) EURASIP Signal Process. , vol.90 , Issue.10 , pp. 2121-2140
    • Engan, K.1    Aase, S.O.2    Husy, J.H.3
  • 10
    • 33750383209 scopus 로고    scopus 로고
    • The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation
    • Nov.
    • M. Aharon, M. Elad, and A. Bruckstein, "The K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation," IEEE Trans. on Signal Processing, vol. 54, no. 11, pp. 4311-4322, Nov. 2006.
    • (2006) IEEE Trans. on Signal Processing , vol.54 , Issue.11 , pp. 4311-4322
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 11
    • 67649842407 scopus 로고    scopus 로고
    • Learning to sense sparse signals: Simultaneous sensing matrix and sparsifying dictionary optimization
    • J. M. Duarte-Carvajalino and G. Sapiro, "Learning to sense sparse signals: Simultaneous sensing matrix and sparsifying dictionary optimization," IEEE Trans. Image Proc., vol. 18, no. 7, pp. 1395-1408, 2009.
    • (2009) IEEE Trans. Image Proc. , vol.18 , Issue.7 , pp. 1395-1408
    • Duarte-Carvajalino, J.M.1    Sapiro, G.2
  • 12
    • 77949403269 scopus 로고    scopus 로고
    • Recursive least squares dictionary learning algorithm
    • Apr.
    • K. Skretting and K. Engang, "Recursive least squares dictionary learning algorithm," IEEE Transactions on Signal Processing, vol. 58, pp. 2121-2130, Apr. 2010.
    • (2010) IEEE Transactions on Signal Processing , vol.58 , pp. 2121-2130
    • Skretting, K.1    Engang, K.2
  • 13
    • 84870486964 scopus 로고    scopus 로고
    • Simultaneous codeword optimization (SimCO) for dictionary update and learning
    • Dec.
    • W. Dai, T. Xu, and W. Wang, "Simultaneous codeword optimization (SimCO) for dictionary update and learning," IEEE Transactions on Signal Processing, vol. 60, no. 12, pp. 6340-6353, Dec. 2012.
    • (2012) IEEE Transactions on Signal Processing , vol.60 , Issue.12 , pp. 6340-6353
    • Dai, W.1    Xu, T.2    Wang, W.3
  • 14
    • 84947249753 scopus 로고    scopus 로고
    • Subspace methods and exploitation of special array structures
    • M. Viberg, Ed. Elsevier, chapter 23, ISBN 978-0-12-396500-4
    • M. Haardt, M. Pesavento, F. Roemer, and M. N. El Korso, "Subspace methods and exploitation of special array structures," in Academic Press Library in Signal Processing: Volume 2, M. Viberg, Ed. Elsevier, 2013, chapter 23, ISBN 978-0-12-396500-4.
    • (2013) Academic Press Library in Signal Processing , vol.2
    • Haardt, M.1    Pesavento, M.2    Roemer, F.3    El Korso, M.N.4
  • 15
    • 79953814105 scopus 로고    scopus 로고
    • Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar
    • Nov.
    • D. Nion and N. D. Sidiropoulos, "Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar," IEEE Trans. on Signal Processing, vol. 58, no. 11, pp. 5693-4705, Nov. 2010.
    • (2010) IEEE Trans. on Signal Processing , vol.58 , Issue.11 , pp. 5693-4705
    • Nion, D.1    Sidiropoulos, N.D.2
  • 16
  • 21
    • 0013953617 scopus 로고
    • Some mathematical notes on three-mode factor analysis
    • L. R. Tucker, "Some mathematical notes on three-mode factor analysis," Psychometrika, vol. 31, pp. 279-311, 1966.
    • (1966) Psychometrika , vol.31 , pp. 279-311
    • Tucker, L.R.1
  • 22
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • Sep.
    • T. G. Kolda and B. W. Bader, "Tensor decompositions and applications," SIAM Review, vol. 51, no. 3, pp. 455-500, Sep. 2009.
    • (2009) SIAM Review , vol.51 , Issue.3 , pp. 455-500
    • Kolda, T.G.1    Bader, B.W.2
  • 23
    • 0000802374 scopus 로고
    • The approximation of one matrix by another one of lower rank
    • C. Eckart and G. Young, "The approximation of one matrix by another one of lower rank," Psychometrika, vol. 1, pp. 211-218, 1936.
    • (1936) Psychometrika , vol.1 , pp. 211-218
    • Eckart, C.1    Young, G.2
  • 24
    • 0034144761 scopus 로고    scopus 로고
    • On the best rank-1 and rank-(r1, r2, rn) approximation of higher-order tensors
    • L. de Lathauwer, B. de Moor, and J. Vandewalle, "On the best rank-1 and rank-(r1, r2, rn) approximation of higher-order tensors," SIAM J. Matrix Anal. Appl., vol. 21, p. 13241342, 2000.
    • (2000) SIAM J. Matrix Anal. Appl. , vol.21 , pp. 13241342
    • De Lathauwer, L.1    De Moor, B.2    Vandewalle, J.3
  • 25
    • 0036056838 scopus 로고    scopus 로고
    • Rank-one approximation to high order tensors
    • T. Zhang and G. H. Golub, "Rank-one approximation to high order tensors," SIAM J. Matrix Anal. Appl., vol. 23, no. 2, pp. 534-550, 2001.
    • (2001) SIAM J. Matrix Anal. Appl. , vol.23 , Issue.2 , pp. 534-550
    • Zhang, T.1    Golub, G.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.