메뉴 건너뛰기




Volumn 2011, Issue , 2011, Pages

Background subtraction via robust dictionary learning

Author keywords

[No Author keywords available]

Indexed keywords


EID: 79955069649     PISSN: 16875176     EISSN: 16875281     Source Type: Journal    
DOI: 10.1155/2011/972961     Document Type: Article
Times cited : (78)

References (24)
  • 7
    • 56749183654 scopus 로고    scopus 로고
    • Scene modeling and change detection in dynamic scenes: A subspace approach
    • Mittal A., Monnet A., Paragios N., Scene modeling and change detection in dynamic scenes: a subspace approach Computer Vision and Image Understanding 2009 113 1 63 79
    • (2009) Computer Vision and Image Understanding , vol.113 , Issue.1 , pp. 63-79
    • Mittal, A.1    Monnet, A.2    Paragios, N.3
  • 9
    • 33745179218 scopus 로고    scopus 로고
    • 1 norm factorization in the presence of outliers and missing data by alternative convex programming
    • 1467342, Proceedings - 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005
    • Ke Q., Kanade T., Robust L1 Norm factorization in the presence of outliers and missing data by alternative convex programming in Proceedings of IEEE Computer Society Conference on Computer Vision and Patter Recognition (CVPR) 2005 1 739 746 (Pubitemid 43897268)
    • (2005) Proceedings - 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005 , vol.I , pp. 739-746
    • Ke, Q.1    Kanade, T.2
  • 15
    • 33750383209 scopus 로고    scopus 로고
    • K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation
    • DOI 10.1109/TSP.2006.881199
    • Aharon M., Elad M., Bruckstein A., K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation IEEE Transactions on Signal Processing 2006 54 11 4311 4322 (Pubitemid 44637761)
    • (2006) IEEE Transactions on Signal Processing , vol.54 , Issue.11 , pp. 4311-4322
    • Aharon, M.1    Elad, M.2    Bruckstein, A.3
  • 18
    • 29144439194 scopus 로고    scopus 로고
    • Decoding by linear programming
    • DOI 10.1109/TIT.2005.858979
    • Candes E. J., Tao T., Decoding by linear programming IEEE Transactions on Information Theory 2005 51 12 4203 4215 (Pubitemid 41800353)
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.12 , pp. 4203-4215
    • Candes, E.J.1    Tao, T.2
  • 20
    • 0018546040 scopus 로고
    • Lower rank approximation of matrices by least squares with any choice of weights
    • Gabriel K. R., Zamir S., Lower rank approximation of matrices by least squares with any choice of weights Technometrics 1979 21 4 489 498 (Pubitemid 10427363)
    • (1979) Technometrics , vol.21 , Issue.4 , pp. 489-498
    • Gabriel, K.R.1    Zamir, S.2
  • 21
    • 79955058068 scopus 로고    scopus 로고
    • New York, NY, USA Springer 6.8.1 Solutions That Minimize Other Norms of the Residuals
    • James G., Matrix Algebra 2007 New York, NY, USA Springer 6.8.1 Solutions That Minimize Other Norms of the Residuals
    • (2007) Matrix Algebra
    • James, G.1
  • 22
    • 84864596681 scopus 로고    scopus 로고
    • http://www.youtube.com/


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