Spectral Forensics of Diffusion Attention Graphs for Copy-Move Forgery Detection

• URL: http://arxiv.org/abs/2604.17287v1
• Date: Sun, 19 Apr 2026 07:02:50 GMT
• Title: Spectral Forensics of Diffusion Attention Graphs for Copy-Move Forgery Detection
• Abstract summary: We introduce GraphSpecForge, a training-free framework that detects copy-move forgery.<n>Our central insight is that copy-move manipulation induces approximate subgraph duplication in the self-attention graph.<n>We build an image-level anomaly detector using Wasserstein distances between per-image Laplacian spectra and an authentic reference distribution.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Copy-move forgery, where a region within an image is duplicated to hide or fabricate content, remains a persistent threat to visual media integrity. We introduce GraphSpecForge, a training-free framework that detects copy-move forgery by analysing the spectral structure of attention graphs from a pretrained Stable Diffusion U-Net. Our central insight is that copy-move manipulation induces approximate subgraph duplication in the self-attention graph, leading to measurable spectral redistribution in the normalized graph Laplacian. We formalise this link with perturbation-based arguments and build an image-level anomaly detector using Wasserstein distances between per-image Laplacian spectra and an authentic reference distribution. We evaluate GraphSpecForge on four copy-move benchmarks without forgery-specific retraining. On RecodAI-LUC (5,128 images), our best configuration achieves AUROC = 0.606 (95% CI: 0.580-0.638; permutation p = 0.005), and the normalized Laplacian outperforms raw attention spectra by +0.057 AUROC. On MICC-F220, CoMoFoD, and COVERAGE, the same pipeline attains AUROCs of 0.752, 0.774, and 0.673, respectively; on CoMoFoD it also reaches AUPRC = 0.833, balanced accuracy = 0.712, MCC = 0.499, and TPR@1%FPR = 32.5%. Additional ablation and falsification experiments confirm the signal's specificity and sensitivity to manipulation strength, while null-graph controls rule out trivial-statistic explanations.

Related papers

• Relational Over-Regularization: Graph-Based AI-Generated Text Detection via Sentence Transition Deviation [4.4331439696271415]
  CrossSource Stylometric Fingerprint (CSFG) is a graph-based framework that encodes positional, sequential, semantic and transition deviation signals as learnable GNN edge features.<n>CSFG achieves 97.14% accuracy under binary detection, outperforming the strongest graph-based baseline by 11.14 pp.
  arXiv  Detail & Related papers  (2026-08-27T06:51:40Z)
• Dual Spatial-Temporal Attribution: Architecture-Aligned Post-Hoc Explainability for Recurrent Graph Anomaly Detection [1.8899300124593645]
  We present X-AddGraph, a post-hoc explainability framework for anomaly detection in dynamic graphs.<n>Because the detector is frozen, detection performance is preserved exactly.<n>X-AddGraph reproduces every score identically while adding explanations where none existed.
  arXiv  Detail & Related papers  (2026-08-12T15:58:27Z)
• Graph Convolutional Attention: A Spectral Perspective on Graph Denoising and Diffusion [82.7007012514703]
  We show that under a denoising objective, linear attention is suboptimal and can only learn an average spectral denoising filter over the training distribution.<n>We introduce Spectral Attention, which directly utilizes the input graph spectrum and provably outperforms linear attention by a margin governed by the spectral diversity of the distribution.<n>For block models, GCA provably matches the idealized Spectral Attention mechanism.
  arXiv  Detail & Related papers  (2026-07-07T17:52:17Z)
• In-Context Graphical Inference [9.39195684989942]
  We introduce an autoregressive Graph Transformer that restores the sequential elimination structure that makes exact inference correct.<n>We prove that TT compression errors propagate at most lincarly through the autoregressive chain, that the Dirichlet-Multinomial loss is a proper scoring rule, and that WCP maintains coverage with a quantifiable degradation under estimated density ratios.
  arXiv  Detail & Related papers  (2026-06-03T16:04:00Z)
• Amplifying, Not Learning: Fine-Tuned AI Text Detectors Amplify a Pretrained Direction [51.56484100374058]
  Text detectors amplify a pretrained typicality axis; they do not construct an AI-vs-human boundary.<n>On raw encoders before any task supervision, projecting onto centroid(AI)-centroid(HC3) achieves NYT-vs-HC3 AUROC 0.806/0.944/0.834 across three architectures.<n>On RoBERTa-base, raw projection exceeds fine-tuning; on RoBERTa-base, full fine-tuning reduces discrimination below raw on both fluent-formal populations tested.
  arXiv  Detail & Related papers  (2026-05-20T19:08:38Z)
• Graph Theoretical Outlier Rejection for 4D Radar Registration in Feature-Poor Environments [0.6171990546748666]
  Automotive 4D imaging radar is well suited for operation in dusty and low-visibility environments.<n>But registration remains challenging due to scan sparsity and spurious detections caused by noise and multipath reflections.<n>We propose a radar-adapted pairwise distance-invariant scoring function for clique-based graph (PCM)<n>Our method reduces segment relative position error (RPE) by 29.6% on 1 m segments and by up to on 100 m segments.
  arXiv  Detail & Related papers  (2026-04-16T10:44:47Z)
• Spectral Signatures of Data Quality: Eigenvalue Tail Index as a Diagnostic for Label Noise in Neural Networks [0.0]
  We investigate whether spectral properties of neural network weight matrices can predict test accuracy.<n>Under controlled label noise variation, the tail index alpha of the eigenvalue distribution at the network's bottleneck layer predicts test accuracy with leave-one-out R2 = 0.984 (21 noise levels, 3 seeds per level)<n>We identify the information-processing bottleneck layer as the locus of this signature and connect the observations to the BBP phase transition in random matrix models.
  arXiv  Detail & Related papers  (2026-03-29T21:53:24Z)
• Geometry of Reason: Spectral Signatures of Valid Mathematical Reasoning [0.0]
  We present a training-free method for detecting valid mathematical reasoning in large language models through spectral analysis of attention patterns.<n>The method requires no training data, fine-tuning, or learned classifiers: a single threshold on a spectral metric suffices for high accuracy.<n>These findings establish spectral graph analysis as a principled framework for reasoning verification with immediate applications to hallucination detection and AI safety monitoring.
  arXiv  Detail & Related papers  (2026-01-02T18:49:37Z)
• On the Problem of Consistent Anomalies in Zero-Shot Industrial Anomaly Detection [0.0]
  We introduce Consistent-Anomaly Detection Graph (CoDeGraph), a novel algorithm that identifies and filters consistent anomalies from similarity computations.<n>CoDeGraph constructs an image-level graph, with images as nodes and edges connecting those with shared consistent-anomaly patterns.<n>Experiments on MVTec AD with the ViT-L-14-336 backbone achieve 98.3% AUROC for AC and AS performance of 66.8%.
  arXiv  Detail & Related papers  (2025-10-12T05:28:28Z)
• A Spectral Interpretation of Redundancy in a Graph Reservoir [51.40366905583043]
  This work revisits the definition of the reservoir in the Multiresolution Reservoir Graph Neural Network (MRGNN)<n>It proposes a variant based on a Fairing algorithm originally introduced in the field of surface design in computer graphics.<n>The core contribution of the paper lies in the theoretical analysis of the algorithm from a random walks perspective.
  arXiv  Detail & Related papers  (2025-07-17T10:02:57Z)
• Adaptive Hierarchical Graph Cut for Multi-granularity Out-of-distribution Detection [10.200872243175183]
  This paper focuses on a significant yet challenging task: out-of-distribution detection (OOD detection)<n>Previous works have made decent success, but they are ineffective for real-world challenging applications.<n>We propose a novel Adaptive Hierarchical Graph Cut network (AHGC) to explore the semantic relationship between different images.
  arXiv  Detail & Related papers  (2024-12-20T08:32:02Z)
• OsmLocator: locating overlapping scatter marks with a non-training generative perspective [48.50108853199417]
  Locating overlapping marks faces many difficulties such as no texture, less contextual information, hallow shape and tiny size. Here, we formulate it as a optimization problem on clustering-based re-visualization from a non-training generative perspective. We especially built a dataset named 2023 containing hundreds of scatter images with different markers and various levels of overlapping severity, and tested the proposed method and compared it to existing methods.
  arXiv  Detail & Related papers  (2023-12-18T12:39:48Z)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• DetectGPT: Zero-Shot Machine-Generated Text Detection using Probability Curvature [143.5381108333212]
  We show that text sampled from an large language model tends to occupy negative curvature regions of the model's log probability function. We then define a new curvature-based criterion for judging if a passage is generated from a given LLM. We find DetectGPT is more discriminative than existing zero-shot methods for model sample detection.
  arXiv  Detail & Related papers  (2023-01-26T18:44:06Z)
• Learning Hierarchical Graph Representation for Image Manipulation Detection [50.04902159383709]
  The objective of image manipulation detection is to identify and locate the manipulated regions in the images. Recent approaches mostly adopt the sophisticated Convolutional Neural Networks (CNNs) to capture the tampering artifacts left in the images. We propose a hierarchical Graph Convolutional Network (HGCN-Net), which consists of two parallel branches.
  arXiv  Detail & Related papers  (2022-01-15T01:54:25Z)
• Recognizing Predictive Substructures with Subgraph Information Bottleneck [97.19131149357234]
  We propose a novel subgraph information bottleneck (SIB) framework to recognize such subgraphs, named IB-subgraph. Intractability of mutual information and the discrete nature of graph data makes the objective of SIB notoriously hard to optimize. Experiments on graph learning and large-scale point cloud tasks demonstrate the superior property of IB-subgraph.
  arXiv  Detail & Related papers  (2021-03-20T11:19:43Z)
• High-Order Information Matters: Learning Relation and Topology for Occluded Person Re-Identification [84.43394420267794]
  We propose a novel framework by learning high-order relation and topology information for discriminative features and robust alignment. Our framework significantly outperforms state-of-the-art by6.5%mAP scores on Occluded-Duke dataset.
  arXiv  Detail & Related papers  (2020-03-18T12:18:35Z)

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.