Cited by 1,799Advanced Neural Network ApplicationsAdversarial Robustness in Machine LearningDomain Adaptation and Few-Shot Learning

Towards Open Set Deep Networks

Open access
Bendale, Abhijit, Boult, Terrance E.·2016·2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

Abstract

Deep networks have produced significant gains for various visual recognition problems, leading to high impact academic and commercial applications. Recent work in deep networks highlighted that it is easy to generate images that humans would never classify as a particular object class, yet networks classify such images high confidence as that given class - deep network are easily fooled with images humans do not consider meaningful. The closed set nature of deep networks forces them to choose from one of the known classes leading to such artifacts. Recognition in the real world is open set, i.e. the recognition system should reject unknown/unseen classes at test time. We present a methodology to adapt deep networks for open set recognition, by introducing a new model layer, OpenMax, which estimates the probability of an input being from an unknown class. A key element of estimating the unknown probability is adapting Meta-Recognition concepts to the activation patterns in the penultimate layer of the network. Open-Max allows rejection of "fooling" and unrelated open set images presented to the system, OpenMax greatly reduces the number of obvious errors made by a deep network. We prove that the OpenMax concept provides bounded open space risk, thereby formally providing an open set recognition solution. We evaluate the resulting open set deep networks using pre-trained networks from the Caffe Model-zoo on ImageNet 2012 validation data, and thousands of fooling and open set images. The proposed OpenMax model significantly outperforms open set recognition accuracy of basic deep networks as well as deep networks with thresholding of SoftMax probabilities.

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.2016.173

Cites

29 of 29 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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Particular challenges for animal re-identification in wild populations include difficulty of manual curation, larger populations, changes in appearance, few sightings per individual, and frequent addition of new individuals, creating an open-set problem.

    “The particular challenges for animal (re-)identification in wild populations are related to the difficulty of manual curation, larger populations, changes in appearance (e.g., due to scars, growth), few sightings per individual, and the frequent addition of new individuals that may enter the system due to birth or immigration, therefore creating an “open-set” problem104 wherein the model must deal”

    From Perspectives in machine learning for wildlife conservation (2022) · cites this paper as [104]

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: 5

  1. [7][7] A. Frome, G. S. Corrado, J. Shlens, S. Bengio, J. Dean, T. Mikolov, et al. Devise: A deep visual-semantic embed- Figure 7: The graphs shows F-Measure performance of OpenMax and Softmax with Open Set testing (using validation, fooling and open set images for testing). Each graph shows F-measure plotted against varying uncertainty threshold values. Tail size varies in different plots. OpenMax reaches its optimal performance at tail size 20. For tail sizes larger than 20, though OpenMax becomes good at rejecting images from fooling set and open set (Fig 6), it also rejects true images thus reducing accuracy on validation set. Hence, we choose tail size 20 for our experiments in main paper. <!-- image --> Figure 8: The above figure shows performance of OpenMax and Softmax as number of top classes to be considered for recalibrating are changed. In our experiments, we found best performance when top 10 classes (i.e. α = 10 ) were considered for recalibration. <!-- image --> ding model. In Advances in Neural Information Processing Systems , pages 2121-2129, 2013. 8 -
  2. [23][23] K. Simonyan and A. Zisserman. Very deep convolutional networks for large scale image recognition. In International Conference on Learning Representations . Computational and Biological Learning Society, 2015. 7 -
  3. [25][25] R. Socher, C. D. Manning, and A. Y. Ng. Learning continuous phrase representations and syntactic parsing with recursive neural networks. In Proceedings of the NIPS-2010 Deep Learning and Unsupervised Feature Learning Work- 1000 Figure 13: The above figure shows confusion matrix of distances between Mean Activation Vector (MAV) for each class in ILSVRC 2012 with MAV of every other class. Lower values of distances indicate that MAVs for respective classes are very close to each other, and higher values of distances indicate classes that are far apart. Majority of misclassifications for OpenMax happen in fine-grained categorization, which is to be expected. <!-- image --> shop , pages 1-9, 2010. 1, 7 -
  4. [27][27] C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus. Intriguing properties of neural networks. In International Conference on Learning Representations . Computational and Biological Learning Society, 2014. 2, 4, 5 -
  5. [30][30] A. Vezhnevets and V. Ferrari. Object localization in imagenet by looking out of the window. In Proceedings of the British Machine Vision Conference,(BMVC) , 2015. 8 -

Cited by

Sorted by citations

Authors
Bendale, A., & Boult, T. E.
Affiliations
University of Colorado Colorado Springs (US)
Venue
2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Publisher
IEEE
Published
2016-06
Pages
1563-1572
ISSN
1063-6919 (ISSN-L)
OpenAlex
W2272331516
Cited by
1,799
References
29
Citations by year
2026: 213 · 2025: 274 · 2024: 275 · 2023: 298 · 2022: 210 · 2021: 226 · 2020: 124 · 2019: 93 · 2018: 58 · 2017: 24 · 2016: 4
FWCI
20.42
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 › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
Keywords
open-set recognition, OpenMax, deep neural network, unknown class detection, image classification

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