Recurrent Convolutions for Causal 3D CNNs

Recurrent Convolutions for Causal 3D CNNs

Gurkirt Singh  Fabio Cuzzolin
Visual Artificial Intelligence Laboratory (VAIL), Oxford Brookes University

Recently, three dimensional (3D) convolutional neural networks (CNNs) have emerged as dominant methods to capture spatiotemporal representations in videos, by adding to pre-existing 2D CNNs a third, temporal dimension. Such 3D CNNs, however, are anti-causal (i.e., they exploit information from both the past and the future frames to produce feature representations, thus preventing their use in online settings), constrain the temporal reasoning horizon to the size of the temporal convolution kernel, and are not temporal resolution-preserving for video sequence-to-sequence modelling, as, for instance, in action detection. To address these serious limitations, here we present a new 3D CNN architecture111This work is partly supported by the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 779813 (SARAS). for the causal/online processing of videos.

Namely, we propose a novel Recurrent Convolutional Network (RCN), which relies on recurrence to capture the temporal context across frames at each network level. Our network decomposes 3D convolutions into (1) a 2D spatial convolution component, and (2) an additional hidden state convolution, applied across time. The hidden state at any time is assumed to depend on the hidden state at and on the current output of the spatial convolution component. As a result, the proposed network: (i) produces causal outputs, (ii) provides flexible temporal reasoning, (iii) preserves temporal resolution. Our experiments on the large-scale large Kinetics and MultiThumos datasets show that the proposed method performs comparably to anti-causal 3D CNNs, while being causal and using fewer parameters.

1 Introduction

Figure 1: Illustration of 3D architectures used on sequences of input frames. (a) Standard 3D convolution, as in I3D [7] or C3D [50]. (b) 3D convolution decomposed into a 2D spatial convolution followed by a 1D temporal one, as in S3D [55]. In R(2+1)D [51] the number of middle planes is increased to match the number of parameters in standard 3D convolution. (c) Our proposed decomposition of 3D convolution into 2D spatial convolution and recurrence (in red) in the temporal direction, with a convolution as hidden state transformation.

Convolutional neural networks (CNN) are starting to deliver gains in action recognition from videos similar to those previously observed in image recognition [26, 42] thanks to new 3D CNN architectures [12, 7, 55, 51, 15, 54]. For instance, Hare \etal [15] have shown that this is the case for the 3D version of residual networks (ResNets) [17]. Other recent works [12, 55, 51] show that 3D convolutions can be decomposed into 2D (spatial) and 1D (temporal) convolutions, and that these ‘decomposed’ architectures not only have fewer parameters to train [55], but also perform better than standard 3D (spatiotemporal) ones.

All such 3D CNNs, however, have significant issues. First and foremost, they are not causal [6], for they process future frames to predict the label of the current one. Causal inference is essential in many video understanding settings, e.g., online action prediction [37, 45, 47], future action label prediction [25], and future representation prediction [53].
Secondly, the size of temporal convolution needs to be specified by hand at every level of network depth, and is usually set to be equal to the spatial convolution size [7, 51, 6]. Whatever the choice, the temporal reasoning horizon or ‘receptive field’ is effectively constrained by the size of the temporal convolution kernel(s). Varol \etal [52] have suggested that using long-term temporal convolution could enable long-term reasoning. However, setting the size of the convolution kernel at each level is a non-trivial task, which requires expert knowledge and extensive cross-validation. Lastly, 3D CNNs do not preserve temporal resolution, as the latter drops with network depth. Preserving temporal resolution (i.e., ensuring that a prediction is made for each input frame), in fact, is essential when predicting, e.g., each individual video frame label for temporal action segmentation [58, 40, 36, 5], or in video segmentation [57].

Our proposal: combining implicit and explicit temporal modelling. An alternative to the implicit modelling of a video’s temporal characteristics via 3D CNNs is the use of models which encode these dynamics explicitly. Hidden state models, such as Markov ones [4], recurrent neural networks (RNN) [21, 11], and long short-term memory (LSTM) networks [18] can all be used to model temporal dynamics in videos  [10, 34], allowing flexible temporal reasoning without any need to specify a temporal window size.
In an approach which aims to combine the representation power of explicit dynamical models with the discriminative power of 3D networks, in this work we propose a recurrent alternative to 3D convolution illustrated in Figure 1(c). In this new architecture, spatial reasoning expressed in the form of a mapping from the input to a hidden state, is performed by 2D convolution (with kernel size ), whereas temporal reasoning (represented by hidden state-to-hidden state transformations) is performed by a 1D convolution (with kernel size ) taking place at every point in time and at each level (depth-wise) of the network. In a setting which merges the effects of both operators, the hidden state at time (denoted by ) is a function of the outputs of both the spatial and the temporal (hidden) convolutions, with as an input. The resulting temporal reasoning horizon is effectively unconstrained, as the hidden state is a function of the input in the interval .

Causality. \textcolorblack2D CNNs [41] are causal and preserve temporal resolution, but cannot perform temporal reasoning. Nevertheless, they can be combined with LSTMs [18] to generate causal representations, as in [10, 58]. However, such 2D CNN plus LSTM combinations perform much worse than 3D CNNs, as shown by Carreira \etal [7]. In a work related to ours, Carreira \etal [6] have proposed to make 3D CNNs causal via a network which uses present and past frames for predicting the action class of the present frame. However, performance is observed dropping in both its sequential and its parallel versions, as compared to the 3D CNN counterpart [7] of the same network [6]. Our proposed method, in opposition, solves the above-mentioned problems via a Recurrent Convolutional Network (RCN) which explicitly performs temporal reasoning at each level of the network by exploiting recurrence, while maintaining temporal resolution and being causal, without any decline in performance.

Tranfer learning and initialisation. The ability of a network to be conferred knowledge acquired by solving other tasks has been proved to be crucial to performance. Famously, when Tran \etal [50] and Ji \etal [19] first proposed 3D CNNs for video action recognition, their observed performance turned out to be merely comparable to that of 2D CNNs [41], e.g., on the Sports1M dataset [23]. For these reasons, Carreira \etal [7] have later suggested using transfer learning to boost 3D CNN performance. There, 2D CNNs are inflated into 3D ones by replacing 2D convolutions with 3D ones: as a result, 2D network weights as pre-trained on ImageNet [9] can be used to initialise their 3D CNNs. This makes using the latter much more practical, for training a full 3D CNN is a computationally expensive task: 64 GPUs were used to train the latest state-of-the-art 3D nets [7, 51, 6], a kind of firepower not accessible to everyone. That makes ImageNet-based initialisation crucial for speeding up the training process of parameter-heavy 3D networks.

Our Recurrent Convolutional Network exhibits similar performance gains when it comes to ImageNet initialisation. Interestingly, Le \etal [27] have shown that simple RNNs can exhibit long-term memory properties if appropriately initialised, even more so than LSTMs. In our work we thus follow [27] and initialise our recurrent convolution (kernel size ) by the identity matrix, where is number of hidden state kernels.

Contributions. We present a new approach to video feature representation based on an original Recurrent Convolutional Network, in which recurrent convolution replaces temporal convolution in 3D CNNs. Our approach:

  • generates output representations in a causal fashion;

  • allows flexible temporal reasoning, as it exploits information coming from the entire input sequence observed up to time , at each level of network depth;

  • is designed to directly benefit from model initialisation via ImageNet pre-trained weights, as opposed to state-of-the-art approaches, and in line with clear emerging trends in the field.

In our experiments we show that our proposed RCN outperforms baseline I3D [7] and (2+1)D [51] models, while displaying all the above desirable properties.

2 Related Work

As mentioned in the Introduction, initial 3D CNNs models [19, 50], which promised to be able to perform spatial and temporal reasoning in parallel but with limited success, were improved by Carreira \etal [7] using ImageNet based initialisation and training on the large scale Kinetics dataset [24]. The resulting models outperformed 2D ones. Nevertheless, 3D CNNs remain heavy, very expensive to train, and anti-causal.

In alternative, the concept of factorising 3D convolutional networks was explored by Sun \etal [48]. This inspired [55, 35, 51, 12] to decompose 3D convolutions into 2D (spatial) and 1D (temporal) convolutions. Recent work by Xie \etal [55] has promised to reduce complexity (number of parameters), while making up for the lost performance via a gating mechanism. Tran \etal [51] would keep the number of parameters equal to that of 3D convolutions, but boost performance by increasing the number of kernels in the 2D layer. Varol \etal [52] have proposed the use of long-term convolutions to capture long-range dependencies in the data. Wang \etal [54], instead, have introduced non-local blocks in existing 3D CNN architectures, to capture the non-local context in both the spatial and the temporal (present, past and future) dimensions.
The way temporal convolution is used in all the above methods is, however, inherently anti-causal. Moreover, the temporal horizon is limited by the size of the temporal convolution kernel or the size of the non-local step. Relevantly, Carreira \etal [6] have proposed to address the anti-causal nature of 3D CNNs by predicting the future and utilising the flow of information in the network. They would train their causal network to mimic a 3D network. The resulting performance drop, however, is significant.


black Additionally, temporal resolution is not preserved in temporal convolutions with strides. To address the issue, [39, 36] have used temporal deconvolution layers on top of a C3D network [50] to produce a one-to-one mapping from the input frames to the corresponding frame-level label predictions for temporal action detection. Here we show that RCN preserves temporal resolution and performs better than state-of-the-art methods [32], while being causal.


black Recurrence has been used in the past to better capture temporal information, for instance by employing LSTMs [10, 43, 58] on top of 2D CNN features. Carreira \etal [7], however, have shown that the joining of convolutional and LSTM layers performs much worse than 3D CNNs.
Shi \etal [56] have proposed a convolutional LSTM (C-LSTM) solution, in which multiple C-LSTM layers are stacked for precipitation forecasting. Their framework, however, requires all the parameters to be trained from scratch, and has not been empirically compared to 3D CNNs. In contrast, motivated by the success of transfer learning in 3D CNNs [7], and by the reported positive effect on RNNs of better initialisation [27, 29], especially when compared with more complex LSTMs, here we choose to replace temporal convolutions with simple recurrent convolutions. C-LSTM has also been applied to video recognition [28] as an attention mechanism. Its performance, however, has turned out to be much below-par when compared with that of 2D [13] or 3D [12] CNNs. The same can be observed in [3], in which convolutional gated recurrent units-based networks cannot rival traditional 3D CNNs [50].
\textcolorblackThe use of recurrence has also been proposed for image or video generation [22, 31, 30], scene labeling [33], scene text recognition [38] and video representation [56]. None of these approaches, however, have been tested on a large scale video recognition problem. More recently, Bai \etal [2] have shown that temporal convolutions are still better than the above recurrence-based methods [31, 30].


blackIn opposition to previous recurrence-based attempts [28, 30, 3] we demonstrate, for the first time, that recurrent networks can compete with 3D CNNs while holding on to their desirable properties such as causality, temporal flexibility, and temporal resolution preservation. We also show that such a performance improvement in recurrent convolutional networks cannot be achieved without the proper initialisation, even on a large scale dataset such as Kinetics [24].

3 Baseline 3D CNNs


blackWe first recall the two basic types of 3D CNNs that can be built upon a 2D CNN architecture. We then use them as baselines in our experiments, as they are currently state-of-the-art [51, 54, 55] in video recognition. As observed in Section 2, 3D CNNs are far superior to recurrence-based 2D CNN+LSTM [10, 43, 58], C-LSTM [28] or convolutional-GRU [3] architectures. Our goal in this work is to create a causal version of such 3D CNNs.

Layers Output Sizes
Names , , number of kernels I3D RCN
conv1 ; stride
res2 &
res3 &
res4 &
res5 &
pool spatial pooling
convC classification;
mean temporal pooling
Table 1: I3D ResNet-18 model architecture with its output sizes vs RCN’s output sizes for input of size . Each convolutional layer of the network is defined by the temporal () and the spatial () size of the kernels and by the number of kernels. The ConvC layer uses the number of classes as number of kernels.

blackTran \etal [51]’s work is the most recent on pure 3D CNNs, meaning that no additional operations such as gating [55] or non-local operators [54] are applied on top of a 3D CNN architecture. Following their work, we convert a 2D CNN into an inflated 3D CNN (I3D) by replacing a 2D () convolution with a 3D () one, as shown in Figure 1(a). In particular, in this work we inflate the 18-layer ResNet [17] network into an I3D one. This is shown in Table 1, in which each 2D convolution is inflated into a 3D convolution. As in the I3D network architecture in [7], a convolutional layer is used for classification in place of the fully connected layer used in [51, 54]. A convolutional classification layer allows us to evaluate the model on sequences of arbitrary length at test time.
\textcolorblackAs an additional baseline we also implement a (2+1)D [51] model, by replacing every 3D layer in Table 1 with a decomposed version, as shown in Figure 1(b). Namely, we decompose the original () convolution into a () spatial convolution and a () temporal convolution. Similarly to [51], is set equal to .

4 Recurrent Convolutional 3D Network

We are now ready to describe the architecture of our Recurrent Convolutional (3D) Network (RCN) and its properties in detail. Firstly, we show how Recurrent Convolutional Units (RCUs) (§ 4.1) are used to replace every 3D convolutions in the I3D network (§ 3), resulting in our RCN model (§ 4.2). Next, we show how RCUs preserve temporal resolution in § 4.3. In § 4.4 we show how our network behaves causally. Lastly, in § 4.5 and § 4.6, we illustrate the initialisation process for RCN and RCU.

Figure 2: An unrolled Recurrent Convolutional Network (RCN) composed by a single RCU layer followed by a batch normlisation (BN) layer, a ReLU activation layer, and a final convolutional layer used for classification.

4.1 Recurrent Convolutional Unit

A pictorial illustration of our proposed Recurrent Convolutional Unit (RCU) is given in Figure 1(c). At any time instant 3D spatial convolution (with kernel of size , denoted by ) is applied to the input. The result is added to the output of a recurrent convolution operation, with kernel denoted by , of size .
The result is termed the hidden state of the unit. Analytically, a recurrent convolutional unit can be described by the following relation:


where and are parameters of the RCU, and denotes the convolution operator.

4.2 Unrolling a Recurrent Convolutional Network

Figure 2 represents a simple recurrent convolutional network composed by a single RCU unit, unrolled up to time . At each time step , an input is processed by the RCU and the other layers to produce an output .

The unrolling principle allows us to build an RCN from 2D/3D networks, e.g., by replacing 3D convolutions with RCUs in any I3D network. Indeed, the network architecture of our proposed model builds on the I3D network architecture shown in Table 1, where the same parameters (, number of kernels) used for 3D convolutions are used for our RCU. Unlike I3D, however, our RCN does not require a temporal convolution size (cfr. Table 1) as a parameter. As in 2D or I3D ResNet models [17, 51, 15], our proposed RCN also has residual connections. The hidden state at time is considered to be the output at that time instant – as such, it acts as input to next hidden state and to the whole next depth-level layer. Table 1 describes the network architecture of ResNet-18 [17] with 18 layers. Similarly, we can build upon other variants of ResNet.

4.3 Temporal Resolution Preservation

The output sizes for both I3D and our proposed RCN are shown in Table 1. Our RCN only uses spatial pooling and a convolutional layer for classification, unlike the spatiotemporal pooling of [7, 54, 51]. It can be seen from Table 1 that, unlike I3D, RCN produces classification score vectors of size 16 in response to an input sequence of length 16.
This one-to-one mapping from input to output is essential in many tasks, ranging from temporal action segmentation [39, 36], to temporal action detection [44], to action tube detection [45]. In all such cases video-level accuracy is not enough, but we need frame-level results in terms, e.g., of detection bounding boxes and class scores. Temporal convolution behaves in a similar way to spatial convolution: it results in lower resolution feature maps as compared to the input as the depth of the network increases.

Unlike the temporal deconvolution proposed in  [39, 36], our RCN inherently addresses this problem (see Table 1). For a fair comparison, in our tests we adjusted our baseline I3D model for dense prediction, by setting the temporal stride to 1 (§ 5.4). The resulting I3D model can produce dense predictions: given frames as input, it will generate predictions in 1-1 correspondence with the input frames.

4.4 Causality and Long-Term Dependencies

A size- temporal convolution operation uses a sequence as input to generate an output at time . In our Recurrent Convolutional Network, instead, is a function of only the inputs from the present and the past (up to the initial time step), as shown in Figure 2. Its independence from future inputs makes the output at time causal. Thus RCN, as presented here, is not only causal but poses no constraints on the modelling of temporal dependencies (as opposed to an upper bound of in the case of temporal convolutions). Temporal dependencies are only limited by the input sequence length at training time.

As in traditional RNNs, we have the option to unroll the same network to model arbitrary input sequence lengths at test time, thus further extending the temporal horizon being modelled, and show a substantial gain in performance.

4.5 ImageNet Initialisation for the 2D Layers

The I3D model proposed by Carreira \etal [7] greatly owes its success to a good initialisation from 2D models trained on ImageNet [9]. By inflating these 2D models, we can benefit from their ImageNet pre-trained weights, as in most state-of-the-art 3D models [7, 55, 54]. We follow the same principle and initialise all 2D layers using the weights of available pre-trained 2D ResNet models [17]. It is noteworthy that the other state-of-the-art (2+1)D model by Tran \etal [51] cannot, instead, exploit ImageNet initialisation, because of the change in the number of kernels.

4.6 Identity Initialisation for the Hidden Layers

The presence of a hidden state convolution layer (, see Figure 2) at every depth level of the unrolled network makes initialisation a tricky issue. A random initialisation of the hidden state convolution component could destabilise the norm of the feature space between two 2D layers. In response to a similar issue, Le \etal [27] have proposed a simple way to initialise RNNs when used with ReLU [14] activation functions. Most state-of-the-art 2D models [17, 49] make indeed use of ReLU as the activation function of choice, for fast and optimal convergence [14].

Following the example of Le \etal [27] and others [29, 46], we initialise the weights of the hidden state convolution kernel () with the identity matrix. Identity matrix initialisation is shown [27, 29] to capture longer term dependencies. It also helps inducing forgetting capabilities in recurrent models, unlike traditional RNNs.

5 Experiments

In this section, we evaluate our RCN on the challenging Kinetics [24] and Multithumos [58] datasets to answer the following questions: i) How does our training setup, which uses 4 GPUs, compare with the 64 GPU training setup of  [50] (Section 5.2)? ii) How do recurrent convolutions compare against 3D convolutions in the action recognition problem (§ 5.3)? iii) How does our RCN help solving the dense prediction task associated with action detection (§ 5.4)? Finally, iv) we validate our claims on the temporal causality and flexibility of RCN, and check whether those features help with longer-term temporal reasoning (§ 5.5).

The Kinetics dataset comprises classes and videos; each video contains a single atomic action. Kinetics has become a de facto benchmark for recent action recognition works [6, 55, 51, 7, 54]. The average duration of a video clip in Kinetics is seconds. The MultiThumos[58] dataset is a multilabel extension of THUMOS[20]. It features classes and videos, with a total duration of 30 hours. On average, it provides 1.5 labels per frame, 10.5 action classes per video. Videos are densely labeled, as opposed to those in THUMOS [20] or ActivityNet [5]. MultiThumos allows us to show the dense prediction capabilities of RCN on long, real-world videos.

Network #Params Initialisation Clip % Video %
I3D [15] 33.4M random 54.2
I3D [51] 33.4M random 49.4 61.8
(2+1)D [51] 33.3M random 52.8 64.8
I3D 33.4M random 49.7 62.3
RCN [ours] 12.8M random 51.0 63.8
(2+1)D 33.4M random 51.9 64.8
I3D 33.4M ImageNet 51.6 64.4
RCN [ours] 12.8M ImageNet 53.4 65.6
trained with our implementation and training setup.
Table 2: Clip-level and video-level action recognition accuracy on the validation set of the Kinetics dataset for different ResNet18 based models, trained using 8-frame-long clips as input.

5.1 Implementation Details

In all our experiments we used sequences of RGB frames as input for simplicity and computational reasons. We used a batch size of 64 when training ResNet18-based models and 32 for models based on ResNet-34 and -50. The initial learning rate was set to for batches of 64, and to for batches of 32. We reduced the learning rate by a factor of after both and iterations. Moreover, training was stopped after iterations (number of batches). We used standard data augmentation techniques, such as random crop, horizontal flip with 50% probability, and temporal jittering. More details about training parameters are provided in the supplementary material.

GPU memory consumption plays a crucial role in the design of neural network architectures. In our training processes, a maximum of 4 GPUs was used. Given our GPU memory and computational constraints, we only considered training networks with 8-frame long input clips, except for ResNet34 which was trained with 16 frames long clips.

Evaluation: For fair comparison, we computed clip-level and video-level accuracy in the way described in [51, 54]. Ten regularly sampled clips were evaluated per video, and scores were averaged for video-level classification. On videos of arbitrary length we averaged all the predictions made by the unrolled versions of both our RCN and of I3D.

5.2 Fair Training Setup

As explained above, we have GPU memory constrained, we will report results of previous basic 3D models [51, 7] re-implemented and trained by using the same amount of resources as our RCN. The main hyperparameters involved in the training of a 3D network are learning rate, batch size, and the number of iterations. These parameters are interdependent, and their optimal setting depends on the computational power at disposal. For instance, Tran \etal [51] would use 64 GPUs, with the training process distributed across multiple machines. In such a case, when vast computational resources are available[51, 7, 6], training takes 10-15 hours [51], allowing for time to identify the optimal parameters. The availability of such computational power, however, is scarce.

In a bid to reproduce the training setup of [51] on 4 GPUs, we re-implemented the I3D and (2+1)D models using ResNet18 and ResNet34 as a backbone. The ResNet18-I3D architecture is described in Table 1. Based on the latter, we built a (2+1)D [51] architecture in which we matched the number of parameters of separated convolutions to that of standard 3D convolutions, as explained in [51].

The results of the I3D and (2+1)D implementations reported in Tran \etal [51] are shown in the top half of Table 2. When comparing them with our implementations of the same networks in the bottom half, it is clear that our training is as performing as that of Tran \etal [51]. This allows a fair comparison of our results.

Why smaller clips as input: training a ResNet18-based model on Kinetics with 8 frame clips as input takes up to 2-3 days on 4 GPUs. Training a ResNet50-based model would take up to 4-5 days. In principle, one could train the same model for longer input clip sizes, but the amount of GPU memory and time required to train would grow linearly. As an estimate, it would take more than two weeks to train a ResNet50 model on 64 long frame clips, assuming that all the hyperparameters are known (i.e., batch size, learning rate, step size for learning rate drop, and whether batch normalisation layers should be frozen or not).

For these reasons we stick to smaller input clips to train our models in a fair comparison setting, using the hyperparameter values from § 5.1.

Model Clip-length Initialisation Acc%
ResNet34-(2+1)D [51] 16 random 67.8
ResNet34-I3D [7] 16 ImageNet 68.2
ResNet34-RCN [ours] 16 ImageNet 70.3
ResNet50-I3D [7] 8 ImageNet 70.0
ResNet50-RCN [ours] 8 ImageNet 71.2
ResNet50-RCN-unrolled [ours] 8 ImageNet 72.1
causal model; trained with our implementation and training setup.
Table 3: Video-level action classification accuracy of different models on the validation set of the Kinetics dataset.

5.3 Results on Action Recognition

We compared our RCN with both I3D and (2+1)D models in the action recognition problem on the Kinetics dataset. A fair comparison is shown in Table 2 with ResNet18 as backbone architecture. Table 3 shows the results with ResNet34 and ResNet50 as backbone, trained on 16 frame and 8 frame clips, respectively. It is clear from these figures that RCN significantly outperforms state-of-the-art 3D networks – e.g. our network outperforms the equivalent I3D network by more than 2% across the board.

The ability to model long-term temporal reasoning of RCN is attested by the performance of the unrolled version (last row of Table 3). It shows that, even though the network is trained on input clip of 8 frames, it can reason over longer temporal horizons at test time. The corresponding unrolled I3D version (the last classification layer is also convolutional, see Table 1) showed no substantial improvement in performance – in fact, a slight drop.

Comparison with I3D variants: the main variants of the I3D model are separated 3D convolutions with gating (S3Dg) [55] and with non-local operators (NL) [54]. We think it appropriate to take a closer look at these variants of I3D as they provide state-of-the-art performance, albeit being all anti-causal. In [55, 54] the application of non-local or gating operations to I3D yields the best performances to date, mainly thanks to training on longer clips given a large amount of GPU memory at their disposal (S3Dg [55] models are trained using 56 GPUs, [54] uses 8 GPUs with 16GB memory each). The best version of I3D-NL achieves an accuracy of 77.7%, but uses 128 frames and ResNet101 as backbone network; hence we do not deem fair to compare it with our models (which only use 8 frame long clips). It would take almost a month to train such a network using 4 GPUs. What needs to be stressed is that gating and NL operations are not at all constrained to be applied on top of I3D or S3D models: indeed, they can also be used in conjunction with (2+1)D and our own RCN model. As in this work we focus on comparing our network with other 3D models, we chose I3D and (2+1)D as baselines (Sec. 5.3). Please refer to the supplementary material for more discussion.

We tried training on longer sequences (32 frames) by reducing the batch size to 8 with Resnet50 as base network. Despite a sub-optimal training procedure, RCN was observed to still outperform I3D by a margin of 1.5%. A closer to optimal training procedure with Resnet50 (as in [51, 54]), is very likely to yield even better results.

Network Input mAP@1 % mAP@8 %
Two-stream+LSTM [58] RGB+FLOW 28.1 -
MultiLSTM [58] RGB+FLOW 29.7 -
Inception-I3D by [32] RGB+FLOW - 30.1
Inception-I3D + SE [32] RGB+FLOW - 36.2
ResNet50-I3D [baseline] RGB 34.8 36.9
ResNet50-RCN [ours] RGB 35.3 37.3
ResNet50-RCN-unrolled [ours] RGB 36.2 38.3
causal model
Table 4: Action detection/segmentation results on Multithumos dataset, mAP computed from dense prediction at every frame (mAP@1) and every 8th frame (mAP@8).

5.4 Results on Temporal Action Detection

We also evaluate our model on the temporal action detection problem on the MultiThumos [58] dataset. The latter is a dense label prediction task. As a baseline, we use a temporal resolution-preserving version of I3D introduced in Section 4.3. ResNet50 is employed as a backbone for both our RCN and the baseline I3D. To capture the longer duration, we use 16 frame clips as input; the sampling period is 4 frames. Both networks are initialised with the respective models pretrained on Kinetics. The initial learning rate is set to and dropped after iterations, a batch size of is used, and trained up to iterations. Similar to [32], we use binary cross-entropy as loss function.

We use the evaluation setup of [58] and  [32], and computed both frame-wise mean Average Precision at 1 (mAP@1) (multi-label prediction on each frame) and [32] mAP@8 (every 8th frame). Table 4 shows the performance of our models along with that of other state-of-the-art methods. Two LSTM-based causal models presented by [58] are shown in rows 1 and 2. Piergiovanni \etal [32] use pretrained I3D [7] to compute features, but do not train I3D end-to-end, hence their performance is lower than in our version of I3D. Our RCN outperforms all other methods, including anti-causal I3D+Super-Events (SE) [32] and the I3D baseline. It is safe to say that RCN is well applicable to dense prediction tasks as well.

5.5 Causality and Temporal Reasoning

A comparison with other causal methods is a must, as we claim the causal nature of the network to be the main contributions of our work, making RCN best suited to online applications such as action detection and prediction. In Section 5.4 we have already shown that our model excels in the task of temporal action detection.

Carreira \etal [6] proposed two causal variants of the I3D network. Their sequential version of I3D, however, shows a slight drop [6] in performance as compared to I3D. Their parallel version is much faster than the sequential one but suffers from an even more significant performance decline 71.8% to 54.5% [6].

In contrast, our causal/online model not only outperforms other causal models (see Table 4) but beats as well strong, inherently anti-causal state-of-the-art 3D networks on a large scale dataset such as Kinetics (see Table 3).

Figure 3: (a) Online/early action prediction task: accumulated scores are used to compute the video accuracy as a function of the video observation percentage. (b) relative accuracy of each of 10 regularly sampled segments.

In addition, as in [37, 45], we can use the early action prediction task to evaluate the sequential temporal reasoning of RCN. The task consists in guessing the label of an entire action instance (or video, if containing a single action) after observing just a fraction of video frames. Accumulated output scores up to time are used to predict the label of the entire video. Figure 3(a) shows that our RCN improves drastically as more video frames are observed when compared to I3D. It indicates that RCN has superior anticipation ability, albeit starting slowly in first 10% of the video.

Furthermore, to provide useful cues about casuality and temporal reasoning, we designed an original segment-level classification evaluation setting. Namely, the outputs of the models being tested are divided into ten regularly sampled segments and the difference between the accuracy for each segment and that for the first segment is computed, as shown in Figure 3(b). Within this setting, we compared the I3D baseline with RCN in two different modalities, one considering clip-wise outputs in a sliding window fashion, the other obtained by unrolling both I3D and RCN over test videos of arbitrary length.

Notably, middle segments provide the best relative improvement, which is reasonable as it indicates that the middle part of the video is the most informative. Secondly, the last segment (no. 10) has the lowest relative accuracy of all, except for RCN-unrolled. The relative accuracy of a pure causal system, though, should improve monotonically, i.e., exploit all it has seen. Instead, all compared models end up at the same performance they started with, except for unrolled RCN for which the final accuracy is almost 5% higher than the initial one. We can conclude that unrolled RCN has a longer-term memory than unrolled I3D or both sliding window-based I3D/RCN.

Figure 4: (a) Mean and standard deviation (Std) of all the entries of the weight matrices () of the hidden state at every RCU layer of RCN, as well as those of just the diagonal elements. (b) Mean and Std of the eigenvalues of the hidden state weight matrices at every RCU layer of a 18-layer RCN.

Evolution of Recurrence with Network Depth is another aspect that can provide clues about RCN’s temporal flexibility. To this purpose, we examine the statistics of the weight matrices () associated with the hidden state at every RCU layer in the RCN network. In Figure 4(a) we can see that the mean of the diagonal elements of the weight matrices increases and their standard deviation decreases with the depth of the network. This means that the matrix becomes sparser as network depth grows. In our view, this phenomenon is associated with RCN putting more focus on feature learning in the early part of the network, and emphasising temporal reasoning at later depths as the temporal reasoning horizon (‘receptive field’) increases. In other words, RCN learns to select the layers which should contribute towards temporal reasoning automatically.

Arjovsky [1] argue that if the eigenvalues of the recurrent layer’s weight matrix diverge from value 1, optimisation becomes difficult due to the vanishing gradient problem. Chang \etal [8] explore a similar idea. Taking an ordinary differential equation view of RNNs, they argue that their stability for long-term memory is related to the eigenvalues of the weight matrices. Figure 4(b) shows that in RCN the mean eigenvalue does rise towards 1 as network depth increases, suggesting that later layers are more stable in terms of long-term memory whereas earlier layers are not concerned with long-term reasoning.

5.6 Discussion

In the light of RCN’s superior results on temporal action detection (§ 5.4), early action prediction (see Figure 3(a)), long-term temporal reasoning (in its unrolled incarnation) at segment-level and for action recognition (§ 5.3, see the last row of Table 3), it is fair to say that the proposed Recurrent Convolutional Network is the best performing causal network out there. An even more in-depth analysis of this fact is conducted in the supplementary material.

Layer-wise design: we tried replacing 3D CONV by RCU (i) only in the last four layers, and (ii) on four regularly sampled layers of Resnet50. This led to lower performance (69% and 68% respectively), compared to 71% when RCU replaces all 18 3D CONVs. This is consistent with previous findings [54, 55].

The number of parameters in our proposed RCN model is million (M), as opposed to 33.4M in both the I3D and (2+1)D models, see Table 2. It is remarkable to see that, despite a times reduction in the number of parameters, RCN still outperforms both I3D and (2+1)D when trained using ImageNet initialisation. Further, RCN surpasses I3D also under random initialisation, while using times fewer model parameters. We measured the floating-point operations (FLOPs) for I3D, R(2+1)D, and RCN, recording 41MMac, 120MMac, and 54MMac, respectively. Thus, RCN requires half the FLOPs as compared to (2+1)D, and is comparable to I3D because RCN preserves temporal resolution. We computed the average time taken to process ten-second long videos of the Kinetics dataset. This takes 0.4s, 0.8s, and 0.9s for I3D, RCN, and (2+1)D respectively.

Effect of weight initialisation. \textcolorblackThe weights of the 2D layers () in the RCU modules (§ 4.1) of our RCN networks are initialised using weights from a pre-trained ImageNet model, trained on RGB images. As for the RCU recurrent convolution (, § 4.1), random initialisation resulted in suboptimal training. Thus, in all our experiments with RCN, we adopted identity matrix initialisation instead.
Table 5 shows the results of training RCN with different initialisation strategies for both recurrent convolution and spatial convolution . In the first row, both and for all the RCUs in RCN are initialised randomly, using the standard initialisation process described in [16]. From the last row, it is clear that RCN performs best if and are initialised using ImageNet pre-trained weights and the identity matrix, respectively. Notably, the performance difference is relatively small in the first three rows of that table, when compared to the dramatic jump of the last row. This proves our point, supported by other recurrence based methods, that initialisation is important for recurrent convolution to be able to compete with temporal convolutions.

init init Clip-Acc% Video-Acc%
Random Random 49.3 61.4
Random Identity 49.8 62.1
ImageNet Random 50.5 62.8
ImageNet Identity 53.4 65.6
Table 5: Video-level and clip-level action recognition accuracy on the Kinetics validation set for different initilisation of 2D layer () and recurrent convolution’s weights () in RCU.

6 Conclusions

In this work, we presented a recurrence-based convolutional network (RCN) able to generate causal spatiotemporal representations by converting 3D CNNs into causal 3D CNNs, while using 2.6 times fewer parameters compared to its traditional 3D counterparts. RCN can model long-term temporal dependencies without the need to specify temporal extents. The proposed RCN is not only causal in nature and temporal resolution-preserving, but was also shown to outperform the main baseline 3D CNNs in all the fair comparisons we ran. We showed that ImageNet-based initialisation is at the heart of the success of 3D CNNs. \textcolorblackAlthough RCN is recurrent in nature, it can still utilise the weights of a pre-trained 2D network for initialisation. Recurrent convolution also needs to be carefully initialised to make recurrence competitive with temporal convolution. The causal nature of our recurrent 3D convolutional network opens up manifold research directions, (including its combination with non-local or gating methods), with direct and promising potential applications to areas such as online action detection and future prediction.


  • [1] M. Arjovsky, A. Shah, and Y. Bengio (2016) Unitary evolution recurrent neural networks. In International Conference on Machine Learning, pp. 1120–1128. Cited by: §5.5.
  • [2] S. Bai, J. Z. Kolter, and V. Koltun (2018) An empirical evaluation of generic convolutional and recurrent networks for sequence modeling. arXiv preprint arXiv:1803.01271. Cited by: §2.
  • [3] N. Ballas, L. Yao, C. Pal, and A. Courville (2015) Delving deeper into convolutional networks for learning video representations. arXiv preprint arXiv:1511.06432. Cited by: §2, §2, §3.
  • [4] L. E. Baum and T. Petrie (1966) Statistical inference for probabilistic functions of finite state markov chains. The annals of mathematical statistics 37 (6), pp. 1554–1563. Cited by: §1.
  • [5] F. Caba Heilbron, V. Escorcia, B. Ghanem, and J. Carlos Niebles (2015) Activitynet: a large-scale video benchmark for human activity understanding. In IEEE Int. Conf. on Computer Vision and Pattern Recognition, pp. 961–970. Cited by: §1, §5.
  • [6] J. Carreira, V. Patraucean, L. Mazare, A. Zisserman, and S. Osindero (2018) Massively parallel video networks. In Proc. European Conf. Computer Vision, Cited by: §1, §1, §1, §2, §5.2, §5.5, §5.
  • [7] J. Carreira and A. Zisserman (2017) Quo vadis, action recognition? a new model and the kinetics dataset. In 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 4724–4733. Cited by: Figure 1, §1, §1, §1, §1, §1, §2, §2, §3, §4.3, §4.5, §5.2, §5.4, Table 3, §5.
  • [8] B. Chang, M. Chen, E. Haber, and E. H. Chi (2019) AntisymmetricRNN: a dynamical system view on recurrent neural networks. In International Conference on Learning Representations, External Links: Link Cited by: §5.5.
  • [9] J. Deng, W. Dong, R. Socher, L. Li, K. Li, and L. Fei-Fei (2009) Imagenet: a large-scale hierarchical image database. In Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, pp. 248–255. Cited by: §1, §4.5.
  • [10] J. Donahue, L. Anne Hendricks, S. Guadarrama, M. Rohrbach, S. Venugopalan, K. Saenko, and T. Darrell (2015) Long-term recurrent convolutional networks for visual recognition and description. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 2625–2634. Cited by: §1, §1, §2, §3.
  • [11] J. L. Elman (1990) Finding structure in time. Cognitive science 14 (2), pp. 179–211. Cited by: §1.
  • [12] C. Feichtenhofer, A. Pinz, and R. Wildes (2016) Spatiotemporal residual networks for video action recognition. In Advances in neural information processing systems, pp. 3468–3476. Cited by: §1, §2, §2.
  • [13] C. Feichtenhofer, A. Pinz, and A. Zisserman (2016) Convolutional two-stream network fusion for video action recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 1933–1941. Cited by: §2.
  • [14] X. Glorot, A. Bordes, and Y. Bengio (2011) Deep sparse rectifier neural networks. In Proceedings of the fourteenth international conference on artificial intelligence and statistics, pp. 315–323. Cited by: §4.6.
  • [15] K. Hara, H. Kataoka, and Y. Satoh (2018) Can spatiotemporal 3d cnns retrace the history of 2d cnns and imagenet. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, pp. 18–22. Cited by: §1, §4.2, Table 2.
  • [16] K. He, X. Zhang, S. Ren, and J. Sun (2015) Delving deep into rectifiers: surpassing human-level performance on imagenet classification. In Proceedings of the IEEE international conference on computer vision, pp. 1026–1034. Cited by: §5.6.
  • [17] K. He, X. Zhang, S. Ren, and J. Sun (2016) Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 770–778. Cited by: §1, §3, §4.2, §4.5, §4.6.
  • [18] S. Hochreiter and J. Schmidhuber (1997) Long short-term memory. Neural computation 9 (8), pp. 1735–1780. Cited by: §1, §1.
  • [19] S. Ji, W. Xu, M. Yang, and K. Yu (2013) 3D convolutional neural networks for human action recognition. IEEE transactions on pattern analysis and machine intelligence 35 (1), pp. 221–231. Cited by: §1, §2.
  • [20] Y. Jiang, J. Liu, A. Roshan Zamir, G. Toderici, I. Laptev, M. Shah, and R. Sukthankar (2014) THUMOS challenge: action recognition with a large number of classes. Cited by: §5.
  • [21] M. Jordan (1986) Attractor dynamics and parallelism in a connectionist sequential machine. In Proc. of the Eighth Annual Conference of the Cognitive Science Society (Erlbaum, Hillsdale, NJ), 1986, Cited by: §1.
  • [22] N. Kalchbrenner, A. v. d. Oord, K. Simonyan, I. Danihelka, O. Vinyals, A. Graves, and K. Kavukcuoglu (2016) Video pixel networks. arXiv preprint arXiv:1610.00527. Cited by: §2.
  • [23] A. Karpathy, G. Toderici, S. Shetty, T. Leung, R. Sukthankar, and L. Fei-Fei (2014) Large-scale video classification with convolutional neural networks. In Proceedings of the IEEE conference on Computer Vision and Pattern Recognition, pp. 1725–1732. Cited by: §1.
  • [24] W. Kay, J. Carreira, K. Simonyan, B. Zhang, C. Hillier, S. Vijayanarasimhan, F. Viola, T. Green, T. Back, P. Natsev, et al. (2017) The kinetics human action video dataset. arXiv preprint arXiv:1705.06950. Cited by: §2, §2, §5.
  • [25] Y. Kong, Z. Tao, and Y. Fu (2017) Deep sequential context networks for action prediction. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1473–1481. Cited by: §1.
  • [26] A. Krizhevsky, I. Sutskever, and G. E. Hinton (2012) ImageNet classification with deep convolutional neural networks. In Advances in Neural Information Processing Systems, Cited by: §1.
  • [27] Q. V. Le, N. Jaitly, and G. E. Hinton (2015) A simple way to initialize recurrent networks of rectified linear units. arXiv preprint arXiv:1504.00941. Cited by: §1, §2, §4.6, §4.6.
  • [28] Z. Li, K. Gavrilyuk, E. Gavves, M. Jain, and C. G. Snoek (2018) VideoLSTM convolves, attends and flows for action recognition. Computer Vision and Image Understanding 166, pp. 41–50. Cited by: §2, §2, §3.
  • [29] T. Mikolov, A. Joulin, S. Chopra, M. Mathieu, and M. Ranzato (2014) Learning longer memory in recurrent neural networks. arXiv preprint arXiv:1412.7753. Cited by: §2, §4.6.
  • [30] A. v. d. Oord, S. Dieleman, H. Zen, K. Simonyan, O. Vinyals, A. Graves, N. Kalchbrenner, A. Senior, and K. Kavukcuoglu (2016) Wavenet: a generative model for raw audio. arXiv preprint arXiv:1609.03499. Cited by: §2, §2.
  • [31] A. v. d. Oord, N. Kalchbrenner, and K. Kavukcuoglu (2016) Pixel recurrent neural networks. arXiv preprint arXiv:1601.06759. Cited by: §2.
  • [32] A. Piergiovanni and M. S. Ryoo (2018) Learning latent super-events to detect multiple activities in videos. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 5304–5313. Cited by: §2, §5.4, §5.4, Table 4.
  • [33] P. H. Pinheiro and R. Collobert (2014) Recurrent convolutional neural networks for scene labeling. In 31st International Conference on Machine Learning (ICML), Cited by: §2.
  • [34] R. Poppe (2010) A survey on vision-based human action recognition. Image and vision computing 28 (6), pp. 976–990. Cited by: §1.
  • [35] Z. Qiu, T. Yao, and T. Mei (2017) Learning spatio-temporal representation with pseudo-3d residual networks. In 2017 IEEE International Conference on Computer Vision (ICCV), pp. 5534–5542. Cited by: §2.
  • [36] C. L. M. D. F. René and V. A. R. G. D. Hager (2017) Temporal convolutional networks for action segmentation and detection. In IEEE International Conference on Computer Vision (ICCV), Cited by: §1, §2, §4.3, §4.3.
  • [37] M. S. Ryoo (2011) Human activity prediction: early recognition of ongoing activities from streaming videos. In IEEE Int. Conf. on Computer Vision, pp. 1036–1043. Cited by: §1, §5.5.
  • [38] B. Shi, X. Bai, and C. Yao (2017) An end-to-end trainable neural network for image-based sequence recognition and its application to scene text recognition. IEEE transactions on pattern analysis and machine intelligence 39 (11), pp. 2298–2304. Cited by: §2.
  • [39] Z. Shou, J. Chan, A. Zareian, K. Miyazawa, and S. Chang (2017) Cdc: convolutional-de-convolutional networks for precise temporal action localization in untrimmed videos. In Computer Vision and Pattern Recognition (CVPR), 2017 IEEE Conference on, pp. 1417–1426. Cited by: §2, §4.3, §4.3.
  • [40] G. A. Sigurdsson, G. Varol, X. Wang, A. Farhadi, I. Laptev, and A. Gupta (2016) Hollywood in homes: crowdsourcing data collection for activity understanding. In European Conference on Computer Vision, Cited by: §1.
  • [41] K. Simonyan and A. Zisserman (2014) Two-stream convolutional networks for action recognition in videos. In Advances in Neural Information Processing Systems 27, pp. 568–576. Cited by: §1, §1.
  • [42] K. Simonyan and A. Zisserman (2014) Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556. Cited by: §1.
  • [43] B. Singh and M. Shao (2016) A multi-stream bi-directional recurrent neural network for fine-grained action detection. In IEEE Int. Conf. on Computer Vision and Pattern Recognition, Cited by: §2, §3.
  • [44] G. Singh and F. Cuzzolin (2016) Untrimmed video classification for activity detection: submission to activitynet challenge. arXiv preprint arXiv:1607.01979. Cited by: §4.3.
  • [45] G. Singh, S. Saha, M. Sapienza, P. Torr, and F. Cuzzolin (2017) Online real-time multiple spatiotemporal action localisation and prediction. In IEEE Int. Conf. on Computer Vision, Cited by: §1, §4.3, §5.5.
  • [46] R. Socher, J. Bauer, C. D. Manning, et al. (2013) Parsing with compositional vector grammars. In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Vol. 1, pp. 455–465. Cited by: §4.6.
  • [47] K. Soomro, H. Idrees, and M. Shah (2016) Predicting the where and what of actors and actions through online action localization. Cited by: §1.
  • [48] L. Sun, K. Jia, D. Yeung, and B. E. Shi (2015) Human action recognition using factorized spatio-temporal convolutional networks. In Proceedings of the IEEE International Conference on Computer Vision, pp. 4597–4605. Cited by: §2.
  • [49] C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich (2015) Going deeper with convolutions. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 1–9. Cited by: §4.6.
  • [50] D. Tran, L. Bourdev, R. Fergus, L. Torresani, and M. Paluri (2015) Learning spatiotemporal features with 3d convolutional networks. IEEE Int. Conf. on Computer Vision. Cited by: Figure 1, §1, §2, §2, §2, §5.
  • [51] D. Tran, H. Wang, L. Torresani, J. Ray, Y. LeCun, and M. Paluri (2018) A closer look at spatiotemporal convolutions for action recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 6450–6459. Cited by: Figure 1, §1, §1, §1, §1, §2, §3, §3, §4.2, §4.3, §4.5, §5.1, §5.2, §5.2, §5.2, §5.3, Table 2, Table 3, §5.
  • [52] G. Varol, I. Laptev, and C. Schmid (2018) Long-term temporal convolutions for action recognition. IEEE transactions on pattern analysis and machine intelligence 40 (6), pp. 1510–1517. Cited by: §1, §2.
  • [53] C. Vondrick, H. Pirsiavash, and A. Torralba (2015) Anticipating the future by watching unlabeled video. arXiv preprint arXiv:1504.08023. Cited by: §1.
  • [54] X. Wang, R. Girshick, A. Gupta, and K. He (2018) Non-local neural networks. In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Cited by: §1, §2, §3, §3, §4.3, §4.5, §5.1, §5.3, §5.3, §5.6, §5.
  • [55] S. Xie, C. Sun, J. Huang, Z. Tu, and K. Murphy (2018) Rethinking spatiotemporal feature learning: speed-accuracy trade-offs in video classification. In Proc. European Conf. Computer Vision, pp. 305–321. Cited by: Figure 1, §1, §2, §3, §3, §4.5, §5.3, §5.6, §5.
  • [56] S. Xingjian, Z. Chen, H. Wang, D. Yeung, W. Wong, and W. Woo (2015) Convolutional lstm network: a machine learning approach for precipitation nowcasting. In Advances in neural information processing systems, pp. 802–810. Cited by: §2.
  • [57] C. Xu, C. Xiong, and J. J. Corso (2012) Streaming hierarchical video segmentation. In European Conference on Computer Vision, pp. 626–639. Cited by: §1.
  • [58] S. Yeung, O. Russakovsky, N. Jin, M. Andriluka, G. Mori, and L. Fei-Fei (2015) Every moment counts: dense detailed labeling of actions in complex videos. arXiv preprint arXiv:1507.05738. Cited by: §1, §1, §2, §3, §5.4, §5.4, Table 4, §5, §5.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description