Online Handwritten Signature Verification Based on Temporal-Spatial Graph Attention Transformer

• URL: http://arxiv.org/abs/2510.19321v1
• Date: Wed, 22 Oct 2025 07:32:55 GMT
• Title: Online Handwritten Signature Verification Based on Temporal-Spatial Graph Attention Transformer
• Abstract summary: This paper introduces a novel approach for dynamic signature verification: the Temporal-Spatial Graph Attention Transformer (TS-GATR)<n>TS-GATR combines the Graph Attention Network (GAT) and the Gated Recurrent Unit (GRU) to model both spatial and temporal dependencies in signature data.<n>To capture long-term temporal dependencies, the model integrates GRU, thereby enhancing its ability to learn dynamic features during signature verification.
• Score: 24.79683227958907
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Handwritten signature verification is a crucial aspect of identity authentication, with applications in various domains such as finance and e-commerce. However, achieving high accuracy in signature verification remains challenging due to intra-user variability and the risk of forgery. This paper introduces a novel approach for dynamic signature verification: the Temporal-Spatial Graph Attention Transformer (TS-GATR). TS-GATR combines the Graph Attention Network (GAT) and the Gated Recurrent Unit (GRU) to model both spatial and temporal dependencies in signature data. TS-GATR enhances verification performance by representing signatures as graphs, where each node captures dynamic features (e.g. position, velocity, pressure), and by using attention mechanisms to model their complex relationships. The proposed method further employs a Dual-Graph Attention Transformer (DGATR) module, which utilizes k-step and k-nearest neighbor adjacency graphs to model local and global spatial features, respectively. To capture long-term temporal dependencies, the model integrates GRU, thereby enhancing its ability to learn dynamic features during signature verification. Comprehensive experiments conducted on benchmark datasets such as MSDS and DeepSignDB show that TS-GATR surpasses current state-of-the-art approaches, consistently achieving lower Equal Error Rates (EER) across various scenarios.

Related papers

• Online Signature Verification Using Augmented Path Signature and T-Mamba [0.5156484100374058]
  We propose a novel framework that integrates the augmented path signature (APS) descriptor with the T-Mamba model.<n>Our framework achieves state-of-the-art EERs on three public benchmark datasets.
  arXiv  Detail & Related papers  (2026-09-08T05:36:44Z)
• Cognitive Graph Intelligence for Adaptive and Robust DDoS Attack Detection in Next Generation Networks [2.434167379974669]
  This paper proposes a Graph-based Generative Adrial Network (GraphGAN) that serves as the cognitive detection engine for this task.<n>GraphGAN captures the relational structure among traffic flows while addressing imbalance through adversarial generation of synthetic samples.<n>The generator learns the distribution of DDoS attacks to synthesize realistic minority samples, while a Graph Convolutional Network (GCN)-based discriminator distinguishes real from synthetic graph data.
  arXiv  Detail & Related papers  (2026-08-18T04:18:31Z)
• PromptDyG: Test-Time Prompt Adaptation on Dynamic Graphs [97.88691137307723]
  We propose PromptDyG, a novel framework that leverages unsupervised test-time Prompt adaptation for Dynamic Graph learning under a live-update online setting.<n>We show theoretically that this unsupervised prompt adaptation can guarantee a larger similarity margin between positive and negative pairs, facilitating more accurate dynamic predictions.
  arXiv  Detail & Related papers  (2026-06-22T06:54:02Z)
• Dynamic Link Prediction with Temporally Enhanced Signed Graph Neural Networks [1.5259434915412646]
  Temporal signed networks (TSNs) model the time evolution of cooperative and adversarial relationships.<n>We propose a emphmodular temporal enhancement framework for signed GNNs that integrates historical context into otherwise static architectures.<n>Experiments on real-world and synthetic TSNs, including Bitcoin OTC, Bitcoin Alpha, Reddit, and small-world network models, demonstrate consistent and statistically significant improvements.
  arXiv  Detail & Related papers  (2026-05-25T19:28:01Z)
• Rethinking Feature Alignment in Generalist Graph Anomaly Detection: A Relational Fingerprint-based Approach [60.199985286210904]
  Generalist graph anomaly detection (GAD) aims to detect anomalies on unseen graphs without graph-specific retraining.<n>Existing approaches primarily focus on aligning heterogeneous data across domains, which ignores different feature semantics.<n>We propose Fingerprint-based generalist GAD approach (ReFi-GAD)<n>We show that ReFi-GAD significantly outperforms state-of-the-art methods in experiments on 14 datasets.
  arXiv  Detail & Related papers  (2026-05-25T05:12:26Z)
• A Hybrid TGN-SEAL Model for Dynamic Graph Link Prediction [0.5836991649815993]
  Predicting links in sparse, continuously evolving networks is a central challenge in network science.<n>In this study, we improve theTemporal Graph Networks framework by extracting enclosing subgraphs around candidate links.<n> Experiments on a sparse CDR dataset show that our approach increases average precision by 2.6% over standard TGNs.
  arXiv  Detail & Related papers  (2026-02-15T17:16:47Z)
• Causal Graph Spatial-Temporal Autoencoder for Reliable and Interpretable Process Monitoring [14.050990954092809]
  This article proposes a Causal Graph Spatial-Temporal Autoencoder (CGSTAE) for industrial process monitoring.<n>The network architecture of CGSTAE combines two components: a correlation graph structure learning module and a spatial-temporal encoder-decoder module.<n>The proposed CGSTAE enables effective process monitoring and fault detection through two statistics in the feature space and residual space.
  arXiv  Detail & Related papers  (2026-02-03T02:18:09Z)
• RAG Meets Temporal Graphs: Time-Sensitive Modeling and Retrieval for Evolving Knowledge [12.898085044538433]
  Knowledge is inherently time-sensitive and continuously evolves over time.<n>Current Retrieval-Augmented Generation (RAG) systems largely ignore this temporal nature.<n>We propose Temporal GraphRAG (TG-RAG), which models external corpora as a bi-level temporal graph.
  arXiv  Detail & Related papers  (2025-10-15T14:21:08Z)
• STGAtt: A Spatial-Temporal Unified Graph Attention Network for Traffic Flow Forecasting [3.9560660144028126]
  This paper presents a novel deep learning model, the Spatial-Temporal Unified Graph Attention Network (STGAtt)<n>By leveraging a unified graph representation and an attention mechanism, STGAtt effectively captures complex spatial-temporal dependencies.
  arXiv  Detail & Related papers  (2025-08-21T17:21:14Z)
• Hierarchical Graph Feature Enhancement with Adaptive Frequency Modulation for Visual Recognition [6.580655899524989]
  Convolutional neural networks (CNNs) have demonstrated strong performance in visual recognition tasks.<n>We propose a novel framework that integrates graph-based rea soning into CNNs to enhance both structural awareness and feature representation.<n>The proposed HGFE module is lightweight, end-to-end trainable, and can be seamlessly integrated into standard CNN backbone networks.
  arXiv  Detail & Related papers  (2025-08-15T14:19:50Z)
• Scalable Weibull Graph Attention Autoencoder for Modeling Document Networks [50.42343781348247]
  We develop a graph Poisson factor analysis (GPFA) which provides analytic conditional posteriors to improve the inference accuracy. We also extend GPFA to a multi-stochastic-layer version named graph Poisson gamma belief network (GPGBN) to capture the hierarchical document relationships at multiple semantic levels. Our models can extract high-quality hierarchical latent document representations and achieve promising performance on various graph analytic tasks.
  arXiv  Detail & Related papers  (2024-10-13T02:22:14Z)
• DyG-Mamba: Continuous State Space Modeling on Dynamic Graphs [59.434893231950205]
  Dynamic graph learning aims to uncover evolutionary laws in real-world systems. We propose DyG-Mamba, a new continuous state space model for dynamic graph learning. We show that DyG-Mamba achieves state-of-the-art performance on most datasets.
  arXiv  Detail & Related papers  (2024-08-13T15:21:46Z)
• Towards Adaptive Neighborhood for Advancing Temporal Interaction Graph Modeling [19.831424038609462]
  Temporal Graph Networks (TGNs) have demonstrated their remarkable performance in modeling temporal interaction graphs. In this paper, we aim to enhance existing TGNs by introducing an adaptive neighborhood encoding mechanism. We present SEAN, a flexible plug-and-play model that can be seamlessly integrated with existing TGNs.
  arXiv  Detail & Related papers  (2024-06-14T07:57:17Z)
• SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning [15.248591535696146]
  We propose a Signed Attention-based Graph Transformer (SignGT) to adaptively capture various frequency information from the graphs. Specifically, SignGT develops a new signed self-attention mechanism (SignSA) that produces signed attention values according to the semantic relevance of node pairs.
  arXiv  Detail & Related papers  (2023-10-17T06:42:11Z)
• Graph-Aware Contrasting for Multivariate Time-Series Classification [50.84488941336865]
  Existing contrastive learning methods mainly focus on achieving temporal consistency with temporal augmentation and contrasting techniques. We propose Graph-Aware Contrasting for spatial consistency across MTS data. Our proposed method achieves state-of-the-art performance on various MTS classification tasks.
  arXiv  Detail & Related papers  (2023-09-11T02:35:22Z)
• EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning [92.71579608528907]
  This paper aims to design an easy-to-use pipeline (termed as EasyDGL) composed of three key modules with both strong ability fitting and interpretability. EasyDGL can effectively quantify the predictive power of frequency content that a model learn from the evolving graph data.
  arXiv  Detail & Related papers  (2023-03-22T06:35:08Z)
• Attention-Driven Dynamic Graph Convolutional Network for Multi-Label Image Recognition [53.17837649440601]
  We propose an Attention-Driven Dynamic Graph Convolutional Network (ADD-GCN) to dynamically generate a specific graph for each image. Experiments on public multi-label benchmarks demonstrate the effectiveness of our method.
  arXiv  Detail & Related papers  (2020-12-05T10:10:12Z)
• Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs [54.13919050090926]
  We propose an end-to-end structural temporal Graph Neural Network model for detecting anomalous edges in dynamic graphs. In particular, we first extract the $h$-hop enclosing subgraph centered on the target edge and propose the node labeling function to identify the role of each node in the subgraph. Based on the extracted features, we utilize Gated recurrent units (GRUs) to capture the temporal information for anomaly detection.
  arXiv  Detail & Related papers  (2020-05-15T09:17:08Z)

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.