<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CSSE</journal-id>
<journal-id journal-id-type="nlm-ta">CSSE</journal-id>
<journal-id journal-id-type="publisher-id">CSSE</journal-id>
<journal-title-group>
<journal-title>Computer Systems Science &#x0026; Engineering</journal-title>
</journal-title-group>
<issn pub-type="ppub">0267-6192</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">34805</article-id>
<article-id pub-id-type="doi">10.32604/csse.2023.034805</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>An Efficient Attention-Based Strategy for Anomaly Detection in Surveillance Video</article-title>
<alt-title alt-title-type="left-running-head">An Efficient Attention-Based Strategy for Anomaly Detection in Surveillance Video</alt-title>
<alt-title alt-title-type="right-running-head">An Efficient Attention-Based Strategy for Anomaly Detection in Surveillance Video</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Amin</surname><given-names>Sareer Ul</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Kim</surname><given-names>Yongjun</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Sami</surname><given-names>Irfan</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Park</surname><given-names>Sangoh</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>sopark@cau.ac.kr</email></contrib>
<contrib id="author-5" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Seo</surname><given-names>Sanghyun</given-names></name><xref ref-type="aff" rid="aff-4">4</xref><email>sanghyun@cau.ac.kr</email></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science and Engineering, Chung-Ang University</institution>, <addr-line>Seoul, 06974</addr-line>, 
<country>Korea</country></aff>
<aff id="aff-2"><label>2</label><institution>Intelligent Convergence Research Lab., ETRI</institution>, <addr-line>DaeJeon, 34129</addr-line>, <country>Korea</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Electrical and Electronics Engineering, Chung-Ang University</institution>, <addr-line>Seoul, 06974</addr-line>, <country>Korea</country></aff>
<aff id="aff-4"><label>4</label><institution>College of Art and Technology, Chung-Ang University</institution>, <addr-line>Anseong, 17546</addr-line>, <country>Korea</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Authors: Sangoh Park. Email: <email>sopark@cau.ac.kr</email>; Sanghyun Seo. Email: <email>sanghyun@cau.ac.kr</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2023</year></pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>31</day>
<month>3</month>
<year>2023</year>
</pub-date>
<volume>46</volume>
<issue>3</issue>
<fpage>3939</fpage>
<lpage>3958</lpage>
<history>
<date date-type="received">
<day>28</day>
<month>7</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>21</day>
<month>11</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2023 Amin et al.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Amin et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CSSE_34805.pdf"></self-uri>
<abstract>
<p>In the present technological world, surveillance cameras generate an immense amount of video data from various sources, making its scrutiny tough for computer vision specialists. It is difficult to search for anomalous events manually in these massive video records since they happen infrequently and with a low probability in real-world monitoring systems. Therefore, intelligent surveillance is a requirement of the modern day, as it enables the automatic identification of normal and aberrant behavior using artificial intelligence and computer vision technologies. In this article, we introduce an efficient Attention-based deep-learning approach for anomaly detection in surveillance video (ADSV). At the input of the ADSV, a shots boundary detection technique is used to segment prominent frames. Next, The Light-weight Convolution Neural Network (LWCNN) model receives the segmented frames to extract spatial and temporal information from the intermediate layer. Following that, spatial and temporal features are learned using Long Short-Term Memory (LSTM) cells and Attention Network from a series of frames for each anomalous activity in a sample. To detect motion and action, the LWCNN received chronologically sorted frames. Finally, the anomaly activity in the video is identified using the proposed trained ADSV model. Extensive experiments are conducted on complex and challenging benchmark datasets. In addition, the experimental results have been compared to state-of-the-art methodologies, and a significant improvement is attained, demonstrating the efficiency of our ADSV method.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Attention-based anomaly detection</kwd>
<kwd>video shots segmentation</kwd>
<kwd>video surveillance</kwd>
<kwd>computer vision</kwd>
<kwd>deep learning</kwd>
<kwd>smart surveillance system</kwd>
<kwd>violence detection</kwd>
<kwd>attention model</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Recently, the surge in the overall crime rate has become one of the leading causes of losing money and lives [<xref ref-type="bibr" rid="ref-1">1</xref>]. Advanced surveillance is the most effective method for promptly detecting such unusual events. A significant amount of attention is paid to anomaly event recognition in video surveillance due to its wide range of applications in a variety of fields, such as crime prevention, traffic safety, and intelligent video surveillance monitoring [<xref ref-type="bibr" rid="ref-2">2</xref>]. Globally, vast amounts of surveillance cameras have been installed in a variety of locations for public safety in recent years [<xref ref-type="bibr" rid="ref-3">3</xref>]. Due to the limits of manual monitoring, law enforcement agencies are unable to identify or prevent abnormal behavior. Unusual behavior must be identified using a computer vision-based system capable of classifying usual and unusual behavior without any individual involvement. Such an intelligent method is preferable for monitoring and reduces the amount of labor needed for 24-h manual observation. The literature [<xref ref-type="bibr" rid="ref-4">4</xref>&#x2013;<xref ref-type="bibr" rid="ref-6">6</xref>] provides several approaches for defining anomalous activity as &#x201C;the existence of variation in normal patterns.&#x201D; For instance, anomaly detection is addressed as a classification issue [<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-8">8</xref>], whereby visual features are fed into the algorithm, which then learns the difference between usual and unusual events. In other contexts, such as the detection of violence and road traffic accidents [<xref ref-type="bibr" rid="ref-9">9</xref>], it is recognized as a binary classification issue. However, these solutions are restricted to two kinds of behaviors: violent behavior, and normal behavior, offering only a percentage of the solution for implementation in real-world scenarios. Until now, sparse coding-based anomaly detection methods have demonstrated promising results [<xref ref-type="bibr" rid="ref-10">10</xref>&#x2013;<xref ref-type="bibr" rid="ref-12">12</xref>], and these methods are assumed to be the standard for anomaly classification. These techniques are trained so that the start segments of video clips (i.e., prior to an uncommon event) are utilized to develop a vocabulary of usual events. Despite that, this strategy is insufficient for correctly detecting aberrant activities from a dictionary of regular events. Anomaly detection strategies based on weakly-supervised Multiple-Instance Learning (MIL) are also investigated in [<xref ref-type="bibr" rid="ref-13">13</xref>]. During the training phase of this technique, the videos are separated into a predefined number of clips. These clips generate bag instances containing samples of usual and unusual events, and they can learn instance-level labels for the bags they create. Since surveillance system changes over time, sparse-coding schemes have particular problems. For example, transferring the dictionary learned from usual and unusual events, results in a high proportion of false alarms. In addition, distinguishing irregular activities in surveillance cameras is exceedingly challenging due to their low quality, high intra-class flexibility, and absence of labeled data, as anomalous activities are infrequently connected with normal appearance. Machines must rely on visual characteristics, whereas people can distinguish both typical and atypical events using their rational thinking. In general, visually robust features exceed visually weak features for event detection and recognition [<xref ref-type="bibr" rid="ref-14">14</xref>]. Existing approaches are predominantly plagued by a high rate of false alarms, resulting in poor performance. In addition, while these methods perform well with tiny datasets, their effectiveness is limited whenever applied to actual scenarios. In this research, we solve these issues by proposing a unique and optimal Light-weight technique to predict abnormalities in surveillance footage. The proposed ADSV method employs a windowing method and analyses a sequence of frames in chronological order to track motion as well as action in surveillance footage. The proposed ADSV method learns the visual unique characteristics from a series of frames per training sample by using the video&#x2019;s spatial and temporal characteristics. The prominent contribution of our research work may be summarized as follows:
<list list-type="bullet">
<list-item>
<p>An effective and efficient shot segmentation-based pre-processing strategy is proposed, wherein shots are segmented from surveillance video having anomaly activity using a shot boundary detection algorithm.</p></list-item>
<list-item>
<p>An efficient, novel and LWCNN with TimeDistributed 2D layers is proposed to extract and learn Spatial-temporal patterns from a series of frames per training sample.</p></list-item>
<list-item>
<p>The ADSV method proposes a hybrid CNN and LSTM training mode that can efficiently process sequential data and assure training speed. In addition, the unnecessary features of data will degrade the model&#x2019;s performance; hence, the attention network is employed to reallocate feature weights to maintain the model&#x2019;s performance and enhance its generalization capability.</p></list-item>
<list-item>
<p>The complex and challenging benchmark datasets UCF-Crime and CUHK-Avenue are utilized to evaluate our proposed ADSV methodology. In contrast to current anomaly detection approaches, we achieve state-of-the-art results employing our proposed ADSV system, which is accurate while requiring fewer model parameters and a smaller overall size of the model (54.1 MBs).</p></list-item>
</list></p>
<p>The remaining sections of the paper are structured as follows. Section 2 explains the review of existing techniques. The proposed methodology is explained in Section 3. The dataset&#x2019;s information, the quantitative assessment, and the explanation are provided in Section 4. The concluding thoughts and future work are presented in Section 5.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<p>The detection and recognition of anomalies in the surveillance environment have been widely researched in the past. Conventional feature-based approaches and deep feature-based approaches for abnormal event detection are the two primary categories mentioned in the literature on anomaly detection methods. In the following, prominent techniques in both categories are briefly discussed.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Conventional Feature-Based Approaches</title>
<p>Traditionally, anomaly identification mostly relied on manual, low-level feature-based approaches. These systems are grouped into three tiers: (1) Retrieval of features, which extracts low-level features from the training dataset; (2) pattern learning, which is differentiated by the dispensation of regular occurrences; and (3) anomaly identification, which identifies dissimilar patterns or deviations as abnormal occurrences. Zhang et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] used the Markov-random field to depict frequent events by employing spatial and temporal information. In a similar way, Mehran et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] proposed a social-interacting method whereby optical flow was used to recognize regular and aberrant actions and estimate cooperative forces. In addition, Nor et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] presented a paradigm for interpretable anomaly detection that aids prognostic and health management PHM. Their methodology relies on a Bayesian learning algorithm with predetermined prior and probabilities [<xref ref-type="bibr" rid="ref-18">18</xref>]. It offers additional descriptions to produce explanations locally and globally for PHM tasks. A similar Attention-based LSTM is developed by Ullah et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] for activity recognition in sports. They refined the spatial characteristics using convolution block attention. The refined extracted features are classified into various sports activities using a densely connected convolutional network with an activation function of SoftMax. Selicato et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] tried to detect abnormalities in gene data. For instance, they develop a method based on ensemble for identifying regular and aberrant expression of gene patterns by employing traditional cluster algorithms as well as principal component analysis (PCA). Riaz et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] suggested deep ensemble-based methods for anomaly detection in complicated scenarios. Furthermore, to identify human being joints, a position-based estimation technique is integrated. The identified joints are considered as features and sent to a neural network for the identification of anomalies. Lately, Zhao et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] came up with the unsupervised method that combined a time-varying-based sparsely coding style, online querying inputs, as well as sparsely reconstruction capability derived using a trained lexicon of all activities to identify irregularities in videos. However, having the ability to recognize abnormalities promptly has remained a difficulty, which has piqued the attention of experts in the field.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Deep Feature-Based Approaches</title>
<p>In the present era, deep feature-based approaches have achieved remarkable popularity in a range of unstructured multi-dimension data domains, such as activity recognition and video analysis, in comparison to conventional techniques. Luo et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] designed a technique wherein video frames are encoded with a convolutional network and unusual activities are recognized with Conv-LSTM. Furthermore, the encoder captures video deviation to identify anomalies in monitoring systems. Luo et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] developed a Conv-LSTM network with an auto-encoder for the detection of anomalies. In addition, they extended their approach by recognizing abnormalities with Recurrent Neural Network (RNN) and auto-encoder. Liu et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] introduced a method for recognizing anomalies in the video by using the spatiotemporal detector. In this model, the discriminating prominence information and a group of temporal texture information were considered as usual data activities. Chang et al. [<xref ref-type="bibr" rid="ref-25">25</xref>] introduced a cluster-based auto-encoder to efficaciously capture valuable patterns from regular activities. Two phases have been utilized to understand spatiotemporal information consistency, the spatial-auto-encoder in the first phase is responsible for the final individual frame. However, the second phase&#x2019;s temporal-auto-encoder executes and generates the RGB difference among frames. Furthermore, abnormalities in videos are identified using generative models. Sabokrou et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] developed Generative Adversarial Network (GANs) for identifying video anomalies. This network guides the normally distributed data employing GANs strategies. Recent video annotation techniques employ 3D Convolution (C3D) and MIL to detect abnormal occurrences [<xref ref-type="bibr" rid="ref-27">27</xref>]. For instance, Sultani et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] introduced a system for identifying abnormal occurrences using weak video annotations as well as the MIL technique. This system was implemented on regular as well as irregular video data by generating two different bags of usual and unusual activities and further used the MIL approach to predict the probability scores of abnormal video activity. Landi et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] suggested a method for tube extraction, which utilizes location information to construct a regression system for anomalies. Before passing the data to the regression model [<xref ref-type="bibr" rid="ref-29">29</xref>], the pooling layer integrates the spatial and temporal information of model inception and optic flow respectively. Zhong et al. [<xref ref-type="bibr" rid="ref-6">6</xref>] proposed an unsupervised method for identifying abnormalities and a supervised system for classifying actions having noise annotations. Due to the unpredictability of anomalous occurrences, the abnormal video annotations remained unclear. In addition, a graph convolution network was developed to remove the noise from these annotations, as well as an activity classifier was used to classify the activities. In comparison to the current strategies, this article Presented an efficient Attention-based deep-learning approach for anomaly detection in surveillance video. Section 3 discusses the prime components of the suggested ADSV method.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Methodology</title>
<p>This section elaborates on the proposed (ADSV) method and its fundamental component structure. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> depicts a visual representation of our ADSV strategy. In brief, the technique of anomaly detection in surveillance video consists of three main components: Shot segmentation, feature extraction, sequence learning, and abnormality classifications. To begin with, a shots boundary detection technique is used to segment prominent frames. Furthermore, The LWCNN model receives the segmented frames in order to extract spatial and temporal information from the intermediate layer. Following that, spatial and temporal features are learned using LSTM cells and Attention Network from a series of frames for each sample of abnormal activity. To detect motion and action, the LWCNN received chronologically sorted frames. Finally, the abnormal activities in video shots are identified using the proposed trained ADSV model.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The proposed ADSV framework for video anomaly detection consists of three main components: shot segmentation, feature extraction, sequence learning, and abnormality classifications. At the input of the ADSV, a shots boundary detection technique is used to segment prominent frames. Next, The LWCNN model receives the segmented frames to extract spatial and temporal information from the intermediate layer. Following that, spatial and temporal features are learned using LSTM cells and Attention Network from a series of frames for each anomalous activity in a sample. To detect motion and action, the LWCNN received chronologically sorted frames. Finally, the anomaly activity in the video is identified using the proposed trained ADSV model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_34805-fig-1.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Segmentation of Shots by Using Boundary Detection Algorithm</title>
<p>Shots Boundary Detection is a prerequisite for most video applications that include the comprehension, indexing, characterization, or classification of video and temporal segmentation, making it a prominent research issue in content-based video analysis. <xref ref-type="table" rid="table-1">Table 1</xref> represents the parameter descriptions of shots segmentation by using a boundary detection algorithm. The concept of the boundary detection algorithm is implemented in the following key phases:
<list list-type="bullet">
<list-item>
<p>Image Segmentation: Divide each frame from the video into <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mrow><mml:mi>&#x1D4C2;</mml:mi></mml:mrow></mml:math></inline-formula>-rows and <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:mi>&#x1D4C3;</mml:mi></mml:mrow></mml:math></inline-formula>-columns blocks at the image segmentation level. Then, the difference between two successive frames of the relevant blocks is calculated. Lastly, the gap between consecutive frames is calculated by adding the differences created by the various weights.</p></list-item>
<list-item>
<p>Attention-Model: Attention, a neurobiological word, refers to the ability or capability to concentrate mental energies on an object through careful observation or attentive listening. The attention model suggests that, from a visual perspective, different contents are prioritized based on their relative significance; it also represents the relative importance of frames. On this basis, it is possible to conclude that pixel in different positions contributes differently to the detection of shot boundaries; pixels on the edge contribute more than pixels in other positions. As a result, distinct weights are assigned to blocks at various positions. The spatial distribution of pixels with varying grey values and the relative significance of pixels with varying positions are evaluated.</p></list-item>
<list-item>
<p>Histogram Matching: There are several types of histogram matching. In most literature, the matching difference is calculated using a color histogram. However, after evaluating different types of histogram matching techniques, it was shown that the <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mrow><mml:mi>&#x1D4CD;</mml:mi></mml:mrow></mml:math></inline-formula><sup>2</sup> histogram surpassed the others in recognizing shot boundaries [<xref ref-type="bibr" rid="ref-30">30</xref>]. As a result, the <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mrow><mml:mi>&#x1D4CD;</mml:mi></mml:mrow></mml:math></inline-formula><sup>2</sup> histogram matching technique is used.</p></list-item>
<list-item>
<p>Shot-Boundary Detection: Histogram differences are used to detect shot boundary and consequently extracted the key frame based on underlying activity. The threshold <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mi>&#x02133;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mspace width="thinmathspace" /><mml:mo>+</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>&#x03B1;</mml:mi><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>&#x00D7;</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mrow><mml:mi>&#x1D4AE;</mml:mi><mml:mi>&#x1D4AF;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow></mml:math></inline-formula> has a constant value of <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> which applies weight to the <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mrow><mml:mi>&#x1D4AE;</mml:mi><mml:mi>&#x1D4AF;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow></mml:math></inline-formula> for the overall <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>. If <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mrow><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>, frame <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the Prior shot&#x2019;s end, while the frame <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> indicates the subsequent shot&#x2019;s end. Typically, the minimum feasible shot duration should be between one and two and a half seconds long. In addition, a frame rate of at least 25&#x2013;30 fps is required to ensure smoothness, or a flashlight might be visible. Thus, a shot should consist of 30&#x2013;45 frames. Therefore, a shot combining rule is provided [<xref ref-type="bibr" rid="ref-30">30</xref>]: If a captured shot contains less than 38 frames, it should be combined with the following shot or declared independent. In <xref ref-type="table" rid="table-3">Table 3</xref>, the pseudo-code implementation of shot boundary detection is presented.</p></list-item>
</list></p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>The parameter descriptions for the algorithm of shot boundary detection</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Symbols</th>
<th>Parameter descriptions</th>
</tr>
</thead>
<tbody>
<tr>
<td><inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mrow><mml:mi>&#x0212C;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td>Block Difference is the inconsistency between two frames&#x2019; relevant blocks.</td>
</tr>
<tr>
<td><inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mrow><mml:mi>&#x0210B;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td>Histogram measurement at the &#x201C;<inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>&#x201D; block of frame &#x201C;<inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>t</mml:mi></mml:math></inline-formula>&#x201D; for the &#x201C;<inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>&#x201D; grey value in &#x201C;<inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>c</mml:mi></mml:math></inline-formula>&#x201D; RGB channel.</td>
</tr>
<tr>
<td><inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mrow><mml:mi>&#x0210B;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td>Histogram measurement at the &#x201C;<inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msup><mml:mi>b</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>&#x201D; block of frame &#x201C;<inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>&#x201D; for the &#x201C;<inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>&#x201D; grey value in &#x201C;<inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>c</mml:mi></mml:math></inline-formula>&#x201D; RGB channel.</td>
</tr>
<tr>
<td><inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mrow><mml:mi>&#x1D4A9;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>&#x0212C;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Count of all the blocks.</td>
</tr>
<tr>
<td><inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msub><mml:mrow><mml:mi>&#x1D4A9;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>&#x0210B;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>The total amount of grayscale values that can be used.</td>
</tr>
<tr>
<td><inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mrow><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td>The difference in histograms between two successive frames.</td>
</tr>
<tr>
<td><inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>The weight of the Block at <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</td>
</tr>
<tr>
<td><inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:mi>&#x02133;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td>Estimating the histogram&#x2019;s mean value.</td>
</tr>
<tr>
<td><inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mrow><mml:mi>&#x1D4AE;</mml:mi><mml:mi>&#x1D4AF;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow></mml:math></inline-formula></td>
<td>Calculating the histogram&#x2019;s standard deviation.</td>
</tr>
<tr>
<td><inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>x</mml:mi></mml:math></inline-formula></td>
<td>A frame of reference.</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Proposed LWCNN Method</title>
<p>CNNs were motivated by biological processes similar to the structure of the visual cortex in animals. The connection of the neurons in the convolution layers (<inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula>) is arranged in a similar way to that of the visual system in an animal. Each neuron in the cortex responds to stimuli within a small portion of the input frame, known as the reception field. <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula> can maintain spatial relationships among input frames in video analysis by learning feature representations by applying filters whose values are learned throughout the training process [<xref ref-type="bibr" rid="ref-31">31</xref>]. The Proposed LWCNN method is comprised of three TimeDistributed 2D <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula> and two TimeDistributed 2D max pooling layers, with the number of channels, kernel, padding, and strides stated in <xref ref-type="table" rid="table-2">Table 2</xref>. Furthermore, a kernel size of 3 &#x00D7; 3, a stride of 2 &#x00D7; 2, and an activation function of the Rectified Linear Unit (ReLU) are applied to each TimeDistributed 2D <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula>. Besides that, TimeDistributed 2D max pooling with a stride size of 2 &#x00D7; 2 is used to minimize the network&#x2019;s size following the second and third <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula>. Each convolutional process utilizes same-padding techniques to avoid losing information at the border of the input frame. In the first <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula>, we start with 64 feature maps, which are then followed by the identical feature maps in the second <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula>, and 128 activation maps are generated in the final <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Descriptions of LWCNN technique used in the proposed ADSV method</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>LWCNN layer</th>
<th>No. of channels</th>
<th>Kernel (h &#x00D7; w)</th>
<th>Padding</th>
<th>Stride (h &#x00D7; w)</th>
<th>Output</th>
<th>Parameters</th>
</tr>
</thead>
<tbody>
<tr>
<td>TimeDistributed-2D <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula>1 (ReLU)</td>
<td>64</td>
<td>3 &#x00D7; 3</td>
<td>Same</td>
<td>2 &#x00D7; 2</td>
<td>5,112 &#x00D7; 112 &#x00D7; 64</td>
<td>1792</td>
</tr>
<tr>
<td>TimeDistributed-2D <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula>2 (ReLU)</td>
<td>64</td>
<td>3 &#x00D7; 3</td>
<td>Same</td>
<td>2 &#x00D7; 2</td>
<td>5, 56 &#x00D7; 56 &#x00D7; 64</td>
<td>36928</td>
</tr>
<tr>
<td>TimeDistributed Max-Pooling-2D1</td>
<td>1</td>
<td>2 &#x00D7; 2</td>
<td>&#x2013;</td>
<td>2 &#x00D7; 2</td>
<td>5, 28 &#x00D7; 28 &#x00D7; 64</td>
<td>0</td>
</tr>
<tr>
<td>TimeDistributed-2D <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:mi mathvariant="italic">C</mml:mi><mml:mi mathvariant="italic">L</mml:mi></mml:mrow></mml:math></inline-formula>3 (ReLU)</td>
<td>128</td>
<td>3 &#x00D7; 3</td>
<td>Same</td>
<td>2 &#x00D7; 2</td>
<td>5, 14 &#x00D7; 14 &#x00D7; 128</td>
<td>73856</td>
</tr>
<tr>
<td>TimeDistributed Max-Pooling-2D2</td>
<td>1</td>
<td>2 &#x00D7; 2</td>
<td>&#x2013;</td>
<td>2 &#x00D7; 2</td>
<td>5, 7 &#x00D7; 7 &#x00D7; 128</td>
<td>0</td>
</tr>
<tr>
<td>TimeDistributed Flatten-1</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
<td>5, 6272</td>
<td>0</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Pseudo-code implementation of shots boundary detection algorithm</title>
</caption>
<table frame="hsides" >
<colgroup>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Pseudo-code of shots segmentation by using a boundary detection algorithm</th>
</tr>
</thead>
<tbody>
<tr>
<td>Required: The whole videos dataset &#x003D; <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msub><mml:mrow><mml:mi>&#x1D4AF;</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi>&#x211B;</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula></td>
</tr>
<tr>
<td>Required: Divide each frame <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>f</mml:mi></mml:math></inline-formula> from the video into sixteen blocks i.e., &#x2200; <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>f</mml:mi></mml:math></inline-formula> <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mi>&#x0212C;</mml:mi></mml:mrow><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula></td>
</tr>
<tr>
<td><bold>for</bold> <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mrow><mml:mi>&#x1D4AF;</mml:mi></mml:mrow><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mn>1</mml:mn><mml:msub><mml:mrow><mml:mi>&#x1D4AF;</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> <bold>do</bold></td>
</tr>
<tr>
<td> <bold>&#x2002;&#x2002;&#x2002;for</bold> <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mi>f</mml:mi><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mi>&#x1D4AF;</mml:mi></mml:mrow></mml:math></inline-formula> <bold>do</bold></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mrow><mml:mi>&#x0212C;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">&#x2190;</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>c</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:munderover><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x1D4A9;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>&#x0212C;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:mspace width="thinmathspace" /><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x1D4A9;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>&#x0210B;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:mrow><mml:mi>&#x0210B;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mi>&#x0210B;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>x</mml:mi></mml:mfrac></mml:mstyle></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo stretchy="false">&#x2190;</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mi>&#x1D4A9;</mml:mi></mml:mrow></mml:mrow></mml:munderover><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>&#x0212C;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:mi>&#x02133;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x1D4AF;</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:mrow><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:msub><mml:mrow><mml:mi>&#x1D4AF;</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mfrac></mml:mstyle></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mrow><mml:mi>&#x1D4AE;</mml:mi><mml:mi>&#x1D4AF;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mo stretchy="false">&#x2190;</mml:mo><mml:msqrt><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x1D4AF;</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mi>&#x1D4AF;</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mfrac></mml:mstyle></mml:msqrt></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mi>&#x02133;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:mi>&#x1D4AE;</mml:mi><mml:mi>&#x1D4AF;</mml:mi><mml:mi>&#x1D49F;</mml:mi></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td><bold>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;if</bold> <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mrow><mml:mi>&#x1D49F;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula> <bold>then</bold></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;prior shot end frame <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Succeeding shot end frame <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td><bold>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;else </bold></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Print (&#x201C;shot not found&#x201D;)</td>
</tr>
<tr>
<td><bold>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;end if</bold></td>
</tr>
<tr>
<td><bold>&#x2002;&#x2002;end for</bold></td>
</tr>
<tr>
<td>&#x2002;&#x2002;return shot boundary detection for the input video</td>
</tr>
<tr>
<td>&#x2002;&#x2002;Repeat loop till the end frame of the video</td>
</tr>
<tr>
<td><bold>end for</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>As input, the suggested framework takes a sequence of the segmented frames that have been preprocessed. In addition, the proposed LWCNN is used to capture the spatial information of each frame, which is subsequently fed into the LSTM to extract temporal information. As shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, we employed a frame-wise LWCNN to retrieve the spatial information of each frame. Furthermore, the input frames (<italic>f</italic><sub><italic>t</italic></sub>, <italic>f</italic><sub><italic>t</italic>&#x002B;1</sub>, <italic>f</italic><sub><italic>t</italic>&#x002B;<italic>n</italic></sub>) are fed separately into an LWCNN, which converts every single frame into a particular series of spatial information representations, as shown in <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>, where <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msub><mml:mrow><mml:mi>&#x2131;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents a series of spatial information representations. Besides this, the temporal information <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msub><mml:mrow><mml:mi>&#x1D4BD;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is generated utilizing a series of spatial information representations as input to the LSTM model, as illustrated in <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>. The LSTM layer&#x2019;s hidden state at time step <italic>t</italic> is represented by <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mrow><mml:mi>&#x1D4BD;</mml:mi></mml:mrow></mml:math></inline-formula><sub><italic>t</italic></sub>, while the hidden state at time step <italic>t</italic>&#x23BC;1 is represented by <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msub><mml:mrow><mml:mi>&#x1D4BD;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> [<xref ref-type="bibr" rid="ref-32">32</xref>]. The information from the previous time step is provided as input to the current time step.</p>
<p><disp-formula id="eqn-1">
<label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mrow><mml:mi>&#x2131;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="monospace">L</mml:mi><mml:mi mathvariant="monospace">W</mml:mi><mml:mi mathvariant="monospace">C</mml:mi><mml:mi mathvariant="monospace">N</mml:mi><mml:mi mathvariant="monospace">N</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mrow><mml:mi>&#x1D4BD;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mi>&#x1D4C3;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="monospace">L</mml:mi><mml:mi mathvariant="monospace">S</mml:mi><mml:mi mathvariant="monospace">T</mml:mi><mml:mi mathvariant="monospace">M</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>&#x2131;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Sequence Learning and Anomalies Classification</title>
<p>The algorithms developed for applications that need sequential or temporal data are known as sequence learning. Moreover, RNNs are introduced to identify latent sequential patterns inside temporal and spatial sequential data. Video data is also a form of time series data in which changes in visual contents are represented by a large number of frames in such a way that the sequence of frames assists in knowing the context of behavior. In the case of long-term sequences, RNNs can comprehend such sequences, but they forget the sequence&#x2019;s prior inputs. This is referred to as the vanishing gradient issue, and it can be addressed using the LSTM, a type of RNN capable of tracking long sequences. Its distinctive structure, consisting of input, output, and forget gates, identifies long-term sequence patterns. During training, a sigmoid unit needs to adjust the gates by learning where to open and close them. <xref ref-type="disp-formula" rid="eqn-3">Eqs. (3)</xref> to <xref ref-type="disp-formula" rid="eqn-8">(8)</xref> outline the activities performed by the LSTM unit, where the input gate at time <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>t</mml:mi></mml:math></inline-formula> is <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:msub><mml:mrow><mml:mi>&#x1D4BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and the forget gate at time <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mi>t</mml:mi></mml:math></inline-formula> is <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:msub><mml:mrow><mml:mi>&#x2131;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, which clears data from the memory cell as required and maintains a record of the preceding frame whose data must be erased from memory. The output gate <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:msub><mml:mrow><mml:mi>&#x1D4AA;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> contains information regarding the next step, where <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mrow><mml:mrow><mml:mtext mathvariant="sans-serif">g</mml:mtext></mml:mrow></mml:mrow></mml:math></inline-formula> is the recurrent unit with activation function &#x201C;<inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>&#x1D4C9;</mml:mi><mml:mrow><mml:mi>&#x1D4B6;</mml:mi><mml:mi>&#x1D4C3;</mml:mi><mml:mi>&#x1D4BD;</mml:mi></mml:mrow></mml:math></inline-formula>&#x201D; that is generated using the current frame&#x2019;s input and the state of the previous frame <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula>. Using &#x201C;<inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>&#x1D4C9;</mml:mi><mml:mrow><mml:mi>&#x1D4B6;</mml:mi><mml:mi>&#x1D4C3;</mml:mi><mml:mi>&#x1D4BD;</mml:mi></mml:mrow></mml:math></inline-formula>&#x201D; activation and the <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:msub><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> memory cell, the LSTM step&#x2019;s hidden state is computed. An attention unit improves the capabilities of these LSTM layers [<xref ref-type="bibr" rid="ref-33">33</xref>]. The output of the final time step of <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:msub><mml:mrow><mml:mi>&#x1D4BD;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mi>&#x1D4C3;</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is supplied as an input to the following attention unit. After receiving input from the attention network, the fully connected layer determines the final estimation score for each anomaly class.</p>
<p><disp-formula id="eqn-3">
<label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mrow><mml:mi>&#x1D4BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4CD;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mi>&#x1D4B2;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>&#x1D4BE;</mml:mi></mml:mrow></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mrow><mml:mi>&#x1D4BE;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-4">
<label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mrow><mml:mi>&#x2131;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4CD;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mi>&#x1D4B2;</mml:mi></mml:mrow><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-5">
<label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:msub><mml:mrow><mml:mi>&#x1D4AA;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4CD;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mi>&#x1D4B2;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi>&#x1D4AA;</mml:mi></mml:mrow></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mrow><mml:mi>&#x1D4AA;</mml:mi></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-6">
<label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mrow><mml:mtext mathvariant="sans-serif">g</mml:mtext></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x1D4C9;</mml:mi><mml:mrow><mml:mi>&#x1D4B6;</mml:mi><mml:mi>&#x1D4C3;</mml:mi><mml:mi>&#x1D4BD;</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4CD;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mi>&#x1D4B2;</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="sans-serif">g</mml:mtext></mml:mrow></mml:mrow></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mrow><mml:mrow><mml:mtext mathvariant="sans-serif">g</mml:mtext></mml:mrow></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><disp-formula id="eqn-7">
<label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mrow><mml:mtext mathvariant="sans-serif">g</mml:mtext></mml:mrow></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4BE;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p><disp-formula id="eqn-8">
<label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mrow><mml:mi>&#x1D4AE;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x1D4C9;</mml:mi><mml:mrow><mml:mi>&#x1D4B6;</mml:mi><mml:mi>&#x1D4C3;</mml:mi><mml:mi>&#x1D4BD;</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D49E;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x1D4AA;</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Attention Mechanism</title>
<p>Attention has likely become the most essential idea in the fields of deep learning as well as computer vision. It is based on the biological systems of beings, which prefer to concentrate on the unique aspects of enormous amounts of data. The attention technique tackles extremely long-range dependency issues in LSTMs [<xref ref-type="bibr" rid="ref-33">33</xref>]. As seen in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, the output at time <italic>i</italic> is given by <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mtext mathvariant="sans-serif">g</mml:mtext></mml:mrow></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> where <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the decoder&#x2019;s hidden state. The context vector <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the weighted sum of the attention weight <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and the encoder&#x2019;s hidden state <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, as given in <xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref>. Attention weight <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is computed according to <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref> and indicates the correlation between the <italic>j-th</italic> location of the input sequence and the <italic>i-th</italic> location of the result sequence. The attention score, <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, is dependent on the hidden state <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> of the decoder and the <italic>j-th</italic> annotate <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of the input sequence, as indicated in <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref>, where <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mi>v</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> are the parameter matrices that are calculated by training the model. The technique of computing attention scores utilizing the preceding hidden state of the decoder is known as the Bahdanau style. In this study, the Bahdanau attention mechanism is utilized to enhance the sequential learning model.</p>
<p><disp-formula id="eqn-9">
<label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p><disp-formula id="eqn-10">
<label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p><disp-formula id="eqn-11">
<label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mi>e</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mi>v</mml:mi><mml:mrow><mml:mo>&#x22BA;</mml:mo></mml:mrow></mml:msup><mml:mi>tanh</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Results</title>
<p>Our proposed ADSV framework is evaluated using two publicly accessible datasets: CUHK-Avenue and UCF-Crime. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> depicts a selection of usual and unusual event frames extracted from these datasets. Furthermore, the Three-Dimensional Uniform Manifold Approximation and Projection (3D-UMAP) Projection of the evaluated datasets is given in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. The two quantitative measures were used to evaluate the proposed ADSV method: frame-based area under the curve (AUC) and receiver operating characteristic (ROC). <xref ref-type="table" rid="table-9">Table 9</xref> shows the training parameters of the proposed method. The algorithm is implemented employing Karas-supported Tensor Flow in the Python 3.7.1 platform. Experiments were performed on a computer (PC) equipped with an Nvidia-GeForce RTX-3070 GPU, 32 GB of RAM, the Windows 10 operating system, and the CUDA toolkit 11.0 with cuDNN v8.0. The experimental results showed the efficacy of the suggested ADSV method as well as a sustained breakthrough in the state-of-the-art methods.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Samples of the anomaly detection dataset</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_34805-fig-2.tif"/>
</fig><fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The 3D-UMAP Projection of the datasets Avenue and UCF-Crime</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_34805-fig-3.tif"/>
</fig>
<sec id="s4_1">
<label>4.1</label>
<title>Datasets</title>
<p>CUHK-Avenue: the CUHK-Avenue dataset was collected at the Chinese University of Hong Kong using a static video camera with a clear resolution of 640 pixels by 360 pixels, which captured street activities. This dataset contains 16 train video clips representing regular human activity and 21 test video clips representing anomalous human activities and events. Walkers on the walkway and groups of walkers gathering on the pavement are examples of regular behavior. In contrast, persons wasting or discarding goods, loitering, going toward the camera, strolling on the grass, and leaving items are examples of anomalous activity.</p>
<p>UCF-Crime: The UCF-Crime dataset contains 1900 long, unedited videos for 13 real-world anomaly activities, such as abuse, arrest, assault, arson, burglary, explosion, fighting, road accident, robbery, stealing, shooting, shoplifting, and vandalism. The training set of the UCF-Crime dataset included 800 videos of normal events and 810 videos of abnormal events. The testing set consisted of the remaining 150 regular videos and 140 abnormal ones. In <xref ref-type="table" rid="table-4">Table 4</xref>, the statistical information of the UCF-Crime dataset is presented.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>The statistical facts contained within the UC-Crime dataset</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Types of anomalies</th>
<th>The number of videos</th>
<th>Training data</th>
<th>Testing data</th>
</tr>
</thead>
<tbody>
<tr>
<td>Abuse.</td>
<td>50.</td>
<td>48.</td>
<td>02</td>
</tr>
<tr>
<td>Arrest.</td>
<td>50.</td>
<td>45.</td>
<td>05</td>
</tr>
<tr>
<td>Assault</td>
<td>50.</td>
<td>47</td>
<td>03</td>
</tr>
<tr>
<td>Arson</td>
<td>50.</td>
<td>41</td>
<td>09</td>
</tr>
<tr>
<td>Shooting</td>
<td>50.</td>
<td>27</td>
<td>23</td>
</tr>
<tr>
<td>Fighting</td>
<td>50</td>
<td>45</td>
<td>5</td>
</tr>
<tr>
<td>Explosion</td>
<td>50</td>
<td>29</td>
<td>21</td>
</tr>
<tr>
<td>Vandalism</td>
<td>50</td>
<td>45</td>
<td>05</td>
</tr>
<tr>
<td>Shoplifting</td>
<td>50</td>
<td>29</td>
<td>21</td>
</tr>
<tr>
<td>Stealing</td>
<td>100</td>
<td>95</td>
<td>05</td>
</tr>
<tr>
<td>Burglary</td>
<td>100</td>
<td>87</td>
<td>13</td>
</tr>
<tr>
<td>Robbery</td>
<td>150</td>
<td>145</td>
<td>05</td>
</tr>
<tr>
<td>Accident</td>
<td>150</td>
<td>127</td>
<td>23</td>
</tr>
<tr>
<td><bold>Sum</bold></td>
<td>950</td>
<td>810</td>
<td>140</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Dataset Visualization Using UMAP</title>
<p>UMAP is a lately introduced strategy for learning manifolds that aims to accurately reflect local structures as well as effectively integrate global structures [<xref ref-type="bibr" rid="ref-34">34</xref>]. It offers a significant benefit over t-distributed Stochastic Neighbor Embedding (t-SNE). In contrast to t-SNE, UMAP has been shown to work effectively with huge datasets. UMAP is built on the following hypotheses:
<list list-type="bullet">
<list-item>
<p>The data is transferred equally throughout a Riemannian manifold.</p></list-item>
<list-item>
<p>The Riemannian metric is locally unchanging.</p></list-item>
<list-item>
<p>The manifold is locally connected.</p></list-item>
</list></p>
<p>Based on these assumptions, the manifold can be represented as a fuzzy topological structure of the sample points with High Dimension (HD). The embedding manifold is determined by looking for a fuzzy topological structure in the Low-Dimension (LD) projection of the data. To construct the fuzzy topological structure, UMAP employs an HD graph to represent the sample points. The resultant HD graph is a weighted graph, where edge weights denote the probability that two points are related. UMAP calculates the similarities between HD sample points using an exponential probability distribution.</p>
<p><disp-formula id="eqn-12">
<label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The distance between the <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> sample points are denoted by <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, while the distance between the <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> data point and its first nearest neighboring are denoted by &#x03C3;. The HD probability of data is symmetrized in UMAP:</p>
<p><disp-formula id="eqn-13">
<label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>j</mml:mi><mml:mi>i</mml:mi></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The generated graph is a probability graph, as previously stated, and UMAP must identify the <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:msup><mml:mi>k</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> adjacent neighbors:</p>
<p><disp-formula id="eqn-14">
<label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:mspace width="thinmathspace" /><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>UMAP generates and optimizes an LD version of the HD graph that is as similar as possible. UMAP employs a probability measure to model distance in low dimensions:</p>
<p><disp-formula id="eqn-15">
<label>(15)</label>
<mml:math id="mml-eqn-15" display="block"><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>b</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> &#x2248; 1.93 and <italic>b</italic> &#x2248; 0.79 by default for UMAP. UMAP utilizes Binary Cross-Entropy (CE) as a cost function because of its capacity to capture the global data structure:</p>
<p><disp-formula id="eqn-16">
<label>(16)</label>
<mml:math id="mml-eqn-16" display="block"><mml:mi>C</mml:mi><mml:mi>E</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mi>Q</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:mspace width="thinmathspace" /><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:munder><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where P denotes the high-dimensional, and Q represents low-dimensional sample points&#x2019; probabilistic similarity. To update the coordination of the LD sample points until convergence, cross-derivative entropy is utilized. In addition, Stochastic Gradient Descent was utilized by UMAP because of its quicker convergence and lower memory consumption. Several essential hyper-parameters influences UMAP&#x2019;s performance. The hyper-parameters are mentioned below:
<list list-type="bullet">
<list-item>
<p>The target embedding&#x2019;s dimensionality.</p></list-item>
<list-item>
<p>Selecting a low value for the <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:mi>k</mml:mi></mml:math></inline-formula> number of neighbors suggests that the interpretation will be extremely localized and extract fine-grained structural details. On the other hand, selecting a considerable value suggests that the prediction will be based on wider regions, which means some fine information structure will be missed.</p></list-item>
<list-item>
<p>The smallest distance among points in the embedding space can be accepted. Lower minimum distance values will capture the underlying manifold structure more precisely, resulting in heavy clouds that make viewing difficult.</p></list-item>
</list></p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Evaluation and Comparison of the Avenue Dataset</title>
<p>The CUHK Avenue dataset is an open-source dataset that is commonly used to assess video anomaly detection techniques. We compared our proposed ADSV system to various current techniques on this dataset [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-23">23</xref>,<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-35">35</xref>&#x2013;<xref ref-type="bibr" rid="ref-38">38</xref>], including supervised and unsupervised strategies that also presented their frame-based AUC values on the CUHK Avenue dataset. Recent techniques, including Liu et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] and Zhou et al. [<xref ref-type="bibr" rid="ref-39">39</xref>], revealed an AUC value of 84.9% and 86.1%, correspondingly, for the CUHK Avenue dataset. Zhou et al. [<xref ref-type="bibr" rid="ref-39">39</xref>] outscore earlier methods, as well as other recent techniques, including those described in [<xref ref-type="bibr" rid="ref-40">40</xref>], further reported high accuracy on the Avenue dataset. However, the ADSV system performs more effectively than most current methods, enhancing further state-of-the-art accuracy for the Avenue dataset. The proposed system outperforms state-of-the-art methods and accomplishes a frame-based AUC of 99%. <xref ref-type="table" rid="table-5">Table 5</xref> displays the quantitative comparison of the proposed ADSV system with the numerous current strategies in terms of frame-based AUC values. <xref ref-type="fig" rid="fig-6">Figs. 6c</xref> and <xref ref-type="fig" rid="fig-6">6d</xref> depict the training accuracy and loss graphs for the proposed system using Avenue Dataset respectively.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>A frame-based (AUC) evaluation of the proposed ADSV technique to existing approaches for the Avenue Dataset</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>CUHK-Avenue Dataset</th>
</tr>
</thead>
<tbody>
<tr>
<td>Hasan et al. [<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td>70.2</td>
</tr>
<tr>
<td>Luo et al. [<xref ref-type="bibr" rid="ref-38">38</xref>]</td>
<td>80.3</td>
</tr>
<tr>
<td>Chong et al. [<xref ref-type="bibr" rid="ref-36">36</xref>]</td>
<td>80.6</td>
</tr>
<tr>
<td>Tudor Ionescu et al. [<xref ref-type="bibr" rid="ref-37">37</xref>]</td>
<td>81.7</td>
</tr>
<tr>
<td>Liu et al. [<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td>84.9</td>
</tr>
<tr>
<td>Zhou et al. [<xref ref-type="bibr" rid="ref-39">39</xref>]</td>
<td>86.1</td>
</tr>
<tr>
<td><bold>Proposed ADSV</bold></td>
<td>99.0</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Evaluation and Comparison of the UCF-Crime Dataset</title>
<p>The UCF-Crime dataset is an open-source dataset that is commonly used to assess algorithms for detecting anomalies in surveillance videos. We compared our ADSV method for video anomaly to other existing techniques [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-35">35</xref>,<xref ref-type="bibr" rid="ref-38">38</xref>] using the UCF-Crime dataset. The ROC and AUC are the evaluation metrics used to assess the performance of our system. We established the AUC and ROC curves using the test set from the UCF-Crime dataset to compare them to the results in [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-35">35</xref>,<xref ref-type="bibr" rid="ref-38">38</xref>]. The experimental research results shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref> reveal that our framework surpasses the techniques described in [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-35">35</xref>,<xref ref-type="bibr" rid="ref-38">38</xref>]. <xref ref-type="table" rid="table-6">Table 6</xref> compares the frame-based AUC values for the UCF-Crime dataset with other existing techniques. It can be seen that the proposed framework obtained the highest frame-based AUC value of 97%, a 14.88% increase over the approach of Zhong et al. [<xref ref-type="bibr" rid="ref-6">6</xref>], which achieved the last highest AUC value of 82.12%. Following, other research in [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-35">35</xref>] obtained AUC values of 75.41%, 50.6%, and 65.51%, respectively, revealing that our framework performs effectively with the UCF-Crime dataset. <xref ref-type="fig" rid="fig-5">Fig. 5</xref> illustrates the frame-based anomalies detection efficiency of the suggested ADSV method with the anomaly scores for the following test video sequences: (a) Arrest-48, (b) Fighting-47, (c) Assault-51, and (d) Normal Videos-27. <xref ref-type="fig" rid="fig-6">Figs. 6a</xref> and <xref ref-type="fig" rid="fig-6">6b</xref> depict the training accuracy and loss graphs for the proposed model using UCF-Crime Dataset respectively.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>For the UCF-Crime dataset, the proposed strategy is compared with alternative methodologies already in use. The colors black, dark brown, blue, cyan, green, gray, purple, and teal, respectively, are used to depict the ROC curves for the binary SVM classifier [<xref ref-type="bibr" rid="ref-12">12</xref>], SCL [<xref ref-type="bibr" rid="ref-11">11</xref>], LTR [<xref ref-type="bibr" rid="ref-35">35</xref>], MIL-C3D [<xref ref-type="bibr" rid="ref-12">12</xref>], TSN-flow [<xref ref-type="bibr" rid="ref-6">6</xref>], TSN-RGB [<xref ref-type="bibr" rid="ref-6">6</xref>], C3D [<xref ref-type="bibr" rid="ref-6">6</xref>], and ADSV approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_34805-fig-4.tif"/>
</fig><table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>A frame-based (AUC) evaluation of the proposed ADSV technique to existing approaches for the UCF-Crime Dataset</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>UCF-Crime Dataset [<xref ref-type="bibr" rid="ref-12">12</xref>]</th>
</tr>
</thead>
<tbody>
<tr>
<td>Binary SVM classifier [<xref ref-type="bibr" rid="ref-12">12</xref>]</td>
<td>50.0</td>
</tr>
<tr>
<td>LTR [<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td>50.6</td>
</tr>
<tr>
<td>Spatiotemporal [<xref ref-type="bibr" rid="ref-44">44</xref>]</td>
<td>63.0</td>
</tr>
<tr>
<td>SCL [<xref ref-type="bibr" rid="ref-11">11</xref>]</td>
<td>65.51</td>
</tr>
<tr>
<td>MIL-C3D without constraints [<xref ref-type="bibr" rid="ref-12">12</xref>]</td>
<td>74.44</td>
</tr>
<tr>
<td>MIL-C3D with constraints [<xref ref-type="bibr" rid="ref-12">12</xref>]</td>
<td>75.41</td>
</tr>
<tr>
<td>TSN-Optical flow [<xref ref-type="bibr" rid="ref-6">6</xref>]</td>
<td>78.08</td>
</tr>
<tr>
<td>C3D [<xref ref-type="bibr" rid="ref-6">6</xref>]</td>
<td>81.08</td>
</tr>
<tr>
<td>TSN-RGB [<xref ref-type="bibr" rid="ref-6">6</xref>]</td>
<td>82.12</td>
</tr>
<tr>
<td><bold>Proposed ADSV</bold></td>
<td>97.0</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The abnormality score curves for four test videos of the UCF-Crime Dataset, including (a) Arrest-48, (b) Fighting-47, (c) Assault-51, and (d) Normal-Videos-27. The ground truth anomalous frames are highlighted by teal patches. For a more accurate depiction, we normalized anomaly values for each video to the interval [0,1]. It indicates that as abnormalities occur, anomaly scores grow</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_34805-fig-5.tif"/>
</fig>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>The training accuracy and loss graphs for the ADSV method using UCF-Crime Dataset are plotted in (a) and (b), while using the Avenue dataset the proposed method generates training accuracy and loss graphs as shown in (c) and (d) respectively</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_34805-fig-6.tif"/>
</fig>
</sec>
<sec id="s4_5">
<label>4.5</label>
<title>In Comparison to Contemporary Methods</title>
<p>In this subsection, the performance of our proposed ADSV framework for anomaly detection is compared to that of existing methodologies utilizing the UCF-Crime dataset. The authors of [<xref ref-type="bibr" rid="ref-41">41</xref>] analyzed a range of deep learning algorithms using multi-layer Bidirectional Long Short-Term Memory Neural Network (BLSTM) integration, such as VGG-19, InceptionV3, and ResNet-50. Among all these methods, the technique with the smallest model size is ResNet-50&#x002B;multi-layer BLSTM. In addition, Deep learning models have become increasingly sophisticated in the current era, requiring massive quantities of storage; they also have enhanced computation costs and restrictive installation protocols over the connected device. A delay in responses can lead to the loss of human life or property in an anomaly detection system; hence, efficient model selection is essential to every anomaly detection system. In comparison to other existing approaches [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-41">41</xref>&#x2013;<xref ref-type="bibr" rid="ref-43">43</xref>], the suggested ADSV method for anomaly detection has a minimum storage capacity, fewer learning parameters, and a quicker processing time. <xref ref-type="table" rid="table-7">Table 7</xref> compares the effectiveness of the proposed ADSV method to existing contemporary strategies in terms of model size (MB), time complexity, and parameter count. Furthermore, a strong and effective anomaly detection system with low false alarm rates is highly desired since, in everyday life surveillance, the frequency of normal actions occurring is higher than the frequency of abnormal actions. Consequently, we made a comparison between the proposed framework and recently published methodologies, as given in <xref ref-type="table" rid="table-8">Table 8</xref>, and the results suggest that the proposed ADSV framework has had the minimum false alarm rates. In comparison to earlier methods, the suggested ADSV framework can process a sequence of 32-frames in 0.26 s [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-41">41</xref>&#x2013;<xref ref-type="bibr" rid="ref-43">43</xref>]. <xref ref-type="fig" rid="fig-7">Figs. 7a</xref> and <xref ref-type="fig" rid="fig-7">7b</xref> depict the class-wise accuracy of the CUHK-Avenue and UCF-Crime Dataset respectively.</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>Comparison of the parameters, model size, and computational complexity of the proposed approach with the state-of-the-art</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>Number of parameters (million)</th>
<th>Size of model (MB)</th>
<th>Time complexity/Sequence (s)</th>
</tr>
</thead>
<tbody>
<tr>
<td>C3D</td>
<td>&#x2013;</td>
<td>313</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>VGG-19&#x002B;multi-layer BLSTM</td>
<td>143</td>
<td>605.5</td>
<td>0.22</td>
</tr>
<tr>
<td>Inception-V3&#x002B;multi-layer BLSTM</td>
<td>23</td>
<td>148.5</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>ResNet-50&#x002B;multi-layer BLSTM</td>
<td>25</td>
<td>143</td>
<td>0.20</td>
</tr>
<tr>
<td>Proposed ADSV method</td>
<td>14.17</td>
<td>54.1</td>
<td>0.26</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>False alarm rate comparison between the proposed ADSV method and recent existing approaches</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>UCF-Crime Dataset [<xref ref-type="bibr" rid="ref-12">12</xref>]</th>
<th>Avenue Dataset [<xref ref-type="bibr" rid="ref-11">11</xref>]</th>
</tr>
</thead>
<tbody>
<tr>
<td>MIL-C3D-with-constraints [<xref ref-type="bibr" rid="ref-12">12</xref>]</td>
<td>1.9</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>Hasan et al. [<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td>27.2</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>Lu et al. SCL [<xref ref-type="bibr" rid="ref-11">11</xref>]</td>
<td>3.1</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>C3D [<xref ref-type="bibr" rid="ref-6">6</xref>]</td>
<td>2.8</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>TSN-RGB [<xref ref-type="bibr" rid="ref-6">6</xref>]</td>
<td>0.1</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>TSN-flow [<xref ref-type="bibr" rid="ref-6">6</xref>]</td>
<td>1.1</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>Proposed ADSV</td>
<td>0.07</td>
<td>0.03</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="table-9">
<label>Table 9</label>
<caption>
<title>The training parameter of the proposed method</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th colspan="2">Model&#x2019;s training parameters</th>
</tr>
</thead>
<tbody>
<tr>
<td>Batch size</td>
<td>32</td>
</tr>
<tr>
<td>Epochs</td>
<td>50</td>
</tr>
<tr>
<td>Step size</td>
<td>1200</td>
</tr>
<tr>
<td>Initial learning rate</td>
<td>0.001</td>
</tr>
<tr>
<td>Optimizer</td>
<td>Stochastic Gradient Descent (SGD)</td>
</tr>
<tr>
<td>Loss</td>
<td>Categorical crossentropy</td>
</tr>
<tr>
<td>Training time per step</td>
<td>267 millisecond/step</td>
</tr>
<tr>
<td>Training time per epoch</td>
<td>320 s</td>
</tr>
<tr>
<td>Total training time</td>
<td>266.7 min</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>The confusion matrix of the proposed model using both the Avenue and UCF-Crime Dataset are plotted in (a) and (b) respectively</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CSSE_34805-fig-7.tif"/>
</fig>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion and Future Direction</title>
<p>Intelligent surveillance systems are popular among computer vision specialists, primarily for security objectives. They assist in rapid response and countermeasures to any anomalous events occurring in a surveillance scene. However, such algorithms are data-hungry and require robust processing systems for effective and efficient analysis. This research utilized several benchmark anomaly detection datasets and presented the ADSV method for video abnormality detection with state-of-the-art performance. In brief, the technique of anomaly detection in surveillance video consists of three main components: Shot segmentation, feature extraction, sequence learning, and abnormality classifications. To begin with, a shots boundary detection technique is used to segment prominent frames. Furthermore, The LWCNN model receives the segmented frames to extract spatial and temporal information from the intermediate layer. Following that, spatial and temporal features are learned using LSTM cells and Attention Network from a series of frames for each sample of abnormal activity. To detect motion and action, the LWCNN received chronologically sorted frames. Finally, the abnormal activities in video shots are identified using the proposed trained ADSV model. Several evaluation criteria were used to validate our ADSV framework. It has been demonstrated that the ADSV method is more accurate than recently published approaches. The experimental research results show that the suggested ADSV approach significantly lowers false alarm rates when compared to the anomaly detection literature and increases accuracy for the Avenue and UCF-Crime datasets by 12.9% and 14.88%, respectively. However, there is potential for improvement in our proposed system&#x2019;s real-time precision and efficacy. We intend to include channel and temporal Attention-based deep learning networks in the future to improve the precision and effectiveness of the currently proposed ADSV architecture.</p>
</sec>
</body>
<back>
<sec><title>Funding Statement</title>
<p>This research was supported by the <funding-source>Chung-Ang University Research</funding-source> Scholarship Grants in 2021 and the Culture, Sports and Tourism R&#x0026;D Program through the Korea Creative Content Agency grant funded by the <funding-source>Ministry of Culture, Sports, and Tourism in 2022</funding-source> (Project Name: <funding-source>Development of Digital Quarantine and Operation Technologies for Creation of Safe Viewing Environment in Cultural Facilities</funding-source>, Project Number: <award-id>R2021040028</award-id>, Contribution Rate: 100%).</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E. L.</given-names> <surname>Piza</surname></string-name>, <string-name><given-names>B. C.</given-names> <surname>Welsh</surname></string-name>, <string-name><given-names>D. P.</given-names> <surname>Farrington</surname></string-name>, <string-name><given-names>A. L. J. C.</given-names> <surname>Thomas</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Policy</surname></string-name></person-group>, &#x201C;<article-title>CCTV surveillance for crime prevention: A 40-year systematic review with meta-analysis</article-title>,&#x201D; <source>Criminology &#x0026; Public Policy</source>, vol. <volume>18</volume>, no. <issue>1</issue>, pp. <fpage>135</fpage>&#x2013;<lpage>159</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. J. P.</given-names> <surname>Suarez</surname></string-name> and <string-name><given-names>P. C. J. A. P. A.</given-names> <surname>Naval</surname> <suffix>Jr</suffix></string-name></person-group>, &#x201C;<article-title>A survey on deep learning techniques for video anomaly detection</article-title>,&#x201D; <comment>ArXiv Preprint ArXiv:2009.14146</comment>, vol. <volume>2</volume>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Ullah</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ullah</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Hussain</surname></string-name>, <string-name><given-names>Z. A.</given-names> <surname>Khan</surname></string-name> and <string-name><given-names>S. W. J. S.</given-names> <surname>Baik</surname></string-name></person-group>, &#x201C;<article-title>An efficient anomaly recognition framework using an attention residual LSTM in surveillance videos</article-title>,&#x201D; <source>Sensors</source>, vol. <volume>21</volume>, no. <issue>8</issue>, pp. <fpage>2811</fpage>, <year>2021</year>; <pub-id pub-id-type="pmid">33923712</pub-id></mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Cong</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yuan</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Liu</surname></string-name></person-group>, &#x201C;<article-title>Sparse reconstruction cost for abnormal event detection</article-title>,&#x201D; in <conf-name>CVPR 2011</conf-name>, <publisher-loc>Colorado Springs, CO, USA</publisher-loc>, pp. <fpage>3449</fpage>&#x2013;<lpage>3456</lpage>, <year>2011</year>. </mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Qiao</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Niu</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Li</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Abnormal event detection via covariance matrix for optical flow based feature</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>77</volume>, no. <issue>13</issue>, pp. <fpage>17375</fpage>&#x2013;<lpage>17395</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J. -X.</given-names> <surname>Zhong</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Kong</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>T. H.</given-names> <surname>Li</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Graph convolutional label noise cleaner: Train a plug-and-play action classifier for anomaly detection</article-title>,&#x201D; in <conf-name>Proc. of the IEEE/CVF Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Long Beach, CA, USA</publisher-loc>, pp. <fpage>1237</fpage>&#x2013;<lpage>1246</lpage>, <year>2019</year>. </mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K. -W.</given-names> <surname>Cheng</surname></string-name>, <string-name><given-names>Y. -T.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>W. -H. J. M. T.</given-names> <surname>Fang</surname></string-name> and <collab>Applications</collab></person-group>, &#x201C;<article-title>An efficient subsequence search for video anomaly detection and localization</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>75</volume>, no. <issue>22</issue>, pp. <fpage>15101</fpage>&#x2013;<lpage>15122</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yan</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Ricci</surname></string-name>, <string-name><given-names>N. J. C. V.</given-names> <surname>Sebe</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Understanding</surname></string-name></person-group>, &#x201C;<article-title>Detecting anomalous events in videos by learning deep representations of appearance and motion</article-title>,&#x201D; <source>Computer Vision and Image Understanding</source>, vol. <volume>100</volume>, no. <issue>156</issue>, pp. <fpage>117</fpage>&#x2013;<lpage>127</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Jia</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Yang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>He</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>MoWLD: A robust motion image descriptor for violence detection</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>76</volume>, no. <issue>1</issue>, pp. <fpage>1419</fpage>&#x2013;<lpage>1438</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>He</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Shao</surname></string-name>, <string-name><given-names>J. J. M. T.</given-names> <surname>Sun</surname></string-name> and <collab>Applications</collab></person-group>, &#x201C;<article-title>An anomaly-introduced learning method for abnormal event detection</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>77</volume>, no. <issue>22</issue>, pp. <fpage>29573</fpage>&#x2013;<lpage>29588</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Shi</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Jia</surname></string-name></person-group>, &#x201C;<article-title>Abnormal event detection at 150 fps in matlab</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Computer Vision</conf-name>, <publisher-loc>Sydney, NSW, Australia</publisher-loc>, pp. <fpage>2720</fpage>&#x2013;<lpage>2727</lpage>, <year>2013</year>. </mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Sultani</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Shah</surname></string-name></person-group>, &#x201C;<article-title>Real-world anomaly detection in surveillance videos</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Salt Lake City, UT, USA</publisher-loc>, pp. <fpage>6479</fpage>&#x2013;<lpage>6488</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Huo</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Gao</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Yang</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Yin</surname></string-name></person-group>, &#x201C;<article-title>Abnormal event detection via multi-instance dictionary learning</article-title>,&#x201D; in <conf-name>Int. Conf. on Intelligent Data Engineering and Automated Learning</conf-name>, <publisher-loc>Natal, Brazil</publisher-loc>, pp. <fpage>76</fpage>&#x2013;<lpage>83</lpage>, <year>2012</year>. </mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Zhu</surname></string-name> and <string-name><given-names>S. J. A. P. A.</given-names> <surname>Newsam</surname></string-name></person-group>, &#x201C;<article-title>Motion-aware feature for improved video anomaly detection</article-title>,&#x201D; <comment>ArXiv Preprint ArXiv:1907.10211</comment>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Gatica-Perez</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Bengio</surname></string-name> and <string-name><given-names>I.</given-names> <surname>McCowan</surname></string-name></person-group>, &#x201C;<article-title>Semi-supervised adapted HMMs for unusual event detection</article-title>,&#x201D; in <conf-name>2005 IEEE Computer Society Conf. on Computer Vision and Pattern Recognition (CVPR&#x2019;05)</conf-name>, <publisher-loc>San Diego, CA, USA</publisher-loc>, pp. <fpage>611</fpage>&#x2013;<lpage>618</lpage>, <year>2005</year>. </mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Mehran</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Oyama</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Shah</surname></string-name></person-group>, &#x201C;<article-title>Abnormal crowd behavior detection using social force model</article-title>,&#x201D; in <conf-name>2009 IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Miami, FL, USA</publisher-loc>, pp. <fpage>935</fpage>&#x2013;<lpage>942</lpage>, <year>2009</year>. </mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. K. M.</given-names> <surname>Nor</surname></string-name>, <string-name><given-names>S. R.</given-names> <surname>Pedapati</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Muhammad</surname></string-name> and <string-name><given-names>V. J. M.</given-names> <surname>Leiva</surname></string-name></person-group>, &#x201C;<article-title>Abnormality detection and failure prediction using explainable Bayesian deep learning: Methodology and case study with industrial data</article-title>,&#x201D; <source>Mathematics</source>, vol. <volume>10</volume>, no. <issue>4</issue>, pp. <fpage>554</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Shukla</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Nasrin</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Darabi</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Gomes</surname></string-name>, <string-name><given-names>A. R.</given-names> <surname>Trivedi</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Compute-in-memory with monte-carlo dropouts for Bayesian edge intelligence</article-title>,&#x201D; <comment>ArXiv Preprint ArXiv:2111.07125</comment>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Ullah</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Mudassar Yamin</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Mohammed</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Daud Khan</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Ullah</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Attention-based LSTM network for action recognition in sports</article-title>,&#x201D; <source>Electronic Imaging</source>, vol. <volume>2021</volume>, no. <issue>6</issue>, pp. <fpage>302&#x2013;1</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Selicato</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Esposito</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Gargano</surname></string-name>, <string-name><given-names>M. C.</given-names> <surname>Vegliante</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Opinto</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A new ensemble method for detecting anomalies in gene expression matrices</article-title>,&#x201D; <source>Mathematics</source>, vol. <volume>9</volume>, no. <issue>8</issue>, pp. <fpage>882</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Riaz</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Uzair</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Ullah</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Ullah</surname></string-name></person-group>, &#x201C;<article-title>Anomalous human action detection using a cascade of deep learning models</article-title>,&#x201D; in <conf-name>2021 9th European Workshop on Visual Information Processing (EUVIP)</conf-name>, <publisher-loc>Paris, France</publisher-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>5</lpage>, <year>2021</year>. </mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Fei-Fei</surname></string-name> and <string-name><given-names>E. P.</given-names> <surname>Xing</surname></string-name></person-group>, &#x201C;<article-title>Online detection of unusual events in videos via dynamic sparse coding</article-title>,&#x201D; in <conf-name>CVPR 2011</conf-name>, <publisher-loc>Colorado Springs, CO, USA</publisher-loc>, pp. <fpage>3313</fpage>&#x2013;<lpage>3320</lpage>, <year>2011</year>. </mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Gao</surname></string-name></person-group>, &#x201C;<article-title>Remembering history with convolutional lstm for anomaly detection</article-title>,&#x201D; in <conf-name>2017 IEEE Int. Conf. on Multimedia and Expo (ICME)</conf-name>, <publisher-loc>Hong Kong, China</publisher-loc>, pp. <fpage>439</fpage>&#x2013;<lpage>444</lpage>, <year>2017</year>. </mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Lian</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Gao</surname></string-name></person-group>, &#x201C;<article-title>Future frame prediction for anomaly detection a new baseline</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Salt Lake City, UT, USA</publisher-loc>, pp. <fpage>6536</fpage>&#x2013;<lpage>6545</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Chang</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Tu</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Xie</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Yuan</surname></string-name></person-group>, &#x201C;<article-title>Clustering driven deep autoencoder for video anomaly detection</article-title>,&#x201D; in <conf-name>European Conf. on Computer Vision</conf-name>, <publisher-loc>Glasgow, United Kingdom</publisher-loc>, pp. <fpage>329</fpage>&#x2013;<lpage>345</lpage>, <year>2020</year>. </mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Sabokrou</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Khalooei</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Fathy</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Adeli</surname></string-name></person-group>, &#x201C;<article-title>Adversarially learned one-class classifier for novelty detection</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Salt Lake City, UT, USA</publisher-loc>, pp. <fpage>3379</fpage>&#x2013;<lpage>3388</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Tomar</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Agarwal</surname></string-name></person-group>, &#x201C;<article-title>Multiple instance learning based on twin support vector machine</article-title>,&#x201D; <source>Advances in Computer and Computational Sciences</source>, vol. <volume>1</volume>, no. <issue>553</issue>, pp. <fpage>497</fpage>&#x2013;<lpage>507</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Landi</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Snoek</surname></string-name> and <string-name><given-names>R. J. A. P. A.</given-names> <surname>Cucchiara</surname></string-name></person-group>, &#x201C;<article-title>Anomaly locality in video surveillance</article-title>,&#x201D; <comment>ArXiv:1901.10364</comment>, vol. <volume>1</volume>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Javaheri</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Kumala</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Javaheri</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Rawassizadeh</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Lubritz</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Quantifying mechanical properties of automotive steels with deep learning based computer vision algorithms</article-title>,&#x201D; <source>Metals</source>, vol. <volume>10</volume>, no. <issue>2</issue>, pp. <fpage>163</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G. I.</given-names> <surname>Rathod</surname></string-name>, <string-name><given-names>D. A. J. I. J. O. E. T.</given-names> <surname>Nikam</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Engineering</surname></string-name></person-group>, &#x201C;<article-title>An algorithm for shot boundary detection and key frame extraction using histogram difference</article-title>,&#x201D; <source>International Journal of Emerging Technology and Advanced Engineering</source>, vol. <volume>3</volume>, no. <issue>8</issue>, pp. <fpage>155</fpage>&#x2013;<lpage>163</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Nawaratne</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Alahakoon</surname></string-name>, <string-name><given-names>D. De</given-names> <surname>Silva</surname></string-name> and <string-name><given-names>X. J. I. T. O. I. I.</given-names> <surname>Yu</surname></string-name></person-group>, &#x201C;<article-title>Spatiotemporal anomaly detection using deep learning for real-time video surveillance</article-title>,&#x201D; <source>IEEE Transactions on Industrial Informatics</source>, vol. <volume>16</volume>, no. <issue>1</issue>, pp. <fpage>393</fpage>&#x2013;<lpage>402</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Yao</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Chen</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Cascade and parallel convolutional recurrent neural networks on EEG-based intention recognition for brain computer interface</article-title>,&#x201D; in <conf-name>Proc. of the AAAI Conf. on Artificial Intelligence</conf-name>, <publisher-loc>New Orleans, Louisiana, USA</publisher-loc>, pp. <fpage>1703</fpage>&#x2013;<lpage>1710</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Bahdanau</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Cho</surname></string-name> and <string-name><given-names>Y. J. A. P. A.</given-names> <surname>Bengio</surname></string-name></person-group>, &#x201C;<article-title>Neural machine translation by jointly learning to align and translate</article-title>,&#x201D; <comment>ArXiv Preprint ArXiv:1409.0473</comment>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>McInnes</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Healy</surname></string-name> and <string-name><given-names>J. J. A. P. A.</given-names> <surname>Melville</surname></string-name></person-group>, &#x201C;<article-title>Umap: Uniform manifold approximation and projection for dimension reduction</article-title>,&#x201D; <comment>ArXiv Preprint ArXiv:1802.03426</comment>, vol. <volume>3</volume>, no. <issue>29</issue>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Hasan</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Choi</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Neumann</surname></string-name>, <string-name><given-names>A. K.</given-names> <surname>Roy-Chowdhury</surname></string-name> and <string-name><given-names>L. S.</given-names> <surname>Davis</surname></string-name></person-group>, &#x201C;<article-title>Learning temporal regularity in video sequences</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Los Alamitos, CA, USA</publisher-loc>, pp. <fpage>733</fpage>&#x2013;<lpage>742</lpage>, <year>2016</year>. </mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>Y. S.</given-names> <surname>Chong</surname></string-name> and <string-name><given-names>Y. H.</given-names> <surname>Tay</surname></string-name></person-group>, &#x201C;<chapter-title>Abnormal event detection in videos using spatiotemporal autoencoder</chapter-title>,&#x201D; in <source>Advances in Neural Network&#x2014;ISSN 2017</source>, <edition>2nd</edition> ed., <publisher-loc>Muran, Hokkaido, Japan</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>, pp. <fpage>189</fpage>&#x2013;<lpage>196</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Tudor Ionescu</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Smeureanu</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Alexe</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Popescu</surname></string-name></person-group>, &#x201C;<article-title>Unmasking the abnormal events in video</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Computer Vision</conf-name>, <publisher-loc>Venice, Italy</publisher-loc>, pp. <fpage>2895</fpage>&#x2013;<lpage>2903</lpage>, <year>2017</year>. </mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Luo</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Gao</surname></string-name></person-group>, &#x201C;<article-title>A revisit of sparse coding based anomaly detection in stacked RNN framework</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Computer Vision</conf-name>, <publisher-loc>Venice, Italy</publisher-loc>, pp. <fpage>341</fpage>&#x2013;<lpage>349</lpage>, <year>2017</year>. </mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J. T.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Du</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zhu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Peng</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Liu</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Anomalynet: An anomaly detection network for video surveillance</article-title>,&#x201D; <source>IEEE Transactions on Information Forensics and Security</source>, vol. <volume>14</volume>, no. <issue>10</issue>, pp. <fpage>2537</fpage>&#x2013;<lpage>2550</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Hinami</surname></string-name>, <string-name><given-names>T.</given-names> <surname>Mei</surname></string-name> and <string-name><given-names>S. I.</given-names> <surname>Satoh</surname></string-name></person-group>, &#x201C;<article-title>Joint detection and recounting of abnormal events by learning deep generic knowledge</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Computer Vision</conf-name>, <publisher-loc>Venice, Italy</publisher-loc>, pp. <fpage>3619</fpage>&#x2013;<lpage>3627</lpage>, <year>2017</year>. </mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Ullah</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ullah</surname></string-name>, <string-name><given-names>I. U.</given-names> <surname>Haq</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Muhammad</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Sajjad</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>CNN features with bi-directional LSTM for real-time anomaly detection in surveillance networks</article-title>,&#x201D; <source>Multimedia Tools and Applications</source>, vol. <volume>80</volume>, no. <issue>11</issue>, pp. <fpage>16979</fpage>&#x2013;<lpage>16995</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. Ul</given-names> <surname>Amin</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Ullah</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Sajjad</surname></string-name>, <string-name><given-names>F. A.</given-names> <surname>Cheikh</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Hijji</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>EADN: An efficient deep learning model for anomaly detection in videos</article-title>,&#x201D; <source>Mathematics</source>, vol. <volume>10</volume>, no. <issue>9</issue>, pp. <fpage>1555</fpage>, <year>2022</year>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Szegedy</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Vanhoucke</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ioffe</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Shlens</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Wojna</surname></string-name></person-group>, &#x201C;<article-title>Rethinking the inception architecture for computer vision</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Los Alamitos, CA, USA</publisher-loc>, pp. <fpage>2818</fpage>&#x2013;<lpage>2826</lpage>, <year>2016</year>. </mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>U.</given-names> <surname>Gianchandani</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Tirupattur</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Shah</surname></string-name></person-group>, &#x201C;<article-title>Weakly-supervised spatiotemporal anomaly detection</article-title>,&#x201D; <publisher-name>University of Central Florida Center for Research in Computer Vision REU</publisher-name>, <year>2019</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>