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 …

On the role and the importance of features for background modeling and foreground detection

T Bouwmans, C Silva, C Marghes, MS Zitouni… - Computer Science …, 2018 - Elsevier
Background modeling has emerged as a popular foreground detection technique for various
applications in video surveillance. Background modeling methods have become increasing …

Compressed sensing with prior information: Strategies, geometry, and bounds

JFC Mota, N Deligiannis… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
We address the problem of compressed sensing (CS) with prior information: reconstruct a
target CS signal with the aid of a similar signal that is known beforehand, our prior …

Multimodal deep unfolding for guided image super-resolution

I Marivani, E Tsiligianni, B Cornelis… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
The reconstruction of a high resolution image given a low resolution observation is an ill-
posed inverse problem in imaging. Deep learning methods rely on training data to learn an …

Classification and reconstruction of high-dimensional signals from low-dimensional features in the presence of side information

F Renna, L Wang, X Yuan, J Yang… - IEEE Transactions …, 2016 - ieeexplore.ieee.org
This paper offers a characterization of fundamental limits on the classification and
reconstruction of high-dimensional signals from low-dimensional features, in the presence of …

Centralized and distributed online learning for sparse time-varying optimization

SM Fosson - IEEE Transactions on Automatic Control, 2020 - ieeexplore.ieee.org
The development of online algorithms to track time-varying systems has drawn a lot of
attention in the last years, in particular in the framework of online convex optimization …

Deep coupled-representation learning for sparse linear inverse problems with side information

E Tsiligianni, N Deligiannis - IEEE Signal Processing Letters, 2019 - ieeexplore.ieee.org
In linear inverse problems, the goal is to recover a target signal from undersampled,
incomplete or noisy linear measurements. Typically, the recovery relies on complex …

Adaptive-rate reconstruction of time-varying signals with application in compressive foreground extraction

JFC Mota, N Deligiannis… - IEEE Transactions …, 2016 - ieeexplore.ieee.org
We propose and analyze an online algorithm for reconstructing a sequence of signals from a
limited number of linear measurements. The signals are assumed sparse, with unknown …

Compressive Online Robust Principal Component Analysis via - Minimization

H Van Luong, N Deligiannis, J Seiler… - … on Image Processing, 2018 - ieeexplore.ieee.org
This paper considers online robust principal component analysis (RPCA) in time-varying
decomposition problems such as video foreground-background separation. We propose a …

Reference-based compressed sensing: A sample complexity approach

JFC Mota, L Weizman, N Deligiannis… - … , Speech and Signal …, 2016 - ieeexplore.ieee.org
We address the problem of reference-based compressed sensing: reconstruct a sparse
signal from few linear measurements using as prior information a reference signal, a signal …