Distributed Adaptive Learning of Graph Signals

DOI10.1109/TSP.2017.2708035MaRDI QIDQ4621798zbMATH OpenFDO

Authors Paolo Di Lorenzo, Paolo Banelli, Sergio Barbarossa, Stefania Sardellitti

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.06100

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: The aim of this paper is to propose distributed strategies for adaptive learning of signals defined over graphs. Assuming the graph signal to be bandlimited, the method enables distributed reconstruction, with guaranteed performance in terms of mean-square error, and tracking from a limited number of sampled observations taken from a subset of vertices. A detailed mean square analysis is carried out and illustrates the role played by the sampling strategy on the performance of the proposed method. Finally, some useful strategies for distributed selection of the sampling set are provided. Several numerical results validate our theoretical findings, and illustrate the performance of the proposed method for distributed adaptive learning of signals defined over graphs.

Cited in

(3)

• Localized Fourier analysis for graph signal processing
• Distributed reconstruction of time-varying graph signals via a modified Newton's method
• Graph Fourier transform based on \(\ell_1\) norm variation minimization

This page was built for publication: Distributed Adaptive Learning of Graph Signals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4621798)