Article (Scientific journals)
Adaptive Graph Filters in Reproducing Kernel Hilbert Spaces: Design and Performance Analysis
Elias, Vitor R. M.; Gogineni, Vinay C.; Alves Martins, Wallace et al.
2020In IEEE Transactions on Signal and Information Processing over Networks
Peer reviewed
 

Files


Full Text
GKLMS.pdf
Author postprint (1.61 MB)
Download

This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/TSIPN.2020.3046217, IEEE Transactions on Signal and Information Processing over Networks. See https://ieeexplore.ieee.org/document/9303421. This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/


All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Adaptive signal processing; Distributed learning; Kernel graph filters; Kernel LMS; Random Fourier features
Abstract :
[en] This paper develops adaptive graph filters that operate in reproducing kernel Hilbert spaces. We consider both centralized and fully distributed implementations. We first define nonlinear graph filters that operate on graph-shifted versions of the input signal. We then propose a centralized graph kernel least mean squares (GKLMS) algorithm to identify nonlinear graph filters' model parameters. To reduce the dictionary size of the centralized GKLMS, we apply the principles of coherence check and random Fourier features (RFF). The resulting algorithms have performance close to that of the GKLMS algorithm. Additionally, we leverage the graph structure to derive the distributed graph diffusion KLMS (GDKLMS) algorithms. We show that, unlike the coherence check-based approach, the GDKLMS based on RFF avoids the use of a pre-trained dictionary through its data independent fixed structure. We conduct a detailed performance study of the proposed RFF-based GDKLMS, and the conditions for its convergence both in mean and mean-squared senses are derived. Extensive numerical simulations show that GKLMS and GDKLMS can successfully identify nonlinear graph filters and adapt to model changes. Furthermore, RFF-based strategies show faster convergence for model identification and exhibit better tracking performance in model-changing scenarios.
Disciplines :
Electrical & electronics engineering
Author, co-author :
Elias, Vitor R. M.
Gogineni, Vinay C.
Alves Martins, Wallace ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom
Werner, Stefan
External co-authors :
yes
Language :
English
Title :
Adaptive Graph Filters in Reproducing Kernel Hilbert Spaces: Design and Performance Analysis
Publication date :
2020
Journal title :
IEEE Transactions on Signal and Information Processing over Networks
ISSN :
2373-776X
Publisher :
Institute of Electrical and Electronics Engineers, New York, United States - New York
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
European Projects :
H2020 - 742648 - AGNOSTIC - Actively Enhanced Cognition based Framework for Design of Complex Systems
Funders :
CE - Commission Européenne [BE]
Available on ORBilu :
since 23 January 2021

Statistics


Number of views
74 (4 by Unilu)
Number of downloads
33 (1 by Unilu)

Scopus citations®
 
23
Scopus citations®
without self-citations
20
WoS citations
 
20

Bibliography


Similar publications



Contact ORBilu