MRA-GNN: Minutiae Relation-Aware Model over Graph Neural Network for Fingerprint Embedding

• URL: http://arxiv.org/abs/2307.16416v1
• Date: Mon, 31 Jul 2023 05:54:06 GMT
• Title: MRA-GNN: Minutiae Relation-Aware Model over Graph Neural Network for Fingerprint Embedding
• Authors: Yapeng Su, Tong Zhao, Zicheng Zhang
• Abstract summary: We propose a novel paradigm for fingerprint embedding, called Minutiae Relation-Aware model over Graph Neural Network (MRA-GNN) Our proposed approach incorporates a GNN-based framework in fingerprint embedding to encode the topology and correlation of fingerprints into descriptive features. We equip MRA-GNN with a Topological relation Reasoning Module (TRM) and Correlation-Aware Module (CAM) to learn the fingerprint embedding from these graphs successfully.
• Score: 4.5262471547727845
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep learning has achieved remarkable results in fingerprint embedding, which plays a critical role in modern Automated Fingerprint Identification Systems. However, previous works including CNN-based and Transformer-based approaches fail to exploit the nonstructural data, such as topology and correlation in fingerprints, which is essential to facilitate the identifiability and robustness of embedding. To address this challenge, we propose a novel paradigm for fingerprint embedding, called Minutiae Relation-Aware model over Graph Neural Network (MRA-GNN). Our proposed approach incorporates a GNN-based framework in fingerprint embedding to encode the topology and correlation of fingerprints into descriptive features, achieving fingerprint representation in the form of graph embedding. Specifically, we reinterpret fingerprint data and their relative connections as vertices and edges respectively, and introduce a minutia graph and fingerprint graph to represent the topological relations and correlation structures of fingerprints. We equip MRA-GNN with a Topological relation Reasoning Module (TRM) and Correlation-Aware Module (CAM) to learn the fingerprint embedding from these graphs successfully. To tackle the over-smoothing problem in GNN models, we incorporate Feed-Forward Module and graph residual connections into proposed modules. The experimental results demonstrate that our proposed approach outperforms state-of-the-art methods on various fingerprint datasets, indicating the effectiveness of our approach in exploiting nonstructural information of fingerprints.

Related papers

• Invisible Traces: Using Hybrid Fingerprinting to identify underlying LLMs in GenAI Apps [0.0]
  Fingerprinting of Large Language Models (LLMs) has become essential for ensuring the security and transparency of AI-integrated applications. We introduce a novel fingerprinting framework designed to address these challenges by integrating static and dynamic fingerprinting techniques. Our approach identifies architectural features and behavioral traits, enabling accurate and robust fingerprinting of LLMs in dynamic environments.
  arXiv  Detail & Related papers  (2025-01-30T19:15:41Z)
• Causality-based Subject and Task Fingerprints using fMRI Time-series Data [8.268840872881213]
  We pioneer and quantify, in this paper, the concept of 'causal fingerprint' We show that the experimental results and comparisons with non-causality-based methods demonstrate the effectiveness of the proposed methods. Our work paves the way for further studies on causal fingerprints with potential applications in both healthy controls and neurodegenerative diseases.
  arXiv  Detail & Related papers  (2024-09-26T21:10:50Z)
• Securing Graph Neural Networks in MLaaS: A Comprehensive Realization of Query-based Integrity Verification [68.86863899919358]
  We introduce a groundbreaking approach to protect GNN models in Machine Learning from model-centric attacks. Our approach includes a comprehensive verification schema for GNN's integrity, taking into account both transductive and inductive GNNs. We propose a query-based verification technique, fortified with innovative node fingerprint generation algorithms.
  arXiv  Detail & Related papers  (2023-12-13T03:17:05Z)
• FPGAN-Control: A Controllable Fingerprint Generator for Training with Synthetic Data [7.203557048672379]
  We present FPGAN-Control, an identity preserving image generation framework. We introduce a novel appearance loss that encourages disentanglement between the fingerprint's identity and appearance properties. We demonstrate the merits of FPGAN-Control, both quantitatively and qualitatively, in terms of identity level, degree of appearance control, and low synthetic-to-real domain gap.
  arXiv  Detail & Related papers  (2023-10-29T14:30:01Z)
• DEGREE: Decomposition Based Explanation For Graph Neural Networks [55.38873296761104]
  We propose DEGREE to provide a faithful explanation for GNN predictions. By decomposing the information generation and aggregation mechanism of GNNs, DEGREE allows tracking the contributions of specific components of the input graph to the final prediction. We also design a subgraph level interpretation algorithm to reveal complex interactions between graph nodes that are overlooked by previous methods.
  arXiv  Detail & Related papers  (2023-05-22T10:29:52Z)
• GrOVe: Ownership Verification of Graph Neural Networks using Embeddings [13.28269672097063]
  Graph neural networks (GNNs) have emerged as a state-of-the-art approach to model and draw inferences from large scale graph-structured data. Prior work has shown that GNNs are prone to model extraction attacks. We present GrOVe, a state-of-the-art GNN model fingerprinting scheme.
  arXiv  Detail & Related papers  (2023-04-17T19:06:56Z)
• AFR-Net: Attention-Driven Fingerprint Recognition Network [47.87570819350573]
  We improve initial studies on the use of vision transformers (ViT) for biometric recognition, including fingerprint recognition. We propose a realignment strategy using local embeddings extracted from intermediate feature maps within the networks to refine the global embeddings in low certainty situations. This strategy can be applied as a wrapper to any existing deep learning network (including attention-based, CNN-based, or both) to boost its performance.
  arXiv  Detail & Related papers  (2022-11-25T05:10:39Z)
• Discovering the Representation Bottleneck of Graph Neural Networks from Multi-order Interactions [51.597480162777074]
  Graph neural networks (GNNs) rely on the message passing paradigm to propagate node features and build interactions. Recent works point out that different graph learning tasks require different ranges of interactions between nodes. We study two common graph construction methods in scientific domains, i.e., emphK-nearest neighbor (KNN) graphs and emphfully-connected (FC) graphs.
  arXiv  Detail & Related papers  (2022-05-15T11:38:14Z)
• ProxyFAUG: Proximity-based Fingerprint Augmentation [81.15016852963676]
  ProxyFAUG is a rule-based, proximity-based method of fingerprint augmentation. The best performing positioning method on this dataset is improved by 40% in terms of median error and 6% in terms of mean error, with the use of the augmented dataset.
  arXiv  Detail & Related papers  (2021-02-04T15:59:30Z)
• Data-Driven Learning of Geometric Scattering Networks [74.3283600072357]
  We propose a new graph neural network (GNN) module based on relaxations of recently proposed geometric scattering transforms. Our learnable geometric scattering (LEGS) module enables adaptive tuning of the wavelets to encourage band-pass features to emerge in learned representations.
  arXiv  Detail & Related papers  (2020-10-06T01:20:27Z)
• Dense Registration and Mosaicking of Fingerprints by Training an End-to-End Network [36.50244665233824]
  We train an end-to-end network to output pixel-wise displacement field between two fingerprints. We also propose a fingerprint mosaicking method based on optimal seam selection. Our registration method outperforms previous dense registration methods in accuracy and efficiency.
  arXiv  Detail & Related papers  (2020-04-13T14:47:00Z)

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.