# Graph Linear Canonical Transform: Definition, Vertex-Frequency Analysis and Filter Design

Source: [Graph Linear Canonical Transform: Definition, Vertex-Frequency Analysis and Filter Design](<https://www.sota2.com/research/paper/68fa5c181e209131ce9ce0f9>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T17:26:27.186Z

Authors: Jian Yi Chen, Bing Zhao Li

Published: 2024-07-02T10:19:26.000Z

## Abstract

This paper proposes a graph linear canonical transform (GLCT) by decomposing the linear canonical parameter matrix into fractional Fourier transform, scale transform, and chirp modulation for graph signal processing. The GLCT enables adjustable smoothing modes, enhancing alignment with graph signals. Leveraging traditional fractional domain time-frequency analysis, we investigate vertex-frequency analysis in the graph linear canonical domain, aiming to overcome limitations in capturing local information. Filter design methods, including optimal design and learning with stochastic gradient descent, are analyzed and applied to image classification tasks. The proposed GLCT and vertex-frequency analysis present innovative approaches to signal processing challenges, with potential applications in various fields.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2407.12046>)

[PDF](<https://arxiv.org/pdf/2407.12046.pdf>)