Publication | Closed Access
A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
89
Citations
34
References
2015
Year
Numerical AnalysisWeighted Residual ErrorSparse RepresentationImage AnalysisEngineeringData ScienceMatrix FactorizationPattern RecognitionMatrix CompletionMultilinear Subspace LearningInverse ProblemsNuclear NormRegularization (Mathematics)Approximation TheoryLow-rank ApproximationLow-rank Matrix Completion
Low-rank matrix completion aims to recover a matrix from a small subset of its entries and has received much attention in the field of computer vision. Most existing methods formulate the task as a low-rank matrix approximation problem. A truncated nuclear norm has recently been proposed as a better approximation to the rank of matrix than a nuclear norm. The corresponding optimization method, truncated nuclear norm regularization (TNNR), converges better than the nuclear norm minimization-based methods. However, it is not robust to the number of subtracted singular values and requires a large number of iterations to converge. In this paper, a TNNR method based on weighted residual error (TNNR-WRE) for matrix completion and its extension model (ETNNR-WRE) are proposed. TNNR-WRE assigns different weights to the rows of the residual error matrix in an augmented Lagrange function to accelerate the convergence of the TNNR method. The ETNNR-WRE is much more robust to the number of subtracted singular values than the TNNR-WRE, TNNR alternating direction method of multipliers, and TNNR accelerated proximal gradient with Line search methods. Experimental results using both synthetic and real visual data sets show that the proposed TNNR-WRE and ETNNR-WRE methods perform better than TNNR and Iteratively Reweighted Nuclear Norm (IRNN) methods.
| Year | Citations | |
|---|---|---|
Page 1
Page 1