• Corpus ID: 239016246

Orthogonal Transforms for Signals on Directed Graphs

  title={Orthogonal Transforms for Signals on Directed Graphs},
  author={J. M. Barrufet and Antonio Ortega},
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… 

Figures from this paper


On the Graph Fourier Transform for Directed Graphs
This paper addresses the general case of directed graphs and proposes an alternative approach that builds the graph Fourier basis as the set of orthonormal vectors that minimize a continuous extension of the graph cut size, known as the Lovász extension.
Wavelets on Graphs via Spectral Graph Theory
A novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph using the spectral decomposition of the discrete graph Laplacian L, based on defining scaling using the graph analogue of the Fourier domain.
Diagonalizable Shift and Filters for Directed Graphs Based on the Jordan-Chevalley Decomposition
This paper proposes to replace a given adjacency shift A by a diagonalizable shift AD obtained via the Jordan-Chevalley decomposition, which means that AD generates the subalgebra of all diagonalizable filters and is itself a polynomial in A (i.e., a filter).
Introduction to Graph Signal Processing
Spectral analysis of graphs is discussed next and some simple forms of processing signal on graphs, like filtering in the vertex and spectral domain, subsampling and interpolation, are given.
Spectral Projector-Based Graph Fourier Transforms
A quasi-coordinate free definition of the GFT and graph spectral decomposition of graph signals that is developed and implemented through oblique spectral projectors and discusses a generalized Parseval's inequality.
Irregularity-Aware Graph Fourier Transforms
A novel generalization of the graph Fourier transform (GFT) is presented, using the Voronoi cell area of vertices in the authors' GFT definition, showing that it leads to a more sensible definition of graph signal energy even when sampling is highly irregular.
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains
This tutorial overview outlines the main challenges of the emerging field of signal processing on graphs, discusses different ways to define graph spectral domains, which are the analogs to the classical frequency domain, and highlights the importance of incorporating the irregular structures of graph data domains when processing signals on graphs.
Signal Processing on Graphs - Contributions to an Emerging Field. (Traitement du signal sur graphes - Contributions à un domaine émergent)
This dissertation defines signal processing on graphs and gives intuitions on its strengths and weaknesses compared to classical signal processing and gives a method to study and test stationarity on real graph signals.
A Directed Graph Fourier Transform With Spread Frequency Components
It is shown that the spectral-dispersion minimization problem can be cast as supermodular optimization over the set of candidate frequency components, whose orthonormality can be enforced via a matroid basis constraint.
Graph Signal Processing: Structure and Scalability to Massive Data Sets
A novel formulation and graph signal processing framework that addresses the detection of normal and abnormal behaviors in extremely large, directed, sparse networks is presented and a graph Fourier transform for which the spectral components are the Jordan subspaces of the adjacency matrix is developed.