Detecting anomalies in security cameras with 3D-convolutional neural network and convolutional long short-term memory

This paper presents a novel deep learning-based approach for anomaly detection in surveillance films. A deep network that has been trained to recognize objects and human activity in movies forms the foundation of the suggested approach. In order to detect anomalies in surveillance films, the proposed method combines the strengths of 3D-convolutional neural network (3DCNN) and convolutional long short-term memory (ConvLSTM). From the video frames, the 3DCNN is utilized to extract spatiotemporal features,while ConvLSTM is employed to record temporal relationships between frames. The technique was evaluated on five large-scale datasets from the actual world (UCFCrime, XDViolence, UBIFights, CCTVFights, UCF101) that had both indoor and outdoor video clips as well as synthetic datasets with a range of object shapes, sizes, and behaviors. The results further demonstrate that combining 3DCNN with ConvLSTM can increase precision and reduce false positives, achieving a high accuracy and area under the receiver operating characteristic-area under the curve (ROC-AUC) in both indoor and outdoor scenarios when compared to cuttingedge techniques mentioned in the comparison

Rhizostoma optimization algorithm and its application in different real-world optimization problems

In last decade, numerous meta-heuristic algorithms have been proposed for dealing the complexity and difficulty of numerical optimization problems in the realworld which is growing continuously recently, but only a few algorithms have caught researchers’ attention. In this study, a new swarm-based meta-heuristic algorithm called Rhizostoma optimization algorithm (ROA) is proposed for solving the optimization problems based on simulating the social movement of Rhizostoma octopus (barrel jellyfish) in the ocean. ROA is intended to mitigate the two optimization problems of trapping in local optima and slow convergence. ROA is proposed with three different movement strategies (simulated annealing (SA), fast simulated annealing (FSA), and Levy walk (LW)) and tested with 23 standard mathematical benchmark functions, two classical engineering problems, and various real-world datasets including three widely used datasets to predict the students’ performance. Comparing the ROA algorithm with the latest meta-heuristic optimization algorithms and a recent published research proves that ROA is a very competitive algorithm with a high ability in optimization performance with respect to local optima avoidance, the speed of convergence and the exploration/exploitation balance rate, as it is effectively applicable for performing optimization tasks