Finite impulse response filters for simplicial complexes
In this paper, we study linear filters to process signals defined on simplicial complexes, ie,
signals defined on nodes, edges, triangles, etc. of a simplicial complex, thereby generalizing …
signals defined on nodes, edges, triangles, etc. of a simplicial complex, thereby generalizing …
Generalizing graph signal processing: High dimensional spaces, models and structures
Graph signal processing (GSP) has seen rapid developments in recent years. Since its
introduction around ten years ago, we have seen numerous new ideas and practical …
introduction around ten years ago, we have seen numerous new ideas and practical …
Topological slepians: Maximally localized representations of signals over simplicial complexes
C Battiloro, P Di Lorenzo… - ICASSP 2023-2023 IEEE …, 2023 - ieeexplore.ieee.org
This paper introduces topological Slepians, ie, a novel class of signals defined over
topological spaces (eg, simplicial complexes) that are maximally concentrated on the …
topological spaces (eg, simplicial complexes) that are maximally concentrated on the …
Distributed nonlinear polynomial graph filter and its output graph spectrum: Filter analysis and design
While frequency-domain algorithms have been demonstrated to be powerful for
conventional nonlinear signal processing, there is still not much progress in literature …
conventional nonlinear signal processing, there is still not much progress in literature …
Topological volterra filters
To deal with high-dimensional data, graph filters have shown their power in both graph
signal processing and data science. However, graph filters process signals exploiting only …
signal processing and data science. However, graph filters process signals exploiting only …
Autoregressive graph Volterra models and applications
Graph-based learning and estimation are fundamental problems in various applications
involving power, social, and brain networks, to name a few. While learning pair-wise …
involving power, social, and brain networks, to name a few. While learning pair-wise …
Learning connectivity and higher-order interactions in radial distribution grids
To perform any meaningful optimization task, distribution grid operators need to know the
topology of their grids. Although power grid topology identification and verification has been …
topology of their grids. Although power grid topology identification and verification has been …
Graph topology inference with derivative-reproducing property in RKHS: Algorithm and convergence analysis
M Moscu, RA Borsoi, C Richard… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
In many areas such as computational biology, finance or social sciences, knowledge of an
underlying graph explaining the interactions between agents is of paramount importance but …
underlying graph explaining the interactions between agents is of paramount importance but …