메뉴 건너뛰기




Volumn 21, Issue 8, 2012, Pages 3794-3800

Inductive robust principal component analysis

Author keywords

Error correction; robust principal component analysis (PCA); subspace learning

Indexed keywords

COMPUTATIONAL COSTS; CORRUPTED DATA; DATA MATRICES; DATA SETS; HIGH DIMENSIONAL DATA; HIGH-DIMENSIONAL; HUMAN FACES; LEAST SQUARE ERRORS; LOW RANK APPROXIMATIONS; LOW-DIMENSIONAL SUBSPACE; ONLINE COMPUTATIONS; PCA METHOD; POLYNOMIAL-TIME; PROJECTION MATRIX; REGULARIZED MINIMIZATION PROBLEMS; ROBUST PRINCIPAL COMPONENT ANALYSIS; SUBSPACE LEARNING; TRAINING DATA; TRAINING PROCEDURES; VIDEO SURVEILLANCE;

EID: 84864138018     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2012.2192742     Document Type: Article
Times cited : (161)

References (31)
  • 4
    • 70350743173 scopus 로고    scopus 로고
    • Robust recovery of signals from a structured union of subspaces
    • Nov.
    • Y. C. Eldar and M. Mishali, "Robust recovery of signals from a structured union of subspaces," IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 5302-5316, Nov. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.11 , pp. 5302-5316
    • Eldar, Y.C.1    Mishali, M.2
  • 6
    • 77956529193 scopus 로고    scopus 로고
    • Robust subspace segmentation by low-rank representation
    • G. Liu, Z. Lin, and Y. Yu, "Robust subspace segmentation by low-rank representation," in Proc. Int. Conf. Mach. Learn., 2010, pp. 1-8.
    • (2010) Proc. Int. Conf. Mach. Learn. , pp. 1-8
    • Liu, G.1    Lin, Z.2    Yu, Y.3
  • 7
    • 34548133659 scopus 로고    scopus 로고
    • Segmentation of multivariate mixed data via lossy data coding and compression
    • DOI 10.1109/TPAMI.2007.1085
    • Y. Ma, H. Derksen, W. Hong, and J. Wright, "Segmentation of multivariate mixed data via lossy data coding and compression," IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 9, pp. 1546-1562, Sep. 2007. (Pubitemid 47299910)
    • (2007) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.29 , Issue.9 , pp. 1546-1562
    • Ma, Y.1    Derksen, H.2    Hong, W.3    Wright, J.4
  • 8
    • 0000325341 scopus 로고
    • On lines and planes of closest fit to systems of points in space
    • K. Pearson, "On lines and planes of closest fit to systems of points in space," Philosoph. Mag., vol. 2, no. 6, pp. 559-572, 1901.
    • (1901) Philosoph. Mag. , vol.2 , Issue.6 , pp. 559-572
    • Pearson, K.1
  • 10
    • 0002063041 scopus 로고
    • Robust M-estimators of multivariate location and scatter
    • R. A. Maronna, "Robust M-estimators of multivariate location and scatter," Ann. Stat., vol. 4, no. 1, pp. 51-67, 1976.
    • (1976) Ann. Stat. , vol.4 , Issue.1 , pp. 51-67
    • Maronna, R.A.1
  • 11
    • 84950884569 scopus 로고
    • Robust estimation of dispersion matrices and principal components
    • S. J. Devlin, R. Gnanadesikan, and J. R. Kettenring, "Robust estimation of dispersion matrices and principal components," J. Amer. Stat. Assoc., vol. 76, no. 374, pp. 354-362, 1981.
    • (1981) J. Amer. Stat. Assoc. , vol.76 , Issue.374 , pp. 354-362
    • Devlin, S.J.1    Gnanadesikan, R.2    Kettenring, J.R.3
  • 12
    • 0001337027 scopus 로고
    • Projection-pursuit approach to robust dispersion matrices and principal components: Primary theory and Monte Carlo
    • G. Li and Z. Chen, "Projection-pursuit approach to robust dispersion matrices and principal components: Primary theory and Monte Carlo," J. Amer. Stat. Assoc., vol. 80, no. 391, pp. 759-766, 1985.
    • (1985) J. Amer. Stat. Assoc. , vol.80 , Issue.391 , pp. 759-766
    • Li, G.1    Chen, Z.2
  • 14
    • 79952493979 scopus 로고    scopus 로고
    • Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization
    • J. Wright, A. Ganesh, S. Rao, Y. Peng, and Y. Ma, "Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization," in Proc. Neural Inf. Process. Syst., 2009, pp. 1-9.
    • (2009) Proc. Neural Inf. Process. Syst. , pp. 1-9
    • Wright, J.1    Ganesh, A.2    Rao, S.3    Peng, Y.4    Ma, Y.5
  • 16
    • 78651312555 scopus 로고    scopus 로고
    • Decomposing background topics from keywords by principal component pursuit
    • K. Min, Z. Zhang, J. Wright, and Y. Ma, "Decomposing background topics from keywords by principal component pursuit," in Proc. 19th Int. Conf. Inf. Knowl. Manage., 2010, pp. 269-278.
    • (2010) Proc. 19th Int. Conf. Inf. Knowl. Manage. , pp. 269-278
    • Min, K.1    Zhang, Z.2    Wright, J.3    Ma, Y.4
  • 17
    • 78650977486 scopus 로고    scopus 로고
    • Image tag refinement toward low-rank, content-tag prior and error sparsity
    • G. Zhu, S. Yan, and Y. Ma, "Image tag refinement toward low-rank, content-tag prior and error sparsity," in Proc. Int. Conf. Multimedia, 2010, pp. 461-470.
    • (2010) Proc. Int. Conf. Multimedia , pp. 461-470
    • Zhu, G.1    Yan, S.2    Ma, Y.3
  • 19
    • 0000435292 scopus 로고
    • The ordering of multivariate data
    • V. Barnett, "The ordering of multivariate data," J. Royal Stat. Soc. Ser. A, vol. 3, no. 138, pp. 318-344, 1976.
    • (1976) J. Royal Stat. Soc. Ser. A , vol.3 , Issue.138 , pp. 318-344
    • Barnett, V.1
  • 20
    • 0001409590 scopus 로고
    • Estimation of correlation coefficients by ellipsoidal trimming
    • D. M. Titterington, "Estimation of correlation coefficients by ellipsoidal trimming," Appl. Stat., vol. 27, no. 3, pp. 227-234, 1978.
    • (1978) Appl. Stat. , vol.27 , Issue.3 , pp. 227-234
    • Titterington, D.M.1
  • 21
  • 22
    • 71049116435 scopus 로고    scopus 로고
    • Exact matrix completion via convex optimization
    • E. Candès and B. Recht, "Exact matrix completion via convex optimization," J. Found. Comput. Math., vol. 9, no. 6, pp. 717-772, 2009.
    • (2009) J. Found. Comput. Math. , vol.9 , Issue.6 , pp. 717-772
    • Candès, E.1    Recht, B.2
  • 24
    • 85032760331 scopus 로고    scopus 로고
    • Subspace clustering
    • Mar.
    • R. Vidal, "Subspace clustering," IEEE Signal Process. Mag., vol. 28, no. 2, pp. 52-68, Mar. 2011.
    • (2011) IEEE Signal Process. Mag. , vol.28 , Issue.2 , pp. 52-68
    • Vidal, R.1
  • 26
    • 33744552752 scopus 로고    scopus 로고
    • 1-norm near-solution approximates the sparsest nearsolution
    • D. L. Donoho, "For most large underdetermined systems of equations, the minimal 1-norm near-solution approximates the sparsest nearsolution," Commun. Pure Appl. Math., vol. 59, no. 7, pp. 907-934, 2006.
    • (2006) Commun. Pure Appl. Math. , vol.59 , Issue.7 , pp. 907-934
    • Donoho, D.L.1
  • 28
    • 77951291046 scopus 로고    scopus 로고
    • A singular value thresholding algorithm for matrix completion
    • J. Cai, E. J. Candès, and Z. Shen, "A singular value thresholding algorithm for matrix completion," Soc. Ind. Appl. Math. J. Optim., vol. 20, no. 4, pp. 1956-1982, 2010.
    • (2010) Soc. Ind. Appl. Math. J. Optim. , vol.20 , Issue.4 , pp. 1956-1982
    • Cai, J.1    Candès, E.J.2    Shen, Z.3
  • 30
    • 7444243389 scopus 로고    scopus 로고
    • Statistical modeling of complex backgrounds for foreground object detection
    • Nov.
    • L. Li, W. Huang, I. Y. H. Gu, and Q. Tian, "Statistical modeling of complex backgrounds for foreground object detection," IEEE Trans. Image Process., vol. 13, no. 11, pp. 1459-1472, Nov. 2004.
    • (2004) IEEE Trans. Image Process. , vol.13 , Issue.11 , pp. 1459-1472
    • Li, L.1    Huang, W.2    Gu, I.Y.H.3    Tian, Q.4
  • 31
    • 0347380229 scopus 로고    scopus 로고
    • The CMU pose, illumination, and expression database
    • Dec.
    • T. Sim, S. Baker, and M. Bsat, "The CMU pose, illumination, and expression database," IEEE Trans. Pattern Anal. Mach. Intell., vol. 25, no. 12, pp. 1615-1618, Dec. 2003.
    • (2003) IEEE Trans. Pattern Anal. Mach. Intell. , vol.25 , Issue.12 , pp. 1615-1618
    • Sim, T.1    Baker, S.2    Bsat, M.3


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