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 …

MGLNN: Semi-supervised learning via multiple graph cooperative learning neural networks

B Jiang, S Chen, B Wang, B Luo - Neural Networks, 2022 - Elsevier
In many machine learning applications, data are coming with multiple graphs, which is
known as the multiple graph learning problem. The problem of multiple graph learning is to …

Geometric deep learning on graphs and manifolds using mixture model cnns

F Monti, D Boscaini, J Masci… - Proceedings of the …, 2017 - openaccess.thecvf.com
Deep learning has achieved a remarkable performance breakthrough in several fields, most
notably in speech recognition, natural language processing, and computer vision. In …

Topology identification and learning over graphs: Accounting for nonlinearities and dynamics

GB Giannakis, Y Shen… - Proceedings of the …, 2018 - ieeexplore.ieee.org
Identifying graph topologies as well as processes evolving over graphs emerge in various
applications involving gene-regulatory, brain, power, and social networks, to name a few …

Stationary signal processing on graphs

N Perraudin, P Vandergheynst - IEEE Transactions on Signal …, 2017 - ieeexplore.ieee.org
Graphs are a central tool in machine learning and information processing as they allow to
conveniently capture the structure of complex datasets. In this context, it is of high …

Graph reduction with spectral and cut guarantees

A Loukas - Journal of Machine Learning Research, 2019 - jmlr.org
Can one reduce the size of a graph without significantly altering its basic properties? The
graph reduction problem is hereby approached from the perspective of restricted spectral …

A time-vertex signal processing framework: Scalable processing and meaningful representations for time-series on graphs

F Grassi, A Loukas, N Perraudin… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
An emerging way to deal with high-dimensional noneuclidean data is to assume that the
underlying structure can be captured by a graph. Recently, ideas have begun to emerge …

[HTML][HTML] Random sampling of bandlimited signals on graphs

G Puy, N Tremblay, R Gribonval… - Applied and …, 2018 - Elsevier
We study the problem of sampling k-bandlimited signals on graphs. We propose two
sampling strategies that consist in selecting a small subset of nodes at random. The first …

Large scale graph learning from smooth signals

V Kalofolias, N Perraudin - arXiv preprint arXiv:1710.05654, 2017 - arxiv.org
Graphs are a prevalent tool in data science, as they model the inherent structure of the data.
They have been used successfully in unsupervised and semi-supervised learning. Typically …

SULoRA: Subspace unmixing with low-rank attribute embedding for hyperspectral data analysis

D Hong, XX Zhu - IEEE Journal of Selected Topics in Signal …, 2018 - ieeexplore.ieee.org
To support high-level analysis of spaceborne imaging spectroscopy (hyperspectral)
imagery, spectral unmixing has been gaining significance in recent years. However, from the …