Sampling of graph signals with successive local aggregations
Antonio G. Marques2015
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
A new scheme to sample signals defined in the nodes of a graph is proposed. The underlying assumption is that such signals admit a sparse representation in a frequency domain related to the structure of the graph, which is captured by the so-called graph-shift operator. Most of the works that have looked at this problem have focused on using the value of the signal observed at a subset of nodes to recover the signal in the entire graph. Differently, the sampling scheme proposed here uses as input observations taken at a single node. The observations correspond to sequential applications of the graph-shift operator, which are linear combinations of the information gathered by the neighbors of the node. When the graph corresponds to a directed cycle (which is the support of time-varying signals), our method is equivalent to the classical sampling in the time domain. When the graph is more general, we show that the Vandermonde structure of the sampling matrix, which is critical to guar...
Related papers
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
Aggregation sampling of graph signals in the presence of noise
2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2015
A scheme to sample bandlimited graph signals in the presence of noise is analyzed. Samples are aggregated at a single node by successive applications of the so-called graph-shift operator that encodes the local structure of the underlying graph. In contrast to the noiseless case, when noise is present the choice of the sampling node and the local sample-selection scheme play a major role in determining the interpolation error. We provide optimal sampling schemes for particular noise models. We also analyze and provide identifiability conditions for the case where the frequency support of the bandlimited signal is unknown. Finally, simulations with synthetic and real-world graph signals are used to illustrate the behavior of aggregation sampling in noisy scenarios.
Discrete signal processing on graphs: Sampling theory
2015
We propose a sampling theory for signals that are supported on either directed or undirected graphs. The theory follows the same paradigm as classical sampling theory. We show that the perfect recovery is possible for graph signals bandlimited under the graph Fourier transform, and the sampled signal coefficients form a new graph signal, whose corresponding graph structure is constructed from the original graph structure, preserving frequency contents. By imposing a specific structure on the graph, graph signals reduce to finite discrete-time signals and the proposed sampling theory works reduces to classical signal processing. We further establish the connection to frames with maximal robustness to erasures as well as compressed sensing, and show how to choose the optimal sampling operator, how random sampling works on circulant graphs and Erdős-Rényi graphs, and how to handle full-band graph signals by using graph filter
Sampling and Reconstruction of Diffused Sparse Graph Signals From Successive Local Aggregations
IEEE Signal Processing Letters, 2019
We analyze the sampling and posterior recovery of diffused sparse graph signals from observations gathered at a single node using an aggregation sampling scheme. Diffused sparse graph signals can be modeled as the output of a linear graph filter to a sparse input, and are useful in scenarios where a few seeding (source) nodes generate a non-zero input which is then diffused according to the network dynamics dictated by the filter. Instead of considering a traditional setup where the observations correspond to the signal values at a subset of nodes, here the observations are obtained locally at a single node via the successive aggregation of its own value and that of its neighbors. Depending of the particular application, the goal is to use the local observations to recover the diffused signal or (the location and values of) the seeds. Different sampling configurations are investigated, including those of known and unknown location of the sources as well as that of the diffusing filter being unknown.
Sampling and Recovery of Graph Signals
Cooperative and Graph Signal Processing, 2018
The aim of this chapter is to give an overview of the recent advances related to sampling and recovery of signals defined over graphs. First, we illustrate the conditions for perfect recovery of bandlimited graph signals from samples collected over a selected set of vertexes. Then, we describe some sampling design criteria proposed in the literature to mitigate the effect of noise and model mismatching when performing graph signal recovery. Finally, we illustrate algorithms and optimal sampling strategies for adaptive recovery and tracking of dynamic graph signals, where both sampling set and signal values are allowed to vary with time. Numerical simulations carried out over both synthetic and real data illustrate the potential advantages of graph signal processing methods for sampling, interpolation, and tracking of signals observed over irregular domains such as, e.g., technological or biological networks.
Efficient Estimation of Graph Signals With Adaptive Sampling
IEEE Transactions on Signal Processing, 2020
We propose two new least mean squares (LMS)-based algorithms for adaptive estimation of graph signals that improve the convergence speed of the LMS algorithm while preserving its low computational complexity. The first algorithm, named extended least mean squares (ELMS), extends the LMS algorithm by virtue of reusing the signal vectors of previous iterations alongside the signal available at the current iteration. Utilizing the previous signal vectors accelerates the convergence of the ELMS algorithm at the expense of higher steady-state error compared to the LMS algorithm. To further improve the performance, we propose the fast ELMS (FELMS) algorithm in which the influence of the signal vectors of previous iterations is controlled by optimizing the gradient of the mean-square deviation (GMSD). The FELMS algorithm converges faster than the ELMS algorithm and has steady-state errors comparable to that of the LMS algorithm. We analyze the mean-square performance of ELMS and FELMS algorithms theoretically and derive the respective convergence conditions as well as the predicted MSD values. In addition, we present an adaptive sampling strategy in which the sampling probability of each node is changed according to the GMSD of the node. Computer simulations using both synthetic and real data validate the theoretical results and demonstrate the merits of the proposed algorithms.
Interpolation of graph signals using shift-invariant graph filters
2015 23rd European Signal Processing Conference (EUSIPCO), 2015
New schemes to recover signals defined in the nodes of a graph are proposed. Our focus is on reconstructing bandlimited graph signals, which are signals that admit a sparse representation in a frequency domain related to the structure of the graph. The schemes are designed within the framework of linear shift-invariant graph filters and consider that the seeding signals are injected only at a subset of interpolating nodes. After several sequential applications of the graph-shift operator-which computes linear combinations of the information available at neighboring nodes-the seeding signals are diffused across the graph and the original bandlimited signal is eventually recovered. Conditions under which the recovery is feasible are given, and the corresponding schemes to recover the signal are proposed. Connections with the classical interpolation in the time domain are also discussed.
Optimal sampling strategies for adaptive learning of graph signals
2017 25th European Signal Processing Conference (EUSIPCO)
The aim of this paper is to propose optimal sampling strategies for adaptive learning of signals defined over graphs. Introducing a novel least mean square (LMS) estimation strategy with probabilistic sampling, we propose two different methods to select the sampling probability at each node, with the aim of optimizing the sampling rate, or the mean-square performance, while at the same time guaranteeing a prescribed learning rate. The resulting solutions naturally lead to sparse sampling probability vectors that optimize the tradeoff between graph sampling rate, steady-state performance, and learning rate of the LMS algorithm. Numerical simulations validate the proposed approach, and assess the performance of the proposed sampling strategies for adaptive learning of graph signals.
Space-Time Variable Density Samplings for Sparse Bandlimited Graph Signals Driven by Diffusion Operators
ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
We consider the space-time sampling and reconstruction of sparse bandlimited graph signals driven by a heat diffusion process. In this paper, we develop a sampling framework consisting of selecting a small subset of space-time nodes at random according to some probability distribution, generalizing the classical variable density sampling to the heat diffusion field. We show that the number of space-time samples required to ensure stable recovery depends on an incoherence parameter determined by the interplay between graph topology, temporal dynamics, and sampling probability distributions. In optimal scenarios, as few as O(s log k) space-time samples are sufficient to ensure accurate recovery of all kbandlimited graph signals that are additionally s-sparse. Our proposed sampling method requires much fewer spatial samples than the static case by leveraging temporal information. Finally, we test our sampling techniques on a wide variety of graphs. The numerical results on synthetic and real climate data sets support our theoretical findings and demonstrate the practical applicability.
Signal recovery on graphs: Random versus experimentally designed sampling
2015 International Conference on Sampling Theory and Applications (SampTA), 2015
We study signal recovery on graphs based on two sampling strategies: random sampling and experimentally designed sampling. We propose a new class of smooth graph signals, called approximately bandlimited. We then propose two recovery strategies based on random sampling and experimentally designed sampling. The proposed recovery strategy based on experimentally designed sampling uses sampling scores, which is similar to the leverage scores used in the matrix approximation. We show that while both strategies are unbiased estimators for the low-frequency components, the convergence rate of experimentally designed sampling is much faster than that of random sampling when a graph is irregular 1. We validate the proposed recovery strategies on three specific graphs: a ring graph, an Erdős-Rényi graph, and a star graph. The simulation results support the theoretical analysis.
Related topics
Related papers
Exploiting Structure In Data: Sampling and Signal Processing on Graphs
2020
With the explosive growth of information and communication, data is being generated at an unprecedented rate from various sources, including multimedia, sensor networks, biological systems, social networks, and physical infrastructure. Research in graph signal processing aims to develop tools for processing such data by providing a framework for the analysis of high-dimensional datadefined on irregular graph domains. Graph signal processing extends fundamental signal processingconcepts to data supported on graphs that we refer to as graph signals. In this work, we study two fraternal problems: (1) sampling and (2) reconstruction of signals on graphs. Both of these problems are eminent topics in the field of signal processing over the past decades and have meaningful implications for many real-world problems including semi-supervised learning and activelearning on graphs. Sampling is the task of choosing or measuring some representative subset of the signal such that we can interpola...
Sampling Theory for Graph Signals on Product Graphs
2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
In this paper, we extend the sampling theory on graphs by constructing a framework that exploits the structure in product graphs for efficient sampling and recovery of bandlimited graph signals that lie on them. Product graphs are graphs that are composed from smaller graph atoms; we motivate how this model is a flexible and useful way to model richer classes of data that can be multi-modal in nature. Previous works have established a sampling theory on graphs for bandlimited signals. Importantly, the framework achieves significant savings in both sample complexity and computational complexity.
On Local Distributions in Graph Signal Processing
ArXiv, 2022
Graph filtering is the cornerstone operation in graph signal processing (GSP). Thus, understanding it is key in developing potent GSP methods. Graph filters are local and distributed linear operations, whose output depends only on the local neighborhood of each node. Moreover, a graph filter’s output can be computed separately at each node by carrying out repeated exchanges with immediate neighbors. Graph filters can be compactly written as polynomials of a graph shift operator (typically, a sparse matrix description of the graph). This has led to relating the properties of the filters with the spectral properties of the corresponding matrix – which encodes global structure of the graph. In this work, we propose a framework that relies solely on the local distribution of the neighborhoods of a graph. The crux of this approach is to describe graphs and graph signals in terms of a measurable space of rooted balls. Leveraging this, we are able to seamlessly compare graphs of different ...
Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
IEEE Transactions on Signal Processing
The goal of this paper is to propose novel strategies for adaptive learning of signals defined over graphs, which are observed over a (randomly time-varying) subset of vertices. We recast two classical adaptive algorithms in the graph signal processing framework, namely, the least mean squares (LMS) and the recursive least squares (RLS) adaptive estimation strategies. For both methods, a detailed mean-square analysis illustrates the effect of random sampling on the adaptive reconstruction capability and the steady-state performance. Then, several probabilistic sampling strategies are proposed to design the sampling probability at each node in the graph, with the aim of optimizing the tradeoff between steady-state performance, graph sampling rate, and convergence rate of the adaptive algorithms. Finally, a distributed RLS strategy is derived and is shown to be convergent to its centralized counterpart. Numerical simulations carried out over both synthetic and real data illustrate the good performance of the proposed sampling and reconstruction strategies for (possibly distributed) adaptive learning of signals defined over graphs.
Signal Recovery on Graphs: Fundamental Limits of Sampling Strategies
IEEE Transactions on Signal and Information Processing over Networks
This paper builds theoretical foundations for the recovery of a newly proposed class of smooth graph signals, approximately bandlimited graph signals, under three sampling strategies: uniform sampling, experimentally designed sampling and active sampling. We then state minimax lower bounds on the maximum risk for the approximately bandlimited class under these three sampling strategies and show that active sampling cannot fundamentally outperform experimentally designed sampling. We propose a recovery strategy to compare uniform sampling with experimentally designed sampling. As the proposed recovery strategy lends itself well to statistical analysis, we derive the exact mean square error for each sampling strategy. To study convergence rates, we introduce two types of graphs and find that (1) the proposed recovery strategy achieves the optimal rates; and (2) the experimentally designed sampling fundamentally outperforms uniform sampling for Type-2 class of graphs. To validate our proposed recovery strategy, we test it on five specific graphs: a ring graph with k nearest neighbors, an Erdős-Rényi graph, a random geometric graph, a small-world graph and a power-law graph and find that experimental results match the proposed theory well. This work also presents a comprehensive explanation for when and why sampling for semi-supervised learning with graphs works.
Signal Representations on Graphs: Tools and Applications
2015
We present a framework for representing and modeling data on graphs. Based on this framework, we study three typical classes of graph signals: smooth graph signals, piecewise-constant graph signals, and piecewise-smooth graph signals. For each class, we provide an explicit definition of the graph signals and construct a corresponding graph dictionary with desirable properties. We then study how such graph dictionary works in two standard tasks: approximation and sampling followed with recovery, both from theoretical as well as algorithmic perspectives. Finally, for each class, we present a case study of a real-world problem by using the proposed methodology.
Accelerated Sampling of Bandlimited Graph Signals
arXiv: Signal Processing, 2018
We study the problem of sampling and reconstructing bandlimited graph signals where the objective is to select a subset of nodes of pre-specified cardinality that ensures interpolation of the original signal with the lowest possible reconstruction error. First, we consider a non-Bayesian scenario and propose an efficient iterative sampling procedure that in the noiseless case enables exact recovery of the original signal from the set of selected nodes. In the case of noisy measurements, a bound on the reconstruction error of the proposed algorithm is established. Then, we consider the Bayesian scenario where we formulate the sampling task as the problem of maximizing a monotone weak submodular function, and propose a randomized-greedy algorithm to find a sub-optimal subset. We derive a worst-case performance guarantee on the mean-square error achieved by the randomized-greedy algorithm for general non-stationary graph signals. The efficacy of the proposed methods is illustrated thro...
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...
A Hilbert Space Theory of Generalized Graph Signal Processing
IEEE Transactions on Signal Processing, 2019
Graph signal processing (GSP) has become an important tool in many areas such as image processing, networking learning and analysis of social network data. In this paper, we propose a broader framework that not only encompasses traditional GSP as a special case, but also includes a hybrid framework of graph and classical signal processing over a continuous domain. Our framework relies extensively on concepts and tools from functional analysis to generalize traditional GSP to graph signals in a separable Hilbert space with infinite dimensions. We develop a concept analogous to Fourier transform for generalized GSP and the theory of filtering and sampling such signals.
Graph Signal Processing - Part II: Processing and Analyzing Signals on Graphs
2019
The focus of Part I of this monograph has been on both the fundamental properties, graph topologies, and spectral representations of graphs. Part II embarks on these concepts to address the algorithmic and practical issues centered round data/signal processing on graphs, that is, the focus is on the analysis and estimation of both deterministic and random data on graphs. The fundamental ideas related to graph signals are introduced through a simple and intuitive, yet illustrative and general enough case study of multisensor temperature field estimation. The concept of systems on graph is defined using graph signal shift operators, which generalize the corresponding principles from traditional learning systems. At the core of the spectral domain representation of graph signals and systems is the Graph Discrete Fourier Transform (GDFT). The spectral domain representations are then used as the basis to introduce graph signal filtering concepts and address their design, including Chebys...
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.