Anomaly detection in video is the task of identifying frames from a video sequence which depict events that deviate significantly from the norm. Identifying such anomalous events, e.g., fires, traffic accidents or stampedes, can be of great practical importance, particularly in guiding timely responses. The task is made particularly challenging, by the fact that anomalous events are rare, visually unbounded and often unidentifiable before they occur. It is nonetheless critical in a wide variety of application areas, as it provides a method for allowing human attention to be focused on the events that are most likely to be of interest from within an otherwise overwhelming volume of video.
The practical significance of the problem has seen many methods for video anomaly detection developed. The majority of existing methods assume the availability of a labeled dataset depicting a set of ‘normal’ events. This includes the dictionary learning-based methods [4, 7, 26, 44]
and the more recently emerging deep learning-based methods[12, 14, 24, 27, 40, 42]. This assumption significantly limits their domain of application, not least because it means that the system cannot be continuously re-trained without human involvement, nor applied to database sifting . To address this issue, here we address what has been termed ‘unsupervised video anomaly detection’ [8, 40], which requires identifying abnormal frames from a large volume of video frames with no manually labeled normal/abnormal training data. This version of the problem may be the only viable approach in the many application domains where human labeling of video is extremely costly or impossible. This includes, for example, large-scale video surveillance, Internet video filtering, and industrial process safety monitoring, because in all of these cases the definition of normal events is diverse, constantly changing, and unpredictable.
Additionally, these methods often employ a two-step approach as shown in Figure 1(a). This approach first learns or extracts feature representations from labeled normal training data and then employs a deterministic anomaly measure to calculate the normal/anomaly scores based on the extracted/learned representations. This essentially separates the feature learning/extraction and anomaly detection modules, leading to inflexible and sub-optimal anomaly scoring.
Some previous studies [8, 40] address a similar problem setting to ours. Although labeled normal training data is not required, their methods typically adopt a similar two-step approach that first extracts features from test data and builds anomaly scoring models upon the extracted features.
To address the aforementioned two issues, we introduce an end-to-end approach to unsupervised video anomaly detection based on self-trained ordinal regression. Applying self-trained ordinal regression enables the development of a weakly supervised approach to the problem that is amenable to end-to-end training. End-to-end training, in turn, enables the optimization of a feature learner that is tailored specifically to anomaly detection in the target data, and an anomaly scoring process that is tailored to the output of this feature learner. The method is weakly supervised in that it is initialized using a pre-trained model (e.g., ResNet-50 ) on relevant auxiliary labeled data and initial pseudo labels of normality and abnormality generated using generic (that is, not video specific) anomaly detectors.
To apply self-training ordinal regression we formulate the problem as a surrogate two-class ordinal regression task, for which an ordinal regression  model is defined to directly learn anomaly scores for pseudo normal and anomalous frames in an iterative fashion, as shown in Figure 1(b). The initial pseudo normal and anomalous frames can be determined based on existing unsupervised methods [8, 23, 36, 40]. The ordinal regression model stacks differentiable feature representations and anomaly scoring learners for end-to-end training. The key intuition underlying this approach is as follows. Although existing methods cannot produce well optimized anomaly scores, they generally achieve good accuracy in correctly identifying a subset of normal and anomalous events. These identified normal and anomalous events can be leveraged by the end-to-end anomaly score learner to iteratively improve and optimize the anomaly scores, resulting in significantly better detection performance compared to the initial detection.
We implement our formulation as a self-trained deep ordinal regression network, which is a synthesis of convolutional network-based feature learning and fully connected network-based anomaly scoring. This facilitates end-to-end anomaly score optimization. Moreover, our model can offer two important capabilities that are difficult to achieve with existing methods. First, the nature of self-training and end-to-end learning enables effective human-in-the-loop anomaly detection. Human experts can easily interact with our model by providing it with feedback on the detected anomalies which the model can use to update itself to quickly return more accurate detection results. This is a critical capability, especially when the anomalies are rare and the cost of false-negatives is high. Second, our method can easily generate frame-level saliency maps to effectively localize the identified anomalies. In summary, we make the following two major contributions.
We show that applying self-training ordinal regression to video anomaly detection enables a novel formulation of the problem that not only eliminates the need for manually labeled training data, it enables end-to-end training, thus improving detection accuracy.
We present a novel end-to-end neural network-based anomaly detection method. The method offers three critical capabilities: i) it generates optimal anomaly scores w.r.t. the given ordinal regression loss; ii) it enables effective human-in-the-loop anomaly detection; and iii) it offers easy and accurate localization of the identified anomalies within the corresponding images. These capabilities are analyzed through extensive experiments on eight different scenes from three real-world video datasets.
1.1 Related Work
Some popular video anomaly detection approaches include low-level feature extraction [3, 21, 22, 28, 30, 41], dictionary learning [4, 6, 7, 26, 44] and deep learning [2, 5, 12, 14, 24, 27, 34, 40, 42]. The low-level feature extraction approach focuses on extracting low-level appearance , and/or dynamic features [21, 28, 30, 41], for profiling normal behaviors. The dictionary learning-based approach learns a dictionary of normal events and identifies the events that cannot be well represented by the dictionary. The dictionary learning may also be applied to low-level features, such as histogram of gradient (HoG) or histogram of optical flow (HoF) features [7, 44], and 3D gradient features . There have been other approaches that aim to model normal events with compact representations, such as hashing-based methods  and clustering [22, 38]. The deep learning-based approach also aims to learn a model of normal events. Most deep learning-based methods use reconstruction error to measure divergence of the test data from a set of normal training videos [2, 5, 12, 14, 27, 34, 42]. Future frame prediction is an alternative deep-learning approach explored in . The aforementioned approaches [4, 5, 7, 12, 14, 21, 22, 24, 26, 27, 34, 38, 42, 43, 44] often require manually labeled normal video samples to train their models. Unlike these approaches, our approach does not require manual annotation of normal/abnormal data.
Some recent work [8, 40] addressed a similar problem setting to ours. Permutation tests are used in  to define the anomaly scores by evaluating the discriminativeness of a given frame in different groups of frames. Unmasking  is exploited in [40, 25]
to measure the anomalousness by the classification accuracy changes resulting from unmasking. These methods generally include two main steps: feature extraction/learning and anomaly scoring, which are performed separately. This simplifies the feature extraction/learning problem but leads to a feature transform that is not optimized for the problem, or the data. By contrast, our approach unifies these two steps to enable end-to-end optimization of the whole anomaly identification process. Studies have addressed the same problem setting in the machine learning community, such as current state-of-the-art methods Sp[36, 33] and iForest . Note that they operate on traditional features and their effectiveness on video data is rarely explored.
2 Problem Formulation
The problem that we aim to address is end-to-end learning of anomaly scores for a set of video frames with no manually labeled normal/abnormal data. Formally, given a set of video frames with no class label information, our goal is to learn an anomaly scoring function that directly assigns anomaly scores to the video frames such that if is an anomalous frame and is a normal frame.
We formulate this problem as a self-training ordinal regression task. Specifically, let be augmented scalar ordinal class labels with , be a set of anomalous frame candidates with each frame having an ordinal label , () be a set of normal frame candidates with each frame having an ordinal label , then the anomaly score learner can be formulated as
is a regression loss function andand .
One critical idea in the ordinal regression theory is to leverage the ordinal dependence in the supervision information to learn an optimal sample ranking function [29, 10]. To apply this idea to optimize the ranking of anomalies, we devise the self-training ordinal regression. As , optimizing the objective in Eqn. (1) will identify corresponding to a version of that assigns scores to such that suspicious abnormal and normal samples have anomaly scores as close to respective and as possible, yielding an optimal anomaly ranking.
Since contains high-dimensional samples, we often need to map the data onto a low-dimensional space before the anomaly scoring. Let be a feature mapping function with parameters and be an anomaly scoring function with parameters , then Eqn. (1) can break down into
To enable end-to-end training, we need to address two main problems. First, it requires that and can be simultaneously optimized. As is discussed in Section 3.2, deep neural networks can be designed to address this problem. Second, we need to generate and since they are unknown in the first place. To tackle this problem, we first initialize and using anomaly scores generated by some existing unsupervised anomaly detection methods (see Section 3.1), and we iteratively update and and retrain until the best is achieved (see Section 3.3).
The key idea of this formulation is that existing anomaly detection methods are able to identify frames that are clearly members of and , but are unable to expand these sets to accurately cover
. The proposed approach uses each estimate ofand to further optimize the anomaly scores. These scores then, in turn, help generate new, more accurate, sets and . This iterative self-training achieves much better detection performance and coverage than the initial detection methods support.
It is important to note that the initial set need not span the anomalies in , and may even erroneously contain elements of . The iterative process means that the model implicitly defined by is continually being refined. The membership of and is thus constantly being updated to improve their quality.
3 The Proposed Method
Our formulation is implemented as a self-training deep neural network for ordinal regression. As shown in Figure 2, our method consists of three major modules. The first module carries out the initial anomaly detection, which yields the initial membership of and . These are then fed into the end-to-end anomaly scoring module to optimize and thus the anomaly scores. A corresponding new set of anomaly scores are then generated, which are used to update the membership of and .
3.1 Initial Anomaly Detection
The role of the initial anomaly detection is to obtain a set of frames that can be identified as belonging to and
with high probability. To achieve this, two state-of-the-art unsupervised anomaly detection methods, Sp[36, 33] and iForest 
, which are designed for feature vector-based data, are employed to perform the initialization. Combining anomaly scores from different anomaly detectors allows to identify anomalies with different characteristics and improves the subsequent anomaly candidate selection. Sp is a very simple yet effective and provable method, which defines the anomaly score of a given example as the nearest neighbor distance in a small random subsample of the full dataset. Letbe a function that extracts feature vectors from a video frame and , its anomaly score is
where is a random subset of and represents the Euclidean distance. To obtain statistically stable performance, for each , we use the average of a bootstrap aggregating of scores to be the final anomaly score .
iForest  is probably the most widely-used unsupervised anomaly detection method for traditional general multidimensional data in recent years. It posits that anomalies are susceptible to isolation and builds isolation trees on random data subspaces to identify them. Each tree is grown by using a random subsample until every data example is isolated, where the feature and cut-point at each tree node are randomly selected. The inverse of the path length traversed from the root to a leaf node by is used as its anomaly score
where denotes the path length of in , is the average path length of over isolation trees, and is the expected path length for a given subsample size.
We rescale the two sets of anomaly scores from these two detectors into the same range and use their average as the initial anomaly scores. We then use these anomaly scores to include the most likely anomalous frames into the pseudo anomaly set and the most likely normal frames into the pseudo normal set (see Section 4.1 for detail).
3.2 End-to-end Anomaly Score Learner
The end-to-end anomaly score learner takes and as inputs and learns to optimize the anomaly scores such that the data inputs of similar behaviors as those in () receive large (small) scores. The score learner can be defined as a function , which is a sequential stack of a feature representation learner and an anomaly score learner , where is an intermediate feature representation space and contains all the parameters to be learned.
Specifically, the feature learner is specified as a network with hidden layers and their weights , and can be represented as
where and . Different backbones can be used here. We implement using ResNet-50  due to its superior capability of capturing frame appearance features.
The anomaly score learner is specified as a fully connected two-layer neural network. The network consists of a hidden layer with 100 units and an output layer with a single linear unit:
where , is a matrix transpose operation, maps the ResNet-50 features to the hidden layer and contains the weight parameters of this scoring learner. Thus, can be formally represented as
which directly maps raw visual inputs to scalar anomaly scores and can be trained in an end-to-end fashion by minimizing the following loss function:
where when and when . Since takes two scalar ordinal values only, it is a two-class ordinal regression.
The absolute loss is employed together with stochastic gradient descent-based optimization to reduce the negative effects brought by false pseudo labels inand . Minimizing this loss enforces an anomaly score close to () for any frames having similar features as the frames in (), resulting in larger anomaly scores assigned to anomalous frames than normal frames.
3.3 Iterative Learning via Self-training
We further perform iterative learning using a self-training approach  to iteratively improve our anomaly detector. The intuition is that the initial anomaly detection results can pose limitations on the performance of our end-to-end anomaly score learner, since our score learner is dependent on the quality of pseudo normal and anomalous frames; on the other hand, our end-to-end anomaly score optimization is expected to produce better anomaly scores than the initial anomaly scores, so it can provide pseudo normal and anomalous frames of better quality and in turn improve its self-performance.
Self-training, a.k.a. self-learning, is a classic semi-supervised learning approach. It first trains a model using a small labeled dataset and then applies the trained model to unlabeled data to generate more reliable labeled data. Since we do not have any labeled data, we present a simple strategy to adapt the self-training to an unsupervised setting. Particularly, at each iteration of the iterative learning, instead of incrementally adding more labeled data, we use the newly obtained pseudo labels,and , to replace the previous ones and then retrain the end-to-end anomaly learner . The main reason for discarding the previous and is because combining the previous and newly obtained pseudo labels without supervision information can result in worse pseudo labels. We found empirically that this simple strategy worked very well on different datasets.
Each iteration outputs an optimized , so the iterative learning results in a set of trained models. Similar to sequential ensemble learning , we perform an average aggregation of all the sequentially output models to achieve stable detection performance. Specifically, the final anomaly score of a given is defined as
where is the optimized model at the th iteration.
4.1 Implementation Details
The initial anomaly detectors, Sp and iForest, are implemented using scikit-learn. They are used with recommended settings as in [23, 33]. Since both Sp and iForest only work on feature vectors, we need to transform video data into feature vectors before applying them. Specifically, we first extract features using the last dense layer of the pre-trained ResNet-50 and then apply PCA to reduce the dimensionality using the most important 100 components.
For the end-to-end anomaly score learner, the pre-trained ResNet-50111ResNet-50 is used since this work examines appearance-based anomalies only, which is one of the most common anomalies in video data.; the output layer contains a linear unit; and and are used in the pseudo ordinal class labels to guide the learning (our model also worked well with other settings of and as long as was sufficiently larger than
). The Stochastic Gradient Descent (SGD) optimizer with a learning rate 0.005 is used throughout all the experiments. The batch size and the number of epochs are respectively set to 128 and 50 by default.
To obtain a set of reliable pseudo anomalous frames, we need to determine with a sufficiently high confidence level. Particularly, we include the 10% most anomalous frames into
according to their anomaly scores, because anomaly scores often follow a Gaussian distribution and this decision threshold can provide an approximate 90% confidence level of making false positive errors in such cases. However, we may still include normal frames into . We further tackle this problem using a weighted random sampling-based mini-batch generation method, i.e., sampling examples from with a probability positively proportional to their anomaly scores. To generate the pseudo normal frame set , we select the 20% most normal frames based on the anomaly scores. This can always help to achieve a high-quality because of the overwhelming presence of normal frames in the real-word datasets. These two cutoff thresholds are used by default as they consistently obtain substantially improved performance on datasets with diverse anomaly rates (see Table 1 and Figure 5 for detail).
In the iterative learning, extensive results showed that our model could often be substantially improved in the first multiple iterations and then plateaued out. Thus, we perform the iterative learning for five iterations by default.
Three real-world datasets are used in our experiments:
UCSD . This data is one of the most challenging anomaly detection datasets. It contains the UCSD Pedestrian 1 data (Ped1) and the UCSD Pedestrian 2 data (Ped2). Ped1 consists of 34 training and 36 test videos, while Ped2 contains 16 training and 12 test videos. The anomalies are vehicles, bicycles, skate borders and wheelchairs crossing the pedestrian areas.
Subway . This is one of the largest datasets for video anomaly detection. It includes two videos: the Entrance gate video of 96 minutes and the Exit gate video of 43 minutes. The anomalies are passengers walking towards a wrong direction or escaping tickets.
UMN . The UMN dataset contains three different scenes, each with 1,453, 4,144, and 2,144 frames, respectively. In each scene, the normal activity is people casually walking around while the anomalous activity is people running in all directions.
Note that anomalies are rare events in real-world applications, but this is violated if only the test set of these datasets are used, because these test sets can contain a large percentage of anomalous events, e.g., nearly 50% anomalies in the UCSD test sets. Such test sets are not applicable in our setting. We address this problem by merging the training and test sets, and train and evaluate our model on the full dataset with the ground truth used in the evaluation only. This applies to the competing methods unless stated otherwise.
4.3 Performance Evaluation Metrics
, the area under the ROC curve (AUC) is used as the evaluation metric. AUC is calculated using the frame-level anomaly scores and ground truth. The equal error rate (EER) has also been used as the evaluation metric in some previous work, but we agree with that this metric can be misleading for many real-world applications where the anomalies are very rare. Therefore, we do not use the EER in our evaluation.
4.4 Effectiveness in Real-world Datasets
As shown in Table 1, we first examine the performance of our method by comparing to 17 state-of-the-art methods. On all of the scenes, our method is consistently the best performer among the unsupervised methods [23, 36, 8] that are evaluated using the same evaluation protocol. Specifically, compared to Sp + iForest [23, 36] that provides initial anomaly detection results for our method, our method achieves about 2%-15% AUC improvement. It is impressive that we obtain more than 15% improvement on UCSD-Ped1 and UCSD-Ped2 where Sp + iForest works less effectively, and that we can also obtain remarkable 8%-12% improvement on different scenes of the UMN data where Sp + iForest performs very well. This demonstrates our method’s capability in producing significantly better anomaly scores than the initial scores when the initial detectors perform either fairly well or very well. To have a fair and straightforward comparison with the discriminative framework-based method , our method is compared with its two variants: the first variant, namely Del Giorno et al.  #1 in Table 1, uses ResNet-50 and PCA to extract features as the input to the discriminative framework; and the second variant, namely Del Giorno et al.  #2 in Table 1, uses the features extracted from the last dense layer in our trained model. The results show that our method achieves about 5%-25% AUC improvement over both cases of Del Giorno et al.  on all the datasets.
|Training Data||Method||Ped1||Ped2||Entrance||Exit||Scene1||Scene2||Scene3||All Scenes|
|Labeled normal data||Kim et al. ||59.0%||69.3%||-||-||-||-||-||-|
|Mahadevan et al. ||81.8%||82.9%||-||-||-||-||-||-|
|Mehran et al. ||67.5%||55.6%||-||-||-||-||-||96.0%|
|Cong et al. ||-||-||80.0%||83.0%||99.5%||97.5%||96.4%||97.8%|
|Xu et al. ||92.1%||90.8%||-||-||-||-||-||-|
|Sun et al. ||93.8%||94.1%||-||-||99.8%||99.3%||99.9%||99.7%|
|Zhang et al. ||87.0%||91.0%||-||-||99.2%||98.3%||99.9%||99.7%|
|Liu et al. ||83.1%||95.4%||-||-||-||-||-||-|
|Nguyen et al. ||-||96.2%||-||-||-||-||-||-|
|Dong et al. ||-||94.1%||-||-||-||-||-||-|
|Ionescu et al. ||-||97.8%||-||-||-||-||-||99.6%|
|Ionescu et al. ||-||-||93.5%||95.1%||99.9%||98.2%||99.8%||99.3%|
|No labeled data||Ionescu et al. ||68.4%||82.2%||70.6%||85.7%||99.3%||87.7%||98.2%||95.1%|
|Liu et al. ||69.0%||87.5%||71.6%||93.1%||-||-||-||95.2%|
|Del Giorno et al.  #1||50.3%||63.0%||70.7%||86.8%||82.5%||83.5%||87.4%||76.5%|
|Del Giorno et al.  #2||59.6%||57.6%||74.6%||87.2%||80.2%||88.3%||77.1%||84.8%|
|Sp + iForest [23, 36]||56.3%||67.5%||80.5%||91.0%||87.3%||88.1%||91.5%||87.1%|
Compared to the unmasking framework , our method performs substantially better on the challenging cases UCSD-Ped1, Subway-Entrance, Subway-Exit and UMN-Scene2 by a margin of respective 3%, 17%, 7% and 12%, and performs comparably better on the other datasets. The unmasking method is improved by a two-sample test method in . Our method retains similar improvement over this variant on all scenes except UCSD-Ped2 and Subway-Exit. Note the results of the unmasking method and its variant are respectively taken from  and  based on an evaluation protocol different from ours, i.e., they are evaluated on the test data rather than the full data.
Compared to the upper block methods, it is very impressive that our method 1) achieves large improvement over several of these methods, such as Kim et al. , Mahadevan et al.  and Mehran et al.  on the UCSD data and Cong et al.  on the Subway and UMN datasets; and 2) performs comparably well to the best methods [38, 43, 15, 16] on the UMN data. However, it is clear that our AUC score is 10%-22% lower than the methods [24, 38, 43] on the UCSD data, showing the substantial gap between these two types of methods on the very challenging data. Note that the upper block competing methods are also based on a different setting from ours and taken here for a high-level comparison only.
4.5 Human-in-the-loop Anomaly Detection
Existing methods are lack of explicit prior knowledge of anomalies. As a result, many anomalous events they identify are data noises. This section examines whether our method can effectively interact with human experts to leverage their feedback on the anomalies of their interest to iteratively enhance our model and reduce such false positives. We simulate the interaction as follows. First, our model presents a small set of top-ranked anomalous frames to an expert. The expert then picks up two sets of frames (), with one set of frames believed to be the anomalies of interest and another set to be normal events. These frames are employed to fine-tune our model with 20 epochs. After that, an updated anomaly ranking is again presented to the expert for the feedback. This human-machine interaction can repeat until the expert obtains the most satisfactory anomaly ranking results. To better exploit the feedback, we also include the temporally adjacent frames of the selected frames with the same label (e.g., the adjacent 5 frames to the selected frame) into our fine-tuning process.
Figure 3 shows empirical results on two representative datasets, UCSD-Ped1 and Subway-Exit, with and . UCSD-Ped1 represents a challenging scene with large improvement space, while Subway-Exit represents a less challenging scene yet with small improvement space. Our method can well leverage the limited human feedback per interaction to gradually and consistently reduce the false positive errors, achieving more than 6% AUC improvement on both datasets after 5-round interactions.
4.6 Localizing the Identified Anomalies
The end-to-end learning of anomaly scores also enables us to leverage existing deep neural network interpretation techniques to localize and understand the anomalous patches within a given frame that are responsible for large anomaly scores. Here we adapt the state-of-the-art method, class activation map (CAM) , to achieve this goal. Particularly, for a given frame , let be the activation of an unit in the last convolutional layer at a spatial location and be the weight for the unit w.r.t. anomaly scoring, then based on  we can obtain , where is the class activation map. The frame-level saliency map can then be obtained by upsampling the class activation map to the size of the input frame . The CAM-based saliency maps corresponding to some exemplar anomalies are shown in Figure 4. We can see that the regions corresponding to the anomalous events of the frames are well highlighted with high activation values in all four different scenes. Although our method may be also distracted by normal patches in some cases, such as the upper patch in Figure 4(b), it is very impressive for an unsupervised anomaly detection method to achieve such effective anomalous region localization.
4.7 Ablation Study
Initial Anomaly Detection. The stability of labeling pseudo anomalies and normal data using the two fixed cut-off thresholds is examined by looking into the AUC performance on datasets with different anomaly rates, including 5%, 10%, 15% and 20%. The results on Ped1 and Ped2 are shown in Figure 5, with Sp + iForest used as baseline. This experiment is not applicable on the other datasets as their anomaly rates are too small. The results show that, despite the anomaly rate varies significantly across the examined cases, our method with the default cut-offs can consistently achieve substantial AUC improvement over the baseline that we use to generate initial pseudo labels. This frees us from tuning the cutoffs on different scenarios. Note that the increasing performance with increasing anomaly rates is mainly due to the fact that it becomes easier to obtain better AUC performance when the anomaly rate is larger.
Network Architecture. We replace ResNet-50 with VGG  and 3DConv  to examine the use of different architectures. The results are shown in Table 2. It is clear that our method can work very well using different popular backbones with either shallower or higher-dimensional convolutional architectures. This indicates that our performance is not dependent on specific backbones.
Self-training. To examine the self-training module, Figure 6 shows the AUC results of our method at each iteration during self-training. Our performance gets larger improvement with increasing iterations in the first few iterations on most datasets and then becomes stable at the 4th or 5th iteration. This shows that the self-training approach can iteratively improve the performance of our method. However, it should be noted that the performance of our method is bounded at some points when no extra information is provided, so we stop the iterative learning after a few iterations. We found empirically that five iterations are often sufficient to reach the possibly best performance on different datasets.
End-to-end Anomaly Score Learner. The importance of the end-to-end anomaly score learning is manifested by comparing the results of our method to Del Giorno et al.  #2 in Table 1. The anomaly scoring of our method and Del Giorno et al.  #2 take exactly the same feature inputs, but our method achieves consistently large improvement over Del Giorno et al.  #2 on all the datasets. This is because the input features are optimized as an integrated part in our end-to-end score learning, resulting in optimal anomaly scores; whereas the two-step methods like Del Giorno et al.  #2 on one hand rely on the quality of input feature representations while on the other hand cannot unify the feature extractor/learner and anomaly scoring, leading to much less effective performance.
We have shown that framing video anomaly detection as a self-training deep ordinal regression task overcomes some of the key limitations of existing approaches to this important problem. We additionally devised an end-to-end trained approach that outperforms the current state-of-the-art by a significant margin. Two key insights gained are that (1) the end-to-end learning enables better optimized anomaly scores than the two-step approach and (2) the self-training ordinal regression approach can be leveraged by our end-to-end anomaly score learner to iteratively enhance detection performance. Furthermore, our method offers some crucial capabilities, including human-in-the-loop anomaly detection and accurate anomaly localization. We are working on incorporating other features such as motion features into our model to identify other types of anomalies.
Acknowledgments XB was in part supported by the NSFC project #61772057 and BNSF project #4202039.
-  UMN unusual crowd activity data set. http://mha.cs.umn.edu/Movies/Crowd-Activity-All.avi.
Davide Abati, Angelo Porrello, Simone Calderara, and Rita Cucchiara.
Latent space autoregression for novelty detection.In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 481–490, 2019.
-  Amit Adam, Ehud Rivlin, Ilan Shimshoni, and Daviv Reinitz. Robust real-time unusual event detection using multiple fixed-location monitors. IEEE Trans. Pattern Anal. Mach. Intell., 30(3):555–560, 2008.
-  Kai-Wen Cheng, Yie-Tarng Chen, and Wen-Hsien Fang. Video anomaly detection and localization using hierarchical feature representation and gaussian process regression. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 2909–2917, 2015.
Yong Shean Chong and Yong Haur Tay.
Abnormal event detection in videos using spatiotemporal autoencoder.In Proc. Int. Symp. Neural Networks, pages 189–196, 2017.
-  Wenqing Chu, Hongyang Xue, Chengwei Yao, and Deng Cai. Sparse coding guided spatiotemporal feature learning for abnormal event detection in large videos. IEEE Trans. Multimedia, 21(1):246–255, 2018.
-  Yang Cong, Junsong Yuan, and Ji Liu. Sparse reconstruction cost for abnormal event detection. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 3449–3456, 2011.
-  Allison Del Giorno, J Andrew Bagnell, and Martial Hebert. A discriminative framework for anomaly detection in large videos. In Proc. Eur. Conf. Comp. Vis., pages 334–349, 2016.
-  Dong Gong, Lingqiao Liu, Vuong Le, Budhaditya Saha, Moussa Reda Mansour, Svetha Venkatesh, and Anton van den Hengel. Memorizing normality to detect anomaly: Memory-augmented deep autoencoder for unsupervised anomaly detection. In Proc. IEEE Int. Conf. Comp. Vis., 2019.
-  Pedro Antonio Gutiérrez, Maria Perez-Ortiz, Javier Sanchez-Monedero, Francisco Fernandez-Navarro, and Cesar Hervas-Martinez. Ordinal regression methods: survey and experimental study. IEEE Trans. Knowl. Data Eng., 28(1):127–146, 2016.
-  Alex Hanson, PNVR Koutilya, Sanjukta Krishnagopal, and Larry Davis. Bidirectional convolutional lstm for the detection of violence in videos. In Proc. Eur. Conf. Comp. Vis., pages 280–295, 2018.
-  Mahmudul Hasan, Jonghyun Choi, Jan Neumann, Amit K Roy-Chowdhury, and Larry S Davis. Learning temporal regularity in video sequences. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 733–742, 2016.
-  Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Deep residual learning for image recognition. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 770–778, 2016.
-  Ryota Hinami, Tao Mei, and Shin’ichi Satoh. Joint detection and recounting of abnormal events by learning deep generic knowledge. In Proc. IEEE Int. Conf. Comp. Vis., pages 3619–3627, 2017.
-  Radu Tudor Ionescu, Fahad Shahbaz Khan, Mariana-Iuliana Georgescu, and Ling Shao. Object-centric auto-encoders and dummy anomalies for abnormal event detection in video. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 7842–7851, 2019.
-  Radu Tudor Ionescu, Sorina Smeureanu, Marius Popescu, and Bogdan Alexe. Detecting abnormal events in video using narrowed normality clusters. In Proc. Winter Conf. Appl. Comp. Vis., pages 1951–1960. IEEE, 2019.
-  Jaechul Kim and Kristen Grauman. Observe locally, infer globally: a space-time mrf for detecting abnormal activities with incremental updates. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 2921–2928, 2009.
-  Moshe Koppel, Jonathan Schler, and Elisheva Bonchek-Dokow. Measuring differentiability: Unmasking pseudonymous authors. J. Machine Learning Research, 8(Jun):1261–1276, 2007.
Hans-Peter Kriegel, Peer Kroger, Erich Schubert, and Arthur Zimek.
Interpreting and unifying outlier scores.In Proc. SIAM Int. Conf. Data Mining, pages 13–24, 2011.
-  Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. Deep learning. Nature, 521(7553):436, 2015.
-  Weixin Li, Vijay Mahadevan, and Nuno Vasconcelos. Anomaly detection and localization in crowded scenes. IEEE Trans. Pattern Anal. Mach. Intell., 36(1):18–32, 2014.
-  Hanhe Lin, Jeremiah Deng, Brendon Woodford, and Ahmad Shahi. Online weighted clustering for real-time abnormal event detection in video surveillance. In Proc. ACM Int. Conf. Multimedia, pages 536–540. ACM, 2016.
-  Fei Tony Liu, Kai Ming Ting, and Zhi-Hua Zhou. Isolation-based anomaly detection. ACM Transactions on Knowledge Discovery from Data, 6(1):3, 2012.
-  Wen Liu, Weixin Luo, Dongze Lian, and Shenghua Gao. Future frame prediction for anomaly detection–a new baseline. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 6536–6545, 2018.
-  Yusha Liu, Chun-Liang Li, and Barnabás Póczos. Classifier two sample test for video anomaly detections. In Proc. British Machine Vis. Conf., 2018.
-  Cewu Lu, Jianping Shi, and Jiaya Jia. Abnormal event detection at 150 fps in matlab. In Proc. IEEE Int. Conf. Comp. Vis., pages 2720–2727, 2013.
-  Weixin Luo, Wen Liu, and Shenghua Gao. A revisit of sparse coding based anomaly detection in stacked rnn framework. In Proc. IEEE Int. Conf. Comp. Vis., pages 341–349, 2017.
-  Vijay Mahadevan, Weixin Li, Viral Bhalodia, and Nuno Vasconcelos. Anomaly detection in crowded scenes. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 1975–1981, 2010.
-  Peter McCullagh. Regression models for ordinal data. J. Royal Statistical Society: Series B (Methodological), 42(2):109–127, 1980.
-  Ramin Mehran, Alexis Oyama, and Mubarak Shah. Abnormal crowd behavior detection using social force model. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 935–942, 2009.
-  Trong Nguyen Nguyen and Jean Meunier. Anomaly detection in video sequence with appearance-motion correspondence. In Proc. IEEE Int. Conf. Comp. Vis., 2019.
-  Guansong Pang, Chunhua Shen, and Anton van den Hengel. Deep anomaly detection with deviation networks. In Proc. ACM SIGKDD Int. Conf. Knowledge discovery & data mining, pages 353–362, 2019.
-  Guansong Pang, Kai Ming Ting, and David Albrecht. Lesinn: Detecting anomalies by identifying least similar nearest neighbours. In Proc. IEEE Int. Conf. Data Mining Workshop, pages 623–630. IEEE, 2015.
-  Mohammad Sabokrou, Mohammad Khalooei, Mahmood Fathy, and Ehsan Adeli. Adversarially learned one-class classifier for novelty detection. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 3379–3388, 2018.
-  Karen Simonyan and Andrew Zisserman. Very deep convolutional networks for large-scale image recognition. In Proc. Int. Conf. Learn. Representations, 2015.
Mahito Sugiyama and Karsten Borgwardt.
Rapid distance-based outlier detection via sampling.In Proc. Advances in Neural Inf. Process. Syst., pages 467–475, 2013.
-  Waqas Sultani, Chen Chen, and Mubarak Shah. Real-world anomaly detection in surveillance videos. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 6479–6488, 2018.
-  Qianru Sun, Hong Liu, and Tatsuya Harada. Online growing neural gas for anomaly detection in changing surveillance scenes. Pattern Recognition, 64:187–201, 2017.
-  Du Tran, Lubomir Bourdev, Rob Fergus, Lorenzo Torresani, and Manohar Paluri. Learning spatiotemporal features with 3d convolutional networks. In Proc. IEEE Int. Conf. Comp. Vis., pages 4489–4497, 2015.
-  Radu Tudor Ionescu, Sorina Smeureanu, Bogdan Alexe, and Marius Popescu. Unmasking the abnormal events in video. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 2895–2903, 2017.
-  Shandong Wu, Brian Moore, and Mubarak Shah. Chaotic invariants of lagrangian particle trajectories for anomaly detection in crowded scenes. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 2054–2060, 2010.
-  Dan Xu, Elisa Ricci, Yan Yan, Jingkuan Song, and Nicu Sebe. Learning deep representations of appearance and motion for anomalous event detection. In Proc. British Machine Vis. Conf., 2015.
-  Ying Zhang, Huchuan Lu, Lihe Zhang, Xiang Ruan, and Shun Sakai. Video anomaly detection based on locality sensitive hashing filters. Pattern Recognition, 59:302–311, 2016.
-  Bin Zhao, Li Fei-Fei, and Eric P Xing. Online detection of unusual events in videos via dynamic sparse coding. In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 3313–3320, 2011.
Bolei Zhou, Aditya Khosla, Agata Lapedriza, Aude Oliva, and Antonio Torralba.
Learning deep features for discriminative localization.In Proc. IEEE Conf. Comp. Vis. Patt. Recogn., pages 2921–2929, 2016.
-  Zhi-Hua Zhou. Ensemble methods: foundations and algorithms. Chapman and Hall/CRC, 2012.
Xiaojin Zhu and Andrew B Goldberg.
Introduction to semi-supervised learning.
Synthesis Lectures on Artificial Intelligence and Machine Learning, 3(1):1–130, 2009.