메뉴 건너뛰기




Volumn , Issue , 2012, Pages 1276-1280

Compressive principal component pursuit

Author keywords

[No Author keywords available]

Indexed keywords

COMPONENT SIGNALS; COMPRESSIVE SENSING; HIGH-DIMENSIONAL; HYPER-SPECTRAL IMAGES; LINEAR MEASUREMENTS; POLY-LOGARITHMIC FACTORS; PRINCIPAL COMPONENTS; TARGET MATRICES; TRANSFORMATION INVARIANTS;

EID: 84867566839     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283062     Document Type: Conference Paper
Times cited : (31)

References (26)
  • 1
    • 79960675858 scopus 로고    scopus 로고
    • Robust principal component analysis?
    • May
    • E. Candès, X. Li, Y. Ma, and J. Wright, "Robust principal component analysis?" Journal of the ACM, vol. 58, no. 7, May 2011.
    • (2011) Journal of the ACM , vol.58 , Issue.7
    • Candès, E.1    Li, X.2    Ma, Y.3    Wright, J.4
  • 4
    • 0037328517 scopus 로고    scopus 로고
    • Lambertian reflectance and linear subspaces
    • R. Basri and D. Jacobs, "Lambertian reflectance and linear subspaces," IEEE Tr. PAMI, vol. 25, no. 2, pp. 218-233, 2003.
    • (2003) IEEE Tr. PAMI , vol.25 , Issue.2 , pp. 218-233
    • Basri, R.1    Jacobs, D.2
  • 13
    • 84859831899 scopus 로고    scopus 로고
    • Two proposals for robust PCA using semidefinite programming
    • M. McCoy and J. Tropp, "Two proposals for robust PCA using semidefinite programming," Electronic Journal of Statistics, 2011.
    • (2011) Electronic Journal of Statistics
    • McCoy, M.1    Tropp, J.2
  • 14
    • 36348936685 scopus 로고    scopus 로고
    • Sparsity and morphological diversity and source separation
    • J. Bobin, Y. M. J. L. Starck, and M. Elad, "Sparsity and morphological diversity and source separation," IEEE Transactions on Image Processing, vol. 16, no. 11, pp. 2662-2674, 2007.
    • (2007) IEEE Transactions on Image Processing , vol.16 , Issue.11 , pp. 2662-2674
    • Bobin, J.1    Starck, Y.M.J.L.2    Elad, M.3
  • 15
    • 71049116435 scopus 로고    scopus 로고
    • Exact matrix completion via convex optimzation
    • E. Candès and B. Recht, "Exact matrix completion via convex optimzation," Foundations of Computational Mathematics, vol. 9, no. 6, pp. 717-772, 2008.
    • (2008) Foundations of Computational Mathematics , vol.9 , Issue.6 , pp. 717-772
    • Candès, E.1    Recht, B.2
  • 20
    • 62749175137 scopus 로고    scopus 로고
    • CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
    • D. Needell and J. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comp. Harmonic Anal., vol. 26, pp. 301-321, 2008.
    • (2008) Appl. Comp. Harmonic Anal. , vol.26 , pp. 301-321
    • Needell, D.1    Tropp, J.2
  • 25
    • 79951886985 scopus 로고    scopus 로고
    • Recovering low-rank matrices from few coefficients in any basis
    • D. Gross, "Recovering low-rank matrices from few coefficients in any basis," IEEE Transactions on Information Theory, vol. 57, no. 3, 2011.
    • (2011) IEEE Transactions on Information Theory , vol.57 , Issue.3
    • Gross, D.1


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