메뉴 건너뛰기




Volumn , Issue , 2013, Pages 5954-5958

Recursive robust PCA or recursive sparse recovery in large but structured noise

Author keywords

compressive sensing; robust PCA

Indexed keywords

COMPRESSIVE SENSING; HIGH PROBABILITY; LOW-DIMENSIONAL SUBSPACE; RECONSTRUCTION ERROR; ROBUST PCA; ROBUST PRINCIPAL COMPONENTS; SIGNAL-OF-INTEREST; STRUCTURED NOISE;

EID: 84890498882     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2013.6638807     Document Type: Conference Paper
Times cited : (23)

References (26)
  • 2
    • 79960675858 scopus 로고    scopus 로고
    • Robust principal component analysis
    • E. J. Candes, X. Li, Y. Ma, and J. Wright, "Robust principal component analysis?", Journal of ACM, vol. 58, no. 3, 2011.
    • (2011) Journal of ACM , vol.58 , Issue.3
    • Candes, E.J.1    Li, X.2    Ma, Y.3    Wright, J.4
  • 3
    • 77953803524 scopus 로고    scopus 로고
    • Dense error correction via l1-minimization
    • J. Wright and Y. Ma, "Dense error correction via l1-minimization", IEEE Trans. on Info. Th., vol. 56, no. 7, pp. 3540-3560, 2010.
    • (2010) IEEE Trans. on Info. Th. , vol.56 , Issue.7 , pp. 3540-3560
    • Wright, J.1    Ma, Y.2
  • 9
    • 84944416149 scopus 로고    scopus 로고
    • Incremental singular value decomposition of uncertain data with missing values
    • M. Brand, "Incremental singular value decomposition of uncertain data with missing values", in European Conference on Computer Vision, 2002, pp. 707-720.
    • (2002) European Conference on Computer Vision , pp. 707-720
    • Brand, M.1
  • 10
    • 0344982975 scopus 로고    scopus 로고
    • Weighted and robust incremental method for subspace learning
    • Oct
    • D. Skocaj and A. Leonardis, "Weighted and robust incremental method for subspace learning", in IEEE Intl. Conf. on Computer Vision (ICCV), Oct 2003, vol. 2, pp. 1494-1501.
    • (2003) IEEE Intl. Conf. on Computer Vision (ICCV) , vol.2 , pp. 1494-1501
    • Skocaj, D.1    Leonardis, A.2
  • 14
    • 77953854541 scopus 로고    scopus 로고
    • Exact signal recovery from sparsely corrupted measurements through the pursuit of justice
    • Nov
    • J.N. Laska, M.A. Davenport, and R.G. Baraniuk, "Exact signal recovery from sparsely corrupted measurements through the pursuit of justice", in Asilomar Conf. on Sig. Sys. Comp., Nov 2009, pp. 1556-1560.
    • (2009) Asilomar Conf. on Sig. Sys. Comp. , pp. 1556-1560
    • Laska, J.N.1    Davenport, M.A.2    Baraniuk, R.G.3
  • 16
    • 29144439194 scopus 로고    scopus 로고
    • Decoding by linear programming
    • Dec
    • E. Candes and T. Tao, "Decoding by linear programming", IEEE Trans. Info. Th., vol. 51(12), pp. 4203-4215, Dec. 2005.
    • (2005) IEEE Trans. Info. Th. , vol.51 , Issue.12 , pp. 4203-4215
    • Candes, E.1    Tao, T.2
  • 19
    • 31744440684 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • February
    • E. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information", IEEE Trans. Info. Th., vol. 52(2), pp. 489-509, February 2006.
    • (2006) IEEE Trans. Info. Th. , vol.52 , Issue.2 , pp. 489-509
    • Candes, E.1    Romberg, J.2    Tao, T.3
  • 20
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • April
    • D. Donoho, "Compressed sensing", IEEE Trans. on Information Theory, vol. 52(4), pp. 1289-1306, April 2006.
    • (2006) IEEE Trans. on Information Theory , vol.52 , Issue.4 , pp. 1289-1306
    • Donoho, D.1
  • 21
    • 42649140570 scopus 로고    scopus 로고
    • The restricted isometry property and its implications for compressed sensing
    • E. Candes, "The restricted isometry property and its implications for compressed sensing", Compte Rendus de lAcademie des Sciences, Paris, Serie I, pp. 589-592, 2008.
    • (2008) Compte Rendus de LAcademie des Sciences, Paris, Serie i , pp. 589-592
    • Candes, E.1
  • 22
    • 47849114121 scopus 로고    scopus 로고
    • The dantzig selector: Statistical estimation when p is much larger than n
    • E. Candes and T. Tao, "The dantzig selector: statistical estimation when p is much larger than n", Annals of Statistics, 2006.
    • (2006) Annals of Statistics
    • Candes, E.1    Tao, T.2
  • 23
    • 78049360641 scopus 로고    scopus 로고
    • Algorithms for robust linear regression by exploiting the connection to sparse signal recovery
    • Y. Jin and B. Rao, "Algorithms for robust linear regression by exploiting the connection to sparse signal recovery", in IEEE Intl. Conf. Acoustics, Speech, Sig. Proc. (ICASSP), 2010.
    • (2010) IEEE Intl. Conf. Acoustics, Speech, Sig. Proc. (ICASSP)
    • Jin, Y.1    Rao, B.2
  • 26
    • 84864315555 scopus 로고    scopus 로고
    • User-friendly tail bounds for sums of random matrices
    • J. A. Tropp, "User-friendly tail bounds for sums of random matrices", Foundations of Computational Mathematics, vol. 12, no. 4, 2012.
    • (2012) Foundations of Computational Mathematics , vol.12 , Issue.4
    • Tropp, J.A.1


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