Vertex-frequency analysis on graphs
From MaRDI portal
Abstract: One of the key challenges in the area of signal processing on graphs is to design dictionaries and transform methods to identify and exploit structure in signals on weighted graphs. To do so, we need to account for the intrinsic geometric structure of the underlying graph data domain. In this paper, we generalize one of the most important signal processing tools - windowed Fourier analysis - to the graph setting. Our approach is to first define generalized convolution, translation, and modulation operators for signals on graphs, and explore related properties such as the localization of translated and modulated graph kernels. We then use these operators to define a windowed graph Fourier transform, enabling vertex-frequency analysis. When we apply this transform to a signal with frequency components that vary along a path graph, the resulting spectrogram matches our intuition from classical discrete-time signal processing. Yet, our construction is fully generalized and can be applied to analyze signals on any undirected, connected, weighted graph.
Recommendations
Cites work
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 45971 (Why is no real title available?)
- scientific article; zbMATH DE number 1446947 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Bounds for the entries of matrix functions with applications to preconditioning
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Discrete calculus. Applied analysis on graphs for computational science
- Eigenvalues of Graphs and Sobolev Inequalities
- Eigenvectors of random graphs: nodal domains
- Foundations of time-frequency analysis
- Frames and bases. An introductory course
- Functions of Matrices
- Heat Kernel Estimates on Weighted Graphs
- Matrices, moments and quadrature with applications
- Non-localization of eigenfunctions on large regular graphs
- On the Lambert \(w\) function
- Proximal splitting methods in signal processing
- Sparse random graphs: eigenvalues and eigenvectors
- Sparse regular random graphs: spectral density and eigenvectors
- The Discrete Cosine Transform
- Toeplitz and circulant matrices: a review.
- Wavelets on graphs via spectral graph theory
Cited in
(42)- Vertex-frequency analysis of graph signals
- 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
- Data Analytics on Graphs Part II: Signals on Graphs
- Localization in matrix computations: theory and applications
- Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
- Graph signal interpolation with positive definite graph basis functions
- Local smoothness of graph signals
- Signal processing on weighted line graphs
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
- Parallel Transport Convolution: Deformable Convolutional Networks on Manifold-Structured Data
- Fractional spectral graph wavelets and their applications
- Designing Gabor windows using convex optimization
- Approximation theorems on graphs
- Graph Fourier transform based on singular value decomposition of the directed Laplacian
- Graph signal processing on dynamic graphs based on temporal-attention product
- Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures
- Fast mesh data augmentation via Chebyshev polynomial of spectral filtering
- Riemannian gradient descent methods for graph-regularized matrix completion
- Graph Fourier transform based on \(\ell_1\) norm variation minimization
- The dual graph shift operator: identifying the support of the frequency domain
- Optimal design of edge weights in transforming low-frequency graph signals into the spectral domain
- Graph convolutional neural networks via scattering
- Partition of unity methods for signal processing on graphs
- A class of doubly stochastic shift operators for random graph signals and their boundedness
- A noncommutative approach to the graphon Fourier transform
- Multiscale discrete framelet transform for graph-structured signals
- Spectral graph wavelet packets frames
- The spectrum of a class of uniform hypergraphs
- Two subspace methods for frequency sparse graph signals
- Gabor-type frames for signal processing on graphs
- Wavelets on graphs via spectral graph theory
- Tight frames generated by a graph short-time Fourier transform
- Frames for signal processing on Cayley graphs
- Spectral Laplace transform of signals on arbitrary domains
- Spectral analysis of non-Hermitian matrices and directed graphs
- GBFPUM -- a MATLAB package for partition of unity based signal interpolation and approximation on graphs
- Tracking network dynamics: a survey using graph distances
This page was built for publication: Vertex-frequency analysis on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905903)
