A novel robust principal component analysis algorithm of nonconvex rank approximation

DOI10.1155/2020/9356935MaRDI QIDQ2004251zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 14 October 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/9356935

Mathematics Subject Classification ID

Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Robust PCA using nonconvex rank approximation and sparse regularizer
• Fast algorithms for robust principal component analysis with an upper bound on the rank
• scientific article; zbMATH DE number 7448151
• An alternating minimization method for robust principal component analysis
• Nonconvex Regularized Robust PCA Using the Proximal Block Coordinate Descent Algorithm
• The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
• On the complexity of robust PCA and \(\ell_1\)-norm low-rank matrix approximation
• Robust principal component analysis: a factorization-based approach with linear complexity
• Robust sparse \(L_p\)-norm principal component analysis

Cites work

• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 4032473 (Why is no real title available?)
• A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
• A General-Thresholding Solution for l_p(0 <; p <; 1) Regularized CT Reconstruction
• A Singular Value Thresholding Algorithm for Matrix Completion
• Analysis of multi-stage convex relaxation for sparse regularization
• Background Subtraction Based on Low-Rank and Structured Sparse Decomposition
• Confidence Region of Singular Subspaces for Low-Rank Matrix Regression
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• De-noising by soft-thresholding
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM
• Nearly unbiased variable selection under minimax concave penalty
• Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
• Principal component analysis.
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

Cited in

(9)

• Generalized singular value thresholding operator based nonconvex low-rank and sparse decomposition for moving object detection
• A novel robust principal component analysis method for image and video processing.
• The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
• Stable local-smooth principal component pursuit
• Fast non-convex low-rank matrix decomposition for separation of potential field data using minimal memory
• A new model for sparse and low-rank matrix decomposition
• scientific article; zbMATH DE number 7448151 (Why is no real title available?)
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds
• Robust PCA using nonconvex rank approximation and sparse regularizer

This page was built for publication: A novel robust principal component analysis algorithm of nonconvex rank approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004251)