Graph Fourier transform based on singular value decomposition of the directed Laplacian

DOI10.1007/s43670-023-00062-wzbMath1530.94074arXiv2205.06242OpenAlexW4385494701MaRDI QIDQ6049831

Yang Chen, Cheng Cheng, Qiyu Sun

Publication date: 18 September 2023

Published in: Sampling Theory, Signal Processing, and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.06242

zbMATH Keywords

singular value decompositiondirected graphsgraph Fourier transformgraph signal processing

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
• Local smoothness of graph signals
• Splines and wavelets on circulant graphs
• Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
• Spatially distributed sampling and reconstruction
• Graph Fourier transform based on \(\ell_1\) norm variation minimization
• Discrete Signal Processing on Graphs
• Discrete Signal Processing on Graphs: Frequency Analysis
• Discrete Signal Processing on Graphs: Sampling Theory
• Blind Identification of Graph Filters
• Irregularity-Aware Graph Fourier Transforms
• Bipartite Approximation for Graph Wavelet Signal Decomposition
• A Directed Graph Fourier Transform With Spread Frequency Components
• Digraph Laplacian and the Degree of Asymmetry
• Graph Fourier Transform: A Stable Approximation
• Fast Graph Fourier Transforms Based on Graph Symmetry and Bipartition

This page was built for publication: Graph Fourier transform based on singular value decomposition of the directed Laplacian