Natural Graph Wavelet Packet Dictionaries

09/18/2020
by   Alexander Cloninger, et al.
0

We introduce a set of novel multiscale basis transforms for signals on graphs that utilize their "dual" domains by incorporating the "natural" distances between graph Laplacian eigenvectors, rather than simply using the eigenvalue ordering. These basis dictionaries can be seen as generalizations of the classical Shannon wavelet packet dictionary and of classical time-frequency adapted wavelet packets to arbitrary graphs, and does not rely on the frequency interpretation of Laplacian eigenvalues. We describe the algorithms (involving either vector rotations or orthogonalizations) to efficiently approximate and compress signals through the best-basis algorithm, and demonstrate the strengths of these basis dictionaries for graph signals on sunflower graphs and road traffic networks.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset