Robust Least Mean Squares Estimation of Graph Signals (original) (raw)
Free related PDFsRelated papers
Free PDF
Free PDF
Free PDF
Free PDF
Free PDF
Free PDF
Free PDF
Graph Signal Processing - Part III: Machine Learning on Graphs, from Graph Topology to Applications
ArXiv, 2020
Many modern data analytics applications on graphs operate on domains where graph topology is not known a priori, and hence its determination becomes part of the problem definition, rather than serving as prior knowledge which aids the problem solution. Part III of this monograph starts by addressing ways to learn graph topology, from the case where the physics of the problem already suggest a possible topology, through to most general cases where the graph topology is learned from the data. A particular emphasis is on graph topology definition based on the correlation and precision matrices of the observed data, combined with additional prior knowledge and structural conditions, such as the smoothness or sparsity of graph connections. For learning sparse graphs (with small number of edges), the least absolute shrinkage and selection operator, known as LASSO is employed, along with its graph specific variant, graphical LASSO. For completeness, both variants of LASSO are derived in an...
Free PDF
Sampling of graph signals via randomized local aggregations
IEEE Transactions on Signal and Information Processing over Networks, 2019
Sampling of signals defined over the nodes of a graph is one of the crucial problems in graph signal processing. While in classical signal processing sampling is a well defined operation, when we consider a graph signal many new challenges arise and defining an efficient sampling strategy is not straightforward. Recently, several works have addressed this problem. The most common techniques select a subset of nodes to reconstruct the entire signal. However, such methods often require the knowledge of the signal support and the computation of the sparsity basis before sampling. Instead, in this paper we propose a new approach to this issue. We introduce a novel technique that combines localized sampling with compressed sensing. We first choose a subset of nodes and then, for each node of the subset, we compute random linear combinations of signal coefficients localized at the node itself and its neighborhood. The proposed method provides theoretical guarantees in terms of reconstruction and stability to noise for any graph and any orthonormal basis, even when the support is not known. Code is available at https://git.io/fj0Ib
Free PDF
Robust recovery of bandlimited graph signals via randomized dynamical sampling
ArXiv, 2021
Heat diffusion processes have found wide applications in modelling dynamical systems over graphs. In this paper, we consider the recovery of a k-bandlimited graph signal that is an initial signal of a heat diffusion process from its space-time samples. We propose three random space-time sampling regimes, termed dynamical sampling techniques, that consist in selecting a small subset of space-time nodes at random according to some probability distribution. We show that the number of space-time samples required to ensure stable recovery for each regime depends on a parameter called the spectral graph weighted coherence, that depends on the interplay between the dynamics over the graphs and sampling probability distributions. In optimal scenarios, no more than O(k log(k)) space-time samples are sufficient to ensure accurate and stable recovery of all k-bandlimited signals. In any case, dynamical sampling typically requires much fewer spatial samples than the static case by leveraging th...
Free PDF