<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</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">71043</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2025.071043</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Efficient Video Emotion Recognition via Multi-Scale Region-Aware Convolution and Temporal Interaction Sampling</article-title>
<alt-title alt-title-type="left-running-head">Efficient Video Emotion Recognition via Multi-Scale Region-Aware Convolution and Temporal Interaction Sampling</alt-title>
<alt-title alt-title-type="right-running-head">Efficient Video Emotion Recognition via Multi-Scale Region-Aware Convolution and Temporal Interaction Sampling</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Zhang</surname><given-names>Xiaorui</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref><email>zxr365@126.com</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Yuan</surname><given-names>Chunlin</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Sun</surname><given-names>Wei</given-names></name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Wang</surname><given-names>Ting</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<aff id="aff-1"><label>1</label><institution>College of Computer and Information Engineering, Nanjing Tech University</institution>, <addr-line>Nanjing, 211816</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>College of Electronic and Information Engineering, Nanjing University of Information Science and Technology</institution>, <addr-line>Nanjing, 210044</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>College of Computer Science, Nanjing University of Information Science and Technology</institution>, <addr-line>Nanjing, 210044</addr-line>, <country>China</country></aff>
<aff id="aff-4"><label>4</label><institution>College of Automation, Nanjing University of Information Science and Technology</institution>, <addr-line>Nanjing, 210044</addr-line>, <country>China</country></aff>
<aff id="aff-5"><label>5</label><institution>College of Electrical Engineering and Control Science, Nanjing Tech University</institution>, <addr-line>Nanjing, 211816</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Xiaorui Zhang. Email: <email>zxr365@126.com</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year></pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>09</day><month>12</month><year>2025</year>
</pub-date>
<volume>86</volume>
<issue>2</issue>
<fpage>1</fpage>
<lpage>19</lpage>
<history>
<date date-type="received">
<day>30</day>
<month>07</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>17</day>
<month>10</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</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_CMC_71043.pdf"></self-uri>
<abstract>
<p>Video emotion recognition is widely used due to its alignment with the temporal characteristics of human emotional expression, but existing models have significant shortcomings. On the one hand, Transformer multi-head self-attention modeling of global temporal dependency has problems of high computational overhead and feature similarity. On the other hand, fixed-size convolution kernels are often used, which have weak perception ability for emotional regions of different scales. Therefore, this paper proposes a video emotion recognition model that combines multi-scale region-aware convolution with temporal interactive sampling. In terms of space, multi-branch large-kernel stripe convolution is used to perceive emotional region features at different scales, and attention weights are generated for each scale feature. In terms of time, multi-layer odd-even down-sampling is performed on the time series, and odd-even sub-sequence interaction is performed to solve the problem of feature similarity, while reducing computational costs due to the linear relationship between sampling and convolution overhead. This paper was tested on CMU-MOSI, CMU-MOSEI, and Hume Reaction. The Acc-2 reached 83.4%, 85.2%, and 81.2%, respectively. The experimental results show that the model can significantly improve the accuracy of emotion recognition.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Multi-scale</kwd>
<kwd>region-aware convolution</kwd>
<kwd>temporal interaction sampling</kwd>
<kwd>video emotion recognition</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>National Nature Science Foundation of China</funding-source>
<award-id>62272236</award-id>
<award-id>62376128</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Natural Science Foundation of Jiangsu Province</funding-source>
<award-id>BK20201136</award-id>
<award-id>BK20191401</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The expression of human emotions is a chronological process [<xref ref-type="bibr" rid="ref-1">1</xref>]. Unlike text and images, videos provide temporal association information in addition to spatial content information. Consequently, there are a lot of research implications for video-based emotion identification, especially in the areas of content recommendation, psychological analysis, and human-computer interface. In recent years, an increasing number of researchers have been devoting their attention to the field of video-based emotion recognition and have made significant advancements in research [<xref ref-type="bibr" rid="ref-2">2</xref>&#x2013;<xref ref-type="bibr" rid="ref-4">4</xref>].</p>
<p>Recently, researchers have been exploring the application of Transformer [<xref ref-type="bibr" rid="ref-5">5</xref>] and its improved models, such as Vision Transformer (VIT) [<xref ref-type="bibr" rid="ref-6">6</xref>], Swin Transformer [<xref ref-type="bibr" rid="ref-7">7</xref>], and TimeSformer [<xref ref-type="bibr" rid="ref-8">8</xref>] in the field of video-based emotion recognition. Wang et al. [<xref ref-type="bibr" rid="ref-9">9</xref>] used ResNet with graph convolution for spatial feature extraction and subsequently incorporated TimeSformer to effectively model global inter-frame dependency, yielding favorable outcomes. The combination of contrast learning and TimeSformer by Chaudhari et al. [<xref ref-type="bibr" rid="ref-10">10</xref>] yielded promising results in emotion recognition. Transformer is used extensively for creating global dependencies because of its multi-headed self-attention, but it still faces difficulties because of its high computational cost. Even though Differential Transformer [<xref ref-type="bibr" rid="ref-11">11</xref>], Slide-Transformer [<xref ref-type="bibr" rid="ref-12">12</xref>], and some other models exhibit superior self-attention capabilities, they still necessitate extensive pairwise computations. In addition, the self-attention mechanism applied to temporal series, as discovered by Shi et al. [<xref ref-type="bibr" rid="ref-13">13</xref>], introduces the issue of feature similarity. The probability matrix produced by self-attention causes the input feature matrix to rapidly converge to rank 1 at a bi-exponential rate. This tendency eventually affects the efficiency of model recognition by gradually increasing similarity within the series.</p>
<p>The spatial distribution of emotions in images, called the emotion region, has been consistently observed in existing studies [<xref ref-type="bibr" rid="ref-14">14</xref>]. The existing video emotion recognition models have small and single convolutional kernels, which only allow them to learn single-scale features from small regions [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>], enabling them to perceive multi-scale regions simultaneously. The emotion regions in the from-far-to-near photos exhibit a wide range of sizes, ranging from tiny to huge, as depicted in <xref ref-type="fig" rid="fig-1">Fig. 1a</xref>&#x2013;<xref ref-type="fig" rid="fig-1">c</xref>. To accommodate the scale variation, it is imperative for the model to possess spatial capabilities that enable feature extraction across diverse scales. In addition, <xref ref-type="fig" rid="fig-1">Fig. 1c</xref>,<xref ref-type="fig" rid="fig-1">d</xref> demonstrates that a single image can contain multiple emotion regions with varying sizes simultaneously. Moreover, these emotion regions are presented in discrete forms, including square and bar arrangements. This means it needs to understand regions of different scales.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Original image and the image with emotion region annotation</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_71043-fig-1.tif"/>
</fig>
<p>Researchers have shifted their focus back to convolution because of the high computational overhead of the transformer and the issue of feature similarity in the temporal dimension. Convolution reduces computational load and accelerates convergence because its complexity is directly correlated with the number of pixels in a picture. Temporally, SCINet [<xref ref-type="bibr" rid="ref-17">17</xref>] employs iterative down-sampling at different temporal resolutions to extract information, leveraging the convolution&#x2019;s ability to handle data of any resolution. Spatially, the utilization of a large kernel offers a broader perspective. Large kernel convolutions are integrated into Transformer&#x2019;s general architecture to create ConvNeXt [<xref ref-type="bibr" rid="ref-18">18</xref>], which requires less training time to achieve the same results as an equivalent Transformer model. A large effective receptive field is made possible by the use of large-kernel convolution, which facilitates more thorough spatial information exploration and the identification of entire emotion regions. SegNeXt [<xref ref-type="bibr" rid="ref-19">19</xref>] introduces multi-size branch convolution and enhances original features by the use of convolutional attention. The experimental findings show that in the region extraction task, convolutional attention performs better than Transformer&#x2019;s self-attention. This study&#x2019;s requirements for recognizing and utilizing emotion regions at various scales are satisfied by the idea of multi-size branch convolution.</p>
<p>This study, which is motivated by the previously described research, suggests a novel video-based emotion recognition model. Spatially, combine the large kernel decomposition of VAN with the multi-scale convolution of SegNeXt, and attempt to decompose the standard n &#x00D7; n large-kernel convolution into a 1 &#x00D7; n rectangular convolution. By breaking down the traditional convolution, the stripe convolution minimizes the computation required for large-kernel convolution. Meanwhile, generate attention weights for each scale of the emotional region. These attention weights are also used to integrate multi-scale emotional regions. Temporally, decompose long sequences by filtering odd and even frames in the sequence. Unlike SCINet, each layer uses element multiplication and convolution to achieve interaction between sub-sequence pairs, capturing temporal correlation information between odd and even subsequences with minimal overhead. The suggested model allows for the generation of global temporal dependency with less cost due to the linear overhead of convolution and sampling in terms of the number of pixels.</p>
<p>In summary, the main contributions are as follows:
<list list-type="simple">
<list-item><label>i)</label><p>We propose a multi-scale region-aware module. It utilizes multi-branch large-kernel stripe convolution to extract emotion regions of varying scales and shapes. In order to reduce computation, stripe convolution is also used. Then, using a fully connected layer&#x2019;s pooling operation, attention weights are produced for each scale of emotion regions. This allows multi-scale emotion regions to be integrated using these weights, enhancing perceptual diversity while emphasizing important characteristics.</p></list-item>
<list-item><label>ii)</label><p>The temporal series interactive sampling learning module is proposed. A multi-layer odd-even down-sampling is employed on the temporal series data. Each layer incorporates convolution and element-wise multiplication to facilitate interaction between pairs of odd-even sub-series, enabling the model to learn the temporal correlation information effectively. Compared to the Transformer, the proposed technique exhibits linear complexity related to the number of pixels in sampling and convolution operations. As a result, our model maintains good recognition accuracy during model training by establishing global temporal dependency with minimal computational resources.</p></list-item>
</list></p>
<p>The rest of the paper is organized as follows. <xref ref-type="sec" rid="s2">Section 2</xref> provides a concise overview of the related work associated with the model. <xref ref-type="sec" rid="s3">Section 3</xref> presents the general framework of the proposed model, followed by an in-depth elucidation of each proposed module. <xref ref-type="sec" rid="s4">Section 4</xref> describes the main experiments and verifies their validity. <xref ref-type="sec" rid="s5">Section 5</xref> summarizes the study and offers future perspectives.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<p>This section describes in detail the work related to the proposed method in terms of both spatial information extraction and temporal information extraction.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Spatial Information Extraction</title>
<p>Since ResNet [<xref ref-type="bibr" rid="ref-20">20</xref>] solved the difficult training of deep convolutional neural networks, convolutional neural networks have achieved important advances in feature extraction. In order to break down the feature map into a multi-scale pyramid representation, Lin et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] suggested using the Adaptive Context module. Li et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] proposed a cross-layer feature distribution module that adaptively generates weights between multi-layer features and fuses them according to the weights. Res2Net [<xref ref-type="bibr" rid="ref-23">23</xref>] takes split feature maps and improves multi-scale representation through multipath superimposed small kernel convolution, thereby achieving good results in multi-scale feature extraction and fusion. However, most of these techniques use a fixed 3 &#x00D7; 3 convolution kernel to extract features from images, which limits the effective receptive field. Consequently, when managing downstream jobs, the model&#x2019;s performance degrades. The dominance of convolutional neural networks in computer vision is challenged by Vision Transformer.</p>
<p>More and more models based on the visual Transformer, such as Segformer [<xref ref-type="bibr" rid="ref-24">24</xref>] and Swin Transformer [<xref ref-type="bibr" rid="ref-7">7</xref>], have shown superior performance in downstream visual tasks compared to CNN due to their excellent overall architecture and multi-head self-attention mechanism. In contrast, multi-head self-attention is essentially dense pairwise processing, which leads to higher computational complexity. Currently, in the spatial domain, ConvNeXt [<xref ref-type="bibr" rid="ref-18">18</xref>] imitates the Transformer architecture and introduces large-kernel convolution, which has similar effects to Transformer architecture models of the same scale, but reduces training time. The subsequent VAN [<xref ref-type="bibr" rid="ref-15">15</xref>] network proposes to use the Large Kernel Attention (LKA) mechanism to establish channel and spatial attention, and decompose the large kernel convolution to achieve it at a lower computational cost. SegNeXt [<xref ref-type="bibr" rid="ref-19">19</xref>] uses convolutional attention to improve original features and introduces multi-size branch convolution. It is demonstrated through a series of experiments that convolutional attention performs better in region feature extraction and augmentation than the Transformer&#x2019;s self-attention. <xref ref-type="table" rid="table-1">Table 1</xref> shows the pros. and cons. of several spatial information extraction models.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Pros. and cons. of spatial information extraction models</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th align="center">Research method</th>
<th align="center">Representative model</th>
<th align="center">Pros.</th>
<th align="center">Cons.</th>
</tr>
</thead>
<tbody>
<tr>
<td>Based on small kernel convolution</td>
<td>Res2Net</td>
<td>More effective in the task of regional feature extraction</td>
<td>Limit the effective receptive field</td>
</tr>
<tr>
<td>Based on Transformer</td>
<td>Segformer; Swin Transformer</td>
<td>Effectively establish the correlation information between local areas</td>
<td>High storage and computational overhead, training is difficult, and the amount of data required is large</td>
</tr>
<tr>
<td>Based on large kernel convolution</td>
<td>ConvNeXt</td>
<td>Introduce large kernel convolution</td>
<td>Convolution kernel size is single, and multi-scale information is not fully utilized</td>
</tr>
<tr>
<td/>
<td>VAN</td>
<td>Decomposing large kernel convolution to reduce computational cost</td>
<td>Convolution kernel size is single, and multi-scale information is not fully utilized</td>
</tr>
<tr>
<td/>
<td>SegNeXt</td>
<td>Introducemulti-scale branching convolution</td>
<td>The standard large kernel convolution has high overhead, and the attention is single, which does not make full use of multi-scale features</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Inspired by the aforementioned models, we propose a multi-scale region-aware module. This module adopts the four-layer architecture of Transformer; however, we substitute self-attention with convolution-based multi-scale region-aware attention to reduce the computational load and improve the emotion region extraction. By employing large kernel convolutions, we can expand the sensory field and extract spatial information from a larger neighborhood range within the image. At the same time, stripe convolution [<xref ref-type="bibr" rid="ref-25">25</xref>] helps alleviate the model&#x2019;s computational burden while perceiving the stripe regions. Consequently, the proposed method yields the most diverse shapes and comprehensive information about extracted emotion regions. Additionally, the attention weights are generated for each scale of emotion regions by pooling operations in the whole connected layer, which highlights important emotion regions and takes inspiration from humans&#x2019; selective attention mechanism. Lastly, the weights of these multi-scale emotion zones are summed.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Temporal Information Extraction</title>
<p>With the in-depth study of Transformer and self-attention, VTN [<xref ref-type="bibr" rid="ref-26">26</xref>] applied sliding window to focus on temporal correlation in the time dimension and tried to introduce Transformer into the temporal series. Wang et al. [<xref ref-type="bibr" rid="ref-9">9</xref>] achieved good success in the video emotion identification community by combining TimeSformer for global dependency modeling between frames and using ResNet with graph convolution for spatial feature extraction. However, the extensive pairwise computation of self-attention without a priori knowledge of localization and translational isotropy still results in a larger computing cost. The introduction of the time dimension in Transformer also brings about the problem of feature similarity, that is, the self-attention probability matrix drives the input feature matrix to converge to rank 1 at a double exponential rate, resulting in an increase in sequence similarity and thus affecting the recognition performance of the model. Shi et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] discovered that convolution and residual concatenation can help to solve this issue. Previously, TCN [<xref ref-type="bibr" rid="ref-27">27</xref>] attempted to handle the temporal series task by expanding the convolution with residual concatenation, in which features were extracted directly across time steps using convolution. PredCNN [<xref ref-type="bibr" rid="ref-28">28</xref>] combines a cascade multiplication unit (CMU) with CNN to capture the inter-frame dependency of the temporal series. At the moment, SimVP [<xref ref-type="bibr" rid="ref-29">29</xref>], which is totally based on CNN, extracts inter-frame dependency by concatenating large kernel convolutions in a bi-directional manner without adding any further tricks or intricate plans. <xref ref-type="table" rid="table-2">Table 2</xref> shows the pros. and cons. of several temporal information extraction models.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Pros. and cons. of temporal information extraction models</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th align="center">Research method</th>
<th align="center">Representative model</th>
<th align="center">Pros.</th>
<th align="center">Cons.</th>
</tr>
</thead>
<tbody>
<tr>
<td>Based on Transformer</td>
<td>TimeSformer</td>
<td>Extract global dependency modeling between frame, and make full use of context information of time dimension</td>
<td>Computational overhead is high, and there is a problem of similar timing characteristics</td>
</tr>
<tr>
<td>Based on convolution</td>
<td>TCN; PredCNN</td>
<td>Capture long-sequence dependency and high parallel computing efficiency</td>
<td>Unable to establish temporal long-term dependency</td>
</tr>
<tr>
<td/>
<td>SimVP</td>
<td>Use large kernel convolution to extract inter-frame dependency with low computational overhead</td>
<td>The calculation efficiency of series connection is low for long sequences</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Motivated by the aforementioned method, we present a temporally interactive sample learning module. Layer by layer, the lengthy data are broken down using iterative odd-even down-sampling. To enable interaction between pairs of odd-even sub-series and further capture the temporal correlation information within them, each layer uses convolutional processes with element-wise multiplication. Moreover, the convolution is utilized as the interaction weights to enhance feature diversity and mitigate potential issues related to the feature similarity in self-attention. Additionally, each sub-series undergoes another round of convolution, enabling effective fusion of surrounding pixels and enhancing information fusion. The global temporal dependency emerges as the sampling-interaction develops. Global temporal dependency can be better modeled by the module thanks to the linear complexity of sampling and convolution with respect to the number of pixels, in contrast to the quadratic complexity of dense pairwise computing in Transformer.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Method</title>
<p>The proposed multi-scale region-aware module perceives emotion regions at various scales spatially by employing multi-branch large-kernel stripe convolution. Additionally, by pooling completely linked layers, attention weights are produced in the emotion regions at each scale. This module can improve the diversity of perception and highlight the prominence of focused features. To learn temporal correlation information between pairs of odd-even sub-series, a temporal approach based on multiple convolutional interactions and iterative odd-even down-sampling is proposed. The approach preserves recognition accuracy while establishing global temporal connections with minimal overhead. The multi-scale region-aware module, temporal interaction sampling learning module, and model architecture are then explained in detail.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Network Architecture</title>
<p>The architecture of the proposed model is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, which mainly consists of a multi-scale region-aware module and a temporal interaction sampling learning module. To get the combined region characteristics for each frame, fixed-length series are dynamically sampled from the source video, down-sampled by the Stem layer, and supplied to the multi-scale region perception module. The structure of the multi-scale region-aware module is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The module adopts the four-layer architecture of Transformer but uses convolution-based multi-scale region-aware attention to replace self-attention for region extraction. A region attention aggregation submodule and a branching convolution submodule make up multi-scale region-aware attention. Using convolution kernels of various sizes on each branch, the branching convolution submodule extracts emotion regions of various scales in each frame. Subsequently, the region attention aggregation submodule calculates the attention weights of the emotion regions at each scale and generates combined region features by aggregating regions according to the weights. We build the spatial portion of the entire model by stacking multi-scale region-aware modules using a multi-stage pooling method, which produces new temporal series. The temporal interaction sampling learning module then receives the new series and uses multi-layer odd-even down-sampling to progressively break down the lengthy series. Each layer uses convolution and elemental multiplication to achieve interaction between pairs of odd-even series and learn the temporal correlation information between the two series. Additionally, by using convolution as the interaction weight, the feature similarity issue is resolved, and feature diversity is increased. Each series is then subjected to a second convolution, which blends the surrounding pixels to improve the information fusion. The global timing-dependent properties of the deep series are concatenated.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Model architecture diagram</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_71043-fig-2.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Model Architecture</title>
<p>The preprocessed video series is fed into the multi-scale region-aware module (MRA). This module&#x2019;s multi-scale region-aware attention extracts emotion regions at various scales using deep convolution kernels of varying sizes. The model&#x2019;s attention to important regions is then increased by applying attention weights to the feature maps of these regions. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> depicts the branching convolution submodule (BCS) and the region attention aggregation submodule(RAAS) that make up the multi-scale region attention structure. Firstly, the branching convolution submodule extracts emotional regions of different scales in each frame. Subsequently, the region attention aggregation submodule computes the attention weights for each scale emotion region. Aggregating regions based on the weights yields the combined region features.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Multi-scale region attention structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_71043-fig-3.tif"/>
</fig>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>Branching Convolution Submodule</title>
<p>A multi-branch depth-wise separable convolution that detects multi-scale emotion zones and a small-kernel standard convolution that combines local data comprise the branching convolution submodule. A more detailed explanation of the submodule can be found below. A 3 &#x00D7; 3 standard convolutional kernel is first used to learn the detailed local regions of each frame, and a 1 &#x00D7; 1 convolution is connected for upscaling. Subsequently, three sets of depth-wise Separable convolutional kernels of different sizes, 1 &#x00D7; 5, 5 &#x00D7; 1, 1 &#x00D7; 7, 7 &#x00D7; 1, 1 &#x00D7; 11, 11 &#x00D7; 1, are used to perceive emotional regions at different scales. The use of depth-wise Separable convolutions can both reduce the computational effort by decomposing the standard convolution and provide the perception of stripe regions to enable more varied emotional regions to be extracted. The branching convolution process can be expressed as <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>D</mml:mi><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>F</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is the convolution result of the branch <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>i</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo fence="false" stretchy="false">{</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo fence="false" stretchy="false">}</mml:mo></mml:math></inline-formula>, <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>D</mml:mi><mml:mi>S</mml:mi><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is a set of depth-wise separable convolutions on branch <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>i</mml:mi></mml:math></inline-formula>. <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is the <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:math></inline-formula> convolution and <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>F</mml:mi></mml:math></inline-formula> is the module input.</p>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>Region Attention Aggregation Submodule</title>
<p>Following the aforementioned branching convolution submodule, the frame&#x2019;s emotion regions at various scales are retrieved. The region attention aggregation submodule uses two-layer full connectivity to adaptively modify each scale region&#x2019;s weights in order to enhance the attention to valuable regions. To obtain the spatial information, we specifically compress the three-scale region characteristics independently using global average pooling (GAP). The compressed three features are made channel concatenated to obtain a channel-level multi-scale feature <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>C</mml:mi></mml:math></inline-formula>. Subsequently, the adaptive aggregated weight <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> between multi-scale regions is learnt through two fully connected layers, which can be expressed as <xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>:
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>&#x03C8;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>L</mml:mi><mml:mi>U</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>C</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> are the weights of the two fully connected layers, and <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>L</mml:mi><mml:mi>U</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>L</mml:mi><mml:mi>U</mml:mi></mml:math></inline-formula> activation function.</p>
<p>Using the adaptive aggregation weights <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula>, the enhanced features <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mrow><mml:mover><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> of the regions at each scale are obtained according to <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>:
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mover><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the element <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>i</mml:mi></mml:math></inline-formula> in <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> and &#x2217; is the scalar multiplication between <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>.</p>
<p>Then, the enhanced features are connected to generate the combined region features <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>R</mml:mi></mml:math></inline-formula>. This process can be expressed as <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>:
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mover><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2A01;</mml:mo><mml:mrow><mml:mover><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2A01;</mml:mo><mml:mrow><mml:mover><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mo>&#x2A01;</mml:mo></mml:math></inline-formula> is Connection operation.</p>
<p>Afterwards, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>R</mml:mi></mml:math></inline-formula> are fed into the third 1 &#x00D7; 1 convolution for dimensionality reduction.</p>
<p>We adopt a multi-stage pooling technique to stack multi-scale regional perceptual modules, both to further broaden the sensory field and extract high-level semantic information in emotional regions. Specifically, non-coverage down-sampling is applied after each multi-scale region-aware module by using 2 &#x00D7; 2 kernels with step size of 2. In the meantime, the LN layer&#x2014;rather than the BN layer&#x2014;is employed in ConvNeXt prior to down-sampling in order to stabilize the incoming data in the proper range. The final multi-scale region-aware module&#x2019;s outputs are all combined to create a new temporal series Z.</p>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>Temporal Interaction Sampling Learning Module</title>
<p>In order to avoid the feature similarity issue among series and to create global temporal dependency with less overhead, we suggest a temporal interaction sampling learning module. The module uses iterative odd-even down-sampling to break down the temporal series layer by layer. Each layer leverages elemental multiplication and exponentiation to create interactions between pairs of odd-even series and uses convolution to extract features from sub-series in order to learn temporal correlation information. Convolution as interaction weights prevents the self-attention feature similarity issue while also increasing feature variety. The surrounding pixels are then mixed to improve the information fusion through another application of one-dimensional convolution of the interaction results. The sampling and convolution difficulty is linear with the number of pixels, allowing the module to simulate global temporal dependency with less overhead than the square-level complexity associated with dense pairwise computing in the Transformer. This preserves the accuracy of the model&#x2019;s recognition while cutting down on training time.</p>
<p>The basic building block in the temporal interaction sampling learning module is the Convolutional Interaction Block (CIBlock). Its structure is shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. The CIBlock decomposes the new temporal series <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>Z</mml:mi></mml:math></inline-formula> into an odd temporal series <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and an even temporal series <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> through odd-even down-sampling. Subsequently, 1D convolution is employed to extract the temporal features for every series. Meanwhile, an interaction technique is presented to learn the affine transform parameters from each other and trade information between pairs of odd-even sub-series in order to compensate for the information lost during the down-sampling. The following is the interaction learning process.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Convolutional interaction block structure</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_71043-fig-4.tif"/>
</fig>
<p>For element-by-element multiplication, the convolution results of the two subseries are transformed into exponential form and crossed. In order to enhance the information fusion and blend the surrounding pixels, the multiplication result is convolved again. The original features and the output of the second convolution are residually concatenated. The above interaction process can be written as <xref ref-type="disp-formula" rid="eqn-5">Eqs. (5)</xref> and <xref ref-type="disp-formula" rid="eqn-6">(6)</xref>:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msubsup><mml:mi>Z</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2A01;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2A00;</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p><disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msubsup><mml:mi>Z</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2A01;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2A00;</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msubsup><mml:mi>Z</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the output odd series, <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the down-sampling odd series, <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mo>&#x2A01;</mml:mo></mml:math></inline-formula> is the residual link, <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> is the 3 &#x00D7; 3 convolution, <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mo>&#x2A00;</mml:mo></mml:math></inline-formula> is the element-by-element multiplication, <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi></mml:math></inline-formula> is the exponential operation, <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the down-sampling even series, and <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msubsup><mml:mi>Z</mml:mi><mml:mrow><mml:mi>e</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is the output even series.</p>
<p>By putting several CIBlocks in a binary tree structure, the temporal interaction sampling learning module is built. Concatenating all of the deep level&#x2019;s series and performing residual concatenation with the input from the temporal interaction sampling learning module yields the global emotion temporal feature <italic>T</italic>.</p>
<p>Subsequently the global emotion temporal feature <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>T</mml:mi></mml:math></inline-formula> is fed into the classifier. The classifier uses three fully connected layers. Dimensionality reduction is achieved by the first two layers; dropout is added to prevent overfitting after both layers. Emotional recognition values are output by the third completely connected layer. The loss function that we employ is mean absolute error, or MAE. To further prevent model overfitting, the L2 regularization is added concurrently. The objective function is minimized in order to optimize the model. The objective function including L2 regularization is shown in <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref>:<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mo>&#x2225;</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:msup><mml:mo stretchy="false">&#x2225;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mi>L</mml:mi></mml:math></inline-formula> is the objective function, <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi>N</mml:mi></mml:math></inline-formula> is the number of samples, <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>a</mml:mi></mml:math></inline-formula> is the sample number, <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mrow><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is the predicted value of the sample <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>a</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msub><mml:mrow><mml:mover><mml:mrow><mml:mtext>y</mml:mtext></mml:mrow><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mrow><mml:mtext>a</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is the true value of the sample <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>a</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mi>&#x03BB;</mml:mi><mml:mo>&#x2225;</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:msup><mml:mo stretchy="false">&#x2225;</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> is the regularization.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experiments</title>
<p>To prove the effectiveness of the proposed model, comparative experiments with other advanced models are conducted. Relevant ablation experiments are also done to show the necessity of the proposed component module.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Experimental Settings</title>
<sec id="s4_1_1">
<label>4.1.1</label>
<title>Dataset and Settings</title>
<p>In this study, CMU-MOSI [<xref ref-type="bibr" rid="ref-30">30</xref>], CMU-MOSEI [<xref ref-type="bibr" rid="ref-31">31</xref>] and Hume-Reaction [<xref ref-type="bibr" rid="ref-32">32</xref>] are selected as benchmark datasets for performance evaluation and comparison. CMU-MOSI consists of 2199 short monologue video clips of 89 speakers from different countries on YouTube. CMU-MOSEI has 3228 monologue video clips for a total of 65 h, some examples of which are shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Selected examples of the CMU-MOSEI dataset</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_71043-fig-5.tif"/>
</fig>
<p>Over 70 h of video footage from 2222 participants make up Hume-Reaction. Every sample has seven different emotional reactions labeled on it. These seven emotional reactions are: surprise, admiration, excitement, fear, disgust, worry, and distress. The original frame rates of CMU-MOSI and CMU-MOSEI are both 30 frames per second, and Hume Reaction is 25 frames per second. CMU-MOSI and CMU-MOSEI use MTCNN to crop only the face and resize it uniformly to 224 &#x00D7; 224. The latter combines MTCNN with OpenPose to crop the face and upper body, also adjusted to 224 &#x00D7; 224. CMU-MOSI and CMU-MOSEI are native discourse-level annotations, and this study directly uses the original segmentation and labels. All datasets only use spatiotemporal visual features of RGB video frames, excluding audio and text features. <xref ref-type="table" rid="table-3">Table 3</xref> displays the specifics of each dataset&#x2019;s training, validation, and test set divisions.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Division of training, validation and test sets in CMU-MOSI, CMU-MOSEI and Hume-Reaction</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Delineation</th>
<th>Statistical information</th>
<th>CMU-MOSI</th>
<th>CMU-MOSEI</th>
<th>Hume-Reaction</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="2">Training</td>
<td>Size</td>
<td>1283</td>
<td>16,315</td>
<td>1334</td>
</tr>
<tr>
<td>Duration</td>
<td>2:55:06</td>
<td>46:25:50</td>
<td>51:04:02</td>
</tr>
<tr>
<td rowspan="2">Validation</td>
<td>Size</td>
<td>229</td>
<td>1871</td>
<td>444</td>
</tr>
<tr>
<td>Duration</td>
<td>0:31:15</td>
<td>5:10:15</td>
<td>14:59:27</td>
</tr>
<tr>
<td rowspan="2">Test</td>
<td>Size</td>
<td>686</td>
<td>4654</td>
<td>444</td>
</tr>
<tr>
<td>Duration</td>
<td>1:33:37</td>
<td>13:14:40</td>
<td>14:48:21</td>
</tr>
<tr>
<td rowspan="2">Total</td>
<td>Size</td>
<td>2198</td>
<td>22,840</td>
<td>2222</td>
</tr>
<tr>
<td>Duration</td>
<td>4:59:58</td>
<td>64:50:45</td>
<td>74:26:19</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>A computer with an Intel Core i7-10870 CPU and 16 GB RAM, and a remote server consisting of 2 NVIDIA GeForce RTX 3090 GPUs has been used. Pytorch 1.11 is the development environment, mostly utilized for hyperparameter tweaking, model training, and validation. While 64 is the batch size used during model training, 16 is the batch size for testing, and the frame length is 16. After 30 generations of the warmup approach, the learning rate is gradually lowered to zero using the cosine annealing procedure. A starting learning rate of 0.005 is used. In the gradient calculation, the Ranger optimizer is used to update the model parameters, which integrates AdamW [<xref ref-type="bibr" rid="ref-33">33</xref>], Lookahead [<xref ref-type="bibr" rid="ref-34">34</xref>], adaptive gradient clipping, and other techniques, having a stronger learning ability. The model is trained for regression, classification. All activation functions use GELU, which can be regarded as a combination of dropout and RELU. GELU introduces randomness to make the model training more robust.</p>
</sec>
<sec id="s4_1_2">
<label>4.1.2</label>
<title>Experimental Indicators</title>
<p>In this experiment, Pearson Correlation (Corr) is used as a measure for the emotion regression task. Meanwhile, the seven-classification accuracy (Acc-7), the two-classification accuracy (Acc-2), and the F1-score (F1) value are used as a measure for the emotion classification task. For both CMU-MOSI and CMU-MOSEI datasets, the real number of emotion scores is discretized to obtain seven category labels, from which Acc-7 is calculated; meanwhile, non-negative emotion scores are used as positive categories, and negative scores as negative categories, from which Acc-2 and F1 values are calculated. For Hume-Reaction, the emotion category with the highest score was used to determine Acc-7; in the meantime, Acc-2 and F1 values were calculated using the negative categories of anxiety, disgust, pain, and fear, and the positive categories of adoration, joy, and surprise. This section uses FLOPs per frame and memory overhead as efficiency metrics to quantify temporal and spatial efficiency.</p>
</sec>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Comparative Experiments</title>
<p>To evaluate the performance of our method on the video emotion recognition task, we choose four methods for comparison experiments.</p>
<p>ResNet&#x002B;Bi-LSTM uses ResNet50 for spatial feature extraction, followed by Bi-LSTM to complete temporal feature extraction. PredRCNN [<xref ref-type="bibr" rid="ref-35">35</xref>] extracts and memorises spatial and temporal feature representations at the same time using ST-LSTM. ResNet3D [<xref ref-type="bibr" rid="ref-36">36</xref>] replaces each residual block internally with multiple 3D convolutional layers on top of ResNet while learning spatial relationships between video frames and temporal dynamics. ConvLSTM is added to ResNet3D via ResNet3D&#x002B;ConvLSTM, enabling spatiotemporal attentional augmentation of previously extracted spatiotemporal characteristics. TimeSformer [<xref ref-type="bibr" rid="ref-8">8</xref>] uses the Transformer for spatiotemporal feature extraction. Dynamic Facial Expression Recognition Transformer (Former-DFER) [<xref ref-type="bibr" rid="ref-37">37</xref>] models temporal sequences&#x2019; global dependency by first extracting spatial features using a basic ResNet and then adding a two-stage TimeSformer. The model&#x2019;s global time capacity allows it to produce good results. Deep Emotional Arousal Network (DEAN) [<xref ref-type="bibr" rid="ref-38">38</xref>] extracts temporal features using Bi-LSTM after using Transformer to aggregate relationships across various regions.</p>
<p>The input size is uniformly 224 &#x00D7; 224, and the sequence length is adapted according to the dataset; Among them, ResNet&#x002B;Bi LSTM adopts ResNet50, combined with randomly initialized Bi LSTM layers, fine-tuned to convergence on the dataset of this study. ResNet3D (&#x002B;ConvLSTM) uses ResNet3D-18 randomly initialized with ConvLSTM layers, and independently trains from scratch on three datasets. DEAN retains the original model&#x2019;s multi-scale convolution&#x002B;attention vision module, removes the audio branch, and trains from scratch; PredRNN references the basic metrics of the original paper (Kinetics-400 pre-training), while Former DFER removes the audio/text branches from the original multimodal and only retains the video ViT module. After fine-tuning the video branch parameters in this dataset, only video performance is obtained. The results of the comparative trials on emotion recognition are shown in <xref ref-type="table" rid="table-2">Tables 2</xref>&#x2013;<xref ref-type="table" rid="table-4">4</xref>. The performance of multiple models is compared in <xref ref-type="table" rid="table-5">Table 5</xref> in terms of memory overhead and FLOPs per frame.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Comparative results of emotion recognition on CMU-MOSI dataset</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Acc-7</th>
<th>Acc-2</th>
<th>F1</th>
<th>Corr</th>
</tr>
</thead>
<tbody>
<tr>
<td>ResNet&#x002B;Bi-LSTM</td>
<td>0.356</td>
<td>0.781</td>
<td>0.780</td>
<td>0.639</td>
</tr>
<tr>
<td>PredRNN</td>
<td>0.379</td>
<td>0.783</td>
<td>0.774</td>
<td>0.658</td>
</tr>
<tr>
<td>ResNet3D</td>
<td>0.384</td>
<td>0.796</td>
<td>0.783</td>
<td>0.663</td>
</tr>
<tr>
<td>ResNet3D&#x002B;ConvLSTM</td>
<td>0.391</td>
<td>0.813</td>
<td>0.806</td>
<td>0.659</td>
</tr>
<tr>
<td>TimeSformer</td>
<td>0.417</td>
<td>0.827</td>
<td>0.814</td>
<td>0.682</td>
</tr>
<tr>
<td>Former-DFER</td>
<td>0.420</td>
<td>0.831</td>
<td>0.824</td>
<td>0.681</td>
</tr>
<tr>
<td>DEAN</td>
<td>0.422</td>
<td>0.827</td>
<td>0.826</td>
<td>0.698</td>
</tr>
<tr>
<td>Ours</td>
<td>0.419</td>
<td>0.834</td>
<td>0.823</td>
<td>0.689</td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Comparative results of emotion recognition on the CMU-MOSEI dataset</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Acc-7</th>
<th>Acc-2</th>
<th>F1</th>
<th>Corr</th>
</tr>
</thead>
<tbody>
<tr>
<td>ResNet&#x002B;Bi-LSTM</td>
<td>0.450</td>
<td>0.775</td>
<td>0.773</td>
<td>0.540</td>
</tr>
<tr>
<td>PredRNN</td>
<td>0.503</td>
<td>0.791</td>
<td>0.806</td>
<td>0.663</td>
</tr>
<tr>
<td>ResNet3D</td>
<td>0.507</td>
<td>0.826</td>
<td>0.813</td>
<td>0.683</td>
</tr>
<tr>
<td>ResNet3D&#x002B;ConvLSTM</td>
<td>0.511</td>
<td>0.828</td>
<td>0.816</td>
<td>0.691</td>
</tr>
<tr>
<td>TimeSformer</td>
<td>0.516</td>
<td>0.839</td>
<td>0.820</td>
<td>0.698</td>
</tr>
<tr>
<td>Former-DFER</td>
<td>0.518</td>
<td>0.847</td>
<td>0.823</td>
<td>0.703</td>
</tr>
<tr>
<td>DEAN</td>
<td>0.523</td>
<td>0.833</td>
<td>0.832</td>
<td>0.707</td>
</tr>
<tr>
<td>Ours</td>
<td>0.529</td>
<td>0.852</td>
<td>0.849</td>
<td>0.712</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The data in <xref ref-type="table" rid="table-4">Tables 4</xref>&#x2013;<xref ref-type="table" rid="table-6">6</xref> show that ResNet&#x002B;Bi-LSTM and PredRNN have already achieved good results in processing the video task by virtue of the spatio-temporal model structure. The subsequent ResNet3D&#x002B; ConvLSTM results demonstrate that another round of spatio-temporal enhancement of the extracted spatio-temporal features can be more effective in enriching the affective spatio-temporal features and enhancing the recognition accuracy. ResNet3D depends on the residual connections to stack the network deeper, thereby obtaining more temporal memories and achieving better results. After Transformer was added, the model as a whole performed better on large sample datasets like CMU-MOSEI and Hume-Reaction. This was due to the model utilizing Transformer&#x2019;s global self-attention modeling capability and fully extracting correlation information within images and between video frames. Nevertheless, the limited improvement effect of Transformer-based models in smaller datasets is influenced by the lack of past knowledge. And such models have high memory overheads, high computational requirements, and long training times.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Comparative results of emotion recognition on the Hume-Reaction dataset</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Acc-7</th>
<th>Acc-2</th>
<th>F1</th>
<th>Corr</th>
</tr>
</thead>
<tbody>
<tr>
<td>ResNet&#x002B;Bi-LSTM</td>
<td>0.276</td>
<td>0.747</td>
<td>0.766</td>
<td>0.325</td>
</tr>
<tr>
<td>PredRNN</td>
<td>0.296</td>
<td>0.758</td>
<td>0.780</td>
<td>0.331</td>
</tr>
<tr>
<td>ResNet3D</td>
<td>0.297</td>
<td>0.763</td>
<td>0.793</td>
<td>0.338</td>
</tr>
<tr>
<td>ResNet3D&#x002B;ConvLSTM</td>
<td>0.314</td>
<td>0.790</td>
<td>0.789</td>
<td>0.340</td>
</tr>
<tr>
<td>TimeSformer</td>
<td>0.321</td>
<td>0.788</td>
<td>0.792</td>
<td>0.342</td>
</tr>
<tr>
<td>Former-DFER</td>
<td>0.326</td>
<td>0.793</td>
<td>0.791</td>
<td>0.345</td>
</tr>
<tr>
<td>DEAN</td>
<td>0.312</td>
<td>0.786</td>
<td>0.812</td>
<td>0.343</td>
</tr>
<tr>
<td>Ours</td>
<td>0.332</td>
<td>0.812</td>
<td>0.828</td>
<td>0.346</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>This paper combines the advantages of the above models and fully extracts and utilizes information from spatiotemporal and spatial dimensions through the deep stacking of the proposed modules. In the CMU-MOSEI and Hume Reaction datasets with sufficient samples, the Acc-7, Acc-2, F1, and Corr of our model have all been improved. This is because the model introduces multi-scale large kernel convolution and adaptive region attention to achieve multi-scale emotional region perception and fusion, and subsequently uses multi-layer sampling, convolution, and interaction in temporal feature extraction to establish global temporal dependency. However, in the CMU-MOSI dataset with insufficient data, due to the reliance on sufficient samples for multi-scale region-aware convolution and temporal interaction sampling to learn spatiotemporal feature distribution patterns, the Acc-7 metric has decreased compared to Transformer-based models. Meanwhile, analyzing the recognition failure cases, the model performs poorly on videos with extreme motion blur and severe occlusion.</p>
<p><xref ref-type="table" rid="table-7">Table 7</xref> reflects the temporal and spatial overheads of different models. The model in this paper is based on sampling and convolution as a whole, compared to the square-level overhead brought about by dense pairwise computation in Transformer, the overheads of sampling and convolution are linear with the number of pixels. At the same time, convolution possesses the assumptions of a priori knowledge of locality, translation invariance, etc., so that the cost of the model is significantly reduced in both time and space, with Flops being reduced by nearly 2.5 times compared to Transformer-based models.</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>Comparison results of memory overhead and FLOPs per frame</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Methods</th>
<th>Memory</th>
<th>FLOPs</th>
</tr>
</thead>
<tbody>
<tr>
<td>ResNet&#x002B;Bi-LSTM</td>
<td>1243 MB</td>
<td>113.4 G</td>
</tr>
<tr>
<td>PredRNN</td>
<td>1666 MB</td>
<td>192.9 G</td>
</tr>
<tr>
<td>ResNet3D</td>
<td>1813 MB</td>
<td>173.5 G</td>
</tr>
<tr>
<td>ResNet3D&#x002B;ConvLSTM</td>
<td>2695 MB</td>
<td>381.3 G</td>
</tr>
<tr>
<td>TimeSformer</td>
<td>2786 MB</td>
<td>398.7 G</td>
</tr>
<tr>
<td>Former-DFER</td>
<td>2817 MB</td>
<td>406.8 G</td>
</tr>
<tr>
<td>DEAN</td>
<td>2995 MB</td>
<td>437.3 G</td>
</tr>
<tr>
<td>Ours</td>
<td>1752 MB</td>
<td>166.8 G</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows the experimental results of the model on the three datasets of CMU-MOSI, CMU-MOSEI, and Hume-Reaction using bar charts in order to clearly depict the performance of the model provided in this chapter on the three datasets. Because CMU-MOSEI has a larger sample size, its indication identification is superior.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Experimental effects of the model in this paper on different datasets</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_71043-fig-6.tif"/>
</fig>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Ablation Experiments</title>
<p>The proposed video emotion recognition model, which combines spatial multi-scale region-aware and temporally interactive sampling, is mainly consisted of multi-scale region-aware module and temporal interactive sampling learning module. We created ablation experiments that remove each module one at a time for testing and examine how each module affects overall performance in order to confirm the necessity of each module. <xref ref-type="table" rid="table-8">Table 8</xref> displays the ablation experiment findings,</p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Accuracy results of ablation experiments on the CMU-MOSEI dataset</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th colspan="2">MRA</th>
<th colspan="2">CIB</th>
<th rowspan="2">Acc-7</th>
<th rowspan="2">Acc-2</th>
<th rowspan="2">F1</th>
</tr>
<tr>
<th>BCS</th>
<th>RAAS</th>
<th>Interactivity</th>
<th>Enhance</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>&#x00D7;</bold></td>
<td>&#x221A;</td>
<td>&#x221A;</td>
<td>&#x221A;</td>
<td>0.512</td>
<td>0.846</td>
<td>0.836</td>
</tr>
<tr>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>&#x221A;</td>
<td>&#x221A;</td>
<td>0.503</td>
<td>0.839</td>
<td>0.824</td>
</tr>
<tr>
<td>&#x221A;</td>
<td>&#x221A;</td>
<td><bold>&#x00D7;</bold></td>
<td>&#x221A;</td>
<td>0.509</td>
<td>0.841</td>
<td>0.834</td>
</tr>
<tr>
<td>&#x221A;</td>
<td>&#x221A;</td>
<td><bold>&#x00D7;</bold></td>
<td><bold>&#x00D7;</bold></td>
<td>0.506</td>
<td>0.836</td>
<td>0.823</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In this work, we aim to eliminate the branching convolution sub-module for multi-scale emotional region extraction and utilize ResNet 50&#x2019;s standard conv 1 through conv 4 exclusively for feature extraction. The model&#x2019;s performance on CMU-MOSEI declines by 0.007, 0.006, and 0.013, according to the results. The above results show that using large kernel convolution of different sizes to extract multi-scale emotion regions and obtain varied emotion information can improve the accuracy of emotion recognition. The region attention aggregation submodule, which produces region attention weights, was then eliminated. This time, the spatial components of affective feature extraction and fusion are not used; only the temporal interaction sample learning module is used. At this moment, the CMU-MOSEI model&#x2019;s accuracy was still declining by 0.009, 0.007, and 0.012. The additional decline in accuracy suggests that, once the multi-scale affective regions have been recovered, significant regions should be emphasized and highlighted throughout the fusion process.</p>
<p>Secondly, this paper tries to remove some functional parts of the temporal interaction sampling learning module to test their effects. After removing the weight multiplication and inter-sequence interaction fusion, the accuracy of the model on CMU-MOSEI shows a different degree of decrease, including a decrease of 0.01 in the accuracy of seven classes, which indicates that the interaction of temporal information achieves good performance in multi-class recognition tasks. The accuracy of the model in seven classes on CMU-MOSEI continues to drop by 0.12 with each further removal of the quadratic convolutional reinforcement module.</p>
<p>The entire ablation experiment shows that attention must be paid to both the temporal and spatial dimensions. The recognition outcomes are influenced by global temporal dependency in the temporal dimension and multi-scale region extraction and fusion in the spatial dimension. The need for interaction and fusion is particularly clear in activities involving multiple classes.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>In this study, we propose a video-based emotion recognition model that combines spatially multi-scale region perception with temporally interactive sampling. Spatially, combining VAN&#x2019;s large kernel decomposition with SegNeXt&#x2019;s multi-scale convolution, using multi-branch large kernel strip convolution to perceive multi-scale and multi-shaped emotion regions. Furthermore, to enhance the perceptual diversity and emphasize the predominance of focused features, attention weights are generated by pooling operations in a fully connected layer for the emotion region features at each scale. Temporally, decompose long sequences by filtering odd and even frames in the sequence. Unlike SCINet, each layer uses element multiplication and convolution to achieve interaction between subsequence pairs, capturing temporal correlation information between odd and even subsequences with minimal overhead. In contrast to the Transformer techniques, this approach establishes global temporal dependency with reduced computation and circumvents the self-attention-induced feature similarity issue. The experiment findings demonstrate that the suggested model more successfully achieves a trade-off between recognition accuracy and model complexity.</p>
<p>Future work will further focus on the following two aspects to improve model performance: (1) for better multi-modal fusion, we will explore the temporal alignment strategy of patches from different modalities. And in doing so, we will improve the cross-modal Transformer&#x2019;s self-attention mechanism to create modal links that correlate temporally; (2) the multi-label image classification algorithm based on spatial attention and graph convolution proposed by Kang et al. [<xref ref-type="bibr" rid="ref-39">39</xref>] provides us with new ideas, and we will explore the application of attention and graph convolution in video emotion recognition.</p>
</sec>
</body>
<back>
<ack>
<p>We are grateful to Nanjing University of Information Science and Technology and Nanjing Tech University for providing study environment and computing equipment.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This study was supported, in part, by the National Nature Science Foundation of China under Grant 62272236, 62376128; in part, by the Natural Science Foundation of Jiangsu Province under Grant BK20201136, BK20191401.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>Study conception and design: Xiaorui Zhang, Chunlin Yuan; data collection: Ting Wang; analysis and interpretation of results: Wei Sun, Chunlin Yuan; draft manuscript preparation: Chunlin Yuan, Wei Sun. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The datasets used and/or analysed during the current study are available from the corresponding author on reasonable request.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable. This paper does not contain any studies with human participants performed by any of the authors.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zadeh</surname> <given-names>A</given-names></string-name>, <string-name><surname>Liang</surname> <given-names>PP</given-names></string-name>, <string-name><surname>Mazumder</surname> <given-names>N</given-names></string-name>, <string-name><surname>Poria</surname> <given-names>S</given-names></string-name>, <string-name><surname>Cambria</surname> <given-names>E</given-names></string-name>, <string-name><surname>Morency</surname> <given-names>LP</given-names></string-name></person-group>. <article-title>Memory fusion network for multi-view sequential learning</article-title>. <source>Proc AAAI Conf Artif Intell</source>. <year>2018</year>;<volume>32</volume>(<issue>1</issue>):<fpage>5634</fpage>&#x2013;<lpage>41</lpage>. doi:<pub-id pub-id-type="doi">10.1609/aaai.v32i1.12021</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>L</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>S</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>S</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>MDKAT: multimodal decoupling with knowledge aggregation and transfer for video emotion recognition</article-title>. <source>IEEE Trans Circuits Syst Video Technol</source>. <year>2025</year>;<volume>35</volume>(<issue>10</issue>):<fpage>9809</fpage>&#x2013;<lpage>22</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TCSVT.2025.3571534</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Meng</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>M</given-names></string-name>, <string-name><surname>Han</surname> <given-names>H</given-names></string-name>, <string-name><surname>Liao</surname> <given-names>L</given-names></string-name>, <string-name><surname>Cambria</surname> <given-names>E</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Towards multimodal empathetic response generation: a rich text-speech-vision avatar-based benchmark</article-title>. In: <conf-name>Proceedings of the ACM on Web Conference 2025; 2025 May 5&#x2013;9</conf-name>; <publisher-loc>Sydney, NSW, Australia</publisher-loc>. p. <fpage>2872</fpage>&#x2013;<lpage>81</lpage>. doi:<pub-id pub-id-type="doi">10.1145/3696410.3714739</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Fu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Z</given-names></string-name></person-group>. <article-title>BeMERC: behavior-aware mllm-based framework for multimodal emotion recognition in conversation</article-title>. <comment>arXiv:2503.23990. 2025</comment>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Vaswani</surname> <given-names>A</given-names></string-name>, <string-name><surname>Shazeer</surname> <given-names>N</given-names></string-name>, <string-name><surname>Parmar</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Attention is all you need</article-title>. <source>Adv Neural Inf Process Syst</source>. <year>2017</year>;<volume>30</volume>:<fpage>30</fpage>&#x2013;<lpage>44</lpage>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Dosovitskiy</surname> <given-names>A</given-names></string-name>, <string-name><surname>Beyer</surname> <given-names>L</given-names></string-name>, <string-name><surname>Kolesnikov</surname> <given-names>A</given-names></string-name></person-group>. <article-title>An image is worth 16x16 words: transformers for image recognition at scale</article-title>. <comment>arXiv:2010.11929. 2020</comment>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Cao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wei</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Z</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Swin transformer: hierarchical vision transformer using shifted windows</article-title>. In: <conf-name>2021 IEEE/CVF International Conference on Computer Vision (ICCV); 2021 Oct 10&#x2013;17</conf-name>; <publisher-loc>Montreal, QC, Canada</publisher-loc>. p. <fpage>9992</fpage>&#x2013;<lpage>10002</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ICCV48922.2021.00986</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bertasius</surname> <given-names>G</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Torresani</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Is space-time attention all you need for video understanding?</article-title> <source>In: Proceedings of the 38th International Conference on Machine Learning;</source> <year>2021</year>. Vol. <volume>139</volume>, p. <fpage>813</fpage>&#x2013;<lpage>24</lpage>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>K</given-names></string-name>, <string-name><surname>Lian</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>L</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>B</given-names></string-name>, <string-name><surname>Tao</surname> <given-names>J</given-names></string-name>, <string-name><surname>Fan</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Emotional reaction analysis based on multi-label graph convolutional networks and dynamic facial expression recognition transformer</article-title>. In: <conf-name>Proceedings of the 3rd International on Multimodal Sentiment Analysis Workshop and Challenge; 2020 Oct 10&#x2013;14</conf-name>; <publisher-loc>Lisbon, Portugal</publisher-loc>. p. <fpage>75</fpage>&#x2013;<lpage>80</lpage>. doi:<pub-id pub-id-type="doi">10.1145/3551876.3554810</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chaudhari</surname> <given-names>A</given-names></string-name>, <string-name><surname>Bhatt</surname> <given-names>C</given-names></string-name>, <string-name><surname>Krishna</surname> <given-names>A</given-names></string-name>, <string-name><surname>Travieso-Gonz&#x00E1;lez</surname> <given-names>CM</given-names></string-name></person-group>. <article-title>Facial emotion recognition with inter-modality-attention-transformer-based self-supervised learning</article-title>. <source>Electronics</source>. <year>2023</year>;<volume>12</volume>(<issue>2</issue>):<fpage>288</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics12020288</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Ye</surname> <given-names>T</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>L</given-names></string-name>, <string-name><surname>Xia</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Differential transformer</article-title>. <comment>arXiv:2410.05258. 2024</comment>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Pan</surname> <given-names>X</given-names></string-name>, <string-name><surname>Ye</surname> <given-names>T</given-names></string-name>, <string-name><surname>Xia</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Song</surname> <given-names>S</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Slide-transformer: hierarchical vision transformer with local self-attention</article-title>. In: <conf-name>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR); 2023 Jun 17&#x2013;24</conf-name>; <publisher-loc>Vancouver, BC, Canada</publisher-loc>. p. <fpage>2082</fpage>&#x2013;<lpage>91</lpage>. doi:<pub-id pub-id-type="doi">10.1109/CVPR52729.2023.00207</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Shi</surname> <given-names>D</given-names></string-name>, <string-name><surname>Zhong</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Cao</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Ma</surname> <given-names>L</given-names></string-name>, <string-name><surname>Lit</surname> <given-names>J</given-names></string-name>, <string-name><surname>Tao</surname> <given-names>D</given-names></string-name></person-group>. <article-title>TriDet: temporal action detection with relative boundary modeling</article-title>. In: <conf-name>2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR); 2023 Jun 17&#x2013;24</conf-name>; <publisher-loc>Vancouver, BC, Canada</publisher-loc>. p. <fpage>18857</fpage>&#x2013;<lpage>66</lpage>. doi:<pub-id pub-id-type="doi">10.1109/CVPR52729.2023.01808</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>You</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Jin</surname> <given-names>H</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Visual sentiment analysis by attending on local image regions</article-title>. <source>Proc AAAI Conf Artif Intell</source>. <year>2017</year>;<volume>31</volume>(<issue>1</issue>):<fpage>231</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.1609/aaai.v31i1.10501</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Guo</surname> <given-names>MH</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>CZ</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>ZN</given-names></string-name>, <string-name><surname>Cheng</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>SM</given-names></string-name></person-group>. <article-title>Visual attention network</article-title>. <source>Comput Vis Medium</source>. <year>2023</year>;<volume>9</volume>(<issue>4</issue>):<fpage>733</fpage>&#x2013;<lpage>52</lpage>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Ding</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Han</surname> <given-names>J</given-names></string-name>, <string-name><surname>Ding</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Scaling up your kernels to 31 &#x00D7; 31: revisiting large kernel design in CNNs</article-title>. In: <conf-name>2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR); 2022 Jun 18&#x2013;24</conf-name>; <publisher-loc>New Orleans, LA, USA</publisher-loc>. p. <fpage>11953</fpage>&#x2013;<lpage>65</lpage>. doi:<pub-id pub-id-type="doi">10.1109/CVPR52688.2022.01166</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>M</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>A</given-names></string-name>, <string-name><surname>Lai</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Time series is a special sequence: forecasting with sample convolution and inter-action</article-title>. <comment>arXiv:2106.09305. 2021</comment>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Mao</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>CY</given-names></string-name>, <string-name><surname>Feichtenhofer</surname> <given-names>C</given-names></string-name>, <string-name><surname>Darrell</surname> <given-names>T</given-names></string-name>, <string-name><surname>Xie</surname> <given-names>S</given-names></string-name></person-group>. <article-title>A ConvNet for the 2020s</article-title>. In: <conf-name>2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR); 2022 Jun 18&#x2013;24</conf-name>; <publisher-loc>New Orleans, LA, USA</publisher-loc>. p. <fpage>11966</fpage>&#x2013;<lpage>76</lpage>. doi:<pub-id pub-id-type="doi">10.1109/CVPR52688.2022.01167</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Guo</surname> <given-names>MH</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>CZ</given-names></string-name>, <string-name><surname>Hou</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Segnext: rethinking convolutional attention design for semantic segmentation</article-title>. <source>Adv Neural Inf Process Syst</source>. <year>2022</year>;<volume>35</volume>:<fpage>1140</fpage>&#x2013;<lpage>56</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>He</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Ren</surname> <given-names>S</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Deep residual learning for image recognition</article-title>. In: <conf-name>2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR); 2016 Jun 27&#x2013;30</conf-name>; <publisher-loc>Las Vegas, NV, USA</publisher-loc>. p. <fpage>770</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.1109/CVPR.2016.90</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Lin</surname> <given-names>TY</given-names></string-name>, <string-name><surname>Doll&#x00E1;r</surname> <given-names>P</given-names></string-name>, <string-name><surname>Girshick</surname> <given-names>R</given-names></string-name>, <string-name><surname>He</surname> <given-names>K</given-names></string-name>, <string-name><surname>Hariharan</surname> <given-names>B</given-names></string-name>, <string-name><surname>Belongie</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Feature pyramid networks for object detection</article-title>. In: <conf-name>2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR); 2017 Jul 21&#x2013;26</conf-name>; <publisher-loc>Honolulu, HI, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2017</year>. p. <fpage>936</fpage>&#x2013;<lpage>44</lpage>. doi:<pub-id pub-id-type="doi">10.1109/CVPR.2017.106</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Lang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Liew</surname> <given-names>JH</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Hou</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Feng</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Cross-layer feature pyramid network for salient object detection</article-title>. <source>IEEE Trans Image Process</source>. <year>2021</year>;<volume>30</volume>:<fpage>4587</fpage>&#x2013;<lpage>98</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TIP.2021.3072811</pub-id>; <pub-id pub-id-type="pmid">33872147</pub-id></mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gao</surname> <given-names>SH</given-names></string-name>, <string-name><surname>Cheng</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>XY</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>MH</given-names></string-name>, <string-name><surname>Torr</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Res2Net: a new multi-scale backbone architecture</article-title>. <source>IEEE Trans Pattern Anal Mach Intell</source>. <year>2021</year>;<volume>43</volume>(<issue>2</issue>):<fpage>652</fpage>&#x2013;<lpage>62</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tpami.2019.2938758</pub-id>; <pub-id pub-id-type="pmid">31484108</pub-id></mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xie</surname> <given-names>E</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>Z</given-names></string-name></person-group>. <article-title>SegFormer: simple and efficient design for semantic segmentation with transformers</article-title>. <source>Adv Neural Inf Process Syst</source>. <year>2021</year>;<volume>34</volume>:<fpage>12077</fpage>&#x2013;<lpage>90</lpage>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Hou</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Cheng</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Feng</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Strip pooling: rethinking spatial pooling for scene parsing</article-title>. In: <conf-name>2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR); 2020 Jun 13&#x2013;19</conf-name>; <publisher-loc>Seattle, WA, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2020</year>. p. <fpage>4002</fpage>&#x2013;<lpage>11</lpage>. doi:<pub-id pub-id-type="doi">10.1109/cvpr42600.2020.00406</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Neimark</surname> <given-names>D</given-names></string-name>, <string-name><surname>Bar</surname> <given-names>O</given-names></string-name>, <string-name><surname>Zohar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Asselmann</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Video transformer network</article-title>. In: <conf-name>2021 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW); 2020 Oct 11&#x2013;17</conf-name>; <publisher-loc>Montreal, BC, Canada</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2021</year>. p. <fpage>3156</fpage>&#x2013;<lpage>65</lpage>. doi:<pub-id pub-id-type="doi">10.1109/iccvw54120.2021.00355</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Bai</surname> <given-names>S</given-names></string-name>, <string-name><surname>Kolter</surname> <given-names>JZ</given-names></string-name>, <string-name><surname>Koltun</surname> <given-names>V</given-names></string-name></person-group>. <article-title>An empirical evaluation of generic convolutional and recurrent networks for sequence modeling</article-title>. <comment>arXiv:1803.01271. 2018</comment>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Long</surname> <given-names>M</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name></person-group>. <article-title>PredCNN: predictive learning with cascade convolutions</article-title>. In: <conf-name>Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence; 2018 Jul 13&#x2013;19</conf-name>; <publisher-loc>Stockholm, Sweden</publisher-loc>. p. <fpage>2940</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.24963/ijcai.2018/408</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Gao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Tan</surname> <given-names>C</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Li</surname> <given-names>SZ</given-names></string-name></person-group>. <article-title>SimVP: simpler yet better video prediction</article-title>. In: <conf-name>2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR); 2022 Jun 18&#x2013;22</conf-name>; <publisher-loc>New Orleans, LA, USA</publisher-loc>: <publisher-name>IEEE; 2022</publisher-name>. p. <fpage>3160</fpage>&#x2013;<lpage>70</lpage>. doi:<pub-id pub-id-type="doi">10.1109/CVPR52688.2022.00317</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zadeh</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zellers</surname> <given-names>R</given-names></string-name>, <string-name><surname>Pincus</surname> <given-names>E</given-names></string-name>, <string-name><surname>Morency</surname> <given-names>LP</given-names></string-name></person-group>. <article-title>Multimodal sentiment intensity analysis in videos: facial gestures and verbal messages</article-title>. <source>IEEE Intell Syst</source>. <year>2016</year>;<volume>31</volume>(<issue>6</issue>):<fpage>82</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.1109/MIS.2016.94</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Bagher Zadeh</surname> <given-names>A</given-names></string-name>, <string-name><surname>Liang</surname> <given-names>PP</given-names></string-name>, <string-name><surname>Poria</surname> <given-names>S</given-names></string-name>, <string-name><surname>Cambria</surname> <given-names>E</given-names></string-name>, <string-name><surname>Morency</surname> <given-names>LP</given-names></string-name></person-group>. <article-title>Multimodal language analysis in the wild: cmu-MOSEI dataset and interpretable dynamic fusion graph</article-title>. In: <conf-name>Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</conf-name>. <publisher-loc>Melbourne, Australia. Stroudsburg, PA, USA</publisher-loc>: <publisher-name>ACL</publisher-name>; <year>2018</year>. p. <fpage>2236</fpage>&#x2013;<lpage>46</lpage>. doi:<pub-id pub-id-type="doi">10.18653/v1/p18-1208</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Christ</surname> <given-names>L</given-names></string-name>, <string-name><surname>Amiriparian</surname> <given-names>S</given-names></string-name>, <string-name><surname>Baird</surname> <given-names>A</given-names></string-name>, <string-name><surname>Tzirakis</surname> <given-names>P</given-names></string-name>, <string-name><surname>Kathan</surname> <given-names>A</given-names></string-name>, <string-name><surname>M&#x00FC;ller</surname> <given-names>N</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>The MuSe 2022 multimodal sentiment analysis challenge: humor, emotional reactions, and stress</article-title>. In: <conf-name>Proceedings of the 3rd International on Multimodal Sentiment Analysis Workshop and Challenge; 2022 Oct 10&#x2013;14</conf-name>; <publisher-loc>Lisbon, Portugal</publisher-loc>. p. <fpage>5</fpage>&#x2013;<lpage>14</lpage>. doi:<pub-id pub-id-type="doi">10.1145/3551876.3554817</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Loshchilov</surname> <given-names>I</given-names></string-name>, <string-name><surname>Hutter</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Decoupled weight decay regularization</article-title>. <comment>arXiv:1711.05101. 2017</comment>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>M</given-names></string-name>, <string-name><surname>Lucas</surname> <given-names>J</given-names></string-name>, <string-name><surname>Hinton</surname> <given-names>G</given-names></string-name>, <string-name><surname>Ba</surname> <given-names>J</given-names></string-name></person-group>. <chapter-title>Lookahead optimizer: k steps forward, 1 step back</chapter-title>. In: <source>Advances in neural information processing systems</source>; <year>2019</year>. <fpage>32</fpage> p.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Long</surname> <given-names>M</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Predrnn</surname> <given-names>Yu PS</given-names></string-name></person-group>. <chapter-title>Recurrent neural networks for predictive learning using spatiotemporal lstms</chapter-title>. In: <source>Advances in neural information processing systems</source>; <year>2017</year>. <fpage>30</fpage> p.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Hara</surname> <given-names>K</given-names></string-name>, <string-name><surname>Kataoka</surname> <given-names>H</given-names></string-name>, <string-name><surname>Satoh</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Learning spatio-temporal features with 3D residual networks for action recognition</article-title>. In: <conf-name>2017 IEEE International Conference on Computer Vision Workshops (ICCVW); 2017 Oct 22&#x2013;29</conf-name>; <publisher-loc>Venice, Italy</publisher-loc>: <publisher-name>IEEE</publisher-name>; <year>2017</year>. p. <fpage>3154</fpage>&#x2013;<lpage>60</lpage>, <comment>2017</comment>. doi:<pub-id pub-id-type="doi">10.1109/ICCVW.2017.373</pub-id>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zhao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Former-DFER: dynamic facial expression recognition transformer</article-title>. In: <conf-name>Proceedings of the 29th ACM International Conference on Multimedia; 2021 Oct 20&#x2013;24</conf-name>; <publisher-loc>Virtual Event, China</publisher-loc>. p. <fpage>1553</fpage>&#x2013;<lpage>61</lpage>. doi:<pub-id pub-id-type="doi">10.1145/3474085.3475292</pub-id>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>F</given-names></string-name>, <string-name><surname>Li</surname> <given-names>XC</given-names></string-name>, <string-name><surname>Lim</surname> <given-names>CP</given-names></string-name>, <string-name><surname>Hua</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>CR</given-names></string-name>, <string-name><surname>Zhai</surname> <given-names>JH</given-names></string-name></person-group>. <article-title>Deep emotional arousal network for multimodal sentiment analysis and emotion recognition</article-title>. <source>Inf Fusion</source>. <year>2022</year>;<volume>88</volume>(<issue>1</issue>):<fpage>296</fpage>&#x2013;<lpage>304</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.inffus.2022.07.006</pub-id>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kang</surname> <given-names>P</given-names></string-name>, <string-name><surname>Hou</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>H</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Li</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Multi-label image classification algorithm based on spatial attention and graph convolution</article-title>. <source>Microelectron Comput</source>. <year>2022</year>;<volume>39</volume>(<issue>5</issue>):<fpage>10</fpage>&#x2013;<lpage>9</lpage>.</mixed-citation></ref>
</ref-list>
</back></article>