mlsanityData to 14 Oct 2026

Differentiable NMS via Sinkhorn Matching for End-to-End Fabric Defect Detection

arXiv 2505.07040 ↗First posted 11 May 2025cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Fabric defect detection confronts two fundamental challenges. First, conventional non-maximum suppression disrupts gradient flow, which hinders genuine end-to-end learning. Second, acquiring pixel-level annotations at industrial scale is prohibitively costly. Addressing these limitations, we propose a differentiable NMS framework for fabric defect detection that achieves superior localization precision through end-to-end optimization. We reformulate NMS as a differentiable bipartite matching problem solved through the Sinkhorn-Knopp algorithm, maintaining uninterrupted gradient flow throughout the network. This approach specifically targets the irregular morphologies and ambiguous boundaries of fabric defects by integrating proposal quality, feature similarity, and spatial relationships. Our entropy-constrained mask refinement mechanism further enhances localization precision through principled uncertainty modeling. Extensive experiments on the Tianchi fabric defect dataset demonstrate significant performance improvements over existing methods while maintaining real-time speeds suitable for industrial deployment. The framework exhibits remarkable adaptability across different architectures and generalizes effectively to general object detection tasks.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 24 of its 51 references that are in the map. First posted on arXiv 11 May 2025.

Builds on

24 of 51 references.

References · 24

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
  5. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
  6. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
  7. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
  8. 2020Deformable DETR: Deformable Transformers for End-to-End Object Detectioncited by 3,422
  9. 2019FCOS: Fully Convolutional One-Stage Object Detectioncited by 1,577
  10. 2019EfficientDet: Scalable and Efficient Object Detectioncited by 1,020
  11. 2019Bridging the Gap Between Anchor-based and Anchor-free Detection via Adaptive Training Sample Selectioncited by 540
  12. 2020Sparse R-CNN: End-to-End Object Detection with Learnable Proposalscited by 495
12 more
  1. 2019Uninformed Students: Student-Teacher Anomaly Detection with Discriminative Latent Embeddingscited by 386
  2. 2017Soft-NMS -- Improving Object Detection With One Line of Codecited by 382
  3. 2021TOOD: Task-aligned One-stage Object Detectioncited by 218
  4. 2023AnomalyGPT: Detecting Industrial Anomalies Using Large Vision-Language Modelscited by 171
  5. 2018Bounding Box Regression with Uncertainty for Accurate Object Detectioncited by 143
  6. 2017Learning non-maximum suppressioncited by 113
  7. 2020Revisiting the Sibling Head in Object Detectorcited by 82
  8. 2025PRISM: Self-Pruning Intrinsic Selection Method for Training-Free Multimodal Data Selectioncited by 61
  9. 2022Adaptive Memory Networks with Self-supervised Learning for Unsupervised Anomaly Detectioncited by 18
  10. 2024Progressive Boundary Guided Anomaly Synthesis for Industrial Anomaly Detectioncited by 17
  11. 2020FeatureNMS: Non-Maximum Suppression by Learning Feature Embeddingscited by 12
  12. 2025Work-Efficient Parallel Non-Maximum Suppression Kernelscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.