Smooth Robust Tensor Completion for Background/Foreground Separation with Missing Pixels: Novel Algorithm with Convergence Guarantee
Not on the map. Why?
Abstract (arXiv)
The objective of this study is to address the problem of background/foreground separation with missing pixels by combining the video acquisition, video recovery, background/foreground separation into a single framework. To achieve this, a smooth robust tensor completion (SRTC) model is proposed to recover the data and decompose it into the static background and smooth foreground, respectively. Specifically, the static background is modeled by the low-rank tucker decomposition and the smooth foreground (moving objects) is modeled by the spatiotemporal continuity, which is enforced by the total variation regularization. An efficient algorithm based on tensor proximal alternating minimization (tenPAM) is implemented to solve the proposed model with global convergence guarantee under very mild conditions. Extensive experiments on real data demonstrate that the proposed method significantly outperforms the state-of-the-art approaches for background/foreground separation with missing pixels.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 11 of its 53 references that are in the map. First posted on arXiv 29 Mar 2022.
Builds on
11 of 53 references.
References · 11
- 2017Hyperspectral Image Restoration via Total Variation Regularized Low-rank Tensor Decompositioncited by 61
- 2014Novel methods for multilinear data completion and de-noising based on tensor-SVDcited by 56
- 2017Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimizationcited by 35
- 2019Background Subtraction in Real Applications: Challenges, Current Models and Future Directionscited by 29
- 2018Bilinear Factor Matrix Norm Minimization for Robust PCA: Algorithms and Applicationscited by 16
- 2015Total Variation Regularized Tensor RPCA for Background Subtraction from Compressive Measurementscited by 14
- 2015Towards Benchmarking Scene Background Initializationcited by 13
- 2015Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Datasetcited by 13
- 2020Robust Low-tubal-rank Tensor Completion based on Tensor Factorization and Maximum Correntopy Criterioncited by 6
- 2020Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifoldcited by 5
- 2020Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Methodcited by 5
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 1.
5 papers.
- 2024Low-Rank Robust Subspace Tensor Clustering for Metro Passenger Flow Modelingcited by 5
- 2024Global-local Fourier Neural Operator for Accelerating Coronal Magnetic Field Modelcited by 4
- 2023Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Datacited by 2
- 2023On Model Compression for Neural Networks: Framework, Algorithm, and Convergence Guaranteecited by 1
- 2025Robust Foreground-Background Separation for Severely-Degraded Videos Using Convolutional Sparse Representation Modelingcited by 1
- 2025Robust Foreground-Background Separation for Severely-Degraded Videos Using Convolutional Sparse Representation Modeling21 Jun 2025
- 2024Global-local Fourier Neural Operator for Accelerating Coronal Magnetic Field Model21 May 2024
- 2024Low-Rank Robust Subspace Tensor Clustering for Metro Passenger Flow Modeling5 Apr 2024
- 2023Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data7 Sep 2023
- 2023On Model Compression for Neural Networks: Framework, Algorithm, and Convergence Guarantee13 Mar 2023