Bespoke multiresolution analysis of graph signals
Giacomo Elefante, Gianluca Giacchi, Michael Multerer, Jacopo Quizi

TL;DR
This paper introduces a new multiresolution analysis framework for graph signals using samplet transforms, enabling efficient compression and analysis of complex graph data by leveraging graph subdivision, embedding, and wavelet-like constructions.
Contribution
It defines samplets on graphs through patch subdivision and embedding, extending wavelet analysis to graph signals with properties like orthogonality and locality.
Findings
Outperforms Haar wavelets in compression and fidelity
Demonstrates robustness and scalability on manifold-based graph signals
Provides sparse representations with controllable approximation error
Abstract
We present a novel framework for discrete multiresolution analysis of graph signals. The main analytical tool is the samplet transform, originally defined in the Euclidean framework as a discrete wavelet-like construction, tailored to the analysis of scattered data. The first contribution of this work is defining samplets on graphs. To this end, we subdivide the graph into a fixed number of patches, embed each patch into a Euclidean space, where we construct samplets, and eventually pull the construction back to the graph. This ensures orthogonality, locality, and the vanishing moments property with respect to properly defined polynomial spaces on graphs. Compared to classical Haar wavelets, this framework broadens the class of graph signals that can efficiently be compressed and analyzed. Along this line, we provide a definition of a class of signals that can be compressed using our…
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.
