Natural graph wavelet packet dictionaries

From MaRDI portal
Publication:829903

DOI10.1007/S00041-021-09832-3zbMATH Open1462.65229arXiv2009.09020OpenAlexW3157727345MaRDI QIDQ829903FDOQ829903


Authors: Alexander Cloninger, Haotian Li, Naoki Saito Edit this on Wikidata


Publication date: 6 May 2021

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Abstract: 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 to arbitrary graphs, and do not rely on the frequency interpretation of Laplacian eigenvalues. We describe the algorithms (involving either vector rotations or orthogonalizations) to construct these basis dictionaries, use them to efficiently approximate graph signals through the best basis search, and demonstrate the strengths of these basis dictionaries for graph signals measured on sunflower graphs and street networks.


Full work available at URL: https://arxiv.org/abs/2009.09020




Recommendations




Cites Work


Cited In (11)

Uses Software





This page was built for publication: Natural graph wavelet packet dictionaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829903)