arXiv:2601.01856cs.CV2026-01被引 3

通过几何一致路由提升无任务依赖持续异常检测的稳定性

GCR: Geometry-Consistent Routing for Task-Agnostic Continual Anomaly Detection

  • 在共享嵌入空间中基于最近原型距离实现专家路由
  • 在MVTec AD和VisA上实现近零遗忘与稳定检测性能
  • 适合需要持续新增类别且不依赖标注的任务场景

基于特征的异常检测因大型预训练视觉编码器的强大表征能力,广泛应用于工业质检。现有方法多关注类内异常评分优化,但实际部署常需在持续类别扩展下实现无任务依赖运行,测试时类别身份未知。此时整体性能往往由专家选择(即路由)决定:需将输入分配至合适的正常性模型后再进行头特定评分。然而,独立构建的各头间异常分数比较不可靠,因不同类别在量级和尾部行为上差异显著。本文提出轻量级混合专家框架GCR,通过几何一致路由稳定无任务依赖的持续异常检测。GCR在冻结的补丁嵌入空间中直接路由每张测试图像,最小化其累积最近原型距离至类别特定原型库,并仅在选定专家内使用标准原型评分规则计算异常图。通过分离跨头决策与头内评分,避免了跨头分数可比性问题,无需端到端表示学习。在MVTec AD和VisA上的实验表明,几何一致路由显著提升路由稳定性,缓解持续性能退化,在保持竞争性检测与定位性能的同时实现近零遗忘。结果表明,许多曾归因于表示遗忘的失败,实则源于跨头路由中的决策规则不稳。代码已公开于https://github.com/jw-chae/GCR。

原文摘要 · Abstract (English)

Feature-based anomaly detection is widely adopted in industrial inspection due to the strong representational power of large pre-trained vision encoders. While most existing methods focus on improving within-category anomaly scoring, practical deployments increasingly require task-agnostic operation under continual category expansion, where the category identity is unknown at test time. In this setting, overall performance is often dominated by expert selection, namely routing an input to an appropriate normality model before any head-specific scoring is applied. However, routing rules that compare head-specific anomaly scores across independently constructed heads are unreliable in practice, as score distributions can differ substantially across categories in scale and tail behavior. We propose GCR, a lightweight mixture-of-experts framework for stabilizing task-agnostic continual anomaly detection through geometry-consistent routing. GCR routes each test image directly in a shared frozen patch-embedding space by minimizing an accumulated nearest-prototype distance to category-specific prototype banks, and then computes anomaly maps only within the routed expert using a standard prototype-based scoring rule. By separating cross-head decision making from within-head anomaly scoring, GCR avoids cross-head score comparability issues without requiring end-to-end representation learning. Experiments on MVTec AD and VisA show that geometry-consistent routing substantially improves routing stability and mitigates continual performance collapse, achieving near-zero forgetting while maintaining competitive detection and localization performance. These results indicate that many failures previously attributed to representation forgetting can instead be explained by decision-rule instability in cross-head routing. Code is available at https://github.com/jw-chae/GCR

异常检测持续学习路由机制

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。