Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset

DOI10.1016/j.cosrev.2016.11.001zbMath1398.68572arXiv1511.01245OpenAlexW3111652977WikidataQ56028211 ScholiaQ56028211MaRDI QIDQ518124

Thierry Bouwmans, El-Hadi Zahzah, Sajid Javed, Andrews Sobral, Soon Ki Jung

Publication date: 28 March 2017

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.01245

zbMATH Keywords

robust principal component analysislow rank minimizationrobust matrix completionbackground subtractionsubspace trackingforeground detectionrobust non-negative matrix factorization

Mathematics Subject Classification ID

Related Items (23)

A survey on deep learning and its applications ⋮ Decentralized Dictionary Learning Over Time-Varying Digraphs ⋮ Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes ⋮ Decomposition in multidimensional Boolean-optimization problems with sparse matrices ⋮ Efficient and robust background modeling with dynamic mode decomposition ⋮ Background subtraction with Kronecker-basis-representation based tensor sparsity and \(l_{1,1,2}\) norm ⋮ Nonsmooth rank-one matrix factorization landscape ⋮ Adaptive robust principal component analysis ⋮ An improved total variation regularized RPCA for moving object detection with dynamic background ⋮ An efficient semi-proximal ADMM algorithm for low-rank and sparse regularized matrix minimization problems with real-world applications ⋮ Quaternion-based color image completion via logarithmic approximation ⋮ Compressed sensing of low-rank plus sparse matrices ⋮ Background subtraction using adaptive singular value decomposition ⋮ New robust PCA for outliers and heavy sparse noises' detection via affine transformation, the \(L_{\ast, w}\) and \(L_{2,1}\) norms, and spatial weight matrix in high-dimensional images: from the perspective of signal processing ⋮ An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization ⋮ Low-rank and sparse matrices fitting algorithm for low-rank representation ⋮ Sparse Principal Component Analysis via Variable Projection ⋮ ORCA: outlier detection and robust clustering for attributed graphs ⋮ Moving objects detection with a moving camera: a comprehensive review ⋮ Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data ⋮ Generalized singular value thresholding operator based nonconvex low-rank and sparse decomposition for moving object detection ⋮ Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction ⋮ Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion

Uses Software

• PDCO
• SPGL1
• CoSaMP
• ElemStatLearn
• LMaFit
• softImpute
• rsvd
• ADMiRA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Latent variable graphical model selection via convex optimization
• A novel robust principal component analysis method for image and video processing.
• Incremental principal component pursuit for video background modeling
• Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
• Variational Bayesian sparse additive matrix factorization
• Surveillance video processing using compressive sensing
• Strongly convex programming for exact matrix completion and robust principal component analysis
• A fast tri-factorization method for low-rank matrix recovery and completion
• An efficient matrix factorization based low-rank representation for subspace clustering
• An alternating direction method with increasing penalty for stable principal component pursuit
• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• On the sublinear convergence rate of multi-block ADMM
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• A framework for robust subspace learning
• Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
• A generalized robust minimization framework for low-rank matrix recovery
• Multi-stage convex relaxation method for low-rank and sparse matrix separation problem
• Robust bilinear factorization with missing and grossly corrupted observations
• Least angle regression. (With discussion)
• Traditional and recent approaches in background modeling for foreground detection: an overview
• Optimization of the regularization in background and foreground modeling
• A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint
• Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
• A unified approach for minimizing composite norms
• Handbook of Robust Low-Rank and Sparse Matrix Decomposition
• Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods
• Limited Memory Block Krylov Subspace Optimization for Computing Dominant Singular Value Decompositions
• Background Modeling and Foreground Detection for Video Surveillance
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• A First-Order Augmented Lagrangian Method for Compressed Sensing
• Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Robust principal component analysis?
• Rank-Sparsity Incoherence for Matrix Decomposition
• Outlier Detection Using Nonconvex Penalized Regression
• Robust Video Restoration by Joint Sparse and Low Rank Matrix Approximation
• The Split Bregman Method for L1-Regularized Problems
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Atomic Decomposition by Basis Pursuit
• The Geometry of Algorithms with Orthogonality Constraints
• An MDL Framework for Sparse Coding and Dictionary Learning
• Sparse Bayesian Methods for Low-Rank Matrix Estimation
• Robust PCA as Bilinear Decomposition With Outlier-Sparsity Regularization
• An Online Algorithm for Separating Sparse and Low-Dimensional Signal Sequences From Their Sum
• Robust PCA With Partial Subspace Knowledge
• Robust Subspace Tracking With Missing Entries: The Set-Theoretic Approach
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• Bayesian Robust Principal Component Analysis
• Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
• Double Nuclear Norm-Based Matrix Decomposition for Occluded Image Recovery and Background Modeling
• Online Space-Variant Background Modeling With Sparse Coding
• Background Subtraction Based on Low-Rank and Structured Sparse Decomposition
• Robust 2D Principal Component Analysis: A Structured Sparsity Regularized Approach
• Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction
• Polar $n$-Complex and $n$-Bicomplex Singular Value Decomposition and Principal Component Pursuit
• High Dimensional Low Rank Plus Sparse Matrix Decomposition
• Adaptive-Rate Reconstruction of Time-Varying Signals With Application in Compressive Foreground Extraction
• Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
• Low‐rank approximation of tensors via sparse optimization
• Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
• Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
• Robust PCA via Outlier Pursuit
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Robust Matrix Decomposition With Sparse Corruptions
• ADMiRA: Atomic Decomposition for Minimum Rank Approximation
• Inductive Robust Principal Component Analysis
• Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
• Relations Among Some Low-Rank Subspace Recovery Models
• Learning with Structured Sparsity
• Distributed Matrix Completion and Robust Factorization
• On the Global Linear Convergence of the ADMM with MultiBlock Variables
• An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
• Generalized low rank approximations of matrices
• A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
• Discussion: Latent variable graphical model selection via convex optimization

This page was built for publication: Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset