Name
Abstract | ||
|---|---|---|
Graph filters, defined as polynomial functions of a graph-shift operator (GSO), play a key role in signal processing over graphs. In this work, we are interested in the adaptive and distributed estimation of graph filter coefficients from streaming graph signals. To this end, diffusion LMS strategies can be employed. However, most popular GSOs such as those based on the graph Laplacian matrix or the adjacency matrix are not energy preserving. This may result in a large eigenvalue spread and a slow convergence of the graph diffusion LMS. To address this issue and improve the transient performance, we introduce a graph diffusion LMS-Newton algorithm. We also propose a computationally efficient preconditioned diffusion strategy and we study its performance. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.23919/EUSIPCO.2018.8553273 | European Signal Processing Conference |
Keywords | Field | DocType |
Graph signal processing,graph filter,diffusion LMS,LMS-Newton,preconditioned LMS | Convergence (routing),Adjacency matrix,Signal processing,Laplacian matrix,Polynomial,Matrix (mathematics),Computer science,Algorithm,Eigenvalues and eigenvectors,Filter design | Conference |
ISSN | Citations | PageRank |
2076-1465 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fei Hua | 1 | 9 | 2.83 |
| Roula Nassif | 2 | 57 | 6.89 |
| Cédric Richard | 3 | 940 | 71.61 |
| Haiyan Wang | 4 | 39 | 16.48 |
| Ali H. Sayed | 5 | 9134 | 667.71 |