We propose a deep learning-based solution for the problem of feature learning in one-class classification. The proposed method operates on top of a Convolutional Neural Network (CNN) of choice and produces descriptive features while maintaining a low intra-class variance in the feature space for the given class. For this purpose two loss functions, compactness loss and descriptiveness loss are proposed along with a parallel CNN architecture. A template matching-based framework is introduced to facilitate the testing process. Extensive experiments on publicly available anomaly detection, novelty detection and mobile active authentication datasets show that the proposed Deep One-Class (DOC) classification method achieves significant improvements over the state-of-the-art.
Novelty detection is the identification of new or unknown data or signal that a machine learning system is not aware of during training. Novelty detection is one of the fundamental requirements of a good classification or identification system since sometimes the test data contains information about objects that were not known at the time of training the model. In this paper we provide state-of-the-art review in the area of novelty detection based on statistical approaches. The second part paper details novelty detection using neural networks. As discussed, there are a multitude of applications where novelty detection is extremely important including signal processing, computer vision, pattern recognition, data mining, and robotics. Recently in [1], [2], a new kernel Fisher type contrast measure has been proposed to extract a target population in a data set contaminated by outliers. Although mathematically sound, this work presents some further shortcomings. First, the performance of the method relies on the assumption that the density between the target data and outliers is different. However, this consideration can easily prove to be over-optimistic for real world data sets making the method unreliable, at least directly. Secondly, this contrast measure is similar to a Generalized Rayleigh Quotient which is renowned for being sensitive to the small sample size problem. In this paper, we propose a null-space based version of their algorithm in order to unlock all these shortcomings and fully benefit from the interest of the approach. By this way, we show that the method can be used in a semi-supervised mode by considering that target objects can be beforehand collected and will serve as referentials to classify unseen objects. Experimental results on both synthetic and real data sets confirm the effectiveness of the proposed algorithm. Novelty detection, or one-class classification, aims to determine if data are "normal" with respect to some model of normality constructed using examples of normal system behaviour. If that model is composed of generative probability distributions, the extent of "normality" in the data space can be described using Extreme Value Theory (EVT), a branch of statistics concerned with describing the tails of distributions. This paper demonstrates that existing approaches to the use of EVT for novelty detection are appropriate only for univariate, unimodal problems. We generalise the use of EVT for novelty detection to the analysis of data with multivariate, multimodal distributions, allowing a principled approach to the analysis of high-dimensional data to be taken. Examples are provided using vital-sign data obtained from a large clinical study of patients in a high-dependency hospital ward. Extreme value theory is a branch of statistics that concerns the distribution of data of unusually low or high value, i.e. in the tails of some distribution. These extremal points are important in many applications as they represent the outlying regions of normal events against which we may wish to define abnormal events. In the context of density modelling, novelty detection or radial-basis function systems, points that lie outside of the range of expected extreme values may be flagged as outliers. There has been interest in the area of novelty detection, but decisions as to whether a point is an outlier or not tend to be made on the basis of exceeding some (heuristic) threshold. It is shown that a more principled approach may be taken using extreme value statistics. Detecting samples from previously unknown classes is a crucial task in object recognition, especially when dealing with real-world applications where the closed-world assumption does not hold. We present how to apply a null space method for novelty detection, which maps all training samples of one class to a single point. Beside the possibility of modeling a single class, we are able to treat multiple known classes jointly and to detect novelties for a set of classes with a single model. In contrast to modeling the support of each known class individually, our approach makes use of a projection in a joint subspace where training samples of all known classes have zero intra-class variance. This subspace is called the null space of the training data. To decide about novelty of a test sample, our null space approach allows for solely relying on a distance measure instead of performing density estimation directly. Therefore, we derive a simple yet powerful method for multi-class novelty detection, an important problem not studied sufficiently so far. Our novelty detection approach is assessed in comprehensive multi-class experiments using the publicly available datasets Caltech-256 and Image Net. The analysis reveals that our null space approach is perfectly suited for multi-class novelty detection since it outperforms all other methods. Novelty detection is the identification of new or unknown data or signal that a machine learning system is not aware of during training. In this paper we focus on neural network-based approaches for novelty detection. Statistical approaches are covered in Part 1 paper.