메뉴 건너뛰기




Volumn 2015-January, Issue , 2015, Pages 3590-3596

Robust dictionary learning with capped ℓ1-Norm

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; LEARNING SYSTEMS; SIGNAL PROCESSING; STATISTICS;

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

References (24)
  • 1
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    • Michal Aharon, Michael Elad, and Alfred Bruckstein. K-SVD: An algorithm for designing overcomplete 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
    • 33751379736 scopus 로고    scopus 로고
    • Image denoising via sparse and redundant representations over learned dictionaries
    • Michael Elad and Michal Aharon. Image denoising via sparse and redundant representations over learned dictionaries. IEEE Transactions on Image Processing, 15(12):3736-3745, 2006.
    • (2006) IEEE Transactions on Image Processing , vol.15 , Issue.12 , pp. 3736-3745
    • Elad, M.1    Aharon, M.2
  • 7
    • 84864036295 scopus 로고    scopus 로고
    • Efficient sparse coding algorithms
    • B. Schölkopf, J. Platt, and T. Hoffman, editors MIT Press, Cambridge, MA
    • Honglak Lee, Alexis Battle, Rajat Raina, and Andrew Y. Ng. Efficient sparse coding algorithms. In B. Schölkopf, J. Platt, and T. Hoffman, editors, Advances in Neural Information Processing Systems 19, pages 801-808. MIT Press, Cambridge, MA, 2007.
    • (2007) Advances in Neural Information Processing Systems , vol.19 , pp. 801-808
    • Lee, H.1    Battle, A.2    Raina, R.3    Ng, A.Y.4
  • 15
    • 0030779611 scopus 로고    scopus 로고
    • Sparse coding with an overcomplete basis set: A strategy employed by v1?
    • Bruno A Olshausen and David J Field. Sparse coding with an overcomplete basis set: A strategy employed by v1? Vision research, 37(23):3311-3325, 1997.
    • (1997) Vision Research , vol.37 , Issue.23 , pp. 3311-3325
    • Olshausen, B.A.1    Field, D.J.2
  • 20
    • 84898812503 scopus 로고    scopus 로고
    • Online robust non-negative dictionary learning for visual tracking
    • Sydney, Australia, December 1-8, 2013
    • Naiyan Wang, Jingdong Wang, and Dit-Yan Yeung. Online robust non-negative dictionary learning for visual tracking. In IEEE International Conference on Computer Vision, ICCV 2013, Sydney, Australia, December 1-8, 2013, pages 657-664, 2013.
    • (2013) IEEE International Conference on Computer Vision, ICCV 2013 , pp. 657-664
    • Wang, N.1    Wang, J.2    Yeung, D.-Y.3
  • 23
    • 77951191949 scopus 로고    scopus 로고
    • Analysis of multi-stage convex relaxation for sparse regularization
    • Tong Zhang. Analysis of multi-stage convex relaxation for sparse regularization. The Journal of Machine Learning Research, 11:1081-1107, 2010.
    • (2010) The Journal of Machine Learning Research , vol.11 , pp. 1081-1107
    • Zhang, T.1
  • 24
    • 84891952223 scopus 로고    scopus 로고
    • Multi-stage convex relaxation for feature selection
    • 11
    • Tong Zhang. Multi-stage convex relaxation for feature selection. Bernoulli, 19(5B):2277-2293, 11 2013.
    • (2013) Bernoulli , vol.19 , Issue.5 B , pp. 2277-2293
    • Zhang, T.1


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