메뉴 건너뛰기




Volumn 46, Issue 1, 2013, Pages 163-173

A fast tri-factorization method for low-rank matrix recovery and completion

Author keywords

Low rank representation; Low rank and sparse decomposition; Matrix completion; Nuclear norm minimization; Rank minimization

Indexed keywords

ALTERNATING DIRECTION METHODS; COMPLETION PROBLEM; COMPUTATION COSTS; CONVEX RELAXATION; ITERATIVE ALGORITHM; LOW RANK; LOW-RANK MATRICES; MATRIX COMPLETION; MATRIX RANK; MINIMIZATION ALGORITHMS; MINIMIZATION PROBLEMS; REAL WORLD DATA; ROBUST PRINCIPAL COMPONENT ANALYSIS; SPARSE DECOMPOSITION; VISION COMMUNITIES;

EID: 84866023409     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2012.07.003     Document Type: Article
Times cited : (76)

References (52)
  • 1
    • 72549110327 scopus 로고    scopus 로고
    • Interior-point method for nuclear norm approximation with application to system identification
    • Z. Liu, and L. Vandenberghe Interior-point method for nuclear norm approximation with application to system identification SIAM Journal on Matrix Analysis and Applications 31 3 2009 1235 1256
    • (2009) SIAM Journal on Matrix Analysis and Applications , vol.31 , Issue.3 , pp. 1235-1256
    • Liu, Z.1    Vandenberghe, L.2
  • 2
    • 79960675858 scopus 로고    scopus 로고
    • Robust principal component analysis?
    • E.J. Candès, X. Li, Y. Ma, and J. Wright Robust principal component analysis? Journal of ACM 58 3 2011 1 37
    • (2011) Journal of ACM , vol.58 , Issue.3 , pp. 1-37
    • Candès, E.J.1    Li, X.2    Ma, Y.3    Wright, J.4
  • 5
    • 64849112307 scopus 로고    scopus 로고
    • Low-rank matrix fitting based on subspace perturbation analysis with applications to structure from motion
    • H. Jia, and A.M. Martinez Low-rank matrix fitting based on subspace perturbation analysis with applications to structure from motion IEEE Transactions on Pattern Analysis and Machine Intelligence 31 5 2009 841 854
    • (2009) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.31 , Issue.5 , pp. 841-854
    • Jia, H.1    Martinez, A.M.2
  • 13
    • 84863042818 scopus 로고    scopus 로고
    • Latent low-rank representation for subspace segmentation and feature extraction
    • G. Liu, S. Yan, Latent low-rank representation for subspace segmentation and feature extraction, in: Proceedings of the IEEE Conference on Computer Vision (ICCV), 2011, pp. 1615-1622.
    • (2011) Proceedings of the IEEE Conference on Computer Vision (ICCV) , pp. 1615-1622
    • Liu, G.1    Yan, S.2
  • 15
    • 85162350693 scopus 로고    scopus 로고
    • Linearized alternating direction method with adaptive penalty for low-rank representation
    • Z. Lin, R. Liu, Z. Su, Linearized alternating direction method with adaptive penalty for low-rank representation, in: Advances in Neural Information Processing Systems (NIPS) 25, 2011, pp. 612-620.
    • (2011) Advances in Neural Information Processing Systems (NIPS) , vol.25 , pp. 612-620
    • Lin, Z.1    Liu, R.2    Su, Z.3
  • 19
    • 78049448383 scopus 로고    scopus 로고
    • An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems
    • K.-C. Toh, and S. Yun An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems Pacific Journal of Optimization 6 2010 615 640
    • (2010) Pacific Journal of Optimization , vol.6 , pp. 615-640
    • Toh, K.-C.1    Yun, S.2
  • 22
    • 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 SIAM Journal on Optimization 20 4 2010 1956 1982
    • (2010) SIAM Journal on Optimization , vol.20 , Issue.4 , pp. 1956-1982
    • Cai, J.1    Candès, E.J.2    Shen, Z.3
  • 23
    • 79957957723 scopus 로고    scopus 로고
    • Fixed point and Bregman iterative methods for matrix rank minimization
    • S. Ma, D. Goldfarb, and L. Chen Fixed point and Bregman iterative methods for matrix rank minimization Mathematical Programming Series A 128 1 2011 321 353
    • (2011) Mathematical Programming Series A , vol.128 , Issue.1 , pp. 321-353
    • Ma, S.1    Goldfarb, D.2    Chen, L.3
  • 26
    • 78549288866 scopus 로고    scopus 로고
    • Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
    • B. Recht, M. Fazel, and P. Parrilo Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization SIAM Review 52 3 2010 471 501
    • (2010) SIAM Review , vol.52 , Issue.3 , pp. 471-501
    • Recht, B.1    Fazel, M.2    Parrilo, P.3
  • 30
    • 84857050380 scopus 로고    scopus 로고
    • Graph dual regularization non-negative matrix factorization for co-clustering
    • F. Shang, L.C. Jiao, and F. Wang Graph dual regularization non-negative matrix factorization for co-clustering Pattern Recognition 45 6 2012 2237 2250
    • (2012) Pattern Recognition , vol.45 , Issue.6 , pp. 2237-2250
    • Shang, F.1    Jiao, L.C.2    Wang, F.3
  • 33
    • 35048885164 scopus 로고    scopus 로고
    • Multivariate regression via stiefel manifold constraints
    • G.H. Bakir, A. Gretton, M.O. Franz, B. Schölkopf, Multivariate regression via stiefel manifold constraints, in: Proceedings of the 26th DAGM Symposium, 2004, pp. 262-269.
    • (2004) Proceedings of the 26th DAGM Symposium , pp. 262-269
    • Bakir, G.H.1
  • 34
    • 85014561619 scopus 로고    scopus 로고
    • A fast iterative shrinkage-thresholding algorithm for linear inverse problems
    • A. Beck, and M. Teboulle A fast iterative shrinkage-thresholding algorithm for linear inverse problems SIAM Journal on Imaging Sciences 2 2009 183 202
    • (2009) SIAM Journal on Imaging Sciences , vol.2 , pp. 183-202
    • Beck, A.1    Teboulle, M.2
  • 35
    • 84977895355 scopus 로고    scopus 로고
    • Bregman iterative algorithms for l1-minimization with applications to compressed sensing
    • W. Yin, S. Osher, D. Goldfarb, and J. Darbon Bregman iterative algorithms for l1-minimization with applications to compressed sensing SIAM Journal on Imaging Sciences 1 1 2008 143 168
    • (2008) SIAM Journal on Imaging Sciences , vol.1 , Issue.1 , pp. 143-168
    • Yin, W.1    Osher, S.2    Goldfarb, D.3    Darbon, J.4
  • 38
    • 70350743173 scopus 로고    scopus 로고
    • Robust recovery of signals from a structured union of subspaces
    • Y.C. Eldar, and M. Mishali Robust recovery of signals from a structured union of subspaces IEEE Transactions on Information Theory 55 11 2009 5302 5316
    • (2009) IEEE Transactions on Information Theory , vol.55 , Issue.11 , pp. 5302-5316
    • Eldar, Y.C.1    Mishali, M.2
  • 40
    • 69049112203 scopus 로고    scopus 로고
    • Sparsity preserving projections with applications to face recognition
    • L. Qiao, S. Chen, and X. Tan Sparsity preserving projections with applications to face recognition Pattern Recognition 43 1 2010 331 341
    • (2010) Pattern Recognition , vol.43 , Issue.1 , pp. 331-341
    • Qiao, L.1    Chen, S.2    Tan, X.3
  • 42
    • 33751075906 scopus 로고    scopus 로고
    • Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix
    • P. Drineas, R. Kannan, and M.W. Mahoney Fast Monte Carlo algorithms for matrices II: computing a low-rank approximation to a matrix SIAM Journal on Computing 36 1 2006 158 183
    • (2006) SIAM Journal on Computing , vol.36 , Issue.1 , pp. 158-183
    • Drineas, P.1    Kannan, R.2    Mahoney, M.W.3
  • 43
    • 7044231546 scopus 로고    scopus 로고
    • An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
    • I. Daubechies, M. Defrise, and C. De Mol An iterative thresholding algorithm for linear inverse problems with a sparsity constraint Communications on Pure and Applied Mathematics 57 11 2004 1413 1457
    • (2004) Communications on Pure and Applied Mathematics , vol.57 , Issue.11 , pp. 1413-1457
    • Daubechies, I.1    Defrise, M.2    De Mol, C.3
  • 44
    • 85024122496 scopus 로고    scopus 로고
    • A fast algorithm for edge-preserving variational multichannel image restoration
    • J. Yang, W. Yin, Y. Zhang, and Y. Wang A fast algorithm for edge-preserving variational multichannel image restoration SIAM Journal on Imaging Sciences 2 2 2009 569 592
    • (2009) SIAM Journal on Imaging Sciences , vol.2 , Issue.2 , pp. 569-592
    • Yang, J.1    Yin, W.2    Zhang, Y.3    Wang, Y.4
  • 49
    • 33745812742 scopus 로고    scopus 로고
    • A general framework for motion segmentation: Independent, articulated, rigid, non-rigid, degenerate and non-degenerate
    • J. Yan, M. Pollefeys, A general framework for motion segmentation: independent, articulated, rigid, non-rigid, degenerate and non-degenerate, in: Proceedings of the European Conference on Computer Vision (ECCV), 2006, pp. 94-106.
    • (2006) Proceedings of the European Conference on Computer Vision (ECCV) , pp. 94-106
    • Yan, J.1    Pollefeys, M.2
  • 50
    • 0019574599 scopus 로고
    • Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography
    • M. Fischler, and R. Bolles Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography Communications of the ACM 24 6 1981 381 395
    • (1981) Communications of the ACM , vol.24 , Issue.6 , pp. 381-395
    • Fischler, M.1    Bolles, R.2
  • 51
    • 0032154138 scopus 로고    scopus 로고
    • A multibody factorization method for independently moving objects
    • J. Costeira, and T. Kanade A multibody factorization method for independently moving objects International Journal of Computer Vision 29 3 1998 159 179
    • (1998) International Journal of Computer Vision , vol.29 , Issue.3 , pp. 159-179
    • Costeira, J.1    Kanade, T.2


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