Chebyshev polynomial approximation for distributed signal processing
Authors:
- 1 June 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23252936,p. 1-8
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.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Wavelets on graphs via spectral graph theoryApplied and Computational Harmonic Analysis, 2011
- Graph spectral image smoothing using the heat kernelPattern Recognition, 2008
- Non-local Regularization of Inverse Problems2008
- Discrete Regularization on Weighted Graphs for Image and Mesh Filtering2007
- Regularization on Discrete SpacesLecture Notes in Computer Science, 2005
- Signal Recovery by Proximal Forward-Backward SplittingMultiscale Modeling & Simulation, 2005
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- Regularization and Semi-supervised Learning on Large Graphs2004
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- Eigenvalues of the Laplacian of a graph∗Linear and Multilinear Algebra, 1985