Fei Yan

Industrial visual inspection plays a crucial role in intelligent manufacturing. However, existing anomaly-detection methods based on unsupervised learning paradigms often struggle with issues such as overlooking minor defects and blurring component edges in confidence maps. To address these challenges, this paper proposes an industrial anomaly-detection method based on component-level feature enhancement. This method introduces a component-level feature-enhancement module, which optimizes feature matching by calculating the structural similarity between global coarse-grained confidence features and local fine-grained confidence features, thereby generating enhanced feature maps to improve the model’s detection accuracy for minor defects and local anomalies. Additionally, we propose a region-segmentation method based on multi-layer piecewise thresholds, which effectively distinguishes between foreground and background in confidence maps, circumvents background interference and ensures the integrity of structural information of foreground components. Experimental results demonstrate that the proposed method surpasses comparative methods in both logical and structural defect detection tasks, showing significant advantages, especially in fine-grained anomaly detection, with stronger robustness and accuracy.

In modern industrial production, unsupervised anomaly detection methods have gained significant attention due to their ability to address the challenge posed by the scarcity of labeled anomaly samples. Among them, unsupervised anomaly detection methods based on reverse distillation (RD) have become a mainstream choice, which has attracted extensive research due to their excellent anomaly detection performance. However, there is a problem of “feature leakage” in the RD model, which may lead to non-anomalous regions being incorrectly identified as defects. To solve this problem, we propose a Normal Feature-Enhanced Reverse teacher–student Distillation (NFERD) method. Specifically, we designed and incorporated a normal feature bank (NFB) module into the basic RD network. This module stores normal features extracted by the teacher model, assisting the student model in learning normal features more efficiently, thereby addressing the problem of “feature leakage”. In addition, to effectively fuse the feature maps extracted by the student model with the feature maps in NFBs, we designed a Hybrid Attention Fusion Module (HAFM), which ensures the preservation of key information during the feature fusion process by the parallel processing of spatial and channel attention mechanisms. Through experimental verification on two publicly available datasets, i.e., MVTec and KSDD, our method outperformed the existing mainstream methods in both image-level and pixel-level anomaly detection. Specifically, we achieved an average I-AUROC score of 99.32% on MVTec and a 98.75% P-AUROC on the KSDD, showing clearer segmentation results, especially in complex scenarios. Furthermore, our method surpassed the second-best method by over 1.4% PRO on MVTec, demonstrating its effectiveness.

This paper focuses on network pruning for image retrieval acceleration. Prevailing image retrieval works target at the discriminative feature learning, while little attention is paid to how to accelerate the model inference, which should be taken into consideration in real-world practice. The challenge of pruning image retrieval models is that the middle-level feature should be preserved as much as possible. Such different requirements of the retrieval and classification model make the traditional pruning methods not that suitable for our task. To solve the problem, we propose a new Progressive Local Filter Pruning (PLFP) method for image retrieval acceleration. Specifically, layer by layer, we analyze the local geometric properties of each filter and select the one that can be replaced by the neighbors. Then we progressively prune the filter by gradually changing the filter weights. In this way, the representation ability of the model is preserved. To verify this, we evaluate our method on two widely-used image retrieval datasets,i.e., Oxford5k and Paris6K, and one person re-identification dataset,i.e., Market-1501. The proposed method arrives with superior performance to the conventional pruning methods, suggesting the effectiveness of the proposed method for image retrieval.