Orthogonal Transforms for Signals on Directed Graphs
arXiv:2110.08364
Abstract
In this paper we consider the problem of defining transforms for signals on directed graphs, with a specific focus on defective graphs where the corresponding graph operator cannot be diagonalized. Our proposed method is based on the Schur decomposition and leads to a series of embedded invariant subspaces for which orthogonal basis are available. As compared to diffusion wavelets, our method is more flexible in the generation of subspaces, but these subspaces can only be approximately orthogonal.
arXiv comment5 pages, submitted to ICASSP 2022
References in corpus (6)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs
- On the Graph Fourier Transform for Directed Graphs
- Irregularity-Aware Graph Fourier Transforms
- Spectral Projector-Based Graph Fourier Transforms
- A Directed Graph Fourier Transform with Spread Frequency Components