Preconditioned Diffusion Multitask Clustering Graph Filters
Pages 346 - 350
Abstract
In this work, we are interested in the design of node-variant FIR graph filters, in which the graph filter estimates the filter coefficients from the stream data. Considering the estimation of filter coefficients as a task, we introduce concept of the multitask into graph filters. The filter coefficients can be divided into different clusters, and the cooperation between clusters is beneficial. Then, a multitask graph diffusion LMS algorithm is proposed. In order to improve convergence speed and performance, a multitask graph diffusion preconditioned algorithm is proposed. The simulation results verify the feasibility of algorithms.
References
[1]
A. Sandryhaila and J. M. F. Moura, "Discrete signal processing on graphs," IEEE Transactions on Signal Processing, vol. 61, no. 7, pp. 1644-1656, 2013.
[2]
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, "The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains," IEEE Signal Processing Magazine, vol. 30, no. 3, pp. 83-98, 2013.
[3]
A. Sandryhaila and J. Moura, "Big data analysis with signal processing on graphs: Representation and processing of massive data sets with irregular structure," IEEE Signal Processing Magazine, vol. 31, no. 5, pp. 80-90,2014.
[4]
A. Anis, A. Gadde, and A. Ortega, "Efficient sampling set selection for bandlimited graph signals using graph spectral proxies," IEEE Transactions on Signal Processing, vol. 64, no. 14, pp. 3775-3789, 2016.
[5]
M. Tsitsvero, S. Barbarossa, and P. D. Lorenzo, "Signals on graphs: Uncertainty principle and sampling," IEEE Transactions on Signal Processing, vol. 64, no. 18, pp. 4845-4860,2016.
[6]
E. Isufi, A. Loukas, A. Simonetto, and G. Leus, "Autoregressive moving average graph filtering," IEEE Transactions on Signal Processing, vol. 65, no. 2, pp. 274-288, 2016.
[7]
A. Loukas, A. Simonetto, and G. Leus, "Distributed autoregressive moving average graph filters," IEEE Signal Processing Letters, vol. 22, no. 11, pp. 1931-1935, 2015 .
[8]
F. Hua, R. Nassif, C. Richard, H. Wang, and A. H. Sayed, "Online distributed learning over graphs with multitask graph-filter models," IEEE Transactions on Signal and Information Processing over Networks, vol. 6, pp. 63-77,2020.
[9]
R. Nassif, C. Richard, J. Chen, and A. H. Sayed, "Distributed diffusion adaptation over graph signals," 2018.
[10]
A. H. Sayed, S. Y. Tu, J. Chen, X. Zhao, and Z. J. Towfic, "Diffusion strategies for adaptation and learning over networks: An examination of distributed strategies and network behavior," IEEE Signal Processing Magazine, vol. 30, no. 3, pp. 155-171, 2013 .
[11]
Sayed and H. Ali, "Adaptive networks," Proceedings of the IEEE, vol. 102, no. 4, pp. 460-497, 2014
[12]
A. H. Sayed, "Diffusion adaptation over networks," Academic Press Library in Signal Processing, p. 323453, 2012.
[13]
Y. Hua, F. Chen, S. Deng, S. Duan, and L. Wang, "Secure distributed estimation against false data injection attack,"'Information Sciences, vol. 515, pp. 248-262,2020
[14]
. L. A. C, M. F. A. C, F. C. A. C, Q. S. A. C, and J. K. B, "Robust distributed estimation based on a generalized correntropy logarithmic difference algorithm over wireless sensor networks,' Signal Processing, vol. 177 .
[15]
F. Chen, L. Hu, P. Liu, and M. Feng, "A robust diffusion estimation algorithm for asynchronous networks in iot," IEEE Internet of Things Journal, vol. PP, no. 99, pp. 1-1,2020.
[16]
J. Chen, C. Richard, and A. H. Sayed, "Diffusion lms over multitask networks," IEEE Transactions on Signal Processing, vol. 63, no. 11, pp. 2733-2748,2015.
[17]
J. Chen, C. Richard, A. O. Hero, and A. H. Sayed, "Diffusion Ims for multitask problems with overlapping hypothesis subspaces," 2014.
[18]
R. Nassif, C. Richard, A. Ferrari, and A. Sayed, "Multitask diffusion adaptation over asynchronous networks,' IEEE Transactions on Signal Processing, pp. 2835-2850,2016.
[19]
J. Chen, C. Richard, and A. H. Sayed, "Multitask diffusion adaptation over networks with common latent representations," IEEE Journal of Selected Topics in Signal Processing, 2017.
[20]
A. Y. Zhang, B. M. Feng, C. F. Chen, and D. J. Kurths, "Adaptive clustering based on element-wised distance for distributed estimation over multi-task networks," Chaos, vol. 30, no. 5, p. 053116,2020.
[21]
Q. Shi, F. He, J. Wu, and F. Chen, "Distributed adaptive clustering based on maximum correntropy criterion over dynamic multi-task networks," IEEE Access, vol. PP, no. 99, pp. 1-1,2020.
[22]
A. Y. Zhang, B. M. Feng, C. F. Chen, and D. J. Kurths, "Adaptive clustering based on element-wised distance for distributed estimation over multi-task networks," Chaos, vol. 30, no. 5, p. 053116,2020.
[23]
Q. Shi, F. He, J. Wu, and F. Chen, "Distributed adaptive clustering based on maximum correntropy criterion over dynamic multi-task networks," IEEE Access, vol. PP, no. 99, pp. 1-1,2020.
[24]
F. Chen, X. Li, S. Duan, L. Wang, and J. Wu, "Diffusion generalized maximum correntropy criterion algorithm for distributed estimation over multitask network,” Digital Signal Processing, p. S1051200418300526, 2018.
[25]
S. Segarra, A. G. Marques, and A. Ribeiro, "Optimal graph-filter design and applications to distributed linear network operators," IEEE Transactions on Signal Processing, vol. PP, no. 99, pp. 1-1, 2017.
[26]
P. Di Lorenzo, S. Barbarossa, P. Banelli, and S. Sardellitti, “Adaptive least mean squares estimation of graph signals,” IEEE Transactions on Signal & Information Processing Over Networks, vol. 2, no. 4, pp. 555–568, 2016.
[27]
J. Mei and J. M. F. Moura, “Signal processing on graphs: Causal modeling of unstructured data,” IEEE Transactions on Signal Processing, 2017.
[28]
E. Isufi, A. Loukas, N. Perraudin, and G. Leus, “Forecasting time series with varma recursions on graphs,” 2018.
[29]
P. Di Lorenzo, P. Banelli, S. Barbarossa, and S. Sardellitti, “Distributed adaptive learning of graph signals,” IEEE Transactions on Signal Processing, pp. 1–1, 2016.
[30]
E. Isufi, P. Banelli, P. Di Lorenzo, and G. Leus, “Observing and tracking bandlimited graph processes,” arXiv preprint arXiv:1712.00404, 2017.
[31]
P. Di Lorenzo, P. Banelli, E. Isufi, S. Barbarossa, and G. Leus, “Adaptive graph signal processing: Algorithms and optimal sampling strategies,” IEEE Transactions on Signal Processing, vol. 66, no. 13, pp. 3584–3598, 2018.
[32]
D. Romero, V. N. Ioannidis, and G. B. Giannakis, “Kernel-based reconstruction of space-time functions on dynamic graphs,” IEEE Journal of Selected Topics in Signal Processing, vol. PP, no. 99, pp. 1–1, 2016.
[33]
J. Chen, C. Richard, and A. H. Sayed, "Multitask diffusion adaptation over networks," IEEE Journal of Selected Topics in Signal Processing, vol. PP, no. 99, pp. 1-1, 2013.
Recommendations
Universal Graph Filter Design Based on Butterworth, Chebyshev, and Elliptic Functions
AbstractGraph filters are crucial tools in processing the spectrum of graph signals. In this paper, we propose to design universal IIR graph filters with low computational complexity by using three kinds of functions, which are Butterworth, Chebyshev, and ...
Sensor network data denoising via recursive graph median filters
Highlights- Denoising of sensor network data corrupted simultaneously by impulsive noise and additive Gaussian noise.
AbstractIn wireless sensor networks (WSN) for environmental monitoring, the sensor nodes typically have limited computational and communication resources. Furthermore, the sensors often operate in a harsh environment, and the measurements can ...
Atomic filter: A weak form of shift operator for graph signals
AbstractThe shift operation plays a crucial role in the classical signal processing. It is the generator of all the filters and the basic operation for time-frequency analysis, such as windowed Fourier transform and wavelet transform. With the ...
Comments
Information & Contributors
Information
Published In
January 2022
391 pages
ISBN:9781450395465
DOI:10.1145/3512388
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 28 March 2022
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICIGP 2022
ICIGP 2022: 2022 the 5th International Conference on Image and Graphics Processing
January 7 - 9, 2022
Beijing, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 43Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)1
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format