In the last years, several new tools have been devised to analyze signals defined over the vertices of a graph, i.e., over a discrete domain whose structure is described by pairwise relations. In this paper, we expand these tools to the analysis of signals defined on simplicial complexes, whose domain has a structure specified by various multi-way relations. Within this framework, we show how to filter signals and how to reconstruct edge and vertex signals from a subset of observations. Finally, we propose two alternative algorithms to infer the structure of the simplicial complex from the observations.
Learning from signals defined over simplicity complexes / Barbarossa, S.; Sardellitti, S.; Ceci, E.. - (2018), pp. 51-55. (Intervento presentato al convegno 2018 IEEE Data Science Workshop, DSW 2018 tenutosi a Lausanne; Switzerland) [10.1109/DSW.2018.8439885].
Learning from signals defined over simplicity complexes
Barbarossa S.;Sardellitti S.;Ceci E.
2018
Abstract
In the last years, several new tools have been devised to analyze signals defined over the vertices of a graph, i.e., over a discrete domain whose structure is described by pairwise relations. In this paper, we expand these tools to the analysis of signals defined on simplicial complexes, whose domain has a structure specified by various multi-way relations. Within this framework, we show how to filter signals and how to reconstruct edge and vertex signals from a subset of observations. Finally, we propose two alternative algorithms to infer the structure of the simplicial complex from the observations.File | Dimensione | Formato | |
---|---|---|---|
Barbarossa_Learning_2018.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
728.34 kB
Formato
Adobe PDF
|
728.34 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.