.png){kind=icon}
Return
Multi-dimensional graph linear canonical transform and its application
.png){kind=icon}
PRE
AI
DOI：10.1016/j.dsp.2025.105222.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Processing multi-dimensional (mD) graph data is crucial in fields such as social networks, communication networks, image processing, and signal processing due to its effective representation of complex relationships and network structures. Designing a transform method for processing these mD graph signals in the graph linear canonical domain remains a key challenge in graph signal processing. This article investigates transforms for mD graph signals defined on Cartesian product graphs, including two-dimensional graph linear canonical transforms (2D GLCTs) based on adjacency matrices and graph Laplacian matrices. Furthermore, transforms are extended to mD GLCTs, enabling the handling of more complex mD graph data. To demonstrate the practicality of the proposed method, this paper uses the 2D GLCT based on the Laplacian matrix as an example to detail its application in data compression.
Keywords:
Graph Fourier transform
Linear canonical transform
Graph linear canonical transform
Multi-dimensional signal processing
Graph signal processing
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more