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.
Several previous works show that self-representation is a useful tool for outlier or novelty event detection. For instance, @cite_12 @cite_2 proposed self-representation techniques for video anomaly detection and outlier detection through learning a sparse representation model, as a measure for separating inlier and outlier samples. It is assumed that outlier or novel samples are not sparsely represented using the samples from the target class. In some other works (like @cite_30 @cite_12 ), testing samples are reconstructed using the samples from the target class. The decision if it is an inlier or outlier (novel) is made based on the reconstruction error, , high reconstruction error for a sample indicates that it is more probably an outlier sample. In another work, Liu al @cite_39 proposed to use a low-rank self-representation matrix in place of a sparse representation, penalized by the sum of unsquared self-representation errors. This penalization leads to more robustness against outliers (similar to @cite_52 ). Similarly, auto-encoders are also exploited to model and measure the reconstruction error for the related tasks of outlier removal and video anomaly detection, in @cite_2 @cite_27 .
@cite_30 @cite_52 @cite_39 @cite_27 @cite_2 @cite_12
2194550927 2188862323 79405465 2337453828 2012931101
We present a novel unsupervised deep learning framework for anomalous event detection in complex video scenes. While most existing works merely use hand-crafted appearance and motion features, we propose Appearance and Motion DeepNet (AMDN) which utilizes deep neural networks to automatically learn feature representations. To exploit the complementary information of both appearance and motion patterns, we introduce a novel double fusion framework, combining both the benefits of traditional early fusion and late fusion strategies. Specifically, stacked denoising autoencoders are proposed to separately learn both appearance and motion features as well as a joint representation (early fusion). Based on the learned representations, multiple one-class SVM models are used to predict the anomaly scores of each input, which are then integrated with a late fusion strategy for final anomaly detection. We evaluate the proposed method on two publicly available video surveillance datasets, showing competitive performance with respect to state of the art approaches. A wide spectrum of discriminative methods is increasingly used in diverse applications for classification or regression tasks. However, many existing discriminative methods assume that the input data is nearly noise-free, which limits their applications to solve real-world problems. Particularly for disease diagnosis, the data acquired by the neuroimaging devices are always prone to different sources of noise. Robust discriminative models are somewhat scarce and only a few attempts have been made to make them robust against noise or outliers. These methods focus on detecting either the sample-outliers or feature-noises. Moreover, they usually use unsupervised de-noising procedures, or separately de-noise the training and the testing data. All these factors may induce biases in the learning process, and thus limit its performance. In this paper, we propose a classification method based on the least-squares formulation of linear discriminant analysis, which simultaneously detects the sample-outliers and feature-noises. The proposed method operates under a semi-supervised setting, in which both labeled training and unlabeled testing data are incorporated to form the intrinsic geometry of the sample space. Therefore, the violating samples or feature values are identified as sample-outliers or feature-noises, respectively. We test our algorithm on one synthetic and two brain neurodegenerative databases (particularly for Parkinson's disease and Alzheimer's disease). The results demonstrate that our method outperforms all baseline and state-of-the-art methods, in terms of both accuracy and the area under the ROC curve. We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowest-rank representation among all the candidates that represent all vectors as the linear combination of the bases in a dictionary. Unlike the well-known sparse representation (SR), which computes the sparsest representation of each data vector individually, LRR aims at finding the lowest-rank representation of a collection of vectors jointly. LRR better captures the global structure of data, giving a more effective tool for robust subspace segmentation from corrupted data. Both theoretical and experimental results show that LRR is a promising tool for subspace segmentation. A fast and accurate video anomaly detection and localisation method is presented. The speed and localisation accuracy are two ongoing challenges in real-world anomaly detection. We introduce two novel cubic-patch-based anomaly detector where one works based on power of an auto-encoder (AE) on reconstituting an input video patch and another one is based on the power of sparse representation of an input video patch. It is found that if an AE is efficiently trained on all normal patches, the anomaly patch in testing phase has a more reconstruction error than a normal patch. Also if a sparse AE is learned based on normal training patches, we expect that the given patch to AE is represented sparsely. If the representation is not enough sparse it is considered as a good candidate to be anomaly. For being more fast, these two detectors are combined as a cascade classifier. First, all small patches on test video frame are scanned, those which have not enough sparse representation are resized and sent to next detector for more careful evaluation. The experiment results show that the method mentioned here has a better performance especially in run-time measure than state-of-the-art methods on two UMN and UCSD benchmarks. We propose to detect abnormal events via a sparse reconstruction over the normal bases. Given an over-complete normal basis set (e.g., an image sequence or a collection of local spatio-temporal patches), we introduce the sparse reconstruction cost (SRC) over the normal dictionary to measure the normalness of the testing sample. To condense the size of the dictionary, a novel dictionary selection method is designed with sparsity consistency constraint. By introducing the prior weight of each basis during sparse reconstruction, the proposed SRC is more robust compared to other outlier detection criteria. Our method provides a unified solution to detect both local abnormal events (LAE) and global abnormal events (GAE). We further extend it to support online abnormal event detection by updating the dictionary incrementally. Experiments on three benchmark datasets and the comparison to the state-of-the-art methods validate the advantages of our algorithm.