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

T Bouwmans, A Sobral, S Javed, SK Jung… - Computer Science …, 2017 - Elsevier
Background/foreground separation is the first step in video surveillance system to detect
moving objects. Recent research on problem formulations based on decomposition into low …

Static and dynamic robust PCA and matrix completion: A review

N Vaswani, P Narayanamurthy - Proceedings of the IEEE, 2018 - ieeexplore.ieee.org
Principal component analysis (PCA) is one of the most widely used dimension reduction
techniques. Robust PCA (RPCA) refers to the problem of PCA when the data may be …

Robust subspace learning: Robust PCA, robust subspace tracking, and robust subspace recovery

N Vaswani, T Bouwmans, S Javed… - IEEE signal …, 2018 - ieeexplore.ieee.org
Principal component analysis (PCA) is one of the most widely used dimension reduction
techniques. A related easier problem is termed subspace learning or subspace estimation …

[图书][B] Handbook of robust low-rank and sparse matrix decomposition: Applications in image and video processing

T Bouwmans, NS Aybat, E Zahzah - 2016 - books.google.com
Handbook of Robust Low-Rank and Sparse Matrix Decomposition: Applications in Image
and Video Processing shows you how robust subspace learning and tracking by …

Robust subspace tracking with missing data and outliers: Novel algorithm with convergence guarantee

NV Dung, NL Trung… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
In this article, we propose a novel algorithm, namely PETRELS-ADMM, to deal with
subspace tracking in the presence of outliers and missing data. The proposed approach …

Online tensor robust principal component analysis

MM Salut, DV Anderson - IEEE Access, 2022 - ieeexplore.ieee.org
Online robust principal component analysis (RPCA) algorithms recursively decompose
incoming data into low-rank and sparse components. However, they operate on data vectors …

Low-rank and sparse matrix decomposition via the truncated nuclear norm and a sparse regularizer

Z Xue, J Dong, Y Zhao, C Liu, R Chellali - the visual computer, 2019 - Springer
Recovering the low-rank and sparse components from a given matrix is a challenging
problem that has many real applications. This paper proposes a novel algorithm to address …

Traffic estimation and prediction via online variational Bayesian subspace filtering

C Paliwal, U Bhatt, P Biyani… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
With the increased proliferation of smart devices, the transit passengers of today expect a
higher quality of service in the form of real-time traffic updates, accurate expected time-of …

Robust and efficient FISTA-based method for moving object detection under background movements

M Amoozegar, M Akbarizadeh, T Bouwmans - Knowledge-Based Systems, 2024 - Elsevier
Moving object detection is a fundamental task in many video processing applications, such
as video surveillance. The robustness and efficiency of background subtraction make it one …

Provable subspace tracking from missing data and matrix completion

P Narayanamurthy, V Daneshpajooh… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
We study the problem of subspace tracking in the presence of missing data (ST-miss). In
recent work, we studied a related problem called robust ST. In this paper, we show that a …