On the Problem of Consistent Anomalies in Zero-Shot Industrial Anomaly Detection

• URL: http://arxiv.org/abs/2510.10456v1
• Date: Sun, 12 Oct 2025 05:28:28 GMT
• Title: On the Problem of Consistent Anomalies in Zero-Shot Industrial Anomaly Detection
• Authors: Tai Le-Gia, Ahn Jaehyun,
• Abstract summary: 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%.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Zero-shot image anomaly classification (AC) and segmentation (AS) are vital for industrial quality control, detecting defects without prior training data. Existing representation-based methods compare patch features with nearest neighbors in unlabeled test images but struggle with consistent anomalies -- similar defects recurring across multiple images -- resulting in poor AC/AS performance. We introduce Consistent-Anomaly Detection Graph (CoDeGraph), a novel algorithm that identifies and filters consistent anomalies from similarity computations. Our key insight is that normal patches in industrial images show stable, gradually increasing similarity to other test images, while consistent-anomaly patches exhibit abrupt similarity spikes after exhausting a limited set of similar matches, a phenomenon we term ``neighbor-burnout.'' CoDeGraph constructs an image-level graph, with images as nodes and edges connecting those with shared consistent-anomaly patterns, using community detection to filter these anomalies. We provide a theoretical foundation using Extreme Value Theory to explain the effectiveness of our approach. Experiments on MVTec AD with the ViT-L-14-336 backbone achieve 98.3% AUROC for AC and AS performance of 66.8% (+4.2%) F1 and 68.1% (+5.4%) AP over state-of-the-art zero-shot methods. Using the DINOv2 backbone further improves segmentation, yielding 69.1% (+6.5%) F1 and 71.9% (+9.2%) AP, demonstrating robustness across architectures.

Related papers

• Fixed-Threshold Evaluation of a Hybrid CNN-ViT for AI-Generated Image Detection Across Photos and Art [0.0]
  We introduce fixed-threshold evaluation that holds decision thresholds, selected once on clean validation data, fixed across all post-processing transformations.<n>Our hybrid approach achieves balanced crossdomain performance: 91.4% accuracy on tinygenimage photos, 89.7% accuracy on AiData art/graphics, and 98.3% (competitive) on CIFAKE.
  arXiv  Detail & Related papers  (2025-12-25T05:19:09Z)
• On the Problem of Consistent Anomalies in Zero-Shot Anomaly Detection [0.0]
  Zero-shot anomaly classification and segmentation (AC/AS) aim to detect anomalous samples and regions without any training data.<n>This dissertation aims to investigate the core challenges of zero-shot AC/AS and presents principled solutions rooted in theory and algorithmic design.
  arXiv  Detail & Related papers  (2025-12-02T08:23:03Z)
• Rethinking Contrastive Learning in Graph Anomaly Detection: A Clean-View Perspective [54.605073936695575]
  Graph anomaly detection aims to identify unusual patterns in graph-based data, with wide applications in fields such as web security and financial fraud detection.<n>Existing methods rely on contrastive learning, assuming that a lower similarity between a node and its local subgraph indicates abnormality.<n>The presence of interfering edges invalidates this assumption, since it introduces disruptive noise that compromises the contrastive learning process.<n>We propose a Clean-View Enhanced Graph Anomaly Detection framework (CVGAD), which includes a multi-scale anomaly awareness module to identify key sources of interference in the contrastive learning process.
  arXiv  Detail & Related papers  (2025-05-23T15:05:56Z)
• SoftPatch+: Fully Unsupervised Anomaly Classification and Segmentation [84.07909405887696]
  This paper is the first to consider fully unsupervised industrial anomaly detection (i.e., unsupervised AD with noisy data)<n>We propose memory-based unsupervised AD methods, SoftPatch and SoftPatch+, which efficiently denoise the data at the patch level.<n>Compared with existing methods, SoftPatch maintains a strong modeling ability of normal data and alleviates the overconfidence problem in coreset.<n> Comprehensive experiments conducted in diverse noise scenarios demonstrate that both SoftPatch and SoftPatch+ outperform the state-of-the-art AD methods on the MVTecAD, ViSA, and BTAD benchmarks.
  arXiv  Detail & Related papers  (2024-12-30T11:16:49Z)
• 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)
• Few-Shot Anomaly Detection via Category-Agnostic Registration Learning [65.64252994254268]
  Most existing anomaly detection methods require a dedicated model for each category. This article proposes a novel few-shot AD (FSAD) framework. It is the first FSAD method that requires no model fine-tuning for novel categories.
  arXiv  Detail & Related papers  (2024-06-13T05:01:13Z)
• MuSc: Zero-Shot Industrial Anomaly Classification and Segmentation with Mutual Scoring of the Unlabeled Images [12.48347948647802]
  We study zero-shot anomaly classification (AC) and segmentation (AS) in industrial vision. We leverage a discriminative characteristic to design a novel zero-shot AC/AS method by Mutual Scoring (MuSc) of the unlabeled images. We present an optimization approach named Re-scoring with Constrained Image-level Neighborhood (RsCIN) for image-level anomaly classification.
  arXiv  Detail & Related papers  (2024-01-30T05:16:52Z)
• Adaptive Feature Selection for No-Reference Image Quality Assessment by Mitigating Semantic Noise Sensitivity [55.399230250413986]
  We propose a Quality-Aware Feature Matching IQA Metric (QFM-IQM) to remove harmful semantic noise features from the upstream task.<n>Our approach achieves superior performance to the state-of-the-art NR-IQA methods on eight standard IQA datasets.
  arXiv  Detail & Related papers  (2023-12-11T06:50:27Z)
• Rethinking Image Forgery Detection via Soft Contrastive Learning and Unsupervised Clustering [27.495469888054032]
  Image forgery detection aims to detect and locate forged regions in an image.<n>Most existing forgery detection algorithms formulate classification problems to classify pixels into forged or pristine.<n>We propose FOrensic ContrAstive cLustering (FOCAL) method, a novel, simple yet very effective paradigm based on soft contrastive learning and unsupervised clustering.
  arXiv  Detail & Related papers  (2023-08-18T05:05:30Z)
• Pushing the Limits of Fewshot Anomaly Detection in Industry Vision: Graphcore [71.09522172098733]
  We utilize graph representation in FSAD and provide a novel visual invariant feature (VIIF) as anomaly measurement feature. VIIF can robustly improve the anomaly discriminating ability and can further reduce the size of redundant features stored in M. Besides, we provide a novel model GraphCore via VIIFs that can fast implement unsupervised FSAD training and can improve the performance of anomaly detection.
  arXiv  Detail & Related papers  (2023-01-28T03:58:32Z)
• Enhanced Sharp-GAN For Histopathology Image Synthesis [63.845552349914186]
  Histopathology image synthesis aims to address the data shortage issue in training deep learning approaches for accurate cancer detection. We propose a novel approach that enhances the quality of synthetic images by using nuclei topology and contour regularization. The proposed approach outperforms Sharp-GAN in all four image quality metrics on two datasets.
  arXiv  Detail & Related papers  (2023-01-24T17:54:01Z)
• Adaptation to CT Reconstruction Kernels by Enforcing Cross-domain Feature Maps Consistency [0.06117371161379209]
  We show a decrease in the COVID-19 segmentation quality of the model trained on the smooth and tested on the sharp reconstruction kernels. We propose the unsupervised adaptation method, called F-Consistency, that outperforms the previous approaches.
  arXiv  Detail & Related papers  (2022-03-28T10:00:03Z)
• With a Little Help from My Friends: Nearest-Neighbor Contrastive Learning of Visual Representations [87.72779294717267]
  Using the nearest-neighbor as positive in contrastive losses improves performance significantly on ImageNet classification. We demonstrate empirically that our method is less reliant on complex data augmentations.
  arXiv  Detail & Related papers  (2021-04-29T17:56:08Z)
• Image Fine-grained Inpainting [89.17316318927621]
  We present a one-stage model that utilizes dense combinations of dilated convolutions to obtain larger and more effective receptive fields. To better train this efficient generator, except for frequently-used VGG feature matching loss, we design a novel self-guided regression loss. We also employ a discriminator with local and global branches to ensure local-global contents consistency.
  arXiv  Detail & Related papers  (2020-02-07T03:45:25Z)

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.