Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Dataset

Abstract

Recent research on problem formulations based on decomposition into low-rank plus sparse matrices shows a suitable framework to separate moving objects from the background. The most representative problem formulation is the Robust Principal Component Analysis (RPCA) solved via Principal Component Pursuit (PCP) which decomposes a data matrix in a low-rank matrix and a sparse matrix. However, similar robust implicit or explicit decompositions can be made in the following problem formulations: Robust Non-negative Matrix Factorization (RNMF), Robust Matrix Completion (RMC), Robust Subspace Recovery (RSR), Robust Subspace Tracking (RST) and Robust Low-Rank Minimization (RLRM). The main goal of these similar problem formulations is to obtain explicitly or implicitly a decomposition into low-rank matrix plus additive matrices. In this context, this work aims to initiate a rigorous and comprehensive review of the similar problem formulations in robust subspace learning and tracking based on decomposition into low-rank plus additive matrices for testing and ranking existing algorithms for background/foreground separation. For this, we first provide a preliminary review of the recent developments in the different problem formulations which allows us to define a unified view that we called Decomposition into Low-rank plus Additive Matrices (DLAM). Then, we examine carefully each method in each robust subspace learning/tracking frameworks with their decomposition, their loss functions, their optimization problem and their solvers. Furthermore, we investigate if incremental algorithms and real-time implementations can be achieved for background/foreground separation. Finally, experimental results on a large-scale dataset called Background Models Challenge (BMC 2012) show the comparative performance of 32 different robust subspace learning/tracking methods.

121 pages, 5 figures, submitted to Computer Science Review. arXiv admin note: text overlap with arXiv:1312.7167, arXiv:1109.6297, arXiv:1207.3438, arXiv:1105.2126, arXiv:1404.7592, arXiv:1210.0805, arXiv:1403.8067 by other authors, Computer Science Review, November 2016

References in corpus (8)

• Robust PCA via Nonconvex Rank Approximation
• Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
• Fast Robust PCA on Graphs
• Compressed Dynamic Mode Decomposition for Background Modeling
• Randomized Low-Rank Dynamic Mode Decomposition for Motion Detection
• Surveillance Video Processing Using Compressive Sensing
• Polar $n$-Complex and $n$-Bicomplex Singular Value Decomposition and Principal Component Pursuit
• Discussion: Latent variable graphical model selection via convex optimization

Cited by in corpus (11)

• Sparse Principal Component Analysis via Variable Projection
• Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
• Randomized Matrix Decompositions using R
• A Fusion Framework for Camouflaged Moving Foreground Detection in the Wavelet Domain
• Error Bounded Foreground and Background Modeling for Moving Object Detection in Satellite Videos
• Video Big Data Analytics in the Cloud: A Reference Architecture, Survey, Opportunities, and Open Research Issues
• Online Structured Sparsity-based Moving Object Detection from Satellite Videos
• Camera-trap images segmentation using multi-layer robust principal component analysis
• Graph CNN for Moving Object Detection in Complex Environments from Unseen Videos
• Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit
• Fast Multilevel Algorithms for Compressive Principle Component Pursuit