A deep learning based methodology for video anomaly detection in crowded scenes
Bibliographic record
Abstract
Different approaches have been proposed in the literature for anomaly detection in image/video area. Traditional methods such as trajectory or spatio-temporal based techniques rely on hand-crafted features. The occlusion problems and high complexity in crowded scenes are the vital drawbacks behind using these methodologies. Deep learning structures proved recently to be useful for defining effective solutions for anomaly detection where the high level features are learnt and selected automatically. However, the block-wise methods such as CNNs are computationally slow. On the other hand, they are totally supervised learning methodologies, while the video-based anomaly detection is an unsupervised problem. Auto- Encoders (Convolutional AE, vibrational AE, etc.) can be considered as an alternative option. This paper presents a stateof- the-art deep learning algorithm to be applied in such an unsupervised problem. Using the basic concepts behind the Auto-Encoders as a well-known unsupervised learning algorithm, we propose a novel methodology to detect and localize the anomalies in a video scene. The presented network is trained based on the normal patterns during training phase. The proposed structure enables the system to capture the 2D structure in image sequences during the learning process. The working hypothesis is that a deep network is able to learn normal events in videos, and, therefore, the difference of normal and anomalous frames can be used for devising an anomaly score. The simulation results on well-known data sets such as UCSD confirm that the proposed methodology achieves high performance results in case of accuracy and total processing time compared with counterpart approaches.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".