Abstract: We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian . Given a wavelet generating kernel and a scale parameter , we define the scaled wavelet operator . The spectral graph wavelets are then formed by localizing this operator by applying it to an indicator function. Subject to an admissibility condition on , this procedure defines an invertible transform. We explore the localization properties of the wavelets in the limit of fine scales. Additionally, we present a fast Chebyshev polynomial approximation algorithm for computing the transform that avoids the need for diagonalizing . We highlight potential applications of the transform through examples of wavelets on graphs corresponding to a variety of different problem domains.
Recommendations
Cites work
- scientific article; zbMATH DE number 3719745 (Why is no real title available?)
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- A Survey of Methods of Computing Minimax and Near-Minimax Polynomial Approximations for Functions of a Single Independent Variable
- A multiscale approach to sensor fusion and the solution of linear inverse problems
- A statistical multiscale framework for Poisson inverse problems
- Acceleration of the frame algorithm
- Adaptive wavelet thresholding for image denoising and compression
- Complex wavelets for shift invariant analysis and filtering of signals
- Continuous and Discrete Wavelet Transforms
- Continuous wavelets on compact manifolds
- Decomposition of Hardy Functions into Square Integrable Wavelets of Constant Shape
- Diffusion polynomial frames on metric measure spaces
- Diffusion wavelets
- Embedded image coding using zerotrees of wavelet coefficients
- Filtering and deconvolution by the wavelet transform
- From graph to manifold Laplacian: the convergence rate
- Ideal spatial adaptation by wavelet shrinkage
- Image denoising using scale mixtures of gaussians in the wavelet domain
- Interpolation and approximation by polynomials
- Learning Theory
- Multiscale methods for data on graphs and irregular multidimensional situations
- Near-Minimax Polynomial Approximation in an Elliptical Region
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- Nonlinear solution of linear inverse problems by wavelet-vaguelette decomposition
- Orthogonal bandelet bases for geometric images approximation
- THE CONTINUOUS WAVELET TRANSFORM ON CONIC SECTIONS
- Ten Lectures on Wavelets
- The Haar wavelet transform of a dendrogram
- The Matrix Eigenvalue Problem
- Towards a theoretical foundation for Laplacian-based manifold methods
- Treelets -- an adaptive multi-scale basis for sparse unordered data
- Variational image restoration by means of wavelets: Simultaneous decomposition, deblurring, and denoising
- Wavelet analysis and synthesis of fractional Brownian motion
- Wavelets on the 2-sphere: A group-theoretical approach
Cited in
(only showing first 100 items - show all)- Spectral Laplace transform of signals on arbitrary domains
- Harmonic analysis for graph refinements and the continuous graph FFT
- Spectral analysis of non-Hermitian matrices and directed graphs
- Multi-link wavelets on hierarchical graphs
- Graph spectral image smoothing using the heat kernel
- eGHWT: the extended generalized Haar-Walsh transform
- Tracking network dynamics: a survey using graph distances
- Geometric scattering on measure spaces
- Haar-like wavelets on hierarchical trees
- Graph routing between capsules
- K-plex cover pooling for graph neural networks
- On the optimality of shape and data representation in the spectral domain
- A comparison of neural network architectures for data-driven reduced-order modeling
- Regularized principal component analysis
- Local measurement and diffusion reconstruction for signals on a weighted graph
- Fast Haar transforms for graph neural networks
- Approximate and exact solutions of intertwining equations through random spanning forests
- Exploiting node-feature bipartite graph in graph convolutional networks
- Multilevel approximation of Gaussian random fields: fast simulation
- Doubly stochastic normalization of the Gaussian kernel is robust to heteroskedastic noise
- Vertex-frequency analysis on graphs
- More power via graph-structured tests for differential expression of gene networks
- The DFS fused Lasso: linear-time denoising over general graphs
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- scientific article; zbMATH DE number 6536240 (Why is no real title available?)
- Natural graph wavelet packet dictionaries
- Invertibility of graph translation and support of Laplacian Fiedler vectors
- Graph theoretic uncertainty and feasibility
- Localized Fourier analysis for graph signal processing
- A class of Laplacian multiwavelets bases for high-dimensional data
- Distributed reconstruction of time-varying graph signals via a modified Newton's method
- Data Analytics on Graphs Part II: Signals on Graphs
- Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
- Sparse representation on graphs by tight wavelet frames and applications
- scientific article; zbMATH DE number 1943025 (Why is no real title available?)
- Representation of functions on big data associated with directed graphs
- Local smoothness of graph signals
- scientific article; zbMATH DE number 5054757 (Why is no real title available?)
- Perfect reconstruction two-channel filter banks on arbitrary graphs
- Parseval wavelets on hierarchical graphs
- Random sampling of bandlimited signals on graphs
- Dual wavelet frame transforms on manifolds and graphs
- Adaptive directional Haar tight framelets on bounded domains for digraph signal representations
- Signals on graphs: transforms and tomograms
- Spectral triples and wavelets for higher-rank graphs
- Multi-view graph convolutional networks with attention mechanism
- Tensor network and (\(p\)-adic) AdS/CFT
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- Uncertainty quantification in graph-based classification of high dimensional data
- Parallel Transport Convolution: Deformable Convolutional Networks on Manifold-Structured Data
- Graphical designs and gale duality
- Fractional spectral graph wavelets and their applications
- Construction and Monte Carlo estimation of wavelet frames generated by a reproducing kernel
- Novel and efficient computation of Hilbert-Huang transform on surfaces
- Approximation theorems on graphs
- Feature-preserving, mesh-free empirical mode decomposition for point clouds and its applications
- A Matlab suite for second generation wavelets on an interval and the corresponding adaptive grid
- An adaptive spectral graph wavelet method for PDEs on networks
- Spectral graph wavelet regularization and adaptive wavelet for the backward heat conduction problem
- Graph signal processing on dynamic graphs based on temporal-attention product
- Intertwining wavelets or multiresolution analysis on graphs through random forests
- Dual-domain graph convolutional networks for skeleton-based action recognition
- An adaptive meshfree spectral graph wavelet method for partial differential equations
- TFA-CLSTMNN: Novel convolutional network for sound-based diagnosis of COVID-19
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm
- Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
- A generalization of Gleason's frame function for quantum measurement
- Rutting prediction and analysis of influence factors based on multivariate transfer entropy and graph neural networks
- Fast mesh data augmentation via Chebyshev polynomial of spectral filtering
- Tight framelets and fast framelet filter bank transforms on manifolds
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
- Graph Fourier transform based on \(\ell_1\) norm variation minimization
- Splines and wavelets on circulant graphs
- Dual framelets transform on manifolds and graphs
- The dual graph shift operator: identifying the support of the frequency domain
- Multiscale Transforms for Signals on Simplicial Complexes
- Optimal design of edge weights in transforming low-frequency graph signals into the spectral domain
- Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling
- Spatiotemporal analysis using Riemannian composition of diffusion operators
- Deep neural network for drawing networks, \({(DNN)^{ 2 }} \)
- Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
- Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study
- Constraint matrix factorization for space variant PSFs field restoration
- Graph convolutional neural networks via scattering
- A unified framework for harmonic analysis of functions on directed graphs and changing data
- A graph convolutional neural network for gene expression data analysis with multiple gene networks
- HesGCN: Hessian graph convolutional networks for semi-supervised classification
- Partition of unity methods for signal processing on graphs
- Signal processing on the permutahedron: tight spectral frames for ranked data analysis
- Hierarchical graph Laplacian eigen transforms
- Adaptive multi-channel contrastive graph convolutional network with graph and feature fusion
- Extreme values of the Fiedler vector on trees
- A noncommutative approach to the graphon Fourier transform
- A gentle introduction to deep learning for graphs
- Graph deconvolutional networks
- Multiscale discrete framelet transform for graph-structured signals
- CT image reconstruction by spatial-Radon domain data-driven tight frame regularization
- Data-driven thresholding in denoising with spectral graph wavelet transform
- Sparse approximation of 3D meshes using the spectral geometry of the Hamiltonian operator
- Graph Spectral Image Smoothing
This page was built for publication: Wavelets on graphs via spectral graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629253)
