In this paper, we propose a new non-convex regularization term named half-quadratic function to achieve robustness and sparseness for robust principal component analysis, and derive its proximity operator, indicating that the resultant optimization problem can be solved in computationally attractive manner. In addition, the low-rank matrix component is expressed as the factorization form and proximal block co-ordinate descent is leveraged to seek its solution, whose convergence is rigorously analyzed. We prove that any limit point of the iterations is a critical point of the objective function. Furthermore, the parameter that controls the robustness and sparseness in our algorithm, is automatically adjusted according to the statistical residual error. Experimental results based on synthetic and real-world data demonstrate that the devised algorithm can effectively extract the low-rank and sparse components. MATLAB code is available at https://github.com/bestzywang .
Robust PCA via non-convex half-quadratic regularization
Zhi-yong Wang,Xiao Peng Li,H. So,Zhaofeng Liu
Published 2022 in Signal Processing
ABSTRACT
PUBLICATION RECORD
- Publication year
2022
- Venue
Signal Processing
- Publication date
2022-10-01
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-44 of 44 references · Page 1 of 1
CITED BY
Showing 1-16 of 16 citing papers · Page 1 of 1