Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
From MaRDI portal
Publication:2143605
Abstract: Polynomial graph filters and their inverses play important roles in graph signal processing. An advantage of polynomial graph filters is that they can be implemented in a distributed manner, which involves data transmission between adjacent vertices only. The challenge arisen in the inverse filtering is that a direct implementation may suffer from high computational burden, as the inverse graph filter usually has full bandwidth even if the original filter has small bandwidth. In this paper, we consider distributed implementation of the inverse filtering procedure for a polynomial graph filter of multiple shifts, and we propose two iterative approximation algorithms that can be implemented in a distributed network, where each vertex is equipped with systems for limited data storage, computation power and data exchanging facility to its adjacent vertices. We also demonstrate the effectiveness of the proposed iterative approximation algorithms to implement the inverse filtering procedure and their satisfactory performance to denoise time-varying graph signals and a data set of US hourly temperature at 218 locations.
Recommendations
- Sampling, filtering and sparse approximations on combinatorial graphs
- Wavelets on graphs via spectral graph theory
- Perfect reconstruction two-channel filter banks on arbitrary graphs
- scientific article; zbMATH DE number 880361
- Distributed reconstruction of time-varying graph signals via a modified Newton's method
Cites work
- A Time-Vertex Signal Processing Framework: Scalable Processing and Meaningful Representations for Time-Series on Graphs
- Advances in Distributed Graph Filtering
- Autoregressive Moving Average Graph Filtering
- Bipartite Approximation for Graph Wavelet Signal Decomposition
- Deep Graph-Convolutional Image Denoising
- Differential subalgebras and norm-controlled inversion
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Frequency Analysis
- Extending Classical Multirate Signal Processing Theory to Graphs—Part II: M-Channel Filter Banks
- Forecasting Time Series With VARMA Recursions on Graphs
- scientific article; zbMATH DE number 5500983 (Why is no real title available?)
- scientific article; zbMATH DE number 2166998 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Interpolation and approximation by polynomials
- Nonsubsampled Graph Filter Banks: Theory and Distributed Algorithms
- On the Shift Operator, Graph Frequency, and Optimal Filtering in Graph Signal Processing
- Optimal Graph-Filter Design and Applications to Distributed Linear Network Operators
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- Polynomial control on stability, inversion and powers of matrices on simple graphs
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
- Signal Recovery on Graphs: Variation Minimization
- Spatially distributed sampling and reconstruction
- Splines and wavelets on circulant graphs
- Two-Channel Critically Sampled Graph Filter Banks With Spectral Domain Sampling
- Wavelets on graphs via spectral graph theory
- Wiener's lemma: localization and various approaches
- Wiener's lemma: pictures at an exhibition
- Wiener’s Lemma: Theme and Variations. An Introduction to Spectral Invariance and Its Applications
Cited in
(2)
This page was built for publication: Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2143605)
