Results 1 to 10 of about 1,721,122 (260)
A New Surrogating Algorithm by the Complex Graph Fourier Transform (CGFT) [PDF]
Entropy, 2019 The essential step of surrogating algorithms is phase randomizing the Fourier transform while preserving the original spectrum amplitude before computing the inverse Fourier transform.
Jordi Belda +4 more
doaj +4 more sources
Are There Approximate Fast Fourier Transforms on Graphs? [PDF]
2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2016 Signal processing on graphs is a recent research domain that seeks to extend classical signal processing tools such as the Fourier transform to irregular domains given by a graph. In such a graph setting, a way to rapidly apply the Fourier transform, i.e. a Fast Fourier Transform (FFT), is lacking.
Rémi Gribonval
exaly +4 more sources
Fast Graph Fourier Transforms Based on Graph Symmetry and Bipartition [PDF]
IEEE Transactions on Signal Processing, 2019 14 pages, 15 ...
Antonio Ortega, Keng-Shih Lu
exaly +4 more sources
Fourier Could Be a Data Scientist: From Graph Fourier Transform to Signal Processing on Graphs
Comptes Rendus Physique, 2019 The legacy of Joseph Fourier in science is vast, especially thanks to the essential tool that the Fourier transform is. The flexibility of this analysis, its computational efficiency and the physical interpretation it offers makes it a cornerstone in many scientific domains.
Nicolas Tremblay +2 more
exaly +5 more sources
Computation of Graph Fourier Transform Centrality Using Graph Filter
IEEE Open Journal of Circuits and SystemsIn this paper, the computation of graph Fourier transform centrality (GFTC) of complex network using graph filter is presented. For conventional computation method, it needs to use the non-sparse transform matrix of graph Fourier transform (GFT) to ...
Chien-Cheng Tseng, Su-Ling Lee
doaj +3 more sources
Spectral Projector-Based Graph Fourier Transforms [PDF]
IEEE Journal on Selected Topics in Signal Processing, 2017 The paper presents the graph Fourier transform (GFT) of a signal in terms of its spectral decomposition over the Jordan subspaces of the graph adjacency matrix $A$. This representation is unique and coordinate free, and it leads to unambiguous definition of the spectral components ("harmonics") of a graph signal. This is particularly meaningful when $A$
José M. F. Moura
exaly +3 more sources
Spectral Graph Fractional Fourier Transform for Directed Graphs and Its Application
Signal Processing, 2023 In graph signal processing, many studies assume that the underlying network is undirected. Although the digraph model is rarely adopted, it is more appropriate for many applications, especially for real world networks. In this paper, we present a general framework for extending the graph signal processing to directed graphs in graph fractional domain ...
Bing-Zhao Li
exaly +4 more sources
From Time–Frequency to Vertex–Frequency and Back
Mathematics, 2021 The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided.
Ljubiša Stanković +5 more
doaj +1 more source
A graph-based narrowband matched-field source localization method [PDF]
JASA Express Letters, 2021 Matched field processing (MFP) has been regarded as one of the most successful acoustical methods for positioning underwater sources. In this paper, the narrowband MFP method is combined with a recently developed framework—the graph signal processing ...
Peng Xiao, Jianmin Yang
doaj +1 more source
Fokas Method for the Heat Equation on Metric Graphs
Современная математика: Фундаментальные направления, 2021 The paper presents a method for constructing solutions to initial-boundary value problems for the heat equation on simple metric graphs such as a star-shaped graph, a tree, and a triangle with three converging edges.
Z. A. Sobirov, M. R. Eshimbetov
doaj +1 more source