Discrete Signal Processing on Graphs
From MaRDI portal
Abstract: In social settings, individuals interact through webs of relationships. Each individual is a node in a complex network (or graph) of interdependencies and generates data, lots of data. We label the data by its source, or formally stated, we index the data by the nodes of the graph. The resulting signals (data indexed by the nodes) are far removed from time or image signals indexed by well ordered time samples or pixels. DSP, discrete signal processing, provides a comprehensive, elegant, and efficient methodology to describe, represent, transform, analyze, process, or synthesize these well ordered time or image signals. This paper extends to signals on graphs DSP and its basic tenets, including filters, convolution, z-transform, impulse response, spectral representation, Fourier transform, frequency response, and illustrates DSP on graphs by classifying blogs, linear predicting and compressing data from irregularly located weather stations, or predicting behavior of customers of a mobile service provider.
Recommendations
- Discrete Signal Processing on Graphs: Sampling Theory
- Discrete Signal Processing on Graphs: Frequency Analysis
- Stationary Signal Processing on Graphs
- Introduction to graph signal processing
- Graphon Signal Processing
- Graphon Filters: Graph Signal Processing in the Limit
- Spectral Domain Sampling of Graph Signals
- Signal processing on weighted line graphs
- Digraph Signal Processing With Generalized Boundary Conditions
- Partition of unity methods for signal processing on graphs
Cited in
(48)- Discrete Signal Processing with Set Functions
- Bayesian reconstruction of Cartesian product graph signals with general patterns of missing data
- On embeddings and inverse embeddings of input design for regularized system identification
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- Distributed reconstruction of time-varying graph signals via a modified Newton's method
- Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
- Data Analytics on Graphs Part II: Signals on Graphs
- SIAS-miner: mining subjectively interesting attributed subgraphs
- Graph signal interpolation with positive definite graph basis functions
- Graph-Based Transform for 2D Piecewise Smooth Signals With Random Discontinuity Locations
- Extending Classical Multirate Signal Processing Theory to Graphs—Part I: Fundamentals
- Local smoothness of graph signals
- Perfect reconstruction two-channel filter banks on arbitrary graphs
- Parseval wavelets on hierarchical graphs
- Random walks and diffusion on networks
- Signals on graphs: transforms and tomograms
- Signal processing on weighted line graphs
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
- Continuous spectral transform and modulation for signal processing on arbitrary data
- Graphical designs and gale duality
- Fractional spectral graph wavelets and their applications
- Universal graph filter design based on Butterworth, Chebyshev, and elliptic functions
- Approximation theorems on graphs
- Study of graph isomorphism using Jordan forms of adjacency matrices
- Graph Fourier transform based on singular value decomposition of the directed Laplacian
- Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures
- Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
- Graph Fourier transform based on \(\ell_1\) norm variation minimization
- Spatially distributed sampling and reconstruction
- The dual graph shift operator: identifying the support of the frequency domain
- Spatiotemporal analysis using Riemannian composition of diffusion operators
- Kernel and wavelet density estimators on manifolds and more general metric spaces
- Time-varying graph signal recovery using high-order smoothness and adaptive low-rankness
- Oracle inequalities and upper bounds for kernel density estimators on manifolds and more general metric spaces
- 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
- A novel framework for time series recognition and classification based on dispersion transition networks
- Gabor-type frames for signal processing on graphs
- scientific article; zbMATH DE number 7625171 (Why is no real title available?)
- The Zak transform and the range function in connection with shift invariant spaces on undirected graphs
- Frames for signal processing on Cayley graphs
- Applied harmonic analysis and data science. Abstracts from the workshop held November 28 -- December 4, 2021 (hybrid meeting)
- Spectral Laplace transform of signals on arbitrary domains
- scientific article; zbMATH DE number 4199579 (Why is no real title available?)
- Polynomial control on stability, inversion and powers of matrices on simple graphs
- A graph learning approach for kernel-based system identification with manifold regularization
- Signal Processing on Simplicial Complexes
This page was built for publication: Discrete Signal Processing on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4578485)
