Discrete Signal Processing on Graphs: Frequency Analysis
From MaRDI portal
Publication:4579251
Abstract: Signals and datasets that arise in physical and engineering applications, as well as social, genetics, biomolecular, and many other domains, are becoming increasingly larger and more complex. In contrast to traditional time and image signals, data in these domains are supported by arbitrary graphs. Signal processing on graphs extends concepts and techniques from traditional signal processing to data indexed by generic graphs. This paper studies the concepts of low and high frequencies on graphs, and low-, high-, and band-pass graph filters. In traditional signal processing, there concepts are easily defined because of a natural frequency ordering that has a physical interpretation. For signals residing on graphs, in general, there is no obvious frequency ordering. We propose a definition of total variation for graph signals that naturally leads to a frequency ordering on graphs and defines low-, high-, and band-pass graph signals and filters. We study the design of graph filters with specified frequency response, and illustrate our approach with applications to sensor malfunction detection and data classification.
Cited in
(36)- Signals on graphs: transforms and tomograms
- Polynomial control on stability, inversion and powers of matrices on simple graphs
- The dual graph shift operator: identifying the support of the frequency domain
- Localized Fourier analysis for graph signal processing
- Distributed reconstruction of time-varying graph signals via a modified Newton's method
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
- A noncommutative approach to the graphon Fourier transform
- Graph convolutional neural networks via scattering
- Fractional spectral graph wavelets and their applications
- Local smoothness of graph signals
- Splines and wavelets on circulant graphs
- Three-dimensional steerable discrete cosine transform with application to 3D image compression
- Applied harmonic analysis and data science. Abstracts from the workshop held November 28 -- December 4, 2021 (hybrid meeting)
- On new PageRank computation methods using quantum computing
- Discrete Signal Processing on Graphs
- Graph theoretic uncertainty and feasibility
- scientific article; zbMATH DE number 7625171 (Why is no real title available?)
- Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
- Data Analytics on Graphs Part II: Signals on Graphs
- Multiscale discrete framelet transform for graph-structured signals
- Study of graph isomorphism using Jordan forms of adjacency matrices
- Signal processing on weighted line graphs
- Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures
- Universal graph filter design based on Butterworth, Chebyshev, and elliptic functions
- Graph Fourier transform based on singular value decomposition of the directed Laplacian
- Graph signal processing on dynamic graphs based on temporal-attention product
- Spectral Laplace transform of signals on arbitrary domains
- Spatiotemporal analysis using Riemannian composition of diffusion operators
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem
- Operator-based graph linear canonical transform
- Gode: graph Fourier transform based outlier detection using empirical Bayesian thresholding
- Barron space for graph convolutional neural networks
- Doubly stochastic inter-assembly coupling via entropic optimal transport in echo-state networks for chaotic flows
- Unified Fourier transform on graphs sampled from stochastic block models
- Approximation theorems on graphs
This page was built for publication: Discrete Signal Processing on Graphs: Frequency Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579251)
