A fast tri-factorization method for low-rank matrix recovery and completion
DOI10.1016/J.PATCOG.2012.07.003zbMATH Open1248.68437OpenAlexW2089088255MaRDI QIDQ456030FDOQ456030
Authors: Yuanyuan Liu, Licheng Jiao, Fanhua Shang 
Publication date: 23 October 2012
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2012.07.003
Recommendations
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Fixed point and Bregman iterative methods for matrix rank minimization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Robust principal component analysis: a factorization-based approach with linear complexity
matrix completionrank minimizationnuclear norm minimizationlow-rank and sparse decompositionlow rank representation
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)
Cited In (9)
- Alternating direction method of multipliers for generalized low-rank tensor recovery
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- Robust graph regularized nonnegative matrix factorization for clustering
- Robust Manhattan non-negative matrix factorization for image recovery and representation
- An inexact splitting method for the subspace segmentation from incomplete and noisy observations
- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- Robust low-rank tensor completion via new regularized model with approximate SVD
Uses Software
This page was built for publication: A fast tri-factorization method for low-rank matrix recovery and completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456030)
