Graph Signal Processing: Vertex Multiplication

doi:10.1109/LSP.2021.3086391

Return

Graph Signal Processing: Vertex Multiplication

2021-01-01

Bünyamin Kartal

Bayiz, Yigit E.

Aykut Koç *

DOI：10.1109/LSP.2021.3086391

Original

Save

View PDF

Abstract

En 中文

On the Euclidean domains of classical signal processing, linking of signal samples to underlying coordinate structures is straightforward. While graph adjacency matrices totally define the quantitative associations among the underlying graph vertices, a major problem in graph signal processing is the lack of explicit association of vertices with an underlying coordinate structure. To make this link, we propose an operation, called the vertex multiplication (VM), which is defined for graphs and can operate on graph signals. VM, which generalizes the coordinate multiplication (CM) operation in time series signals, can be interpreted as an operator that assigns a coordinate structure to a graph. By using the graph domain extension of differentiation and graph Fourier transform (GFT), VM is defined such that it shows Fourier duality that differentiation and CM operations are duals of each other under Fourier transformation (FT). Numerical examples and applications are also presented.

Keywords:

Measurement

Location awareness

Fourier transforms

Frequency-domain analysis

Time series analysis

Directed graphs

Signal processing

Graph signal processing (GSP)

graph Fourier transform (GFT)

duality

coordinate multiplication

vertex multiplication

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.