메뉴 건너뛰기




Volumn , Issue , 2013, Pages 3087-3090

Exact recovery of sparsely-used dictionaries

Author keywords

[No Author keywords available]

Indexed keywords

COEFFICIENT MATRIX; EXACT RECOVERIES; POLYNOMIAL-TIME ALGORITHMS; STATE-OF-THE-ART ALGORITHMS;

EID: 84896060530     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (25)

References (13)
  • 1
    • 33750383209 scopus 로고    scopus 로고
    • The K-SVD: An algorithm for designing over complete dictionaries for sparse representation
    • M. Aharon, M. Elad, and A. Bruckstein. The K-SVD: An algorithm for designing over complete dictionaries for sparse representation. IEEE Transactions on Signal Processing, 54(11):4311-4322, 2006.
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.11 , pp. 4311-4322
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 2
    • 0032627073 scopus 로고    scopus 로고
    • Method of optimal directions for frame design
    • K. Engan, S. Aase, and J. Hakon-Husoy. Method of optimal directions for frame design. In ICASSP, volume 5, pages 2443-2446, 1999.
    • (1999) ICASSP , vol.5 , pp. 2443-2446
    • Engan, K.1    Aase, S.2    Hakon-Husoy, J.3
  • 3
    • 23044451368 scopus 로고    scopus 로고
    • Sparse component analysis and blind source separation of underdetermined mixtures
    • P. Georgiev, F. Theis, and A. Cichocki. Sparse component analysis and blind source separation of underdetermined mixtures. IEEE Transactions on Neural Networks, 16(4), 2005.
    • (2005) IEEE Transactions on Neural Networks , vol.16 , Issue.4
    • Georgiev, P.1    Theis, F.2    Cichocki, A.3
  • 4
    • 78149306565 scopus 로고    scopus 로고
    • Matrix sparsication and the sparse null space problem
    • L-A. Gottlieb and T. Neylon. Matrix sparsication and the sparse null space problem. APPROX and RANDOM, 6302:205-218, 2010.
    • (2010) Approx and Random , vol.6302 , pp. 205-218
    • Gottlieb, L.-A.1    Neylon, T.2
  • 6
    • 33646712150 scopus 로고    scopus 로고
    • On the uniqueness of over complete dictionaries, and a practical way to retrieve them
    • M. Elad M. Aharon and A. Bruckstein. On the uniqueness of over complete dictionaries, and a practical way to retrieve them. Linear Algebra and its Applications, 416:48-67, 2006.
    • (2006) Linear Algebra and Its Applications , vol.416 , pp. 48-67
    • Elad, M.1    Aharon, M.2    Bruckstein, A.3
  • 8
    • 0029938380 scopus 로고    scopus 로고
    • Emergence of simple-cell receptive field properties by learning a sparse code for natural images
    • B. Olshausen and D. Field. Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature, 381(6538):607-609, 1996.
    • (1996) Nature , vol.381 , Issue.6538 , pp. 607-609
    • Olshausen, B.1    Field, D.2
  • 12
    • 0000660321 scopus 로고    scopus 로고
    • Blind source separation by sparse decomposition
    • M. Zibulevsky and B. Pearlmutter. Blind source separation by sparse decomposition. Neural Computation, 13(4), 2001.
    • (2001) Neural Computation , vol.13 , Issue.4
    • Zibulevsky, M.1    Pearlmutter, B.2
  • 13
    • 3042722835 scopus 로고    scopus 로고
    • Blind source separation with relative newton method
    • M. Zibulevsky. Blind source separation with relative newton method. Proceedings ICA, pages 897-902, 2003.
    • (2003) Proceedings ICA , pp. 897-902
    • Zibulevsky, M.1


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