Graph-Dictionary Signal Model for Sparse Representations of Multivariate Data
William Cappelletti, Pascal Frossard

TL;DR
This paper introduces a novel graph-dictionary signal model that captures relationships in multivariate data through learned graph structures, enabling sparse representations and improved decoding in brain activity analysis.
Contribution
The paper proposes a new graph-dictionary model and a framework to infer graph structures from data, enhancing sparse representations and signal decoding capabilities.
Findings
Successfully reconstructs graphs from synthetic signals
Outperforms baselines in graph inference tasks
Improves brain activity decoding accuracy
Abstract
Representing and exploiting multivariate signals requires capturing relations between variables, which we can represent by graphs. Graph dictionaries allow to describe complex relational information as a sparse sum of simpler structures, but no prior model exists to infer such underlying structure elements from data. We define a novel Graph-Dictionary signal model, where a finite set of graphs characterizes relationships in data distribution as filters on the weighted sum of their Laplacians. We propose a framework to infer the graph dictionary representation from observed node signals, which allows to include a priori knowledge about signal properties, and about underlying graphs and their coefficients. We introduce a bilinear generalization of the primal-dual splitting algorithm to solve the learning problem. We show the capability of our method to reconstruct graphs from signals in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition
MethodsSparse Evolutionary Training
