430,928 research outputs found
C2AE: Class Conditioned Auto-Encoder for Open-set Recognition
Models trained for classification often assume that all testing classes are
known while training. As a result, when presented with an unknown class during
testing, such closed-set assumption forces the model to classify it as one of
the known classes. However, in a real world scenario, classification models are
likely to encounter such examples. Hence, identifying those examples as unknown
becomes critical to model performance. A potential solution to overcome this
problem lies in a class of learning problems known as open-set recognition. It
refers to the problem of identifying the unknown classes during testing, while
maintaining performance on the known classes. In this paper, we propose an
open-set recognition algorithm using class conditioned auto-encoders with novel
training and testing methodology. In contrast to previous methods, training
procedure is divided in two sub-tasks, 1. closed-set classification and, 2.
open-set identification (i.e. identifying a class as known or unknown). Encoder
learns the first task following the closed-set classification training
pipeline, whereas decoder learns the second task by reconstructing conditioned
on class identity. Furthermore, we model reconstruction errors using the
Extreme Value Theory of statistical modeling to find the threshold for
identifying known/unknown class samples. Experiments performed on multiple
image classification datasets show proposed method performs significantly
better than state of the art.Comment: CVPR2019 (Oral
Evaluating Merging Strategies for Sampling-based Uncertainty Techniques in Object Detection
There has been a recent emergence of sampling-based techniques for estimating
epistemic uncertainty in deep neural networks. While these methods can be
applied to classification or semantic segmentation tasks by simply averaging
samples, this is not the case for object detection, where detection sample
bounding boxes must be accurately associated and merged. A weak merging
strategy can significantly degrade the performance of the detector and yield an
unreliable uncertainty measure. This paper provides the first in-depth
investigation of the effect of different association and merging strategies. We
compare different combinations of three spatial and two semantic affinity
measures with four clustering methods for MC Dropout with a Single Shot
Multi-Box Detector. Our results show that the correct choice of
affinity-clustering combination can greatly improve the effectiveness of the
classification and spatial uncertainty estimation and the resulting object
detection performance. We base our evaluation on a new mix of datasets that
emulate near open-set conditions (semantically similar unknown classes),
distant open-set conditions (semantically dissimilar unknown classes) and the
common closed-set conditions (only known classes).Comment: to appear in IEEE International Conference on Robotics and Automation
2019 (ICRA 2019
High stakes classification with multiple unknown classes based on imperfect data
High stakes classification refers to classification problems where
erroneously predicting the wrong class is very bad, but assigning "unknown" is
acceptable. We make the argument that these problems require us to give
multiple unknown classes, to get the most information out of our analysis. With
imperfect data we refer to covariates with a large number of missing values,
large noise variance, and some errors in the data. The combination of high
stakes classification and imperfect data is very common in practice, but it is
very difficult to work on using current methods.
We present a one-class classifier (OCC) to solve this problem, and we call it
NBP. The classifier is based on Naive Bayes, simple to implement, and
interpretable. We show that NBP gives both good predictive performance, and
works for high stakes classification based on imperfect data.
The model we present is quite simple; it is just an OCC based on density
estimation. However, we have always felt a big gap between the applied
classification problems we have worked on and the theory and models we use for
classification, and this model closes that gap. Our main contribution is the
motivation for why this model is a good approach, and we hope that this paper
will inspire further development down this path.Comment: 8 page
Robust hyperspectral image classification with rejection fields
In this paper we present a novel method for robust hyperspectral image
classification using context and rejection. Hyperspectral image classification
is generally an ill-posed image problem where pixels may belong to unknown
classes, and obtaining representative and complete training sets is costly.
Furthermore, the need for high classification accuracies is frequently greater
than the need to classify the entire image.
We approach this problem with a robust classification method that combines
classification with context with classification with rejection. A rejection
field that will guide the rejection is derived from the classification with
contextual information obtained by using the SegSALSA algorithm. We validate
our method in real hyperspectral data and show that the performance gains
obtained from the rejection fields are equivalent to an increase the dimension
of the training sets.Comment: This paper was submitted to IEEE WHISPERS 2015: 7th Workshop on
Hyperspectral Image and Signal Processing: Evolution on Remote Sensing. 5
pages, 1 figure, 2 table
- …