Vertex-frequency analysis on graphs
From MaRDI portal
Publication:905903
DOI10.1016/j.acha.2015.02.005zbMath1403.94031arXiv1307.5708OpenAlexW2016423476WikidataQ57535607 ScholiaQ57535607MaRDI QIDQ905903
Benjamin Ricaud, Pierre Vandergheynst, David I. Shuman
Publication date: 28 January 2016
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.5708
clusteringlocalizationtime-frequency analysisspectral graph theorygeneralized translation and modulationsignal processing on graphs
Related Items (27)
Approximation theorems on graphs ⋮ Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures ⋮ Natural graph wavelet packet dictionaries ⋮ Tracking network dynamics: a survey using graph distances ⋮ Graph signal interpolation with positive definite graph basis functions ⋮ Graph Fourier transform based on \(\ell_1\) norm variation minimization ⋮ The spectrum of a class of uniform hypergraphs ⋮ Gabor-type frames for signal processing on graphs ⋮ Data Analytics on Graphs Part II: Signals on Graphs ⋮ Graph signal processing on dynamic graphs based on temporal-attention product ⋮ Fast mesh data augmentation via Chebyshev polynomial of spectral filtering ⋮ Spectral Laplace transform of signals on arbitrary domains ⋮ Spectral analysis of non-Hermitian matrices and directed graphs ⋮ Graph convolutional neural networks via scattering ⋮ Spectral graph wavelet packets frames ⋮ Localization in Matrix Computations: Theory and Applications ⋮ Fractional spectral graph wavelets and their applications ⋮ Invertibility of graph translation and support of Laplacian Fiedler vectors ⋮ Riemannian gradient descent methods for graph-regularized matrix completion ⋮ The dual graph shift operator: identifying the support of the frequency domain ⋮ Graph theoretic uncertainty and feasibility ⋮ Local smoothness of graph signals ⋮ Partition of unity methods for signal processing on graphs ⋮ Localized Fourier analysis for graph signal processing ⋮ Designing Gabor windows using convex optimization ⋮ Parallel Transport Convolution: Deformable Convolutional Networks on Manifold-Structured Data ⋮ Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Wavelets on graphs via spectral graph theory
- Sparse regular random graphs: spectral density and eigenvectors
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Bounds for the entries of matrix functions with applications to preconditioning
- Foundations of time-frequency analysis
- On the Lambert \(w\) function
- Non-localization of eigenfunctions on large regular graphs
- Frames and bases. An introductory course
- Proximal Splitting Methods in Signal Processing
- Discrete Calculus
- The Discrete Cosine Transform
- Heat Kernel Estimates on Weighted Graphs
- Eigenvalues of Graphs and Sobolev Inequalities
- Sparse random graphs: Eigenvalues and eigenvectors
- Eigenvectors of random graphs: Nodal Domains
- Functions of Matrices
This page was built for publication: Vertex-frequency analysis on graphs
