A Hierarchical Graph Signal Processing Approach to Inference from Spatiotemporal Signals

• URL: http://arxiv.org/abs/2010.13164v1
• Date: Sun, 25 Oct 2020 17:08:13 GMT
• Title: A Hierarchical Graph Signal Processing Approach to Inference from Spatiotemporal Signals
• Authors: Nafiseh Ghoroghchian, Stark C. Draper, and Roman Genov
• Abstract summary: Motivated by the emerging area of graph signal processing (GSP), we introduce a novel method to draw inference from signals. In this paper we leverage techniques to develop a hierarchical feature extraction approach. We test our approach on the intracranial EEG (iEEG) data set of the K aggle seizure detection contest.
• Score: 14.416786768268233
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Motivated by the emerging area of graph signal processing (GSP), we introduce a novel method to draw inference from spatiotemporal signals. Data acquisition in different locations over time is common in sensor networks, for diverse applications ranging from object tracking in wireless networks to medical uses such as electroencephalography (EEG) signal processing. In this paper we leverage novel techniques of GSP to develop a hierarchical feature extraction approach by mapping the data onto a series of spatiotemporal graphs. Such a model maps signals onto vertices of a graph and the time-space dependencies among signals are modeled by the edge weights. Signal components acquired from different locations and time often have complicated functional dependencies. Accordingly, their corresponding graph weights are learned from data and used in two ways. First, they are used as a part of the embedding related to the topology of graph, such as density. Second, they provide the connectivities of the base graph for extracting higher level GSP-based features. The latter include the energies of the signal's graph Fourier transform in different frequency bands. We test our approach on the intracranial EEG (iEEG) data set of the Kaggle epileptic seizure detection contest. In comparison to the winning code, the results show a slight net improvement and up to 6 percent improvement in per subject analysis, while the number of features are decreased by 75 percent on average.

Related papers

• GSP-KalmanNet: Tracking Graph Signals via Neural-Aided Kalman Filtering [23.19392802641989]
  We study the tracking of graph signals using a hybrid model-based/data-driven approach. We develop the GSP-KalmanNet, which tracks the hidden graphical states from the graphical measurements. The proposed GSP-KalmanNet achieves enhanced accuracy and run time performance as well as improved robustness to model misspecifications.
  arXiv  Detail & Related papers  (2023-11-28T08:43:10Z)
• HAGCN : Network Decentralization Attention Based Heterogeneity-Aware Spatiotemporal Graph Convolution Network for Traffic Signal Forecasting [0.0]
  We study the heterogeneous characteristics inherent in traffic signal data to learn hidden relationships between sensors in various ways. We propose a network decentralization attention-aware graph convolution network (HAGCN) method that aggregates the hidden states of adjacent nodes.
  arXiv  Detail & Related papers  (2022-09-05T13:45:52Z)
• Graph Signal Processing for Heterogeneous Change Detection Part I: Vertex Domain Filtering [21.531426428400227]
  This paper provides a new strategy for the Heterogeneous Change Detection problem: solving HCD from the perspective of Graph Signal Processing (GSP) We construct a graph for each image to capture the structure information, and treat each image as the graph signal. In this way, we convert the HCD into a GSP problem: a comparison of the responses of the two signals on different systems defined on the two graphs.
  arXiv  Detail & Related papers  (2022-08-03T07:22:45Z)
• Spectral Graph Convolutional Networks With Lifting-based Adaptive Graph Wavelets [81.63035727821145]
  Spectral graph convolutional networks (SGCNs) have been attracting increasing attention in graph representation learning. We propose a novel class of spectral graph convolutional networks that implement graph convolutions with adaptive graph wavelets.
  arXiv  Detail & Related papers  (2021-08-03T17:57:53Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• Dynamic Graph Modeling of Simultaneous EEG and Eye-tracking Data for Reading Task Identification [79.41619843969347]
  We present a new approach, that we call AdaGTCN, for identifying human reader intent from Electroencephalogram(EEG) and Eye movement(EM) data. Our method, Adaptive Graph Temporal Convolution Network (AdaGTCN), uses an Adaptive Graph Learning Layer and Deep Neighborhood Graph Convolution Layer. We compare our approach with several baselines to report an improvement of 6.29% on the ZuCo 2.0 dataset, along with extensive ablation experiments.
  arXiv  Detail & Related papers  (2021-02-21T18:19:49Z)
• Contrastive and Generative Graph Convolutional Networks for Graph-based Semi-Supervised Learning [64.98816284854067]
  Graph-based Semi-Supervised Learning (SSL) aims to transfer the labels of a handful of labeled data to the remaining massive unlabeled data via a graph. A novel GCN-based SSL algorithm is presented in this paper to enrich the supervision signals by utilizing both data similarities and graph structure.
  arXiv  Detail & Related papers  (2020-09-15T13:59:28Z)
• Graph Signal Processing for Geometric Data and Beyond: Theory and Applications [55.81966207837108]
  Graph Signal Processing (GSP) enables processing signals that reside on irregular domains. GSP methodologies for geometric data in a unified manner by bridging the connections between geometric data and graphs. Recently developed Graph Neural Networks (GNNs) interpret the operation of these networks from the perspective of GSP.
  arXiv  Detail & Related papers  (2020-08-05T03:20:16Z)
• Sampling Signals on Graphs: From Theory to Applications [119.19108613761915]
  We review current progress on sampling over graphs focusing on theory and potential applications. Although most methodologies used in graph signal sampling are designed to parallel those used in sampling for standard signals, sampling theory for graph signals significantly differs from the theory of Shannon--Nyquist and shift-invariant sampling.
  arXiv  Detail & Related papers  (2020-03-09T07:49:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.