Multi-dimensional graph fractional Fourier transform and its application
원문 초록
Many multi-dimensional signals appear in the real world, such as digital images and data that has spatial and temporal dimensions. How to show the spectrum of these multi-dimensional signals correctly is a key challenge in the field of graph signal processing. This paper investigates the novel transform for multi-dimensional signals defined on Cartesian product graph and studies several related properties. Our work includes: (i) defining the multi-dimensional graph fractional Fourier transform (MGFRFT) based on Laplacian matrix and adjacency matrix; (ii) exploring the advantages of MGFRFT in processing multi-dimensional signals in terms of spectrum and computational time; (iii) applying the proposed transform to data compression to highlight the utility and effectiveness of it.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AstroCompress: A benchmark dataset for multi-purpose compression of astronomical data
Stationary MMD Points for Cubature
MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Models
Efficient compression of neural networks and datasets
DD-Ranking: Rethinking the Evaluation of Dataset Distillation
ReplayCAD: Generative Diffusion Replay for Continual Anomaly Detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.