<?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" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">IASC</journal-id>
<journal-id journal-id-type="nlm-ta">IASC</journal-id>
<journal-id journal-id-type="publisher-id">IASC</journal-id>
<journal-title-group>
<journal-title>Intelligent Automation &#x0026; Soft Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2326-005X</issn>
<issn pub-type="ppub">1079-8587</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">29535</article-id>
<article-id pub-id-type="doi">10.32604/iasc.2022.029535</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Criss-Cross Attention Based Auto Encoder for Video Anomaly Event Detection</article-title><alt-title alt-title-type="left-running-head">Criss-Cross Attention Based Auto Encoder for Video Anomaly Event Detection</alt-title><alt-title alt-title-type="right-running-head">Criss-Cross Attention Based Auto Encoder for Video Anomaly Event Detection</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Wang</surname><given-names>Jiaqi</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>Zhang</surname><given-names>Jie</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Ji</surname><given-names>Genlin</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref><email>glji@njnu.edu.cn</email>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Sheng</surname><given-names>Bo</given-names></name>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>School of Mathematical Sciences, Nanjing Normal University</institution>, <addr-line>Nanjing, 210023</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>School of Computer and Electronic Information, Nanjing Normal University</institution>, <addr-line>Nanjing, 210023</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer Science, University of Massachusetts Boston</institution>, <addr-line>Boston, 02125</addr-line>, <country>USA</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Genlin Ji. Email: <email>glji@njnu.edu.cn</email></corresp></author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-05-23"><day>23</day>
<month>05</month>
<year>2022</year></pub-date>
<volume>34</volume>
<issue>3</issue>
<fpage>1629</fpage>
<lpage>1642</lpage>
<history>
<date date-type="received"><day>05</day><month>3</month><year>2022</year></date>
<date date-type="accepted"><day>12</day><month>4</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Wang, Zhang, Ji and Sheng</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Wang, Zhang, Ji and Sheng</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_IASC_29535.pdf"></self-uri>
<abstract>
<p>The surveillance applications generate enormous video data and present challenges to video analysis for huge human labor cost. Reconstruction-based convolutional autoencoders have achieved great success in video anomaly detection for their ability of automatically detecting abnormal event. The approaches learn normal patterns only with the normal data in an unsupervised way due to the difficulty of collecting anomaly samples and obtaining anomaly annotations. But convolutional autoencoders have limitations in global feature extraction for the local receptive field of convolutional kernels. What is more, 2-dimensional convolution lacks the capability of capturing temporal information while videos change over time. In this paper, we propose a method established on Criss-Cross attention based AutoEncoder (CCAE) for capturing global visual features of sequential video frames. The method utilizes Criss-Cross attention based encoder to extract global appearance features. Another Criss-Cross attention module is embedded into bi-directional convolutional long short-term memory in hidden layer to explore global temporal features between frames. A decoder is executed to fuse global appearance and temporal features and reconstruct the frames. We perform extensive experiments on two public datasets UCSD Ped2 and CUHK Avenue. The experimental results demonstrate that CCAE achieves superior detection accuracy compared with other video anomaly detection approaches.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Video anomaly detection</kwd>
<kwd>bi-directional long short-term memory</kwd>
<kwd>convolutional autoencoder</kwd>
<kwd>Criss-Cross attention module</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The ubiquitous surveillance cameras in public areas such as streets, banks and malls have produced massive amount of video data. It is time consuming and infeasible for human observers analyzing and monitoring every video stream. Video Anomaly Detection (VAD) is important in intelligent surveillance systems which can automatically detect appearance and motion anomaly of objects that deviate significantly from the normality [<xref ref-type="bibr" rid="ref-1">1</xref>]. VAD aims to associate each frame with an anomaly score for the temporal variation, a spatial score to localize the anomaly in space, and identify the type of anomaly [<xref ref-type="bibr" rid="ref-2">2</xref>]. Although VAD has been studied for several decades, the task still remains challenging. (1) The anomaly events are much less than normal ones in real-world scenarios [<xref ref-type="bibr" rid="ref-3">3</xref>]. (2) The definition of abnormal samples is not clear. For example, crowd gathering is normal in supermarket while abnormal in the context of epidemic prevention. (3) Anomalous behaviors and items are diverse and the distribution of anomaly patterns is unknown in advance [<xref ref-type="bibr" rid="ref-4">4</xref>]. It is very difficult to detect all possible anomalous samples. The imbalance, ambiguous and diversity characteristics of video data make it impractical to gather labeled data of all types of possible anomalies. To address this problem, VAD is always treated as an unsupervised task by exploiting the regular patterns only with the normal data.</p>
<p>Reconstruction-based models are the most common strategies in unsupervised learning. The basic idea is to reconstruct normal data with low reconstruction error in the training phrase. During testing, the distinctive encoded patterns are detected as anomalies. Early anomaly detection methods are mainly relied on handcrafted feature engineering with machine learning techniques [<xref ref-type="bibr" rid="ref-5">5</xref>]. In recent years, deep learning-based reconstruction models are popular for the capability of extracting features and training models in a unified framework. Videos are high dimensional signals with both spatial structure and temporal variations [<xref ref-type="bibr" rid="ref-2">2</xref>]. For unsupervised representation learning, a variety of models have been proposed to combine Convolutional Neural Network (CNN) and autoencoder to automatically model both the appearance and motion features. However, these methods have limitations in global information extraction, because CNN concentrates on local information and will lead to information loss on remote features. In addition, 2-dementional CNN is suitable for images, but it is incapable to capture the temporal information for consecutive video frames.</p>
<p>Surveillance videos change over time. The chain-like building blocks of Long Short-Term Memory (LSTM) with forget, input and output gates can regulate long-term sequence pattern recognition [<xref ref-type="bibr" rid="ref-6">6</xref>]. The variant of convolutional LSTM (ConvLSTM) models have been proposed with autoencoder to reconstruct and predict temporal features for sequential video frames [<xref ref-type="bibr" rid="ref-7">7</xref>]. Although deep convolutions are strong in visual features learning and LSTM can capture temporal information, the ConvLSTM models are limited in local receptive fields of CNN which only provide a few surrounding contextual information.</p>
<p>To better capture long-range global dependencies, many researches optimize the encoder and decoder through an attention mechanism [<xref ref-type="bibr" rid="ref-8">8</xref>]. Self-attention [<xref ref-type="bibr" rid="ref-9">9</xref>] is an efficient mechanism which allows each query position in the input sequence to perceive all positions and take their weighted average. The model implies the importance to the effective areas and suppresses other irrelevant areas. In this way self-attention module can obtain full-image contextual information. But the generation of attention maps leads to a very high computational complexity, because we have to measure the relationships for each pair of pixels. Recently, Criss-Cross attention [<xref ref-type="bibr" rid="ref-10">10</xref>] is put forward as an efficient way to harvest full-image contextual information for all the pixels only on its criss-cross path.</p>
<p>To handle the issues mentioned above, we propose a novel method which combines Criss-Cross attention module with bi-directional ConvLSTM and autoencoder for video anomaly detection. The method utilizes an encoder with Criss-Cross module to extract global appearance features. Global temporal features are then calculated by adding a Criss-Cross based bi-directional ConvLSTM network between the encoder and decoder. A decoder is used to fuse the two kinds of features and reconstruct frames for the goal of capturing global features in spatial and temporal space simultaneously. Given several consecutive frames, the method learns the normal patterns well, while the anomaly frame is expected to be distorted and blurry.</p>
<p>The main contributions of this paper are summarized as follows:<list list-type="order"><list-item>
<p>We propose a novel CCAE method for video anomaly detection. By combining Criss-Cross attention module with bi-directional ConvLSTM and autoencoder, the method is able to learn global appearance features and global temporal features.</p></list-item><list-item>
<p>A smooth L1 loss is utilized as intensity loss to compare two video frames pixel by pixel for reconstruction. Smooth L1 loss is smoother near zero than L1 loss, and can prevent from exploding gradient compare to L2 loss.</p></list-item><list-item>
<p>CCAE can accurately detect abnormal events with frame level AUC of 95.3% for UCSD Ped2 dataset and 84.0% for CUHK Avenue dataset. The experimental results show that the proposed method attains competitive detection accuracies compared with other VAD methods.</p></list-item></list></p>
<p>The rest of the paper is organized as follows. Section 2 discusses the brief review of related works on video anomaly detection and attention mechanism. Section 3 describes the details of the proposed CCAE method. The evaluation of experimental results and comparison with existing methods are presented in Section 4. At the end of this paper we conclude our work and discuss the future research directions.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Works</title>
<sec id="s2_1">
<label>2.1</label>
<title>Video Anomaly Detection</title>
<p>Due to the scarce of anomaly data and difficulties of annotations, video anomaly detection has been formulated mainly in unsupervised settings. Previous anomaly detection methods are mainly based on handcrafted feature engineering. Kim et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] capture the distribution of local optical flow patterns with a Mixture of Probabilistic Principal Component Analyzers (MPPCA) [<xref ref-type="bibr" rid="ref-12">12</xref>], then use Markov Random Field (MRF) graph to detect abnormal patterns in incoming video clips. Mahadevan et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] model normal crowd behavior for each spatial-temporal block using Mixtures of Dynamic Textures (MDT) [<xref ref-type="bibr" rid="ref-14">14</xref>], then temporal anomalies are equated to events of low-probability, while spatial anomalies are handled using discriminant saliency. Mehran et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] detect and localize abnormal crowd behavior using the social force (SF) model. Adam et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] detect abnormal events by multiple monitors which utilize histograms to measure the probability of optical flow in a local patch. The handcrafted features can accurately model both spatial and temporal information. However, they are task-specific and require prior knowledge for feature designing. Therefore, the handcrafted features are difficult to adapt to other scenarios [<xref ref-type="bibr" rid="ref-17">17</xref>] and are impractical in real scenarios.</p>
<p>Nowadays, deep learning models have been shown to perform well in video anomaly detection tasks. For example, CNN can effectively extract high-level features by local kernels. Sabokrou et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] use Fully Convolutional Neural Network (FCNN) for detecting and localizing anomalies. Some researchers also train CNN on large-scale ImageNet to obtain the feature representation in video object tracking to solve the problem of insufficient training data [<xref ref-type="bibr" rid="ref-19">19</xref>]. Recently, many unsupervised video anomaly detection models are proposed based on deep autoencoder architecture, which is composed of an encoder to compress the input vector into a low-dimension embedding, and a decoder to reconstruct the dense vector back to the input vector [<xref ref-type="bibr" rid="ref-20">20</xref>]. Hasan [<xref ref-type="bibr" rid="ref-21">21</xref>] build a 2-dimentional Convolutional AutoEncoder (ConvAE) to model the normal videos by stacking the frames. U-net [<xref ref-type="bibr" rid="ref-22">22</xref>] is and end-to-end encoder-decoder architecture for biomedical image segmentation. Sabokrou et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] introduce a novel cubic-patch-based model based on autoencoder to reconstruct input video patch. But 2-dimentional convolutional operation fails to capture temporal cues of video frames. Although Deepak et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] try to capture information on the temporal dimension by using 3-dimentional kernels, it is still inadequate to accurately detect the sequential anomalous samples. Modeling temporal patterns in a timely manner has remained challenging.</p>
<p>Learning temporal features in VAD has attracted many researchers. Inspired by the temporal capability of LSTM for sequential video frames, some works combine ConvAE and LSTM to model spatial and temporal normal patterns simultaneously. Chong et al. [<xref ref-type="bibr" rid="ref-25">25</xref>] use a stack of ConvAE to capture spatial structures, and then the video representation is fed into a stack of ConvLSTM in autoencoder architecture for temporal patterns. Luo et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] design a parse coding inspired deep recurrent neural network autoencoder framework for alleviating the hyper-parameters selection and dictionary training in temporally-coherent sparse coding. While effective, ConvLSTM is constrained by the size of convolution kernels of CNN. The models focus on the local information and cannot fuse the remote features.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Attention Mechanism</title>
<p>Attention module has achieved great success in many computer vision tasks to aggregate global contextual information for better feature representation. The methods can be classified as channel-wise attention [<xref ref-type="bibr" rid="ref-27">27</xref>] and spatial-wise attention [<xref ref-type="bibr" rid="ref-28">28</xref>]. Hu et al. [<xref ref-type="bibr" rid="ref-27">27</xref>] propose a Squeeze-and-Extraction (SE) block to calculate the channel-wise feature maps. Gong et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] propose a Memory-augmented AutoEncoder (MemAE) to encode the latent vector as query to obtain the soft addressing weights. Sun et al. [<xref ref-type="bibr" rid="ref-29">29</xref>] propose a multi-feature learning model with global feature and enhanced local attention for vehicle re-identification in video surveillance. We have known that convolutions and recurrent operations process the local neighborhood at a time, either spatially or temporally; then the long-term dependencies are modeled by repeatedly applying the local operations. In contrast to these ineffective local models, Wang [<xref ref-type="bibr" rid="ref-30">30</xref>] propose a non-local module to capture long-range dependencies by computing interactions between any two positions. The model guarantees that a pixel at any position can perceive contextual information of all other pixels. The non-local modules can be combined with other models easily. However, the non-local methods are always with huge attention maps and thus are computational complexity. To address this problem, a more efficient Criss-Cross attention [<xref ref-type="bibr" rid="ref-10">10</xref>] is proposed to aggregate the contextual information of each pixel only in its horizontal and vertical directions. By stacking two consecutive Criss-Cross modules, each position of input can collect contextual information from all other pixels.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Method</title>
<p>In this section, we employ the proposed CCAE to learn the normal patterns of normal videos. The diagram of video anomaly detection process is illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. A sequence of frames <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> are given, we adopt CCAE to reconstruct the last frame <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> as <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula>. In the training stage, CCAE is trained by minimizing the loss function calculated between the reconstructed frame <inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> and the real frame <inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>. In this way the normal patterns are learned from normal training samples. During testing, we calculate the regularity score of testing frame <inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> based on the reconstructed frame <inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> and the ground truth <inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>. Testing frame <inline-formula id="ieqn-9">
<mml:math id="mml-ieqn-9"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> will be regarded as abnormal if it deviates significantly from the normal pattern.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The diagram of video anomaly detection process</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-1.png"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>Criss-Cross Attention Based Auto Encoder (CCAE)</title>
<p>The proposed CCAE is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The method is composed of Criss-Cross attention encoder, Criss-Cross attention based Bi-directional ConvLSTM (CCBiLSTM) and a decoder. The Criss-Cross attention encoder extracts continuous appearance features with an encoder and obtains the global appearance features with Criss-Cross attention module; then the continuous appearance features are fed into the CCBiLSTM to capture global temporal features; the extracted global appearance features and global temporal features are fused together and used to reconstruct the frames. Inspired by U-net [<xref ref-type="bibr" rid="ref-22">22</xref>], each layer of the encoder-decoder in CCAE is added with a skip connection to obtain the features of the same layer, which can retain more context semantic information.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>The overview of CCAE</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-2.png"/>
</fig>
<sec id="s3_1_1">
<label>3.1.1</label>
<title>The Criss-Cross Attention Module</title>
<p>We first introduce the Criss-Cross attention module [<xref ref-type="bibr" rid="ref-10">10</xref>] which is utilized to aggregate global contextual information of video appearance and temporal features in CCAE. The module can capture the contextual information of each pixel in its horizontal and vertical directions which is very effective. For example, if an input feature map <inline-formula id="ieqn-10">
<mml:math id="mml-ieqn-10"><mml:mi>H</mml:mi></mml:math>
</inline-formula> is fed into the Criss-Cross module, a new feature map <inline-formula id="ieqn-11">
<mml:math id="mml-ieqn-11"><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math>
</inline-formula> will be generated by collecting the contextual information for each pixel in its criss-cross path.</p>
<p>The details of Criss-Cross Attention module are shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. Given a local feature map <inline-formula id="ieqn-12">
<mml:math id="mml-ieqn-12"><mml:mi>H</mml:mi></mml:math>
</inline-formula>, the module first applies two convolutional layers with <inline-formula id="ieqn-13">
<mml:math id="mml-ieqn-13"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math>
</inline-formula> filters on <inline-formula id="ieqn-14">
<mml:math id="mml-ieqn-14"><mml:mi>H</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>H</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula> to generate two feature maps <inline-formula id="ieqn-15">
<mml:math id="mml-ieqn-15"><mml:mi>Q</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:msup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>H</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula> and <inline-formula id="ieqn-16">
<mml:math id="mml-ieqn-16"><mml:mi>K</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:msup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>H</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula>. We further generate an attention map <inline-formula id="ieqn-17">
<mml:math id="mml-ieqn-17"><mml:mi>A</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mo>+</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>H</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula> via Affinity operation. At each position <inline-formula id="ieqn-18">
<mml:math id="mml-ieqn-18"><mml:mi>u</mml:mi></mml:math>
</inline-formula> in the spatial dimension of <inline-formula id="ieqn-19">
<mml:math id="mml-ieqn-19"><mml:mi>Q</mml:mi></mml:math>
</inline-formula>, we can obtain a vector <inline-formula id="ieqn-20">
<mml:math id="mml-ieqn-20"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:msup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula>. Meanwhile, we can also obtain the set <inline-formula id="ieqn-21">
<mml:math id="mml-ieqn-21"><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mo>+</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msup><mml:mi>C</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula> by extracting feature vectors from <inline-formula id="ieqn-22">
<mml:math id="mml-ieqn-22"><mml:mi>K</mml:mi></mml:math>
</inline-formula> which are in the same row or column with position <inline-formula id="ieqn-23">
<mml:math id="mml-ieqn-23"><mml:mi>u</mml:mi></mml:math>
</inline-formula>. <inline-formula id="ieqn-24">
<mml:math id="mml-ieqn-24"><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:msup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula> is the <inline-formula id="ieqn-25">
<mml:math id="mml-ieqn-25"><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> element of <inline-formula id="ieqn-26">
<mml:math id="mml-ieqn-26"><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula>. The Affinity operation is then defined as follow:</p>
<p><disp-formula id="ueqn-1">
<mml:math id="mml-ueqn-1" display="block"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow><mml:msubsup><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msubsup><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-27">
<mml:math id="mml-ieqn-27"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> is the degree of correlation between feature <inline-formula id="ieqn-28">
<mml:math id="mml-ieqn-28"><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> and <inline-formula id="ieqn-29">
<mml:math id="mml-ieqn-29"><mml:mrow><mml:msub><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula>. Then a softmax layer is applied over the channel dimension to calculate the attention map <inline-formula id="ieqn-30">
<mml:math id="mml-ieqn-30"><mml:mi>A</mml:mi></mml:math>
</inline-formula>.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The details of Criss-Cross attention module</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-3.png"/>
</fig>
<p>The third convolutional layer with <inline-formula id="ieqn-31">
<mml:math id="mml-ieqn-31"><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:math>
</inline-formula> filters is applied on <inline-formula id="ieqn-32">
<mml:math id="mml-ieqn-32"><mml:mi>H</mml:mi></mml:math>
</inline-formula> to generate <inline-formula id="ieqn-33">
<mml:math id="mml-ieqn-33"><mml:mi>V</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>H</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula> for feature adaptation. We can obtain a vector <inline-formula id="ieqn-34">
<mml:math id="mml-ieqn-34"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">V</mml:mi></mml:mrow><mml:mi>u</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mi>C</mml:mi></mml:msup></mml:mrow></mml:math>
</inline-formula> and a set <inline-formula id="ieqn-35">
<mml:math id="mml-ieqn-35"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mi>u</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mo>+</mml:mo><mml:mi>W</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mi>H</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula>. The set <inline-formula id="ieqn-36">
<mml:math id="mml-ieqn-36"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mi>u</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> is a collection of feature vectors in <inline-formula id="ieqn-37">
<mml:math id="mml-ieqn-37"><mml:mi>V</mml:mi></mml:math>
</inline-formula> which are in the same row or column with position <inline-formula id="ieqn-38">
<mml:math id="mml-ieqn-38"><mml:mi>u</mml:mi></mml:math>
</inline-formula>. The contextual information is collected by an Aggregation operation defined as follow:</p>
<p><disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:msubsup><mml:mi>H</mml:mi><mml:mi>u</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:munder><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mi>u</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow></mml:munder><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03A6;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-39">
<mml:math id="mml-ieqn-39"><mml:msubsup><mml:mi>H</mml:mi><mml:mi>u</mml:mi><mml:mrow><mml:msup><mml:mi></mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msubsup><mml:mspace width="thickmathspace" /></mml:math>
</inline-formula>is a feature vector in <inline-formula id="ieqn-40">
<mml:math id="mml-ieqn-40"><mml:msup><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>R</mml:mi><mml:mrow><mml:mi>C</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>H</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>W</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math>
</inline-formula> at position <inline-formula id="ieqn-41">
<mml:math id="mml-ieqn-41"><mml:mi>u</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-42">
<mml:math id="mml-ieqn-42"><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /></mml:math>
</inline-formula>is a scalar value at channel <italic>i</italic> and position <inline-formula id="ieqn-43">
<mml:math id="mml-ieqn-43"><mml:mi>u</mml:mi></mml:math>
</inline-formula> in <inline-formula id="ieqn-44">
<mml:math id="mml-ieqn-44"><mml:mi>A</mml:mi></mml:math>
</inline-formula>. The contextual information is added to local feature <inline-formula id="ieqn-45">
<mml:math id="mml-ieqn-45"><mml:mi>H</mml:mi></mml:math>
</inline-formula> to augment the pixel-wise representation. Therefore, it has a wide contextual view and selectively aggregates contexts according to the spatial attention map. Each position in the feature map is sparsely connected with others which are in the same row and the same column in Criss-Cross attention module, leading to the global attention map only has about <inline-formula id="ieqn-46">
<mml:math id="mml-ieqn-46"><mml:mn>2</mml:mn><mml:msqrt><mml:mi>N</mml:mi></mml:msqrt></mml:math>
</inline-formula> weights rather than <inline-formula id="ieqn-47">
<mml:math id="mml-ieqn-47"><mml:mrow><mml:mi mathvariant="normal">N</mml:mi></mml:mrow></mml:math>
</inline-formula> in non-local module. By stacking two consecutive Criss-Cross models, each position can perceive the full contextual information from all the pixels of the input. In this way, CCAE can effectively capture long-range global dependencies of video features through the Criss-Cross attention mechanism.</p>
</sec>
<sec id="s3_1_2">
<label>3.1.2</label>
<title>Criss-Cross Attention Based Auto Encoder</title>
<p>In CCAE, the Criss-Cross attention encoder extracts the appearance features of the video frames by convolution operation, and the size of feature map is reduced to 1/2 of the original size by maxpooling. With the number of channels remaining consistent, totally four iterations are performed to obtain the appearance features in different scales. Then, these appearance features are fed into Criss-Cross attention module to obtain the global appearance features in different scales. The fourth extraction of the appearance features is sent to CCBiLSTM to extract the global temporal features. In the final step, a decoder fuses global appearance features and global temporal features by deconvolution and connection, and generates high-quality reconstructed frames.</p>
<p>The details of CCBiLSTM is shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. The Criss-Cross attention module not only captures the global spatial relationship of a single video frame, but also captures the global temporal dependency between consecutive video frames. In this way, attention can be allocated in the whole spatial region and time dimension to improve the utilization of temporal and appearance features. The continuous appearance features are input into bi-directional ConvLSTM to extract the temporal features between video frames, and then the global temporal features are obtained by weighting the temporal features through the Criss-Cross attention module. The bi-directional ConvLSTM network consists of forward ConvLSTM and reverse ConvLSTM, which generate forward and reverse feature vectors, and these two vectors can be connected to generate video frame feature. Then, the global temporal features are obtained by weighting the features with Criss-Cross attention modules, as follows:</p>
<p><disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mspace width="thickmathspace" /><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi><mml:mi>L</mml:mi><mml:mi>S</mml:mi><mml:mi>T</mml:mi><mml:mrow><mml:msup><mml:mi>M</mml:mi><mml:mi>f</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mover><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">v</mml:mi><mml:mi mathvariant="normal">L</mml:mi><mml:mi mathvariant="normal">S</mml:mi><mml:mi mathvariant="normal">T</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="normal">M</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">b</mml:mi></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">x</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">c</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:mover><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow></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:msub><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mi mathvariant="normal">g</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">b</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mspace width="thickmathspace" /><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">C</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">t</mml:mi></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:mrow></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-48">
<mml:math id="mml-ieqn-48"><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math>
</inline-formula> represents the temporal features obtained by forward ConvLSTM <inline-formula id="ieqn-49">
<mml:math id="mml-ieqn-49"><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi><mml:mi>L</mml:mi><mml:mi>S</mml:mi><mml:mi>T</mml:mi><mml:mrow><mml:msup><mml:mi>M</mml:mi><mml:mi>f</mml:mi></mml:msup></mml:mrow></mml:math>
</inline-formula>, <inline-formula id="ieqn-50">
<mml:math id="mml-ieqn-50"><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover></mml:math>
</inline-formula> denotes the temporal features obtained by reverse ConvLSTM <inline-formula id="ieqn-51">
<mml:math id="mml-ieqn-51"><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>v</mml:mi><mml:mi>L</mml:mi><mml:mi>S</mml:mi><mml:mi>T</mml:mi><mml:mrow><mml:msup><mml:mi>M</mml:mi><mml:mi>b</mml:mi></mml:msup></mml:mrow></mml:math>
</inline-formula>. <inline-formula id="ieqn-52">
<mml:math id="mml-ieqn-52"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</inline-formula> represents the video frame features of consecutive <inline-formula id="ieqn-53">
<mml:math id="mml-ieqn-53"><mml:mi>t</mml:mi></mml:math>
</inline-formula> frames extracted by the encoder,<inline-formula id="ieqn-54">
<mml:math id="mml-ieqn-54"><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> is the time sequence feature which concatenates <inline-formula id="ieqn-55">
<mml:math id="mml-ieqn-55"><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math>
</inline-formula> and <inline-formula id="ieqn-56">
<mml:math id="mml-ieqn-56"><mml:mover><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2190;</mml:mo></mml:mover></mml:math>
</inline-formula>. <inline-formula id="ieqn-57">
<mml:math id="mml-ieqn-57"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>g</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> represents the global temporal features obtained after Criss-Cross attention operation.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The details of CCBiLSTM</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-4.png"/>
</fig>
</sec>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Loss Function</title>
<p>Intensity loss and gradient loss are employed into loss function of CCAE so that the reconstructed video frames can be closer to the real frames. The intensity loss <inline-formula id="ieqn-58">
<mml:math id="mml-ieqn-58"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> uses smooth L1 loss [<xref ref-type="bibr" rid="ref-31">31</xref>] to compare two video frames pixel by pixel. Compared with L1 loss, smooth L1 loss is robust to outliers and is smoother near zero. What is more, the smooth L1 loss can prevent from exploding gradient of L2 loss [<xref ref-type="bibr" rid="ref-32">32</xref>]. We define <inline-formula id="ieqn-59">
<mml:math id="mml-ieqn-59"><mml:mi>x</mml:mi></mml:math>
</inline-formula> as the distance between the reconstructed frame pixel <inline-formula id="ieqn-60">
<mml:math id="mml-ieqn-60"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> and real frame pixel <inline-formula id="ieqn-61">
<mml:math id="mml-ieqn-61"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula>, then the loss function is calculated pixel by pixel as follow:</p>
<p><disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>|</mml:mo><mml:mi>x</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&lt;</mml:mo><mml:mn>1</mml:mn></mml:mstyle></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi>x</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thickmathspace" /></mml:mstyle></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>The purpose of gradient loss <inline-formula id="ieqn-62">
<mml:math id="mml-ieqn-62"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">L</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> is to ensure that the gradients of the reconstructed frame and the real frame are close. The gradient loss calculates the distance between the pixels in the reconstructed frame and the adjacent pixels in the real frame, which is shown as follow:</p>
<p><disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">L</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow><mml:msub><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow><mml:msub><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-63">
<mml:math id="mml-ieqn-63"><mml:mi>i</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-64">
<mml:math id="mml-ieqn-64"><mml:mi>j</mml:mi></mml:math>
</inline-formula> represent the horizontal and vertical coordinates of the pixels in the video frame.</p>
<p>In the training stage, we combine intensity constraint and gradient constraint to improve the reconstruction ability of CCAE by minimizing the loss function<inline-formula id="ieqn-65">
<mml:math id="mml-ieqn-65"><mml:mrow><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula>. The combined loss function is as follow:</p>
<p><disp-formula id="eqn-9"><label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">L</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /><mml:mspace width="thickmathspace" /></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-66">
<mml:math id="mml-ieqn-66"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> and <inline-formula id="ieqn-67">
<mml:math id="mml-ieqn-67"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> are used for weighted loss.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Regularity Score</title>
<p>For abnormal frames, there will be more reconstruction errors compared with the ground truth. In other words, the probability of a frame to be abnormal impacts the quality of the reconstructed frame. It is intuitive to calculate the anomaly score by measuring image quality. We use the Peak Signal Noise Ratio (PSNR) for image quality assessment.</p>
<p><disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:mi>R</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>10</mml:mn><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>M</mml:mi></mml:mfrac></mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>M</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:munderover><mml:mrow><mml:mo movablelimits="false">&#x2211;</mml:mo></mml:mrow><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mstyle></mml:mstyle></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-68">
<mml:math id="mml-ieqn-68"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> is the ground truth of <inline-formula id="ieqn-69">
<mml:math id="mml-ieqn-69"><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>x</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</inline-formula> , and <inline-formula id="ieqn-70">
<mml:math id="mml-ieqn-70"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</inline-formula> is the reconstructed <inline-formula id="ieqn-71">
<mml:math id="mml-ieqn-71"><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>x</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</inline-formula>. <inline-formula id="ieqn-72">
<mml:math id="mml-ieqn-72"><mml:mi>M</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-73">
<mml:math id="mml-ieqn-73"><mml:mi>N</mml:mi></mml:math>
</inline-formula> are the height and width of the frame.</p>
<p>A higher PSNR value indicates a higher quality of the frame, which means it is more likely to be normal. We normalize the PSNR value into <inline-formula id="ieqn-74">
<mml:math id="mml-ieqn-74"><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</inline-formula> for frame <inline-formula id="ieqn-75">
<mml:math id="mml-ieqn-75"><mml:mi>t</mml:mi></mml:math>
</inline-formula> and the regularity score is calculated as follows:</p>
<p><disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mspace width="thickmathspace" /><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mspace width="thickmathspace" /></mml:msub></mml:mrow><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:mi>R</mml:mi><mml:mspace width="thickmathspace" /></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mspace width="thickmathspace" /></mml:msub></mml:mrow><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:mi>R</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mspace width="thickmathspace" /></mml:msub></mml:mrow><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:mi>R</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mspace width="thickmathspace" /></mml:mstyle></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-76">
<mml:math id="mml-ieqn-76"><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math>
</inline-formula> is its original PSNR value. <inline-formula id="ieqn-77">
<mml:math id="mml-ieqn-77"><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:mi>R</mml:mi></mml:math>
</inline-formula> and <inline-formula id="ieqn-78">
<mml:math id="mml-ieqn-78"><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mspace width="thickmathspace" /><mml:mi>P</mml:mi><mml:mi>S</mml:mi><mml:mi>N</mml:mi><mml:mi>R</mml:mi></mml:math>
</inline-formula> are the maximum and minimum PSNR values in the current video. We predict a frame to be normal or abnormal based on its regularity score.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experiments</title>
<sec id="s4_1">
<label>4.1</label>
<title>Experiment Settings</title>
<p>To verify the effectiveness of CCAE, we implement the experiments in Pytorch with four NVIDIA GPUs. Input frames are resized to the resolution of 256&#x002A;256. In the training stage, the learning rate is set to 0.0003 and batch size is set to 8. The number of training epochs is set to 200. The weighted coefficients in the training loss are set as <inline-formula id="ieqn-79">
<mml:math id="mml-ieqn-79"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math>
</inline-formula> and <inline-formula id="ieqn-80">
<mml:math id="mml-ieqn-80"><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x03BB;</mml:mi></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.1</mml:mn></mml:math>
</inline-formula>.</p>
<p>The experiments are conducted on two public video anomaly detection datasets, UCSD Ped2 and CUHK Avenue. The anomalies refer to objects and events that do not conform to expectations. The UCSD Ped2 dataset contains 16 training videos and 12 testing videos. The videos are captured with a stationary camera. The dataset contains people walking normally in a pedestrian sidewalk. The anomalies are about appearance of non-pedestrian entities, such as riding a bike and driving a car in pedestrian area. The CUHK Avenue dataset consists of 16 training videos with normal activities and 21 testing videos. Anomalous events are related to people running, walking in the wrong direction and throwing objects. The details of the two datasets are shown in <xref ref-type="table" rid="table-1">Tab. 1</xref>.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Details of two public video anomaly detection datasets</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Datasets</th>
<th>Scenarios</th>
<th>Anomalies</th>
<th>Resolution</th>
</tr>
</thead>
<tbody>
<tr>
<td>UCSD Ped2</td>
<td>Sidewalk</td>
<td>Appearance of non-pedestrian entities and anomalous pedestrian behaviors</td>
<td>360 <inline-formula id="ieqn-81">
<mml:math id="mml-ieqn-81"><mml:mo>&#x00D7;</mml:mo></mml:math>
</inline-formula> 240</td>
</tr>
<tr>
<td>CUHK Avenue</td>
<td>Campus</td>
<td>Strange action, wrong direction and abnormal object</td>
<td>640 <inline-formula id="ieqn-82">
<mml:math id="mml-ieqn-82"><mml:mo>&#x00D7;</mml:mo></mml:math>
</inline-formula> 360</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Evaluation Metrics</title>
<p>The area under ROC curve (AUC) is adopted as metric to evaluate the detection accuracy of CCAE. ROC curve is obtained by varying the threshold of the anomaly score for each frame-wise reconstruction. A higher AUC value indicates that the detection performance is better. Besides, the equal error rate (EER) is also reported as the percentage of misclassified frames.</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Experimental Results</title>
<p>The examples of reconstructed frames and the actual frames are visualized in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. It is shown that CCAE has good reconstruction effect in the normal scenes, while in abnormal scenes the reconstructed frames are blurry and distorted. The abnormal areas are circled in red. In this way, CCAE can judge whether the frame is abnormal or not.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The comparison between reconstructed and actual frames</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-5.png"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="fig-6">Figs. 6</xref> and <xref ref-type="fig" rid="fig-7">7</xref>, the regularity score is calculated to visualize the performance on CUHK Avenue and UCSD Ped2 datasets. The positions of normal and abnormal frames can be seen directly. This means that the smaller the regularity score is, the higher the probability of abnormal frame is. The red area in the graph represents anomalies when the exception occurs in the dataset.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Regularity score visualization for CUHK Avenue dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-6.png"/>
</fig>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Regularity score visualization for UCSD Ped2 dataset</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-7.png"/>
</fig>
<p><xref ref-type="table" rid="table-2">Tab. 2</xref> shows the AUC and EER of CCAE compared with other video anomaly detection methods. For UCSD Ped2 dataset, we can see that deep learning based methods achieve higher AUC and lower EER than handcraft based methods such as SF and MPPCA. The results verify the excellent learning ability of deep models. Specifically, ConvAE and STAE perform better than handcraft based models, which implies that the models can benefit from integrating deep CNN, autoencoder and convLSTM. Compared with ConvAE and STAE, GMMAE is able to combine Gaussian mixture model and variational autoencoder. The knowledge fusion helps to improve the anomaly detection accuracy. As expected, CCAE attains competitive detection accuracy compared with other deep learning based methods. It is clearly that utilizing only convolutional autoencoder and LSTM to learn spatial and temporal features is not adequate. The experimental results show that the extraction of global appearance features and global temporal features based on Criss-Cross attention module can effectively improve the anomaly detection performance.</p>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Comparison with other anomaly detection methods</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Methods</th>
<th colspan="2">UCSD Ped2</th>
<th colspan="2">CUHK Avenue</th>
</tr>
<tr>
<th>AUC(%)</th>
<th>EER(%)</th>
<th>AUC(%)</th>
<th>EER(%)</th>
</tr>
</thead>
<tbody>
<tr>
<td>MPPCA [<xref ref-type="bibr" rid="ref-31">31</xref>]</td>
<td>69.3</td>
<td>30.0</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>SF [<xref ref-type="bibr" rid="ref-15">15</xref>]</td>
<td>55.6</td>
<td>42.0</td>
<td>&#x2013;</td>
<td></td>
</tr>
<tr>
<td>SF&#x002B;MPPCA [<xref ref-type="bibr" rid="ref-11">11</xref>]</td>
<td>61.3</td>
<td>36.0</td>
<td>&#x2013;</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>ConvAE [<xref ref-type="bibr" rid="ref-21">21</xref>]</td>
<td>90.0</td>
<td>21.7</td>
<td>70.2</td>
<td>25.1</td>
</tr>
<tr>
<td>STAE [<xref ref-type="bibr" rid="ref-25">25</xref>]</td>
<td>91.2</td>
<td>16.7</td>
<td>80.9</td>
<td>24.4</td>
</tr>
<tr>
<td>GMMAE [<xref ref-type="bibr" rid="ref-17">17</xref>]</td>
<td>92.2</td>
<td>12.6</td>
<td>83.4</td>
<td>22.7</td>
</tr>
<tr>
<td>MemAE [<xref ref-type="bibr" rid="ref-29">29</xref>]</td>
<td>94.1</td>
<td>&#x2013;</td>
<td>83.3</td>
<td>&#x2013;</td>
</tr>
<tr>
<td>TSC [<xref ref-type="bibr" rid="ref-26">26</xref>]</td>
<td>92.21</td>
<td></td>
<td>83.48</td>
<td></td>
</tr>
<tr>
<td>Deep STAE [<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td></td>
<td></td>
<td>83</td>
<td></td>
</tr>
<tr>
<td><bold>CCAE</bold></td>
<td><bold>95.3</bold></td>
<td><bold>10.8</bold></td>
<td><bold>84.0</bold></td>
<td><bold>21.9</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Ablation Experiment</title>
<p>In order to analyze the effectiveness of Criss-Cross attention module, we compare CCAE with bi-directional long short term memory autoencoder (BiAE). Unlike CCAE, BiAE only inputs local features extracted by encoder and bi-directional long short term memory network directly into decoder for reconstruction. The AUC and EER are listed in <xref ref-type="table" rid="table-3">Tab. 3</xref>. We can see that Criss-Cross attention module can achieve a positive effect on anomaly detection. <xref ref-type="fig" rid="fig-8">Fig. 8</xref> shows feature heatmap made by CCAE and BiAE on the two datasets. We can see that capturing long-range global dependencies with Criss-Cross attention module can enhance attention in key areas.</p>
<table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Comparison of CCAE with BiAE</title></caption>
<table><colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th rowspan="2">Methods</th>
<th colspan="2">UCSD Ped2</th>
<th colspan="2">CUHK Avenue</th>
</tr>
<tr>
<th>AUC(%)</th>
<th>EER(%)</th>
<th>AUC(%)</th>
<th>EER(%)</th>
</tr>
</thead>
<tbody>
<tr>
<td>BiAE</td>
<td>92.3</td>
<td>15.4</td>
<td>80.8</td>
<td>23.4</td>
</tr>
<tr>
<td><bold>CCAE</bold></td>
<td><bold>95.3</bold></td>
<td><bold>10.8</bold></td>
<td><bold>84.0</bold></td>
<td><bold>21.9</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Feature heatmap of CCAE and BiAE on different datasets</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-8.png"/>
</fig>
<p><xref ref-type="fig" rid="fig-9">Figs. 9</xref> and <xref ref-type="fig" rid="fig-10">10</xref> show ROC curves for UCSD Ped2 and CUHK Avenue datasets. As expected, CCAE outperforms BiAE for both datasets. The experimental results confirm that Criss-Cross attention module is effective, for its capability of capturing global dependencies during appearance encoding and temporal sequential learning.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>ROC curves of CCAE for Avenue and Ped2</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-9.png"/>
</fig>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>ROC curves of BiAE for Avenue and Ped2</title></caption>
<graphic mimetype="image" mime-subtype="png" xlink:href="IASC_29535-fig-10.png"/>
</fig>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusions</title>
<p>In this paper, we presented an efficient unsupervised method CCAE for anomaly events detection by combining Criss-Cross attention and bi-directional ConvLSTM in autoencoder. The method employs Criss-Cross attention module in encoder for global appearance features, and a Criss-Cross attention module with bi-directional ConvLSTM for global temporal features. The two features are then fused by a decoder to reconstruct frames. In addition, an intensity loss and a gradient loss are designed to enhance normal pattern reconstruction. We perform extensive experiments on two public datasets UCSD Ped2 and CUHK Avenue and achieve competitive results with frame level AUC of 95.3% and 84.0% respectively. The experimental results validate the advantages of CCAE over other video anomaly detection methods. In the future, we consider investigating spatial and temporal features by graph convolutional neural networks to enhance feature representations of normal frames.</p>
</sec>
</body>
<back><fn-group>
<fn fn-type="other">
<p><bold>Funding Statement:</bold> This work was supported by the National Science Foundation of China under Grant No. 41971343.</p>
</fn>
<fn fn-type="conflict">
<p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</fn>
</fn-group>
<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>Z.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Zeng</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Ji</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Sheng</surname></string-name></person-group>, &#x201C;<article-title>Improved anomaly detection in surveillance videos with multiple probabilistic models inference</article-title>,&#x201D; <source>Intelligent Automation &#x0026; Soft Computing</source>, vol. <volume>31</volume>, no. <issue>3</issue>, pp. <fpage>1703</fpage>&#x2013;<lpage>1717</lpage>, <year>2022</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>B. R.</given-names> <surname>Kiran</surname></string-name>, <string-name><given-names>D. M.</given-names> <surname>Thomas</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Parakkal</surname></string-name></person-group>, &#x201C;<article-title>An overview of deep learning based methods for unsupervised and semi-supervised anomaly detection in videos</article-title>,&#x201D; <source>Journal of Imaging</source>, vol. <volume>4</volume>, no. <issue>2</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>25</lpage>, <year>2018</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>X.</given-names> <surname>Duan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Ying</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Yuan</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Cheng</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Yin</surname></string-name></person-group>, &#x201C;<article-title>A generative adversarial networks for log anomaly detection</article-title>,&#x201D; <source>Computer Systems Science and Engineering</source>, vol. <volume>37</volume>, no. <issue>1</issue>, pp. <fpage>135</fpage>&#x2013;<lpage>148</lpage>, <year>2021</year>.</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>C. L.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Sohn</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Yoon</surname></string-name></person-group>, &#x201C;<article-title>Cutpaste: Self-supervised learning for anomaly detection and localization</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Nashville, Tennessee, USA</publisher-loc>, pp. <fpage>9664</fpage>&#x2013;<lpage>9674</lpage>, <year>2021</year>. </mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M. I.</given-names> <surname>Georgescu</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Barbalau</surname></string-name> and <string-name><given-names>R. T.</given-names> <surname>Ionescu</surname></string-name></person-group>, &#x201C;<article-title>Anomaly detection in video via self-supervised and multi-task learning</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Nashville, Tennessee, USA</publisher-loc>, pp. <fpage>12742</fpage>&#x2013;<lpage>12752</lpage>, <year>2021</year>. </mixed-citation></ref>
<ref id="ref-6"><label>[6]</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> and <string-name><given-names>I. U.</given-names> <surname>Haq</surname></string-name></person-group>, &#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-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Zhou</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>Abnormal event detection in videos using hybrid spatio-temporal autoencoder</article-title>,&#x201D; in <conf-name>25th IEEE Int. Conf. on Image Processing</conf-name>, <publisher-loc>Athens, Greece</publisher-loc>, pp. <fpage>2276</fpage>&#x2013;<lpage>2280</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Mnih</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Nicolas</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Alex</surname></string-name></person-group>, &#x201C;<article-title>Recurrent models of visual attention</article-title>,&#x201D; in <conf-name>Proc. of the 27th Int. Conf. on Neural Information Processing Systems</conf-name>, <publisher-loc>Montreal, Canada</publisher-loc>, pp. <fpage>2204</fpage>&#x2013;<lpage>2212</lpage>, <year>2014</year>. </mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Vaswani</surname></string-name></person-group>, &#x201C;<article-title>Attention is all you need</article-title>,&#x201D; in <conf-name>Proc. of the 31st Int. Conf. on Neural Information Processing Systems</conf-name>, <publisher-loc>Long Beach, California, USA</publisher-loc>, pp. <fpage>6000</fpage>&#x2013;<lpage>6010</lpage>, <year>2017</year>. </mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>L.</given-names> <surname>Huang</surname></string-name></person-group>, &#x201C;<article-title>Ccnet: Criss-cross attention for semantic segmentation</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Computer Vision</conf-name>, <publisher-loc>Seoul, South Korea</publisher-loc>, pp. <fpage>603</fpage>&#x2013;<lpage>612</lpage>, <year>2019</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>J.</given-names> <surname>Kim</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Grauman</surname></string-name></person-group>, &#x201C;<article-title>Observe locally, infer globally: a space-time MRF for detecting abnormal activities with incremental updates</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Miami, Florida, USA</publisher-loc>, pp. <fpage>2921</fpage>&#x2013;<lpage>2928</lpage>, <year>2009</year>. </mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. E.</given-names> <surname>Tipping</surname></string-name> and <string-name><given-names>C. M.</given-names> <surname>Bishop</surname></string-name></person-group>, &#x201C;<article-title>Mixtures of probabilistic principal component analyzers</article-title>,&#x201D; <source>Neural Computation</source>, vol. <volume>11</volume>, no. <issue>2</issue>, pp. <fpage>443</fpage>&#x2013;<lpage>482</lpage>, <year>1999</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>V.</given-names> <surname>Mahadevan</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Bhalodia</surname></string-name></person-group>, &#x201C;<article-title>Anomaly detection in crowded scenes</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>San Francisco, California, USA</publisher-loc>, pp. <fpage>1975</fpage>&#x2013;<lpage>1981</lpage>, <year>2010</year>. </mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. B.</given-names> <surname>Chan</surname></string-name> and <string-name><given-names>N.</given-names> <surname>Vasconcelos</surname></string-name></person-group>, &#x201C;<article-title>Modeling, clustering, and segmenting video with mixtures of dynamic textures</article-title>,&#x201D; <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>, vol. <volume>30</volume>, no. <issue>5</issue>, pp. <fpage>909</fpage>&#x2013;<lpage>926</lpage>, <year>2008</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>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>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Miami, Florida, USA</publisher-loc>, pp. <fpage>935</fpage>&#x2013;<lpage>942</lpage>, <year>2009</year>. </mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Adam</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Rivlin</surname></string-name> and <string-name><given-names>I.</given-names> <surname>Shimshoni</surname></string-name></person-group>, &#x201C;<article-title>Robust real-time unusual event detection using multiple fixed-location monitors</article-title>,&#x201D; <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>, vol. <volume>30</volume>, no. <issue>3</issue>, pp. <fpage>555</fpage>&#x2013;<lpage>560</lpage>, <year>2008</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>Y.</given-names> <surname>Fan</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Wen</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Li</surname></string-name></person-group>, &#x201C;<article-title>Video anomaly detection and localization via gaussian mixture fully convolutional variational autoencoder</article-title>,&#x201D; <source>Computer Vision and Image Understanding</source>, vol. <volume>195</volume>, no. <issue>102920</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>12</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><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>Fayyaz</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Fathy</surname></string-name></person-group>, &#x201C;<article-title>Deep-anomaly: Fully convolutional neural network for fast anomaly detection in crowded scenes</article-title>,&#x201D; <source>Computer Vision and Image Understanding</source>, vol. <volume>172</volume>, no. <issue>5</issue>, pp. <fpage>88</fpage>&#x2013;<lpage>97</lpage>, <year>2018</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>F.</given-names> <surname>Bi</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Ma</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>W.</given-names> <surname>Fang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Chen</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>Review on video object tracking based on deep learning</article-title>,&#x201D; <source>Journal of New Media</source>, vol. <volume>1</volume>, no. <issue>2</issue>, pp. <fpage>63</fpage>&#x2013;<lpage>74</lpage>, <year>2019</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>Y. C.</given-names> <surname>Su</surname></string-name></person-group>, &#x201C;<article-title>DAEN: Deep autoencoder networks for hyperspectral unmixing</article-title>,&#x201D; <source>IEEE Transactions on Geoscience and Remote Sensing</source>, vol. <volume>57</volume>, no. <issue>7</issue>, pp. <fpage>4309</fpage>&#x2013;<lpage>4321</lpage>, <year>2019</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>M.</given-names> <surname>Hasan</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>Las Vegas, Nevada, USA</publisher-loc>, pp. <fpage>733</fpage>&#x2013;<lpage>742</lpage>, <year>2016</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>O.</given-names> <surname>Ronneberger</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Philipp</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Thomas</surname></string-name></person-group>, &#x201C;<article-title>U-net: Convolutional networks for biomedical image segmentation</article-title>,&#x201D; in <conf-name>Int. Conf. on Medical Image Computing and Computer-Assisted Intervention</conf-name>, <publisher-loc>Cham</publisher-loc>, <publisher-name>Springer</publisher-name>, pp. <fpage>234</fpage>&#x2013;<lpage>241</lpage>, <year>2015</year>. </mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><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>Fathy</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Hoseini</surname></string-name></person-group>, &#x201C;<article-title>Video anomaly detection and localization based on the sparsity and reconstruction error of auto-encoder</article-title>,&#x201D; <source>Electronics Letters</source>, vol. <volume>52</volume>, no. <issue>13</issue>, pp. <fpage>1122</fpage>&#x2013;<lpage>1124</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>K.</given-names> <surname>Deepak</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Srivathsan</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Roshan</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Chandrakala</surname></string-name></person-group>, &#x201C;<article-title>Deep multi-view representation learning for video anomaly detection using spatiotemporal autoencoders</article-title>,&#x201D; <source>Circuits Systems, and Signal Processing</source>, vol. <volume>40</volume>, no. <issue>3</issue>, pp. <fpage>1333</fpage>&#x2013;<lpage>1349</lpage>, <year>2021</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. S.</given-names> <surname>Chong</surname></string-name> and <string-name><given-names>H. T.</given-names> <surname>Yong</surname></string-name></person-group>, &#x201C;<article-title>Abnormal event detection in videos using spatiotemporal autoencoder</article-title>,&#x201D; in <conf-name>Int. Symp. on Neural Networks</conf-name>, <publisher-loc>Hokkaido, Japan</publisher-loc>, pp. <fpage>189</fpage>&#x2013;<lpage>196</lpage>, <year>2017</year>. </mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><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>D.</given-names> <surname>Lian</surname></string-name></person-group>, &#x201C;<article-title>Video anomaly detection with sparse coding inspired deep neural networks</article-title>,&#x201D; <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>, vol. <volume>43</volume>, no. <issue>3</issue>, pp. <fpage>1070</fpage>&#x2013;<lpage>1084</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Hu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Shen</surname></string-name> and <string-name><given-names>G.</given-names> <surname>Sun</surname></string-name></person-group>, &#x201C;<article-title>Squeeze-and-excitation networks</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Salt Lake City, Utah, USA</publisher-loc>, pp. <fpage>7132</fpage>&#x2013;<lpage>7141</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>D.</given-names> <surname>Gong</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Le</surname></string-name></person-group>, &#x201C;<article-title>Memorizing normality to detect anomaly: Memory-augmented deep autoencoder for unsupervised anomaly detection</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Computer Vision</conf-name>, <publisher-loc>Seoul, South Korea</publisher-loc>, pp. <fpage>1705</fpage>&#x2013;<lpage>1714</lpage>, <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>W.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>X. R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>G. Z.</given-names> <surname>Dai</surname></string-name>, <string-name><given-names>P. S.</given-names> <surname>Chang</surname></string-name> <etal>et al.</etal></person-group><italic>,</italic> &#x201C;<article-title>A multi-feature learning model with enhanced local attention for vehicle re-identification</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>69</volume>, no. <issue>3</issue>, pp. <fpage>3549</fpage>&#x2013;<lpage>3561</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>X. L.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Non-local neural networks</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition</conf-name>, <publisher-loc>Salt Lake City, Utah, USA</publisher-loc>, pp. <fpage>7794</fpage>&#x2013;<lpage>7803</lpage>, <year>2018</year>. </mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A. R.</given-names> <surname>Sutanto</surname></string-name> and <string-name><given-names>D. K.</given-names> <surname>Kang</surname></string-name></person-group>, &#x201C;<article-title>A novel diminish smooth L1 loss model with generative adversarial network</article-title>,&#x201D; in <conf-name>Int. Conf. on Intelligent Human Computer Interaction</conf-name>, <publisher-loc>Daegu, South Korea</publisher-loc>, pp. <fpage>361</fpage>&#x2013;<lpage>368</lpage>, <year>2020</year>. </mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Ren</surname></string-name>, <string-name><given-names>K.</given-names> <surname>He</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Girshick</surname></string-name></person-group>, &#x201C;<article-title>Faster R-CNN: Towards real-time object detection with region proposal networks</article-title>,&#x201D; <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>, vol. <volume>39</volume>, no. <issue>6</issue>, pp. <fpage>1137</fpage>&#x2013;<lpage>1149</lpage>, <year>2016</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>