Redundant Graph Fourier Transform

被引：0

作者：

Zheng, Xianwei ^{[1
]}

Tang, Yuanyan ^{[1
]}

Zhou, Jiantao ^{[1
]}

Yang, Lina ^{[1
,2
]}

Yuan, Haoliang ^{[1
]}

Wang, Yulong ^{[1
]}

Li, Chunli ^{[1
]}

机构：

[1] Univ Macau, Dept Comp & Informat Sci, Macau 999078, Peoples R China

[2] Guangxi Normal Univ Nationalities, Chongzuo, Peoples R China

来源：

2015 IEEE 2ND INTERNATIONAL CONFERENCE ON CYBERNETICS (CYBCONF) | 2015年

关键词：

Graph Fourier transform; redundant graph Fourier transform; graph Laplacian matrix; signal compression;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Signal processing on graphs is a new emerging field that processing high-dimensional data by spreading samples on networks or graphs. The new introduced definition of graph Fourier transform shows its importance in establishing the theory of frequency analysis or computational harmonic analysis on graph signal processing. We introduce the definition of redundant graph Fourier transform, which is defined via a Parseval frame transform generated from an extended Laplacian of a given graph. The flexibility and sparsity of the redundant graph Fourier transform are important properties that will be useful in signal processing. In certain applications and by selections of the extended Laplacian, redundant Fourier transform performs better than graph Fourier transform.

引用

下载

页码：406 / 409

页数：4

共 50 条

[1] A WINDOWED GRAPH FOURIER TRANSFORM
Shuman, David I.
Ricaud, Benjamin
Vandergheynst, Pierre
2012 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2012, : 133 - 136
[2] A Fast Fourier Transform for the Johnson Graph
Rodrigo Iglesias
Mauro Natale
Journal of Fourier Analysis and Applications, 2022, 28
[3] A Fast Fourier Transform for the Johnson Graph
Iglesias, Rodrigo
Natale, Mauro
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2022, 28 (04)
[4] On the Graph Fourier Transform for Directed Graphs
Sardellitti, Stefania
Barbarossa, Sergio
Di Lorenzo, Paolo
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2017, 11 (06) : 796 - 811
[5] On the Graph Fourier Transform for Directed Graphs
Lorenzo, Paolo Di (paolo.dilorenzo@unipg.it), 2017, Institute of Electrical and Electronics Engineers Inc., United States (11):
[6] Graph Fourier Transform: A Stable Approximation
Domingos, Joao
Moura, Jose M. F.
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2020, 68 : 4422 - 4437
[7] A New Windowed Graph Fourier Transform
Le Trung Thanh
Nguyen Linh-Trung
Nguyen Viet Dung
Abed-Meraim, Karim
2017 4TH NAFOSTED CONFERENCE ON INFORMATION AND COMPUTER SCIENCE (NICS), 2017, : 150 - 155
[8] Graph Fourier Transform: A Stable Approximation
Moura, José M. F. (moura@andrew.cmu.edu), 2020, Institute of Electrical and Electronics Engineers Inc. (68)
[9] Computation of Graph Fourier Transform Centrality Using Graph Filter
Tseng, Chien-Cheng
Lee, Su-Ling
IEEE OPEN JOURNAL OF CIRCUITS AND SYSTEMS, 2024, 5 : 69 - 80
[10] Graph Fourier Transform Based on Directed Laplacian
Singh, Rahul
Chakraborty, Abhishek
Manoj, B. S.
2016 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATIONS (SPCOM), 2016,

← 1 2 3 4 5 →