Cited by 765Anomaly Detection Techniques and ApplicationsAdversarial Robustness in Machine LearningGenerative Adversarial Networks and Image Synthesis

Adversarially Learned One-Class Classifier for Novelty Detection

Open access
Sabokrou, Mohammad, Khalooei, Mohammad, Fathy, Mahmood, Adeli, Ehsan·2018·2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition

Abstract

Novelty detection is the process of identifying the observation(s) that differ in some respect from the training observations (the target class). In reality, the novelty class is often absent during training, poorly sampled or not well defined. Therefore, one-class classifiers can efficiently model such problems. However, due to the unavailability of data from the novelty class, training an end-to-end deep network is a cumbersome task. In this paper, inspired by the success of generative adversarial networks for training deep models in unsupervised and semi-supervised settings, we propose an end-to-end architecture for one-class classification. Our architecture is composed of two deep networks, each of which trained by competing with each other while collaborating to understand the underlying concept in the target class, and then classify the testing samples. One network works as the novelty detector, while the other supports it by enhancing the inlier samples and distorting the outliers. The intuition is that the separability of the enhanced inliers and distorted outliers is much better than deciding on the original samples. The proposed framework applies to different related applications of anomaly and outlier detection in images and videos. The results on MNIST and Caltech-256 image datasets, along with the challenging UCSD Ped2 dataset for video anomaly detection illustrate that our proposed method learns the target class effectively and is superior to the baseline and state-of-the-art methods.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cvpr.2018.00356

Cites

55 of 55 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 7

  1. M. Arjovsky, S. Chintala, and L. Bottou. Wasserstein gener- ative adversarial networks. In International Conference on Machine Learning, pages 214-223, 2017.
  2. A. Chan and N. Vasconcelos. Ucsd pedestrian dataset. IEEE Trans. on Pattern Analysis and Machine Intelligence (TPAMI), 30(5):909-926, 2008.
  3. I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde- Farley, S. Ozair, A. Courville, and Y. Bengio. Generative adversarial nets. In Advances in neural information process- ing systems, pages 2672-2680, 2014.
  4. M. Markou and S. Singh. Novelty detection: a reviewpart 1: statistical approaches. Signal processing, 83(12):2481-2497, 2003.
  5. M. C. Tsakiris and R. Vidal. Dual principal component pur- suit. In Proceedings of the IEEE International Conference on Computer Vision Workshops, pages 10-18, 2015.
  6. P. Vincent, H. Larochelle, Y. Bengio, and P.-A. Manzagol. Ex- tracting and composing robust features with denoising autoen- coders. In Proceedings of the 25th international conference on Machine learning, pages 1096-1103. ACM, 2008.
  7. H. Xu, C. Caramanis, and S. Sanghavi. Robust pca via out- lier pursuit. In Advances in Neural Information Processing Systems, pages 2496-2504, 2010.

Cited by

Sorted by citations

Authors
Sabokrou, M., Khalooei, M., Fathy, M., & Adeli, E.
Affiliations
  • Institute for Research in Fundamental Sciences (IR)
  • Amirkabir University of Technology (IR)
  • Stanford University (US)
Venue
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
Publisher
IEEE
Published
2018-06
Pages
3379-3388
ISSN
1063-6919 (ISSN-L)
OpenAlex
W2788979378
Cited by
765
References
55
Citations by year
2026: 16 · 2025: 63 · 2024: 107 · 2023: 135 · 2022: 116 · 2021: 157 · 2020: 107 · 2019: 58 · 2018: 6
FWCI
33.49
Type
conference paper
Language
en
Open access
Locations
  • IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Anomaly Detection Techniques and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Generative Adversarial Networks and Image Synthesis
Keywords
novelty detection, one-class classification, generative adversarial networks, adversarial learning, anomaly detection, outlier detection, video anomaly detection, image anomaly detection, unsupervised learning

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.

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