Smooth robust tensor completion for background/foreground separation with missing pixels: novel algorithm with convergence guarantee

Numerical mathematical programming methods (65K05) Vector and tensor algebra, theory of invariants (15A72) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

Unnamed Item
Tensor Decompositions and Applications
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
On the linear convergence of the alternating direction method of multipliers
Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
Factorization strategies for third-order tensors
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
Low-rank tensor train for tensor robust principal component analysis
Exact matrix completion via convex optimization
Handbook of Robust Low-Rank and Sparse Matrix Decomposition
Proximal Splitting Methods in Signal Processing
Matrix Completion With Column Manipulation: Near-Optimal Sample-Robustness-Rank Tradeoffs
Robust principal component analysis?
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
The Split Bregman Method for L1-Regularized Problems
Total Variation Regularized Tensor RPCA for Background Subtraction From Compressive Measurements
Tensor Factorization for Low-Rank Tensor Completion
SVD-Based Tensor-Completion Technique for Background Initialization
On the convergence of higher-order orthogonal iteration
De-noising by soft-thresholding
Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization
Robust Low-Rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method
Robust Low-Rank Tensor Completion Based on Tensor Ring Rank via $\ell _{p,\epsilon }$-Norm
Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
An Augmented Lagrangian Method for Total Variation Video Restoration
Alternating Projections on Manifolds
The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
Matrix completion with column outliers and sparse noise

This page was built for publication: Smooth robust tensor completion for background/foreground separation with missing pixels: novel algorithm with convergence guarantee