2.7k citations · 7.9k across the 98 of their papers we have counts for
4 papers · 1 filter
Finite Impulse Response Filters for Simplicial Complexes
Maosheng Yang, Elvin Isufi, Michael T. Schaub +1
In this paper, we study linear filters to process signals defined on simplicial complexes, i.e., signals defined on nodes, edges, triangles, etc. of a simplicial complex, thereby g…
Distributed Autoregressive Moving Average Graph Filters
Andreas Loukas, Andrea Simonetto, Geert Leus
We introduce the concept of autoregressive moving average (ARMA) filters on a graph and show how they can be implemented in a distributed fashion. Our graph filter design philosoph…
Reconstruction of Graph Signals through Percolation from Seeding Nodes
Santiago Segarra, Antonio G. Marques, Geert Leus +1
New schemes to recover signals defined in the nodes of a graph are proposed. Our focus is on reconstructing bandlimited graph signals, which are signals that admit a sparse represe…
Sampling of graph signals with successive local aggregations
Antonio G. Marques, Santiago Segarra, Geert Leus +1
A new scheme to sample signals defined in the nodes of a graph is proposed. The underlying assumption is that such signals admit a sparse representation in a frequency domain relat…