# Representation for Action Recognition Using Trajectory-Based Low-Level Local Feature and Mid-Level Motion Feature

Authors: Xiaoqiang Li; Dan Wang; Yin Zhang
Journal: Applied Computational Intelligence and Soft Computing
 (2017)

---

## Abstract

The dense trajectories and low-level local features are widely used in action recognition recently. However, most of these methods ignore the motion part of action which is the key factor to distinguish the different human action. This paper proposes a new two-layer model of representation for action recognition by describing the video with low-level features and mid-level motion part model. Firstly, we encode the compensated flow (w-flow) trajectory-based local features with Fisher Vector (FV) to retain the low-level characteristic of motion. Then, the motion parts are extracted by clustering the similar trajectories with spatiotemporal distance between trajectories. Finally the representation for action video is the concatenation of low-level descriptors encoding vector and motion part encoding vector. It is used as input to the LibSVM for action recognition. The experiment results demonstrate the improvements on J-HMDB and YouTube datasets, which obtain 67.4% and 87.6%, respectively.


---

## Body

## 1. Introduction

Human action recognition has become a hot topic in the field of computer vision. It has developed a practical system which will be applied to video surveillance, interactive gaming, and video annotation. Despite remarkable research efforts and many encouraging advances in recent years [1–3], action recognition is still far from being satisfactory and practical. There are large factors affecting accurate rate of the recognition such as cluttered background, illumination, and occlusion.Most action recognition focuses on two important issues: extracting features within a spatiotemporal volume and modeling the action patterns. Many existing researches on human action recognition tend to extract features from whole 3D videos using spatiotemporal interest points (STIP) [4]. In recent years, optical flow is applied to extract the trajectory-based motion features, which have been widely used in local spatiotemporal features. Local trajectory-based features are pooled and normalized to a vector as the video global representation in action recognition. Meanwhile, a lot of work has focused on developing discriminative dictionary for image object recognition or video action recognition. The Bag of Feature (BOF) model generates simple video model by clustering spatiotemporal features of all the training samples and is trained using χ2-kernel Support Vector Machine (SVM). And the state of the art method is popular Fisher Vector (FV) [5] encoding model based on spatiotemporal local features. However, all these methods are not perfect, because they are only concerned about the low-level spatiotemporal features based on interest point and ignored the higher level features of motion part. For most actions, only a small subset of local motion features of the entire video is relevant to the action label. When a person is waving, only the movement around the arm or hand is responsible for the action clapping hand. Action Bank [6] and motionlets [7] adopt unsupervised learning to discover action parts. Many methods [8] cluster the trajectories and seek to understand spatiotemporal properties of movement to construct the mid-level action video representation. The Vector of Locally Aggregated Descriptors (VLAD) [9] is a descriptor encoding technique that aggregates the descriptors based on a locality criterion in the feature space. To keep more spatiotemporal characteristics of the processed motion part, VLAD encoding gets better results than BOF by [10]. Inspired by low-level local feature encoding and mid-level motion part model are key factors to distinguish the different human actions; we propose a new representation (depicted in Figure 2) for action recognition based on local features and motion part in this paper. To reduce the background clutter noise, we extract the local trajectory-based features through a better compensated flow (w-flow) [11] dense trajectories method. Then we cluster the trajectories through the graph clustering algorithm and encode the group features to describe the different motion part. Finally, we represent the video through combining the low-level trajectory-based features encoding model with mid-level motion part model.This paper is organized as follows. In Section2, the local descriptors based on the w-flow dense trajectories and low-level video encoding with FV are introduced. Then we show clustering the motion part and introduce the representation for video in Section 3. We describe the evaluation of our approach and discuss the results in Section 4. Finally, the conclusion and future works are discussed in Section 5.


## 2. First Layer with FV

Trajectories are efficient in capturing object motions in videos. We extract spatiotemporal features along thew-flow dense trajectories to express low-level descriptors. In this section we introduce the w-flow dense trajectories and low-level descriptors with FV.


### 2.1.w-Flow Dense Trajectory

The idea of dense trajectory is based on tracking the interest points. The interest points are sampled on a grid spaced byW=5 pixels and tracked in each frame. Points of subsequent frames are concatenated to form a trajectory: (pt,…,pt+L). pt=(xt,yt) is the position of interest points at frame t. The length of a trajectory is L=15 frames [1]. A recent work by Jain et al. [11] proposed the compensated flow (w-flow) dense trajectories which reduce the impact of the background trajectories. The w-flow dense trajectory is obtained by removing the affine flow vector from the original optical flow vector. The interest point of this method is tracked by w-flow [11] for compensating dominant motion (camera motion). It is beneficial for most of the existing descriptors used for action recognition. This method uses the 2D polynomial affine motion model for compensating camera motion. The affine flow waffpt is the main movement of the two consecutive images which is usually caused by the movement of the camera. We compute the affine flow with the publicly available Motion2D software (http://www.irisa.fr/vista/Motion2D/) which implements a real-time robust multiresolution incremental estimation framework. The final flow vector wpt at point pt=xt,yt is obtained by removing the affine flow vector waffpt=upt,vpt from the original optical flow vector as follows.(1)wpt=wpt-waffpt.Figure 1 shows the dense trajectories extracted by the iDT [12] method and the w-flow dense trajectories.Figure 1
A comparison of the iDT trajectories andw-flow dense trajectories. The red dot is the end point of the green optical flow vector in the current frame. (a) The optical flow vectors are tracked by the improve dense trajectories using SURF descriptors matching [12]. (b) Most of flow vectors due to camera motion are removed by w-flow method.
(a)
iDT vectors
(b)
w-flow DT vectorsFigure 2
The recognition framework of the two-layer model. The first layer encodes the low-levelw-flow trajectory-based descriptors using the Fisher Vector (FV). The second layer describes motion part with trajectories groups.The shape of a trajectory encodes local motion patterns. The shape of a trajectory is described by concatenating a set of displacement vectorsΔPt=pt+1-pt=xt+1-xt,yt+1-yt. Meanwhile, to leverage the motion information in dense trajectories, we compute descriptors within a spatiotemporal volume around the trajectory. The size of a volume is 32×32. And the volume is divided into a 2×2×3 spatiotemporal grid. The Histograms of Optical Flow (HOF and w-HOF) [1] descriptor captures the local motion information which is computed using the orientations and magnitudes of the flow field. Motion boundary histogram (MBH) [1] descriptor encodes the relative motion between pixels which is along both x and y image axis and describes the discriminatory features for the action recognition in background cluttering. The trajectory-based w-HOF features is computed on the compensated flow. For each trajectory, the descriptors combine motion information HOF, w-HOF, and MBH. The single trajectory feature is in the form of (2)F=w-HOF,HOF,MBHx,MBHy,S.The trajectory shape S=(ΔPt,…,ΔPt+L-1)/∑j=tt+L-1ΔPj is normalized by the sum of the magnitudes of the displacement vectors and L is the length of trajectories.


### 2.2. Low-Level Video Encoding

The representation of video is a vital problem in action recognition. We first encode the low-levelw-flow trajectory-based descriptors using the Fisher Vector (FV) encoding method which was proposed for image categorization [13]. FV is derived from Fisher kernel which encodes the statistics between video descriptors and Gaussian Mixture Model (GMM). We reduce the low-level features (w-HOF, HOF, and MBH) dimensionality by PCA keeping the 90% energy. The local descriptors X can be modeled by a probability density function pX,θ with parameters θ, which is usually modeled by GMM. (3)GθX=1N∇θlog⁡pX;θ,θ=w1,μ1,δ1,…,wk,μk,δk,where w,μ,δ are the model parameters denoting the weights, means, and diagonal covariances of GMM. N is the number of local descriptors. k is the number of mixture components and we set k to 256 [5]. We can compute the gradient of the log likelihood with respect to the parameters of the model to represent a video. FV requires a GMM of the encoded feature distribution. The Fisher Vector is the concatenation of these partial derivatives and describes in which direction the parameters of the model should be modified to best fit the data [14]. To keep the low-level feature, we encode each video with the FV encoding feature.


## 2.1.w-Flow Dense Trajectory

The idea of dense trajectory is based on tracking the interest points. The interest points are sampled on a grid spaced byW=5 pixels and tracked in each frame. Points of subsequent frames are concatenated to form a trajectory: (pt,…,pt+L). pt=(xt,yt) is the position of interest points at frame t. The length of a trajectory is L=15 frames [1]. A recent work by Jain et al. [11] proposed the compensated flow (w-flow) dense trajectories which reduce the impact of the background trajectories. The w-flow dense trajectory is obtained by removing the affine flow vector from the original optical flow vector. The interest point of this method is tracked by w-flow [11] for compensating dominant motion (camera motion). It is beneficial for most of the existing descriptors used for action recognition. This method uses the 2D polynomial affine motion model for compensating camera motion. The affine flow waffpt is the main movement of the two consecutive images which is usually caused by the movement of the camera. We compute the affine flow with the publicly available Motion2D software (http://www.irisa.fr/vista/Motion2D/) which implements a real-time robust multiresolution incremental estimation framework. The final flow vector wpt at point pt=xt,yt is obtained by removing the affine flow vector waffpt=upt,vpt from the original optical flow vector as follows.(1)wpt=wpt-waffpt.Figure 1 shows the dense trajectories extracted by the iDT [12] method and the w-flow dense trajectories.Figure 1
A comparison of the iDT trajectories andw-flow dense trajectories. The red dot is the end point of the green optical flow vector in the current frame. (a) The optical flow vectors are tracked by the improve dense trajectories using SURF descriptors matching [12]. (b) Most of flow vectors due to camera motion are removed by w-flow method.
(a)
iDT vectors
(b)
w-flow DT vectorsFigure 2
The recognition framework of the two-layer model. The first layer encodes the low-levelw-flow trajectory-based descriptors using the Fisher Vector (FV). The second layer describes motion part with trajectories groups.The shape of a trajectory encodes local motion patterns. The shape of a trajectory is described by concatenating a set of displacement vectorsΔPt=pt+1-pt=xt+1-xt,yt+1-yt. Meanwhile, to leverage the motion information in dense trajectories, we compute descriptors within a spatiotemporal volume around the trajectory. The size of a volume is 32×32. And the volume is divided into a 2×2×3 spatiotemporal grid. The Histograms of Optical Flow (HOF and w-HOF) [1] descriptor captures the local motion information which is computed using the orientations and magnitudes of the flow field. Motion boundary histogram (MBH) [1] descriptor encodes the relative motion between pixels which is along both x and y image axis and describes the discriminatory features for the action recognition in background cluttering. The trajectory-based w-HOF features is computed on the compensated flow. For each trajectory, the descriptors combine motion information HOF, w-HOF, and MBH. The single trajectory feature is in the form of (2)F=w-HOF,HOF,MBHx,MBHy,S.The trajectory shape S=(ΔPt,…,ΔPt+L-1)/∑j=tt+L-1ΔPj is normalized by the sum of the magnitudes of the displacement vectors and L is the length of trajectories.


## 2.2. Low-Level Video Encoding

The representation of video is a vital problem in action recognition. We first encode the low-levelw-flow trajectory-based descriptors using the Fisher Vector (FV) encoding method which was proposed for image categorization [13]. FV is derived from Fisher kernel which encodes the statistics between video descriptors and Gaussian Mixture Model (GMM). We reduce the low-level features (w-HOF, HOF, and MBH) dimensionality by PCA keeping the 90% energy. The local descriptors X can be modeled by a probability density function pX,θ with parameters θ, which is usually modeled by GMM. (3)GθX=1N∇θlog⁡pX;θ,θ=w1,μ1,δ1,…,wk,μk,δk,where w,μ,δ are the model parameters denoting the weights, means, and diagonal covariances of GMM. N is the number of local descriptors. k is the number of mixture components and we set k to 256 [5]. We can compute the gradient of the log likelihood with respect to the parameters of the model to represent a video. FV requires a GMM of the encoded feature distribution. The Fisher Vector is the concatenation of these partial derivatives and describes in which direction the parameters of the model should be modified to best fit the data [14]. To keep the low-level feature, we encode each video with the FV encoding feature.


## 3. Representation for Video

Motion part encoding has already been identified as a successful method to represent the video for action recognition. In this section, we use a graph clustering method to cluster the similarity trajectories into groups. Then representation for action video is concatenation of low-level local descriptors encoding and high-level motion part encoding.


### 3.1. Trajectories Group

To better describe the motion, we cluster the similarity trajectories into groups, because critical regions of the video are relevant to a specific action. In the method of [22], they compute a hierarchical clustering on trajectories to yield trajectories group of action parts. Then we apply that efficient greedy agglomerative hierarchical clustering procedure to group the trajectories. There are a large number of trajectories in a video; that is, there are a large number of nodes in graph. By removing trajectories distance which is not spatially close will get a sparse trajectories graph. Greedy agglomerative hierarchical clustering is a fast, scalable algorithm, with almost linear complexity in the number of nodes for relatively sparse trajectories’ graph. To group the trajectories we set N×N trajectories distance matrix for a video containing N trajectories. We use a distance metric between trajectories taking into consideration their spatial and temporal relations to cluster. Given two trajectories Pa(t)t=taTa and Pb(t)t=tbTb, (4)da,b=max⁡dst·1T2-T1∑t=T1T2dvelt,t∈T1,T2,dst=Pat-Pbt2,dvel=ΔPat-ΔPbt2,where ds and dvel are the L2 distances of the trajectory points at corresponding time instances. We just calculate the distance between the trajectories Pa and Pb simultaneously existing in T1,T2. To ensure the spatial compactness of the estimated groups, we enforce the above affinity to be zero for trajectory pairs that are not spatially close ds≥30. The number of clusters in a video is set as the number used in [22] and the number of trajectories in a cluster is below the 100 based on empirical value.


### 3.2. Second Layer with VLAD

The trajectory group describing the motion part in the same action categories will have similarities. To capture the coarser spatiotemporal characteristics of the descriptors in the groupk, we compute the mean of group descriptors (w-HOF, HOF, and MBH) and trajectory shapes. Then, we concatenate all the group descriptors (w-HOF, HOF, and MBH) as Gr and group shape as the group descriptors Gg. So the group is described as G=Gr,Gg; VLAD [9] is a descriptor encoding technique that aggregates the descriptors based on a locality criterion in the feature space. As we know, the classic BOF uses the clustering centers statistics to represent the sample which will result in the loss of the lots of information. In group encoding, we denote the code words in the group codebook as c1,c2,…,ck. The group descriptors Gik={Gr,Gg} are all the group descriptors that belong to the kth word. The video will be encoded as a vector: (5)v=∑i=1n1Gi1-c1,…,∑i=1nkGik-ck,where k is the size of codebook learned by the k-means clustering. So the VLAD keeps more information than the BOF.


### 3.3. Video Encoding

We encode each video from the group descriptors of motion part using VLAD model. The codebook for each kind of group descriptors (w-HOF, HOF, MBH, and S) was separately constructed by using K-means cluster. According to the average number of groups in every video, we set the number of visual words to 50. In order to find the nearest center quickly we construct a KD-tree when each group descriptors are mapped to the codebook. We describe video encoding vector with the group model for different descriptors. Then, motion part model is encoded by the concatenation of different descriptors of the group VLAD model. Finally, the representation for action recognition is encoded by the concatenation of low-level local descriptors encoding and mid-level motion part encoding. Figure 2 shows an overview of our pipeline for action recognition.


## 3.1. Trajectories Group

To better describe the motion, we cluster the similarity trajectories into groups, because critical regions of the video are relevant to a specific action. In the method of [22], they compute a hierarchical clustering on trajectories to yield trajectories group of action parts. Then we apply that efficient greedy agglomerative hierarchical clustering procedure to group the trajectories. There are a large number of trajectories in a video; that is, there are a large number of nodes in graph. By removing trajectories distance which is not spatially close will get a sparse trajectories graph. Greedy agglomerative hierarchical clustering is a fast, scalable algorithm, with almost linear complexity in the number of nodes for relatively sparse trajectories’ graph. To group the trajectories we set N×N trajectories distance matrix for a video containing N trajectories. We use a distance metric between trajectories taking into consideration their spatial and temporal relations to cluster. Given two trajectories Pa(t)t=taTa and Pb(t)t=tbTb, (4)da,b=max⁡dst·1T2-T1∑t=T1T2dvelt,t∈T1,T2,dst=Pat-Pbt2,dvel=ΔPat-ΔPbt2,where ds and dvel are the L2 distances of the trajectory points at corresponding time instances. We just calculate the distance between the trajectories Pa and Pb simultaneously existing in T1,T2. To ensure the spatial compactness of the estimated groups, we enforce the above affinity to be zero for trajectory pairs that are not spatially close ds≥30. The number of clusters in a video is set as the number used in [22] and the number of trajectories in a cluster is below the 100 based on empirical value.


## 3.2. Second Layer with VLAD

The trajectory group describing the motion part in the same action categories will have similarities. To capture the coarser spatiotemporal characteristics of the descriptors in the groupk, we compute the mean of group descriptors (w-HOF, HOF, and MBH) and trajectory shapes. Then, we concatenate all the group descriptors (w-HOF, HOF, and MBH) as Gr and group shape as the group descriptors Gg. So the group is described as G=Gr,Gg; VLAD [9] is a descriptor encoding technique that aggregates the descriptors based on a locality criterion in the feature space. As we know, the classic BOF uses the clustering centers statistics to represent the sample which will result in the loss of the lots of information. In group encoding, we denote the code words in the group codebook as c1,c2,…,ck. The group descriptors Gik={Gr,Gg} are all the group descriptors that belong to the kth word. The video will be encoded as a vector: (5)v=∑i=1n1Gi1-c1,…,∑i=1nkGik-ck,where k is the size of codebook learned by the k-means clustering. So the VLAD keeps more information than the BOF.


## 3.3. Video Encoding

We encode each video from the group descriptors of motion part using VLAD model. The codebook for each kind of group descriptors (w-HOF, HOF, MBH, and S) was separately constructed by using K-means cluster. According to the average number of groups in every video, we set the number of visual words to 50. In order to find the nearest center quickly we construct a KD-tree when each group descriptors are mapped to the codebook. We describe video encoding vector with the group model for different descriptors. Then, motion part model is encoded by the concatenation of different descriptors of the group VLAD model. Finally, the representation for action recognition is encoded by the concatenation of low-level local descriptors encoding and mid-level motion part encoding. Figure 2 shows an overview of our pipeline for action recognition.


## 4. Experiments

In this section, we implement some experiments to evaluate the performance of representation for action. We validate our model on several action recognition benchmarks and compare our results with different methods.


### 4.1. Datasets

We validate our model on three standard datasets for human action: KTH, J-HMDB, and YouTube dataset. The KTH dataset views actions in front of a uniform background, whereas the J-HMDB dataset [10] and YouTube dataset [16] are collected from a variety of sources ranging from digitized movies to YouTube. They cover different scales and difficulty levels for action recognition. We summarize them and the experimental protocols as follows.The KTH dataset [23] contains 6 action categories: walking, handclapping, hand waving, jogging, running, and walking. The background is homogeneous and static in most sequences. We follow the experimental setting [23] dividing the dataset into the train set and test set. We train a multiclass classifier and report average accuracy over all classes as performance measure.The J-HMDB [10] contains 21 action categories: brush hair, catch, clap, climb stairs, golf, jump, kick ball, pick, pour, pull-up, push, run, shoot ball, shoot bow, shoot gun, sit, stand, swing baseball, throw, walk, and wave. J-HMDB is a subset of the HMDB51 which is collected from the movies or Internet. This dataset excludes categories from HMDB51 that contain facial expressions like smiling and interactions with others such as shaking hands and focuses on single body action. We evaluate the J-HMDB which contains 11 categories involving one single body action. For multiclass classification, we use the one-vs-rest approach.The YouTube Action dataset [16] contains 11 action categories: basketball, biking, diving, golf swinging, horse riding, soccer juggling, swinging, tennis swinging, trampoline jumping, volleyball spiking, and walking with a dog. Because of the large variations in camera motion, appearance, and pose, it is a challenging dataset. Following [16], we use leave-one-group-out cross-validation and report the average accuracy over all classes.


### 4.2. Experiment Result

The proposed method extract one-scalew-flow trajectory-based local features through tracking dense sampling interest points and, then, cluster the trajectories into groups to encode motion part.In order to choose a discriminative combination of features to represent the low-level local descriptors, we evaluate the low-level local descriptors based onw-flow dense trajectories with Fisher Vector encoding in the first baseline experiment. GMM with 256 components is learned from a subset of 256,000 randomly selected trajectory-based local descriptors. Linear SVM with c=100 is used as classifier. We compare different feature descriptors in Figure 3 where the average accuracy on J-HMDB dataset is reported. It can be seen that MBH descriptors, encoding the relative motion between pixels, work better than other descriptors. Figure 3 also shows that the combination of HOF, w-HOF, and MBH descriptors achieves 67.4%, which is the highest precision among all kinds of the low-level local descriptors. So, we use this combination in the second experiment.Figure 3
Illustration on the effect of our descriptors with FV encoding. Each bar corresponds to one of the feature descriptors or feature combinations.In the second baseline experiment, the proposed two-layer model of the representation for action is the concatenation of low-level local descriptors and motion part descriptors encoding. Table1 and Figure 4 compare the two-layer method with the low-level method for J-HMDB and YouTube datasets. It can be seen that the two-layer model had better performance than the low-level encoding using different descriptors. In addition, we compare the proposed method with a few classic methods on KTH, J-HMDB, and YouTube datasets, such as DT + BoVW [1], mid-level parts [21], traditional FV [17], stacked FV [17], DT + BOW [10], and IDT + FV [17]. As shown in Table 2, the two-layer model obtains 67.4% and 87.6% accuracy on J-HMDB and YouTube datasets, respectively. And the recognition accuracy is improved by 4.6% on J-HMDB dataset and 2.2% on YouTube dataset compared with other state of the art methods. However, the performance on KTH dataset of the proposed method is not the same better as on the J-HMDB and YouTube datasets, because the KTH dataset is collected by the fixed camera with homogeneous background and the advantage of the w-flow trajectories is not shown in this case.Table 1
The accuracy comparisons of representation for action recognition on J-HMDB dataset and YouTube dataset.
Datasets
Features
Low-level encoding
Two-layer model
JHMDB
HOF
52.2%
56.1%
w-HOF
53.9%
57.3%
MBH
58.4%
62.9%
HOF +w-HOF + MBH
62.9%
67.4%
YouTube
HOF
77.6%
77.9%
w-HOF
75.2%
77.0%
MBH
84.2%
85.0%
HOF +w-HOF + MBH
85.3%
87.6%Table 2
Accuracy comparisons of different methods on KTH, YouTube and J-HMDB datasets.
KTH
YouTube
J-HMDB
ISA [15]
86.5%
Liu et al. [16]
71.2%
Traditional FV [17]
62.83%
Yeffet and Wolf [18]
90.1%
Ikizler-Cinbis and Sclaroff [19]
75.21%
Stacked FV [17]
59.27%
Cheng et al. [20]
89.7%
DT + BoVW [1]
85.4%
DT + BOW [10]
56.6%
Le et al. [15]
93.9%
Mid-level parts [21]
84.5%
IDT + FV [17]
62.8%
Two-layer model
92.6%
Two-layer model
87.6%
Two-layer model
67.4%Figure 4
The accuracy of different features comparisons between low-level and two-layer model. (a) The comparison on J-HMDB dataset. (b) The comparison on YouTube dataset.
(a)
J-HMDB dataset
(b)
YouTube dataset


## 4.1. Datasets

We validate our model on three standard datasets for human action: KTH, J-HMDB, and YouTube dataset. The KTH dataset views actions in front of a uniform background, whereas the J-HMDB dataset [10] and YouTube dataset [16] are collected from a variety of sources ranging from digitized movies to YouTube. They cover different scales and difficulty levels for action recognition. We summarize them and the experimental protocols as follows.The KTH dataset [23] contains 6 action categories: walking, handclapping, hand waving, jogging, running, and walking. The background is homogeneous and static in most sequences. We follow the experimental setting [23] dividing the dataset into the train set and test set. We train a multiclass classifier and report average accuracy over all classes as performance measure.The J-HMDB [10] contains 21 action categories: brush hair, catch, clap, climb stairs, golf, jump, kick ball, pick, pour, pull-up, push, run, shoot ball, shoot bow, shoot gun, sit, stand, swing baseball, throw, walk, and wave. J-HMDB is a subset of the HMDB51 which is collected from the movies or Internet. This dataset excludes categories from HMDB51 that contain facial expressions like smiling and interactions with others such as shaking hands and focuses on single body action. We evaluate the J-HMDB which contains 11 categories involving one single body action. For multiclass classification, we use the one-vs-rest approach.The YouTube Action dataset [16] contains 11 action categories: basketball, biking, diving, golf swinging, horse riding, soccer juggling, swinging, tennis swinging, trampoline jumping, volleyball spiking, and walking with a dog. Because of the large variations in camera motion, appearance, and pose, it is a challenging dataset. Following [16], we use leave-one-group-out cross-validation and report the average accuracy over all classes.


## 4.2. Experiment Result

The proposed method extract one-scalew-flow trajectory-based local features through tracking dense sampling interest points and, then, cluster the trajectories into groups to encode motion part.In order to choose a discriminative combination of features to represent the low-level local descriptors, we evaluate the low-level local descriptors based onw-flow dense trajectories with Fisher Vector encoding in the first baseline experiment. GMM with 256 components is learned from a subset of 256,000 randomly selected trajectory-based local descriptors. Linear SVM with c=100 is used as classifier. We compare different feature descriptors in Figure 3 where the average accuracy on J-HMDB dataset is reported. It can be seen that MBH descriptors, encoding the relative motion between pixels, work better than other descriptors. Figure 3 also shows that the combination of HOF, w-HOF, and MBH descriptors achieves 67.4%, which is the highest precision among all kinds of the low-level local descriptors. So, we use this combination in the second experiment.Figure 3
Illustration on the effect of our descriptors with FV encoding. Each bar corresponds to one of the feature descriptors or feature combinations.In the second baseline experiment, the proposed two-layer model of the representation for action is the concatenation of low-level local descriptors and motion part descriptors encoding. Table1 and Figure 4 compare the two-layer method with the low-level method for J-HMDB and YouTube datasets. It can be seen that the two-layer model had better performance than the low-level encoding using different descriptors. In addition, we compare the proposed method with a few classic methods on KTH, J-HMDB, and YouTube datasets, such as DT + BoVW [1], mid-level parts [21], traditional FV [17], stacked FV [17], DT + BOW [10], and IDT + FV [17]. As shown in Table 2, the two-layer model obtains 67.4% and 87.6% accuracy on J-HMDB and YouTube datasets, respectively. And the recognition accuracy is improved by 4.6% on J-HMDB dataset and 2.2% on YouTube dataset compared with other state of the art methods. However, the performance on KTH dataset of the proposed method is not the same better as on the J-HMDB and YouTube datasets, because the KTH dataset is collected by the fixed camera with homogeneous background and the advantage of the w-flow trajectories is not shown in this case.Table 1
The accuracy comparisons of representation for action recognition on J-HMDB dataset and YouTube dataset.
Datasets
Features
Low-level encoding
Two-layer model
JHMDB
HOF
52.2%
56.1%
w-HOF
53.9%
57.3%
MBH
58.4%
62.9%
HOF +w-HOF + MBH
62.9%
67.4%
YouTube
HOF
77.6%
77.9%
w-HOF
75.2%
77.0%
MBH
84.2%
85.0%
HOF +w-HOF + MBH
85.3%
87.6%Table 2
Accuracy comparisons of different methods on KTH, YouTube and J-HMDB datasets.
KTH
YouTube
J-HMDB
ISA [15]
86.5%
Liu et al. [16]
71.2%
Traditional FV [17]
62.83%
Yeffet and Wolf [18]
90.1%
Ikizler-Cinbis and Sclaroff [19]
75.21%
Stacked FV [17]
59.27%
Cheng et al. [20]
89.7%
DT + BoVW [1]
85.4%
DT + BOW [10]
56.6%
Le et al. [15]
93.9%
Mid-level parts [21]
84.5%
IDT + FV [17]
62.8%
Two-layer model
92.6%
Two-layer model
87.6%
Two-layer model
67.4%Figure 4
The accuracy of different features comparisons between low-level and two-layer model. (a) The comparison on J-HMDB dataset. (b) The comparison on YouTube dataset.
(a)
J-HMDB dataset
(b)
YouTube dataset


## 5. Conclusions

This paper proposed a two-layer model of representation for action recognition based on local descriptors and motion part descriptors, which achieved an improvement compared to the low-level local descriptors. Not only did it consider making use of low-level local information to encoding the video, but also it combined the motion part to represent the video. It also presented a discriminative and compact representation for action recognition. However, there is still room for improvement. First, the proposed method cannot determine the number of groups in different datasets while the number of groups affects the performance of mid-level encoding a lot. Second, many groups in video do not represent the action part; it is needed to develop a method to learn the discriminately groups for better representation of the video. In the future, we will do research on new group clustering method which can find the more discriminative groups of action part.



---

*Source: 4019213-2017-10-19.xml*