메뉴 건너뛰기




Volumn 5, Issue , 2006, Pages

MoTIF: An efficient algorithm for learning translation invariant dictionaries

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATABASE SYSTEMS; GLOSSARIES; PROBLEM SOLVING; STATISTICAL METHODS; TRANSLATION (LANGUAGES);

EID: 33947685468     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (56)

References (8)
  • 1
    • 0027842081 scopus 로고
    • Matching pursuit with time-frequency dictionaries
    • Dec
    • S. Mallat and Z. Zhang, "Matching pursuit with time-frequency dictionaries," IEEE Transactions on Signal Processing, vol. 41, no. 12, pp. 3397-3415, Dec 1993.
    • (1993) IEEE Transactions on Signal Processing , vol.41 , Issue.12 , pp. 3397-3415
    • Mallat, S.1    Zhang, Z.2
  • 3
    • 5444237123 scopus 로고    scopus 로고
    • Greed is good: Algorithmic results for sparse approximation
    • October
    • J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2231-2242, October 2004.
    • (2004) IEEE Transactions on Information Theory , vol.50 , Issue.10 , pp. 2231-2242
    • Tropp, J.A.1
  • 4
    • 0030832881 scopus 로고    scopus 로고
    • The 'independent components' of natural scenes are edge filters
    • A.J. Bell and T.J. Sejnowski, "The 'independent components' of natural scenes are edge filters," Vision research, vol. 37, no. 23, pp. 3327-3338, 1997.
    • (1997) Vision research , vol.37 , Issue.23 , pp. 3327-3338
    • Bell, A.J.1    Sejnowski, T.J.2
  • 6
    • 0034133184 scopus 로고    scopus 로고
    • Learning overcom-plete representations
    • M.S. Lewicki and T.J. Sejnowski, "Learning overcom-plete representations," 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


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