A Multidimensional Graph Fourier Transformation Neural Network for Vehicle Trajectory Prediction
This work introduces the multidimensional Graph Fourier Transformation Neural Network (GFTNN) for long-term trajectory predictions on highways. Similar to Graph Neural Networks (GNNs), the GFTNN is a novel network architecture that operates on graph structures. While several GNNs lack discriminative power due to suboptimal aggregation schemes, the proposed model aggregates scenario properties through a powerful operation: the multidimensional Graph Fourier Transformation (GFT). The spatio-temporal vehicle interaction graph of a scenario is converted into a spectral scenario representation using the GFT. This beneficial representation is input to the prediction framework composed of a neural network and a descriptive decoder. Even though the proposed GFTNN does not include any recurrent element, it outperforms state-of-the-art models in the task of highway trajectory prediction. For experiments and evaluation, the publicly available datasets highD and NGSIM are used
Code (0)
등록된 구현이 없습니다.
Tasks
DecoderDescriptiveTrajectory PredictionSimilar Papers 제목 키워드 기반
Prediction and Interpretation of Vehicle Trajectories in the Graph Spectral Domain
This work provides a comprehensive analysis and interpretation of the graph spectral representation of traffic scenarios. Based on a spatio-temporal vehicle interaction graph, an observed traffic scenario can be transfor…
FourierKAN-GCF: Fourier Kolmogorov-Arnold Network -- An Effective and Efficient Feature Transformation for Graph Collaborative Filtering
Graph Collaborative Filtering (GCF) has achieved state-of-the-art performance for recommendation tasks. However, most GCF structures simplify the feature transformation and nonlinear operation during message passing in t…
Collaborative FilteringRobust Sparse Fourier Transform Based on The Fourier Projection-Slice Theorem
The state-of-the-art automotive radars employ multidimensional discrete Fourier transforms (DFT) in order to estimate various target parameters. The DFT is implemented using the fast Fourier transform (FFT), at sample an…
Discrete Linear Canonical Transform on Graphs
With the wide application of spectral and algebraic theory in discrete signal processing techniques in the field of graph signal processing, an increasing number of signal processing methods have been proposed, such as t…
Multidimensional unstructured sparse recovery via eigenmatrix
This note considers the multidimensional unstructured sparse recovery problems. Examples include Fourier inversion and sparse deconvolution. The eigenmatrix is a data-driven construction with desired approximate eigenval…