Classical wavelet, wavelet packets and time-frequency dictionaries have been generalized to the graph setting, the main goal being to obtain atoms which are jointly localized both in the vertex and the graph spectral domain. We present a new method to generate a whole dictionary of frames of wavelet packets defined in the graph spectral domain to represent signals on weighted graphs. We will give some concrete examples on how the spectral graph wavelet packets can be used for compressing, denoising and reconstruction by considering a signal, given by the fRMI (functional magnetic resonance imaging) data, on the nodes of voxel-wise brain graph with 900760 nodes, representing the brain voxels.
Spectral Graph Wavelet Packets Frames
Bulai, Iulia
Writing – Original Draft Preparation
;SalianiWriting – Original Draft Preparation
2023-01-01
Abstract
Classical wavelet, wavelet packets and time-frequency dictionaries have been generalized to the graph setting, the main goal being to obtain atoms which are jointly localized both in the vertex and the graph spectral domain. We present a new method to generate a whole dictionary of frames of wavelet packets defined in the graph spectral domain to represent signals on weighted graphs. We will give some concrete examples on how the spectral graph wavelet packets can be used for compressing, denoising and reconstruction by considering a signal, given by the fRMI (functional magnetic resonance imaging) data, on the nodes of voxel-wise brain graph with 900760 nodes, representing the brain voxels.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.