Robust PCA using nonconvex rank approximation and sparse regularizer
DOI10.1007/S00034-019-01310-YzbMATH Open1452.94012OpenAlexW2990436289WikidataQ126747164 ScholiaQ126747164MaRDI QIDQ2193603FDOQ2193603
Authors: Jing Dong, Zhichao Xue, Wenwu Wang 
Publication date: 20 August 2020
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://surrey-researchmanagement.esploro.exlibrisgroup.com/view/delivery/44SUR_INST/12140079080002346/13140329830002346
Recommendations
- Robust principal component pursuit via inexact alternating minimization on matrix manifolds
- Bayesian robust principal component analysis with structured sparse component
- scientific article; zbMATH DE number 7448151
- An alternating minimization method for robust principal component analysis
- A novel robust principal component analysis algorithm of nonconvex rank approximation
Factor analysis and principal components; correspondence analysis (62H25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Principal component analysis.
- Title not available (Why is that?)
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Robust principal component analysis?
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Exact matrix completion via convex optimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Image Super-Resolution Via Sparse Representation
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- Performance analysis of blind source separation using canonical correlation
- Total Variation Regularized Tensor RPCA for Background Subtraction From Compressive Measurements
Cited In (15)
- A novel robust principal component analysis method for image and video processing.
- Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
- Robust PCA and pairs of projections in a Hilbert space
- A novel robust principal component analysis algorithm of nonconvex rank approximation
- The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
- Majorization-Minimization on the Stiefel Manifold With Application to Robust Sparse PCA
- Title not available (Why is that?)
- An alternating minimization method for robust principal component analysis
- Exact guarantees on the absence of spurious local minima for non-negative rank-1 robust principal component analysis
- 2DPCA with L1-norm for simultaneously robust and sparse modelling
- Bayesian robust principal component analysis with structured sparse component
- A new model for sparse and low-rank matrix decomposition
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Robust principal component pursuit via inexact alternating minimization on matrix manifolds
- Robust sparse principal component analysis: situation of full sparseness
Uses Software
This page was built for publication: Robust PCA using nonconvex rank approximation and sparse regularizer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193603)
