best basis algorithmdual geometry of graphgraph Laplacian eigenvectorsgraph signal approximationwavelet packet dictionaries on graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for wavelets (65T60) Graph theory (including graph drawing) in computer science (68R10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 2177609 (Why is no real title available?)
- scientific article; zbMATH DE number 8551 (Why is no real title available?)
- A fast algorithm for adapted time-frequency tilings
- A simple general procedure for orthogonal rotation
- A wavelet tour of signal processing. The sparse way.
- Analysis of neuronal dendrite patterns using eigenvalues of graph Laplacians
- Archimedean Voronoi spiral tilings
- CayleyNets: Graph Convolutional Neural Networks With Complex Rational Spectral Filters
- Constructing the sunflower head
- Diffusion wavelets
- Entropy-based algorithms for best basis selection
- Foundations of factor analysis
- Gaussian bandwidth selection for manifold learning and classification
- Harmonic analysis of digital data bases
- Hierarchical graph Laplacian eigen transforms
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Manifold parametrizations by eigenfunctions of the Laplacian and heat kernels
- Modern multidimensional scaling. Theory and applications.
- Mysteries around the graph Laplacian eigenvalue 4
- On suprema of autoconvolutions with an application to Sidon sets
- Optimal approximation for the submodular welfare problem in the value oracle model
- Spectral embedding norm: looking deep into the spectrum of the graph Laplacian
- Ten Lectures on Wavelets
- The Discrete Cosine Transform
- The Haar wavelet transform of a dendrogram
- The varimax criterion for analytic rotation in factor analysis
- Treelets -- an adaptive multi-scale basis for sparse unordered data
- Vertex-frequency analysis on graphs
- Wavelets on graphs via spectral graph theory
- Wavelets. Tools for science and technology
Cited in
(11)- Overview of the topical collection: harmonic analysis on combinatorial graphs
- eGHWT: the extended generalized Haar-Walsh transform
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm
- The dual graph shift operator: identifying the support of the frequency domain
- Signals on graphs: transforms and tomograms
- Multiscale Transforms for Signals on Simplicial Complexes
- Spectral graph wavelet packets frames
- scientific article; zbMATH DE number 1943025 (Why is no real title available?)
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- Multi-link wavelets on hierarchical graphs
- Hierarchical graph Laplacian eigen transforms
Describes a project that uses
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)
