Distributed Signal Processing via Chebyshev Polynomial Approximation

View Researcher's Other Codes

MATLAB code for the paper: “Distributed Signal Processing via Chebyshev Polynomial Approximation”.

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors David I Shuman, Pierre Vandergheynst, Daniel Kressner, and Pascal Frossard
Journal/Conference Name IEEE Transactions on Signal and Information Processing over Networks
Paper Category
Paper Abstract Unions of graph multiplier operators 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. The proposed method features approximations of the graph multipliers by shifted Chebyshev polynomials, whose recurrence relations make them readily amenable to distributed computation. We demonstrate how the proposed method can be applied to distributed processing tasks such as smoothing, denoising, inverse filtering, and semi-supervised classification, and show that the communication requirements of the method scale gracefully with the size of the network.
Date of publication 2018
Code Programming Language MATLAB
Comment

Copyright Researcher 2021