메뉴 건너뛰기




Volumn 60, Issue 10, 2012, Pages 5176-5190

Robust PCA as bilinear decomposition with outlier-sparsity regularization

Author keywords

(Group) Lasso; outlier rejection; principal component analysis; robust statistics; sparsity

Indexed keywords

(GROUP) LASSO; COMPRESSIVE SAMPLING; CONVEX RELAXATION; DIMENSIONALITY REDUCTION; FACTOR ANALYSIS MODEL; FEATURE SPACE; HIGH DIMENSIONAL DATA; OUTLIER REJECTION; PERSONALITY ASSESSMENTS; PREFERENCE MEASUREMENT; PRINCIPAL COMPONENTS; REAL TIME; REGULARIZATION PARAMETERS; ROBUST ESTIMATORS; ROBUST PCA; ROBUST STATISTICS; ROBUSTIFICATION; SCALABLE ALGORITHMS; SELECTION OPERATORS; SIGNAL SUB-SPACE; SOCIAL NETWORKS; SPARSITY; SYNTHETIC AND REAL DATA; VARIABLE SELECTION; VIDEO SURVEILLANCE;

EID: 84866502467     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2012.2204986     Document Type: Article
Times cited : (80)

References (45)
  • 1
    • 77953779332 scopus 로고    scopus 로고
    • Online adaptive estimation of sparse signals: Where RLS meets the-norm
    • Jul.
    • D. Angelosante, J. A. Bazerque, and G. B. Giannakis, "Online adaptive estimation of sparse signals: Where RLS meets the-norm," IEEE Trans. Signal Process., vol. 58, pp. 3436-3447, Jul. 2010.
    • (2010) IEEE Trans. Signal Process. , vol.58 , pp. 3436-3447
    • Angelosante, D.1    Bazerque, J.A.2    Giannakis, G.B.3
  • 2
    • 79952389882 scopus 로고    scopus 로고
    • Online identification and tracking of subspaces from highly incomplete information
    • Monticello, IL, Sep./Oct.
    • L. Balzano, R. Nowak, and B. Recht, "Online identification and tracking of subspaces from highly incomplete information," in Proc. 48th Allerton Conf., Monticello, IL, Sep./Oct. 2010, pp. 704-711.
    • (2010) Proc. 48th Allerton Conf. , pp. 704-711
    • Balzano, L.1    Nowak, R.2    Recht, B.3
  • 4
    • 0001011286 scopus 로고
    • Robust procedures in multivariate analysis I: Robust covariance estimation
    • N. A. Campbell, "Robust procedures in multivariate analysis I: Robust covariance estimation," Appl. Stat., vol. 29, pp. 231-237, 1980.
    • (1980) Appl. Stat. , vol.29 , pp. 231-237
    • Campbell, N.A.1
  • 5
    • 79960675858 scopus 로고    scopus 로고
    • Robust principal component analysis?
    • Mar. Article No. 11
    • E. J. Candes, X. Li, Y. Ma, and J. Wright, "Robust principal component analysis?," J. ACM, vol. 58, Mar. 2011, Article No. 11.
    • (2011) J. ACM , vol.58
    • Candes, E.J.1    Li, X.2    Ma, Y.3    Wright, J.4
  • 6
    • 57349174008 scopus 로고    scopus 로고
    • Enhancing sparsity by reweighted minimization
    • Dec.
    • E. J. Candes, M. B. Wakin, and S. Boyd, "Enhancing sparsity by reweighted minimization," J. Fourier Anal. Appl., vol. 14, pp. 877-905, Dec. 2008.
    • (2008) J. Fourier Anal. Appl. , vol.14 , pp. 877-905
    • Candes, E.J.1    Wakin, M.B.2    Boyd, S.3
  • 8
    • 0141742284 scopus 로고    scopus 로고
    • A framework for robust subspace learning
    • F. de la Torre and M. J. Black, "A framework for robust subspace learning," Int. J. Comput. Vis., vol. 54, pp. 1183-209, 2003.
    • (2003) Int. J. Comput. Vis. , vol.54 , pp. 1183-1209
    • De La Torre, F.1    Black, M.J.2
  • 9
    • 80052891985 scopus 로고    scopus 로고
    • Bayesian robust principal component analysis
    • X. Ding, L. He, and L. Carin, "Bayesian robust principal component analysis," IEEE Trans. Image Process., vol. 20, no. 12, pp. 3419-3430, 2011.
    • IEEE Trans. Image Process. , vol.20 , Issue.12 , pp. 3419-3430
    • Ding, X.1    He, L.2    Carin, L.3
  • 10
    • 1542784498 scopus 로고    scopus 로고
    • Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
    • J. Fan and R. Li, "Variable selection via nonconcave penalized likelihood and its oracle properties," J. Amer. Stat. Assoc., vol. 96, pp. 1348-1360, 2001. (Pubitemid 33695585)
    • (2001) Journal of the American Statistical Association , vol.96 , Issue.456 , pp. 1348-1360
    • Fan, J.1    Li, R.2
  • 11
    • 0142215333 scopus 로고    scopus 로고
    • Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices
    • Denver, CO, Jun.
    • M. Fazel, H. Hindi, and S. Boyd, "Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices," in Proc. Amer. Control Conf., Denver, CO, Jun. 2003, pp. 2156-2162.
    • (2003) Proc. Amer. Control Conf. , pp. 2156-2162
    • Fazel, M.1    Hindi, H.2    Boyd, S.3
  • 13
    • 42549115301 scopus 로고    scopus 로고
    • An inverse problem approach to robust regression
    • Phoenix, AZ, Mar.
    • J. J. Fuchs, "An inverse problem approach to robust regression," in Proc. Int. Conf. Acoust., Speech, Signal Process., Phoenix, AZ, Mar. 1999, pp. 180-188.
    • (1999) Proc. Int. Conf. Acoust., Speech, Signal Process. , pp. 180-188
    • Fuchs, J.J.1
  • 20
    • 78049360641 scopus 로고    scopus 로고
    • Algorithms for robust linear regression by exploiting the connection to sparse signal recovery
    • Dallas, TX, Mar.
    • Y. Jin and B. D. Rao, "Algorithms for robust linear regression by exploiting the connection to sparse signal recovery," in Proc. Int. Conf. Acoust., Speech, Signal Process., Dallas, TX, Mar. 2010, pp. 3830-3833.
    • (2010) Proc. Int. Conf. Acoust., Speech, Signal Process. , pp. 3830-3833
    • Jin, Y.1    Rao, B.D.2
  • 21
    • 56349168237 scopus 로고    scopus 로고
    • Paradigm shift to the inte-grative big-five trait taxonomy: History, measurement, and conceptual issues
    • O.P. John, R.W. Robins, and L.A. Pervin, Eds. New York: Guilford Press
    • O. P. John, L. P. Naumann, and C. J. Soto, "Paradigm shift to the inte-grative big-five trait taxonomy: History, measurement, and conceptual issues," in Handbook of Personality: Theory and Research, O.P. John, R.W. Robins, and L.A. Pervin, Eds. New York: Guilford Press, 2008.
    • (2008) Handbook of Personality: Theory and Research
    • John, O.P.1    Naumann, L.P.2    Soto, C.J.3
  • 23
    • 79959197541 scopus 로고    scopus 로고
    • From sparse signals to sparse residuals for robust sensing
    • Jul.
    • V. Kekatos and G. B. Giannakis, "From sparse signals to sparse residuals for robust sensing," IEEE Trans. Signal Process., vol. 59, pp. 3355-3368, Jul. 2011.
    • (2011) IEEE Trans. Signal Process. , vol.59 , pp. 3355-3368
    • Kekatos, V.1    Giannakis, G.B.2
  • 24
    • 76749107542 scopus 로고    scopus 로고
    • Online learning for matrix factorization and sparse coding
    • Jan.
    • J. Mairal, J. Bach, J. Ponce, and G. Sapiro, "Online learning for matrix factorization and sparse coding," J. Mach. Learn. Res., vol. 11, pp. 19-60, Jan. 2010.
    • (2010) J. Mach. Learn. Res. , vol.11 , pp. 19-60
    • Mairal, J.1    Bach, J.2    Ponce, J.3    Sapiro, G.4
  • 25
    • 84885088639 scopus 로고    scopus 로고
    • In-network sparsity-regularized rank minimization: Algorithms and applications
    • [Online]. Available submitted for publication
    • M. Mardani, G. Mateos, and G. B. Giannakis, "In-network sparsity-regularized rank minimization: Algorithms and applications," IEEE Trans. Signal Process., 2012 [Online]. Available: http://arxiv.org/abs/1203. 1570, submitted for publication
    • (2012) IEEE Trans. Signal Process.
    • Mardani, M.1    Mateos, G.2    Giannakis, G.B.3
  • 26
    • 0029291966 scopus 로고
    • Sparse approximate solutions to linear systems
    • B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, pp. 227-234, 1995.
    • (1995) SIAM J. Comput. , vol.24 , pp. 227-234
    • Natarajan, B.K.1
  • 27
    • 79955502711 scopus 로고    scopus 로고
    • Multidimensional shrinkage-thresholding operator and group LASSO penalties
    • Jun.
    • A. T. Puig, A. Wiesel, and A. O. Hero, "Multidimensional shrinkage-thresholding operator and group LASSO penalties," IEEE Signal Process. Lett., vol. 18, pp. 363-366, Jun. 2011.
    • (2011) IEEE Signal Process. Lett. , vol.18 , pp. 363-366
    • Puig, A.T.1    Wiesel, A.2    Hero, A.O.3
  • 29
    • 78549288866 scopus 로고    scopus 로고
    • Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
    • B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization," SIAM Rev., vol. 52, pp. 471-501, 2010.
    • (2010) SIAM Rev. , vol.52 , pp. 471-501
    • Recht, B.1    Fazel, M.2    Parrilo, P.A.3
  • 31
    • 21144460994 scopus 로고
    • Traitedness and the assessment of response pattern scalability
    • S. P. Reise and N. G. Waller, "Traitedness and the assessment of response pattern scalability," J. Personality Social Psychol., vol. 65, pp. 143-151, 1993.
    • (1993) J. Personality Social Psychol. , vol.65 , pp. 143-151
    • Reise, S.P.1    Waller, N.G.2
  • 33
    • 84865131152 scopus 로고    scopus 로고
    • A Generalized Representer Theorem
    • Computational Learning Theory
    • B. Scholkopf, R. Herbrich, and A. J. Smola, "A generalized representer theorem," Computation Learning Theory, ser. Lecture Notes in Computer Science, vol. 2111, pp. 416-426, 2001. (Pubitemid 33312837)
    • (2001) Lecture Notes In Computer Science , Issue.2111 , pp. 416-426
    • Scholkopf, B.1    Herbrich, R.2    Smola, A.J.3
  • 34
    • 0347243182 scopus 로고    scopus 로고
    • Nonlinear Component Analysis as a Kernel Eigenvalue Problem
    • B. Scholkopf, A. J. Smola, and K. R. Muller, "Nonlinear component analysis as a kernel eigenvalue problem," Neural Comput., vol. 10, pp. 1299-1319, 1998. (Pubitemid 128463674)
    • (1998) Neural Computation , vol.10 , Issue.5 , pp. 1299-1319
    • Scholkopf, B.1    Smola, A.2    Muller, K.-R.3
  • 37
    • 33645712308 scopus 로고    scopus 로고
    • Just relax: Convex programming methods for identifying sparse signals in noise
    • DOI 10.1109/TIT.2005.864420
    • J. Tropp, "Just relax: Convex programming methods for identifying sparse signals," IEEE Trans. Inf. Theory, vol. 51, pp. 1030-1051, Mar. 2006. (Pubitemid 46444890)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.3 , pp. 1030-1051
    • Tropp, J.A.1
  • 38
    • 0035533631 scopus 로고    scopus 로고
    • Convergence of block coordinate descent method for non-differentiable maximization
    • P. Tseng, "Convergence of block coordinate descent method for non-differentiable maximization," J. Optim. Theory Appl., vol. 109, pp. 473-492, 2001.
    • (2001) J. Optim. Theory Appl. , vol.109 , pp. 473-492
    • Tseng, P.1
  • 39
    • 84877975535 scopus 로고    scopus 로고
    • Measuring psychopathology with nonstandard irt models: Fitting the four parameter model to the MMPI
    • S. Embretson, Ed. Washington, DC: Amer. Psych. Assoc
    • N. Waller and S. Reise, "Measuring psychopathology with nonstandard irt models: Fitting the four parameter model to the MMPI," in New Directions in Psychological Measurement With Model-Based Approaches, S. Embretson, Ed. Washington, DC: Amer. Psych. Assoc.
    • New Directions in Psychological Measurement with Model-Based Approaches
    • Waller, N.1    Reise, S.2
  • 41
    • 0029184173 scopus 로고
    • Robust principal component analysis by self-organizing rules based on statistical physics approach
    • Jan
    • L. Xu and A. L. Yuille, "Robust principal component analysis by self-organizing rules based on statistical physics approach," IEEE Trans. Neural Netw., vol. 6, pp. 131-143, Jan. 1995.
    • (1995) IEEE Trans. Neural Netw. , vol.6 , pp. 131-143
    • Xu, L.1    Yuille, A.L.2
  • 42
    • 0029196852 scopus 로고
    • Projection approximation subspace tracking
    • Jan
    • B. Yang, "Projection approximation subspace tracking," IEEE Trans. Signal Process., vol. 43, pp. 95-107, Jan. 1995.
    • (1995) IEEE Trans. Signal Process. , vol.43 , pp. 95-107
    • Yang, B.1


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