Chebyshev Polynomial Approximation for Distributed Signal Processing

Abstract

Unions of graph Fourier multipliers are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators to the high-dimensional signals collected by sensor networks. The proposed method features approximations of the graph Fourier multipliers by shifted Chebyshev polynomials, whose recurrence relations make them readily amenable to distributed computation. We demonstrate how the proposed method can be used in a distributed denoising task, and show that the communication requirements of the method scale gracefully with the size of the network.

8 pages, 5 figures, to appear in the Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS), June, 2011, Barcelona, Spain

References in corpus (1)

• Gossip Algorithms for Distributed Signal Processing

Cited by in corpus (34)

• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Graph Neural Networks with convolutional ARMA filters
• Learning Structural Node Embeddings Via Diffusion Wavelets
• Autoregressive Moving Average Graph Filtering
• Forecasting Time Series with VARMA Recursions on Graphs
• Learning parametric dictionaries for graph signals
• Distributed Autoregressive Moving Average Graph Filters
• Filtering Random Graph Processes Over Random Time-Varying Graphs
• Deep Graph Convolutional Reinforcement Learning for Financial Portfolio Management -- DeepPocket
• Spectral Domain Sampling of Graph Signals
• A Distributed Tracking Algorithm for Reconstruction of Graph Signals
• Compressive Spectral Clustering
• Generalized Sampling on Graphs With Subspace and Smoothness Priors
• Network Representation Learning: A Survey
• Graph Tikhonov Regularization and Interpolation via Random Spanning Forests
• Frequency Analysis of Temporal Graph Signals
• Localized Fourier Analysis for Graph Signal Processing
• Spectrum-Adapted Tight Graph Wavelet and Vertex-Frequency Frames
• Fast Color-guided Depth Denoising for RGB-D Images by Graph Filtering
• A Graph-CNN for 3D Point Cloud Classification
• Fast Spectral Ranking for Similarity Search
• Filter Design for Autoregressive Moving Average Graph Filters
• Decentralized Eigendecomposition for Online Learning over Graphs with Applications
• Scalable $M$-Channel Critically Sampled Filter Banks for Graph Signals
• Isometric Transformation Invariant Graph-based Deep Neural Network
• Fast Approximate Spectral Clustering for Dynamic Networks
• A Time-Vertex Signal Processing Framework
• Geometric Formulation for Discrete Points and its Applications
• Deep Learning on Attributed Graphs: A Journey from Graphs to Their Embeddings and Back
• On $(\beta ,\gamma )$-Chebyshev functions and points of the interval
• Active Sampling for Approximately Bandlimited Graph Signals
• Accelerated Spectral Clustering Using Graph Filtering Of Random Signals
• Joint Forecasting and Interpolation of Graph Signals Using Deep Learning
• Variance reduction in stochastic methods for large-scale regularised least-squares problems