Distributed Signal Processing via Chebyshev Polynomial Approximation

Details Distributed Signal Processing via Chebyshev Polynomial Approximation Distributed Signal Processing via Chebyshev Polynomial Approximation

2011-11-22

arxiv.org/abs/1111.5239v2

Computer Science

Distributed, Parallel, and Cluster Computing

14 pages, 6 figures, submitted to IEEE Transactions on Signal Processing

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distributed Signal Processing via Chebyshev Polynomial Approximation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Signal Processing via Chebyshev Polynomial Approximation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Signal Processing via Chebyshev Polynomial Approximation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-553713