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

zbMATH Open1544.65105MaRDI QIDQ6582885FDOQ6582885

Authors: Bo Shen, Weijun Xie, Zhenyu (James) Kong 

Publication date: 5 August 2024

Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Recommendations

• An improved total variation regularized RPCA for moving object detection with dynamic background
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• Augmented Lagrangian alternating direction method for tensor RPCA
• Background subtraction with Kronecker-basis-representation based tensor sparsity and \(l_{1,1,2}\) norm

zbMATH Keywords

global convergencelow-rank propertyrobust tensor completion (RTC)spatio-temporal continuitytensor proximal alternating minimization (tenPAM)

Mathematics Subject Classification ID

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

Cites Work

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

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

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