Self-Supervised Learning for Anomaly Detection With Dynamic Local Augmentation
Open accessAbstract
Anomaly detection is an important problem for recent advances in machine learning. To this end, many attempts have emerged to detect unknown anomalies of the images by learning representations and designing score functions. In this paper, we propose a simple yet effective framework for unsupervised anomaly detection using self-supervised learning. We extend conventional self-supervised learning for an anomaly detection problem. In anomaly detection, anomalous patterns appear in the local regions of an image, so we employ dynamic local augmentation to generate a negative pair of the images from the normal training dataset. Specifically, in addition to learning the global representation of an image, our framework contrasts a normal sample to a locally augmented sample. To effectively apply the local augmentations regardless of a category or a random location of an image, we use dynamically weighted local augmentations to generate more suitable negative samples. We also present a novel scoring function for detecting unseen anomalous patterns. Our experiment demonstrates the effectiveness of our method, and we show that our framework achieves competitive performance compared to state-of-the-art methods on MVTec Anomaly Detection dataset.
AI snapshot
Written from the paper’s full text.
TL;DR
The paper proposes a self-supervised anomaly detection framework that uses dynamic local augmentation to create pseudo-abnormal negative samples and two pixel-level scoring functions based on regression error and MC-dropout uncertainty. On MVTec AD, the method achieves competitive pixel-level anomaly localization, with an average AUROC of 93.04%.
Key findings
- The proposed method achieves the best average performance on MVTec AD, with AUROC averages of 91.42% for texture, 93.85% for object, and 93.04% overall.
- It outperforms the second-highest baseline by 12.66% in the texture category and by 2.53% in the object category.
- Dynamic local augmentation (DLA) outperforms static local augmentation (LA): average AUROC 93.04% vs. 82.92%, which the paper reports as an average 9.90% improvement.
- Ablation shows dense loss and negative pairs matter: training without local augmentation is more effective than training with static local augmentation, while DLA gives the best performance.
Methods
- The framework is based on SimSiam-style self-supervised learning with only positive pairs, plus a dense self-supervised loss adapted from DenseCL; it adds a negative-pair loss using dynamic local augmentation.
- Dynamic local augmentation combines hard local augmentations—Rotation, ColorJitter, Perm, and Grayscale—weighted by their MSE difference from the original image, so augmentation strength adapts to image category and location.
- Anomaly scores are computed per pixel using regression error between test feature maps and average training feature maps, and MC-dropout variance-map differences, across three ResNet-18 stages (C2, C3, C4), upsampled to 224×224.
- Experiments use MVTec AD (5 texture and 10 object categories, over 5000 high-resolution images resized to 256×256), ResNet-18 trained from scratch, batch size 200, SGD with momentum 0.9, weight decay 5×10⁻⁴, 200 epochs, base learning rate 0.02, local region size 50–128, λ₁=1, λ₂=0.1, λ₃=0.5, α₁=1, α₂=0.1; results are average AUROC over three runs.
Limitations
- Stated: hyperparameter tuning is difficult in anomaly detection because the training set contains only normal samples; the authors tune using normal samples and pseudo-abnormal samples generated by local augmentations.
- Stated as future work: extending to wide-scene anomaly detection with many objects in one image or video where uncertainty is high, and studying how the shape, size, and variety of dynamic local augmentations affect abnormal sample quality.
- Evident from the text: evaluation is limited to MVTec AD, with models trained and tested separately per category, and comparisons are mainly against baselines from the MVTec AD paper plus U-Student.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
0 of 13 cited sources checked · 0 supported · 0 flagged
- Findingown data
Some hard local augmentations have no effect at all when applied at certain random locations of an image, for example rotation applied at a local region without shape produces little change.
“Since the hard augmentation is applied at a random location, we observe that some hard local augmentations have no effect at all in certain locations as shown in the bottom row of Figure 2.”
- Also stated in: § Local Augmentation. · plain
“For example, if rotation is applied at a local region that is without shape (e.g., the center of metal nut and bottle classes, the smooth surface of capsule and leather classes), we observe that there is little change (e.g., the bottom row of the”
Quote in the paperSubstantial claim - Also stated in: § Local Augmentation. · plain
- Findingown data
The model trained with self-supervised learning using only global and dense loss (without dynamic local augmentation) tends to have poor anomaly detection at test time.
“In Table 2, we observed that the model trained with self-supervised learning using only global and dense loss (the first∼second row in Table 2) tends to have poor detecting anomalies at test time.”
Quote in the paperSubstantial claim - Findingown data
The model with dynamic local augmentation (DLA) performs an average of 9.90% higher than with fixed local augmentation (LA) in Table 2.
“The fourth row and the last row (Ours) in Table 2 show that the model with DLA (the last row) performs an average of 9.90% higher than with LA.”
Quote in the paperSubstantial claim - Findingown data
Training without local augmentation is more effective than training using static local augmentation (LA).
“Furthermore, training without local augmentation is more effective than training using static local augmentation (LA) as shown in the second and forth row in Table 2.”
Quote in the paperSubstantial claim - Findingown data
The proposed framework achieves competitive performance compared to state-of-the-art methods on the MVTec Anomaly Detection dataset.
“Our experiment demonstrates the effectiveness of our method, and we show that our framework achieves competitive performance compared to state-of-the-art methods on MVTec Anomaly Detection dataset.”
- Also stated in: § VOLUME xx, 20xx · boosted
“Lastly, our experiments demonstrate that the proposed method which is trained from scratch achieves the competitive performance on the public benchmark MVTec Anomaly Detection dataset.”
Quote in the paperSubstantial claim - Also stated in: § VOLUME xx, 20xx · boosted
- Interpretationreasoning
Negative pairs are not effective to prevent collapsing solutions in anomaly detection because the categories of different images are the same.
“For this reason, the categories of the different images are the same, so the negative pairs are not effective to prevent collapsing solutions, unlike SimCLR.”
Quote in the paperSubstantial claim- Rests on an assumption: The category of the training data is the same in the anomaly detection task.
- Interpretationown data
If the negative sample uses too strong augmentation (all hard local augmentations with w(k)=1), the framework is difficult to detect abnormal regions including imperceptible anomalies.
“On the contrary, if we leverage the negative sample with too strong augmentation, e.g., w (k) = 1, where k ∈ {1, 2, 3, 4} in Equation 5, our framework is difficult to detect the abnormal region which includes imperceptible anomaly, although the ground truth of the region is abnormal at test time.”
Quote in the paperSubstantial claim - Premisecitation
GAN-based and AE-based anomaly detection methods lack the ability to capture high-level features and semantic information because they consider pixelwise reconstruction error.
“Since both methods consider pixelwise reconstruction error, the methods lack to capture the high-level features and semantic information [9], [10].”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [9]
Not checked in the free run.
- cites [10]
Not checked in the free run.
- Interpretationown data
Self-supervised learning method is sensitive to abnormal samples.
“The main intuition from Table 2 is that self-supervised learning method is sensitive to abnormal samples.”
Quote in the paperSubstantial claim - Premisecitation
Self-supervised learning with only positive pairs has resulted in competitive performance in comparison to contrastive learning which requires both negative pairs and positive pairs.
“Self-supervised learning with only positive pairs [14], [16] has resulted in competitive performance in comparison to contrastive learning which requires both negative pairs and positive pairs [13], [17].”
Quote in the paperSubstantial claim0 of 3 sources checked - Premisecitation
Feature maps from each layer have different characteristics.
“Following [46], the feature maps from each layer have different characteristics, so we compute the regression errors for each layer and average the error values per pixels after upsampling the difference maps for each layer to the same size (224×224).”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [46]
Not checked in the free run.
- Interpretationown data
To learn tight decision boundaries of normal pixels, an effective pseudo abnormal sample needs to be generated.
“The ablation study on dynamic local augmentation shows that to learn tight decision boundaries of normal pixels, the effective pseudo abnormal sample needs to be generated.”
Quote in the paperSubstantial claim - Interpretationown data
Dynamic local augmentation as a negative sample improves anomaly detection performance compared with fixed local augmentation.
“We observe that the model with LA underperforms the other models, and it shows that the local augmentation is effective as a negative sample when dynamically applied.”
- Also stated in: § B. DISCUSSION · plain
“Overall, our framework (DLA) outperforms LA, and the performance gap between them is especially large on some categories such as grid, tile, bottle, and metal nut.”
- Also stated in: § V. CONCLUSION · plain
“In Table 2, we show that a variety of combinations of four losses affect the performance and dynamic local augmentation is helpful but conventional local augmentation interferes with the performance.”
Quote in the paperSubstantial claim - Also stated in: § B. DISCUSSION · plain
- Interpretationown data
Dense loss L_dense is an important component, especially in the object category.
“In the third row and the last row of Table 2, we observe that dense loss L dense is an important component, especially in the object category.”
Quote in the paperSubstantial claim - Interpretationown data
If the negative sample uses weak augmentation, the framework cannot learn the representation of an anomaly.
“If we use the negative sample with weak augmentation, e.g.,”
Quote in the paperSubstantial claim - Interpretationreasoning
Self-supervised learning without dynamic local augmentation has difficulty detecting abnormal patterns because the model has never learned to detect anomalies on the training dataset.
“Since the model has never learned to detect anomalies on the training dataset, self-supervised learning without dynamic local augmentation has difficulty detecting the abnormal patterns.”
Quote in the paperSubstantial claim - Interpretationown data
The proposed framework does not rely on large mini-batch training, unlike BYOL.
“Since the training data, e.g., MVTec AD, is not a large-scale dataset, our framework does not rely on large mini-batch training, unlike BYOL.”
Quote in the paperSubstantial claim- Rests on an assumption: MVTec AD is not a large-scale dataset.
- May combine two claims. 11
- Classified as probably not a substantial claim. 9
May combine two claims.
Findingown dataThe proposed method outperforms the second-highest method for wood by 16.4% and for zipper by 7.5%.
“Our framework especially outperforms the secondhighest method for wood in texture category by 16.4% and for zipper in object category by 7.5%.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataThe average performance gap between DLA and LA on grid, tile, bottle, and metal nut is 25.4%, and the gap on texture category (14.02%) is larger than on object category (8.17%).
“The average performance gap on these categories is 25.4%, and the performance gap between our framework and LA on texture category (14.02%) is averagely larger than the gap on object category (8.17%).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataOn MVTec AD, the proposed method achieves the best average AUROC among compared baselines for most categories and overall average.
“In Table 1, we show that our method achieves the best performance for most categories as well as the average of all categories.”
- Also stated in: § Setup. · plain
“Our framework that is trained from scratch achieves the best performance on average.”
- Also stated in: § V. CONCLUSION · hedged
“Our method achieved competitive performance for pixelwise anomaly segmentation.”
Quote in the paperSubstantial claim- Also stated in: § Setup. · plain
May combine two claims.
Findingown dataThe proposed method outperforms the second-highest baseline by 12.66% in texture category and by 2.53% in object category on MVTec AD.
“Our method outperforms the second-highest baseline by 12.66% in texture category, by 2.53% in object category.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataThe average AUROCs of baselines in wood and zipper are 68.52% and 80.92%, while the proposed method achieves 89.4% and 95.5% respectively.
“The average AUROCs of the baselines in wood and zipper classes are 68.52% and 80.92% respectively, however the performance of our method is 89.4% and 95.5% respectively.”
Quote in the paperSubstantial claimClassified as probably not a substantial claim.
Study design and conductreasoningHyper-parameter tuning was performed on the validation set using normal samples and pseudo abnormal samples generated by local augmentations.
“In contrast to other baselines, our framework can generate the pseudo abnormal samples using local augmentations, so we did hyper-parameter tuning on the validation set using normal samples and pseudo abnormal samples.”
Quote in the paperSubstantial claim- Rests on an assumption: In anomaly detection, the training set consists of only normal samples, making hyper-parameter tuning using a validation set difficult.
May combine two claims.
Interpretationown dataFrom experiment results, the importance of an effective anomaly sample and dense features is shown.
“From the experiment results, we have shown the importance of an effective anomaly sample and dense features.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
Interpretationnone givenThe paper has first explored uncertainty scores for pixel-level anomaly detection with self-supervised learning.
“Also, we have first explored uncertainty scores for pixel-level anomaly detection with self-supervised learning.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationOne-class classifiers have shown competitive results on image-level classification with high-level representations.
“For example, One-class classifiers [1], [2] have shown competitive results on imagelevel classification with high-level representations.”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites [1]
Not checked in the free run.
- cites [2]
Not checked in the free run.
May combine two claims.
InterpretationreasoningThe performance drop on texture category is bigger than object class because static local augmentation is not effective in texture category causing wrong decision boundary.
“The performance drop on the texture category is bigger than the object class, since static local augmentation is not effective in the texture category causing the wrong decision boundary.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S2 (checkable).
Interpretationnone givenThe proposed method is a simple yet effective framework by self-supervised learning with dynamic local augmentation in anomaly detection.
“We proposed a simple yet effective framework by selfsupervised learning with dynamic local augmentation in anomaly detection.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationGAN-based models detect anomalies when the confidence score is below a certain threshold.
“GAN-based models detect anomalies when the confidence score is below a certain threshold.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [3]-[5]
Not checked in the free run.
May combine two claims.
Interpretationnone givenThe paper presents a novel augmentation method called dynamic local augmentation to generate pseudo abnormal images and effectively detect anomalies at test time.
“We present a novel augmentation method called dynamic local augmentation to generate pseudo abnormal images and effectively detect the anomalies at test time.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductown dataThe reported average AUROC is based on three independent runs with different random seeds.
“We report the average AUROC (%) of three independent runs with different random seeds in Table 1.”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim. May combine two claims.
PremisecitationAE-based models are trained to reconstruct normal input data and determine anomalies when reconstruction error is high at test time.
“AEbased models are trained to reconstruct the input data which is normal, and determine anomalies when reconstruction error is high at test time.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [6]-[8]
Not checked in the free run.
Probably not a substantial claim: may not pass S4 (based).
Interpretationnone givenSelf-supervised learning on only normal training data has limitations because the model has never been trained with abnormal data.
“Self-supervised learning on only normal training data has limitations, since the model has never been trained with abnormal data.”
Quote in the paperNot a substantial claim- The authors state this as an assumption: In anomaly detection tasks, only normal data is given during training.
May combine two claims.
InterpretationreasoningThe model's uncertainty will be high when the input is abnormal test data, because the model is trained on only normal data.
“The intuition is that since the model is trained on only normal data, the model's uncertainty will be high when the input is abnormal test data.”
Quote in the paperSubstantial claim- The authors state this as an assumption: In anomaly detection tasks, only normal data is given during training.
Probably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationA few works have shown the effectiveness of contrastive learning in image-level anomaly detection.
“A few works [15] have shown the effectiveness of contrastive learning in image-level anomaly detection.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [15]
Not checked in the free run.
May combine two claims.
PremisecitationBoth GAN-based and AE-based anomaly detection methods consider pixelwise reconstruction error.
“Since both methods consider pixelwise reconstruction error, the methods lack to capture the high-level features and semantic information [9], [10].”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [9]
Not checked in the free run.
- cites [10]
Not checked in the free run.
The authors state this as an assumption.
In anomaly detection tasks, only normal data is given during training.
“In most anomaly detection tasks, we assume that only the normal data is given during the training and the model predicts whether a test sample is normal or not during the test time.”
The authors state this as an assumption.
Anomalies rarely occur and anomaly patterns are not given in the training dataset.
“In general, one of the assumptions in anomaly detection is that anomalies rarely occur and anomaly patterns are not given in the training dataset.”
The paper relies on this without support.
Anomalous patterns appear in the local regions of an image.
“In anomaly detection, anomalous patterns appear in the local regions of an image, so we employ dynamic local augmentation to generate a negative pair of the images from the normal training dataset.”
The paper relies on this without support.
The category of the training data is the same in the anomaly detection task.
“Note that the category of the training data is the same in the anomaly detection task, so we set v i and v j as positive pairs although they are transformed from either the same image or different images.”
The paper relies on this without support.
MVTec AD is not a large-scale dataset.
“Since the training data, e.g., MVTec AD, is not a large-scale dataset, our framework does not rely on large mini-batch training, unlike BYOL.”
The paper relies on this without support.
Hard augmentations, such as rotation, are harmful and unused for standard contrastive learning.
“Previous works observed that”
The paper relies on this without support.
Defects are often revealed as locally changed color.
“We observe that the defects are often revealed as the locally changed color.”
The paper relies on this without support.
Defects such as hole, crack, and gray stroke are usually gray.
“Fourth, we add Grayscale transformation to easily detect a defect, e.g., hole, crack, and gray stroke, which is usually gray.”
The paper relies on this without support.
Learning local features of an image is important in anomaly detection.
“Second, we observe that learning local features of an image is important in anomaly detection.”
The paper relies on this without support.
The category and random location of an image affect the effectiveness of local augmentations to generate negative samples.
“Our intuition is that the category and the random location of the image affect the effectiveness of the local augmentations to generate the negative sample.”
The paper relies on this without support.
Not many works have been proposed for pixel-level anomaly detection, which requires accurate and reliable pixel-level representation.
“However, not many works have been proposed for pixel-level anomaly detection which requires accurate and reliable pixellevel representation.”
The paper relies on this without support.
Feature maps of training images differ from feature maps of abnormal test images.
“So the intuition is that the feature maps of training images from each layer differs from the feature maps of abnormal images on test data.”
The paper relies on this without support.
In anomaly detection, the training set consists of only normal samples, making hyper-parameter tuning using a validation set difficult.
“In anomaly detection, the training set consists of only normal samples, so the hyper-parameter tuning using the validation set is difficult in the anomaly detection task.”
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Ablation improvement over fixed augmentation is misstated
MinorThe reported total averages for DLA and LA are 93.04% and 82.92%. DLA is 10.12 percentage points higher, not 9.90.
Reported 9.9 · recomputed 10.12
“The fourth row and the last row (Ours) in Table 2 show that the model with DLA (the last row) performs an average of 9.90% higher than with LA.”
Zipper result in prose differs from Table 1
MinorThe prose assigns 95.5% to the proposed method for zipper, while Table 1 reports 95.4%.
“The average AUROCs of the baselines in wood and zipper classes are 68.52% and 80.92% respectively, however the performance of our method is 89.4% and 95.5% respectively.”
“| | zipper | 88 | 77 | 71.6 | 78 | 90 | 95.4±0.23 |”
Wood result in prose differs from Table 1
MinorThe prose assigns 89.4% to the proposed method for wood, while Table 1 reports 89.2%.
“The average AUROCs of the baselines in wood and zipper classes are 68.52% and 80.92% respectively, however the performance of our method is 89.4% and 95.5% respectively.”
“| | wood | 73 | 73 | 66.6 | 62 | 68 | 89.2±0.17 |”
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474 · see citing works
Momentum Contrast for Unsupervised Visual Representation Learning
He, K., Fan, H., Wu, Y., Xie, S., & Girshick, R. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00975 · Cited by 13,347 · see citing works
A simple framework for contrastive learning of visual representations
Chen, T., Kornblith, S., Norouzi, M., & Hinton, G. (2020) · arXiv · doi:10.48550/arxiv.2002.05709 · Cited by 10,857 · see citing works
Dropout as a bayesian approximation: Representing model uncertainty in deep learning
Gal, Y., & Ghahramani, Z. (2015) · arXiv · doi:10.48550/arxiv.1506.02142 · Cited by 6,471 · see citing works
Bootstrap Your Own Latent: A New Approach to Self-Supervised Learning
Grill, J.-B., Strub, F., Altché, F., Tallec, C., Richemond, P. H., Buchatskaya, E., Doersch, C., Pires, B. A., Guo, Z. D., Azar, M. G., et al. (2020) · arXiv · doi:10.48550/arxiv.2006.07733 · Cited by 3,846 · see citing works
Exploring Simple Siamese Representation Learning
Chen, X., & He, K. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01549 · Cited by 3,725 · see citing works
Unsupervised Feature Learning via Non-parametric Instance Discrimination
Wu, Z., Xiong, Y., Yu, S. X., & Lin, D. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00393 · Cited by 3,664 · see citing works
What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?
Kendall, A., & Gal, Y. (2017) · arXiv · doi:10.48550/arxiv.1703.04977 · Cited by 3,088 · see citing works
Improved regularization of convolutional neural networks with cutout
DeVries, T., & Taylor, G. W. (2017) · arXiv · doi:10.48550/arxiv.1708.04552 · Cited by 2,776 · see citing works
Unsupervised Anomaly Detection with Generative Adversarial Networks to Guide Marker Discovery
Schlegl, T., Seeböck, P., Waldstein, S. M., Schmidt-Erfurth, U., & Langs, G. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-59050-9_12 · Cited by 2,627 · see citing works
Improved Baselines with Momentum Contrastive LearningPreprint
Chen, X., Fan, H., Girshick, R., & He, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.04297 · Cited by 2,579 · see citing works
MVTec AD — A Comprehensive Real-World Dataset for Unsupervised Anomaly Detection
Bergmann, P., Fauser, M., Sattlegger, D., & Steger, C. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00982 · Cited by 2,203 · see citing works
Towards Total Recall in Industrial Anomaly Detection
Roth, K., Pemula, L., Zepeda, J., Scholkopf, B., Brox, T., & Gehler, P. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01392 · Cited by 1,810 · see citing works
Ruff, L., Vandermeulen, R. A., Görnitz, N., Deecke, L., Siddiqui, S. A., Binder, A., Müller, E., & Kloft, M. (2018) · International Conference on Machine Learning · Cited by 1,719 · see citing works
PaDiM: A Patch Distribution Modeling Framework for Anomaly Detection and Localization
Defard, T., Setkov, A., Loesch, A., & Audigier, R. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-68799-1_35 · Cited by 1,415 · see citing works
A simple framework for contrastive learning of visual representations
Chen, T. (2024) · TIB Data Manager · doi:10.57702/iuuvgtaz · Cited by 1,140 · see citing works
CutPaste: Self-Supervised Learning for Anomaly Detection and Localization
Li, C.-L., Sohn, K., Yoon, J., & Pfister, T. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00954 · Cited by 1,107 · see citing works
A Unifying Review of Deep and Shallow Anomaly Detection
Ruff, L., Kauffmann, J., Vandermeulen, R. A., Montavon, G., Samek, W., Kloft, M., Dietterich, T. G., & Muller, K.-R. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3052449 · Cited by 1,080 · see citing works
Uninformed Students: Student-Teacher Anomaly Detection With Discriminative Latent Embeddings
Bergmann, P., Fauser, M., Sattlegger, D., & Steger, C. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00424 · Cited by 990 · see citing works
Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shift
Ovadia, Y., Fertig, E., Ren, J., Nado, Z., Sculley, D., Nowozin, S., Dillon, J. V., Lakshminarayanan, B., & Snoek, J. (2019) · arXiv · doi:10.48550/arxiv.1906.02530 · Cited by 989 · see citing works
Improving Unsupervised Defect Segmentation by Applying Structural Similarity to Autoencoders
Bergmann, P., Löwe, S., Fauser, M., Sattlegger, D., & Steger, C. T. (2019) · International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP) · doi:10.5220/0007364503720380 · Cited by 819 · see citing works
Dense Contrastive Learning for Self-Supervised Visual Pre-Training
Wang, X., Zhang, R., Shen, C., Kong, T., & Li, L. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00304 · Cited by 660 · see citing works
Using Self-Supervised Learning Can Improve Model Robustness and Uncertainty
Hendrycks, D., Mazeika, M., Kadavath, S., & Song, D. (2019) · arXiv · doi:10.48550/arxiv.1906.12340 · Cited by 634 · see citing works
OCGAN: One-Class Novelty Detection Using GANs With Constrained Latent Representations
Perera, P., Nallapati, R., & Xiang, B. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00301 · Cited by 608 · see citing works
Latent Space Autoregression for Novelty Detection
Abati, D., Porrello, A., Calderara, S., & Cucchiara, R. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00057 · Cited by 508 · see citing works
Deep Autoencoding Models for Unsupervised Anomaly Segmentation in Brain MR Images
Baur, C., Wiestler, B., Albarqouni, S., & Navab, N. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-11723-8_16 · Cited by 489 · see citing works
Zhang, Y., Du, B., Zhang, L., & Wang, S. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2015.2479299 · Cited by 488 · see citing works
Deep Anomaly Detection Using Geometric TransformationsPreprint
Golan, I., & El‐Yaniv, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.10917 · Cited by 479 · see citing works
Likelihood Ratios for Out-of-Distribution DetectionPreprint
Ren, J., Liu, P. J., Fertig, E., Snoek, J., Poplin, R. E., DePristo, M. A., Dillon, J. V., & Lakshminarayanan, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.02845 · Cited by 407 · see citing works
Learning Deep Features for One-Class Classification
Perera, P., & Patel, V. M. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2917862 · Cited by 399 · see citing works
Exploring Simple Siamese Representation Learning
Chen, X., & He, K. (2020) · arXiv · doi:10.48550/arxiv.2011.10566 · Cited by 381 · see citing works
Sub-Image Anomaly Detection with Deep Pyramid Correspondences
Cohen, N., & Hoshen, Y. (2020) · arXiv · doi:10.48550/arxiv.2005.02357 · Cited by 372 · see citing works
CSI: Novelty Detection via Contrastive Learning on Distributionally Shifted Instances
Tack, J., Mo, S., Jeong, J., & Shin, J. (2020) · arXiv · doi:10.48550/arxiv.2007.08176 · Cited by 351 · see citing works
Classification-Based Anomaly Detection for General DataPreprint
Bergman, L., & Hoshen, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.02359 · Cited by 294 · see citing works
Modeling the Distribution of Normal Data in Pre-Trained Deep Features for Anomaly Detection
Rippel, O., Mertens, P., & Merhof, D. (2021) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr48806.2021.9412109 · Cited by 280 · see citing works
Generative Probabilistic Novelty Detection with Adversarial Autoencoders
Pidhorskyi, S., Almohsen, R., Adjeroh, D. A., & Doretto, G. (2018) · arXiv · doi:10.48550/arxiv.1807.02588 · Cited by 255 · see citing works
Attribute Restoration Framework for Anomaly Detection
Ye, F., Huang, C., Cao, J., Li, M., Zhang, Y., & Lu, C. (2020) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2020.3046884 · Cited by 203 · see citing works
Anomaly Detection in Medical Imaging With Deep Perceptual Autoencoders
Shvetsova, N., Bakker, B., Fedulova, I., Schulz, H., & Dylov, D. V. (2021) · IEEE Access · doi:10.1109/access.2021.3107163 · Cited by 174 · see citing works
Deep End-to-End One-Class Classifier
Sabokrou, M., Fathy, M., Zhao, G., & Adeli, E. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2979049 · Cited by 111 · see citing works
Are All Layers Created Equal?Preprint
Zhang, C., Samy Bengio, A., & Singer, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.01996 · Cited by 105 · see citing works
Skip-GANomaly: Skip Connected and Adversarially Trained Encoder-Decoder Anomaly Detection
Akcay, S., Atapour-Abarghouei, A., & Breckon, T. P. (2019) · 2019 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2019.8851808 · Cited by 103 · see citing works
Fence GAN: Towards Better Anomaly Detection
Ngo, P. C., Winarto, A. A., Kou, C. K. L., Park, S., Akram, F., & Lee, H. K. (2019) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2019.00028 · Cited by 103 · see citing works
CutPaste: Self-Supervised Learning for Anomaly Detection and LocalizationPreprint
Li, C., Sohn, K., Yoon, J., & Pfister, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.04015 · Cited by 84 · see citing works
Detecting Out-of-Distribution Inputs to Deep Generative Models Using a Test for Typicality.Preprint
Nalisnick, E., Matsukawa, A., Teh, Y. W., & Lakshminarayanan, B. (2019) · arXiv (Cornell University) · Cited by 56 · see citing works
Sewer Pipeline Fault Identification Using Anomaly Detection Algorithms on Video Sequences
Xu, F., Guo, W., Li, Q., Zhu, J., Chen, Z., Yu, J., Zhou, B., & Yang, H.-K. (2020) · IEEE Access · doi:10.1109/access.2020.2975887 · Cited by 51 · see citing works
Dense Contrastive Learning for Self-Supervised Visual Pre-TrainingPreprint
Wang, X., Zhang, R., Shen, C., Kong, T., & Li, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.09157 · Cited by 38 · see citing works
Unsupervised Anomaly Detection Using Style Distillation
Chung, H., Park, J.-H., Keum, J., Ki, H., & Kang, S. (2020) · IEEE Access · doi:10.1109/access.2020.3043473 · Cited by 35 · see citing works
Contrastive Predictive Coding for Anomaly DetectionPreprint
de Haan, P., & Löwe, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.07820 · Cited by 13 · see citing works
Towards Total Recall in Industrial Anomaly DetectionPreprint
Roth, K., Pemula, L., Zepeda, J., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.08265 · Cited by 11 · see citing works
Anomaly Detection Using Autoencoder With Feature Vector Frequency Map
Kim, Y.-G., & Park, T.-H. (2021) · IEEE Access · doi:10.1109/access.2021.3080330 · Cited by 7 · see citing works
A Novel Filter-Based Anomaly Detection Framework for Hyperspectral Imagery
Wang, W., Song, W., Li, Z., Zhao, B., & Zhao, B. (2021) · IEEE Access · doi:10.1109/access.2021.3110791 · Cited by 7 · see citing works
Discriminative-Generative Representation Learning for One-Class Anomaly DetectionPreprint
Xia, X., Pan, X., He, X., Zhang, J., Ding, N., & Ma, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.12753 · Cited by 5 · see citing works
Flagged first, then by citations
Research works printed but not linked: 3
- akcay, 2018, GANomaly: Semi-supervised anomaly detection via adversarial training, Proc Asian Conf Comput Vis, 622
- zong, 2018, Deep autoencoding Gaussian mixture model for unsupervised anomaly detection, Proc Int Conf Learn Represent, 2
- lakshminarayanan, 2017, Simple and scalable predictive uncertainty estimation using deep ensembles, Proc NIPS, 1
Cited by
Sorted by citations
Deep Industrial Image Anomaly Detection: A Survey
Liu, J., Xie, G., Wang, J., Li, S., Wang, C., Zheng, F., & Jin, Y. (2024) · Machine Intelligence Research · doi:10.1007/s11633-023-1459-z · Cited by 463 · see citing works
“[32] presents a novel dynamic local augmentation to generate negative image pairs from a normal training dataset, which is effective for anomaly detection.”
- Authors
- Yoa, S., Lee, S., Kim, C., & Kim, H. J.
- Affiliations
- Korea University (KR)
- Venue
- IEEE Access
- Published
- 2021
- Volume
- 9
- Pages
- 147201-147211
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3208975336
- Semantic Scholar
- f215dde930dce032d682692f54cb5c77af694d0f
- Cited by
- 38
- References
- 52
- Citations by year
- 2026: 6 · 2025: 9 · 2024: 11 · 2023: 11 · 2022: 1
- FWCI
- 2.03
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- IEEE Access (publishedVersion, cc-by-nc-nd)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- Samsung
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Anomaly Detection Techniques and Applications
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Industrial Vision Systems and Defect Detection
- Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
- Keywords
- unsupervised anomaly detection, self-supervised learning, contrastive learning, negative sample generation, image anomaly detection
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-09.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-09.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review