Results 31 to 40 of about 32,468 (150)
Journal of Advanced Transportation, 2022 Accurate traffic prediction is a powerful factor of intelligent transportation systems to make assisted decisions. However, existing methods are deficient in modeling long series spatio-temporal characteristics. Due to the complex and nonlinear nature of
Shanchun Zhao, Xu Li
doaj +1 more source
Random-Walk Laplacian for Frequency Analysis in Periodic Graphs
Sensors, 2021 This paper presents the benefits of using the random-walk normalized Laplacian matrix as a graph-shift operator and defines the frequencies of a graph by the eigenvalues of this matrix.
Rachid Boukrab, Alba Pagès-Zamora
doaj +1 more source
Solution to the Dirichlet Problem of the Wave Equation on a Star Graph
Mathematics, 2023 In this paper, the solution to the Dirichlet problem for the wave equation on the star graph is constructed. To begin, we solve the boundary value problem on the interval (on one edge of the graph).
Gaukhar Arepova +2 more
doaj +1 more source
Spectral Projector-Based Graph Fourier Transforms [PDF]
IEEE Journal of 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$
Joya A. Deri, José M. F. Moura
openaire +2 more sources
INDUCED DRAFT FAN DOMINANT FREQUENCY DETECTION USING SHORT-TIME FOURIER TRANSFORM METHOD
Rekayasa Mesin, 2023 Weak suction and large vibrations indicate an Induced Draft Fan (IDF) problem. The Fast Fourier Transform (FFT) method cannot be applied to non-stationary vibration signals.
Dedik Romahadi
doaj +1 more source
Irregularity-Aware Graph Fourier Transforms
IEEE Transactions on Signal Processing, 2018 In this paper, we present a novel generalization of the graph Fourier transform (GFT). Our approach is based on separately considering the definitions of signal energy and signal variation, leading to several possible orthonormal GFTs. Our approach includes traditional definitions of the GFT as special cases, while also leading to new GFT designs that ...
Benjamin Girault +2 more
openaire +3 more sources
Fast Graph Fourier Transforms Based on Graph Symmetry and Bipartition [PDF]
IEEE Transactions on Signal Processing, 2019 14 pages, 15 ...
Keng-Shih Lu, Antonio Ortega
openaire +2 more sources
Multi-dimensional Graph Fourier Transform
CoRR, 2017 Many signals on Cartesian product graphs appear in the real world, such as digital images, sensor observation time series, and movie ratings on Netflix. These signals are "multi-dimensional" and have directional characteristics along each factor graph. However, the existing graph Fourier transform does not distinguish these directions, and assigns 1-D ...
Takashi Kurokawa +2 more
openaire +2 more sources
Analyzing the approximation error of the fast graph Fourier transform [PDF]
2017 51st Asilomar Conference on Signals, Systems, and Computers, 2017 The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is computed via a truncated Jacobi algorithm, and is defined as the product of J Givens rotations (very sparse orthogonal ...
Le Magoarou, Luc +2 more
openaire +3 more sources
A FFT-Like MIMO Detection Algorithm
IEEE Access, 2020 This paper studies the multiple-input-multiple-output (MIMO) detection problem. Existing works model the MIMO detection as a tree or factor graph. This work adds a new member called the clique graph model to the MIMO detection graph model family so that ...
Peng Du, Yuan Zhang, Teer Ba
doaj +1 more source