# Projection Analysis Optimization for Human Transition Motion Estimation

Authors: Wanyi Li; Feifei Zhang; Qiang Chen; Qian Zhang
Journal: International Journal of Digital Multimedia Broadcasting
 (2019)

---

## Abstract

It is a difficult task to estimate the human transition motion without the specialized software. The 3-dimensional (3D) human motion animation is widely used in video game, movie, and so on. When making the animation, human transition motion is necessary. If there is a method that can generate the transition motion, the making time will cost less and the working efficiency will be improved. Thus a new method called latent space optimization based on projection analysis (LSOPA) is proposed to estimate the human transition motion. LSOPA is carried out under the assistance of Gaussian process dynamical models (GPDM); it builds the object function to optimize the data in the low dimensional (LD) space, and the optimized data in LD space will be obtained to generate the human transition motion. The LSOPA can make the GPDM learn the high dimensional (HD) data to estimate the needed transition motion. The excellent performance of LSOPA will be tested by the experiments.


---

## Body

## 1. Introduction

3-dimensional (3D) human motion animation is applied in many fields, such as video game and movie. It is necessary to estimate the human transition motion for making all kinds of 3D animations [1–4]. Estimating the human transition motion is crucial to making the smooth animation of the 3D human motion; it is a branch of human motion estimation. As to technologies of human motion estimation, there are some advanced methods in recent years, such as multiview image segmentation [5], sparse presentation [6], and convolutional neural network (CNN) coupled with a geometric prior [7]. These methods focus on the reconstruction of the 3D human motion from the 2-dimensional (2D) image sequence. The needed data is the high dimensional data of the 3D human motion model. The mapping will be built between the model and the 2D image for each frame. However, it is difficult to build the mapping without the overcomplete prior information, as a result of the data complexity during the optimization. Some human poses contain the ambiguity of limbs; for example, it is hard to determine which thigh is in the front from the silhouette. The right thigh or left thigh cannot be confirmed. The problem is that if we have enough prior information to distinguish the ambiguity, the reconstruction will be achieved easily. Thus the generated model of 3D human motion is necessary; the samples of the model can be obtained to construct the prior information. Besides, the generated model can also generate the 3D human motion for making 3D character movie. Then the generated model can be built through the unsupervised learning. The unsupervised learning of the model is the necessary supplement of the advantaged methods above. In this paper, how to generate the human transition motion will be mainly discussed in the following sectionsIf there is a method that can estimate the valid human transition motion, the animation making time will cost less, and the work will get easier. Thus a new method called latent space optimization based on projection analysis (LSOPA) is proposed to estimate the human transition motion. LSOPA needs to combine Gaussian process dynamical models (GPDM) [8] to process the low dimensional (LD) data. GPDM is the derivation of some dimension reduction models [9–13]; it can provide the prediction of the LD data. After the dimension reduction, LD data will be optimized by LSOPA, so that the valid human transition motion can be generated to achieve the estimation. The human motion is described by the high dimensional data. If the HD data sample is searched in its own dimensional space, the invalid data will be generated; it means the generated human motion in 3D will be abnormal [14]. GPDM is an unsupervised learning model; it can learn the high dimensional data (HD) sample and estimate the new one, but it needs to process the LD data in the LD space. In the LD space, the LD data can be searched, and the corresponding valid HD data can be generated by the mapping from LD data to HD data. Some methods [15–17] can process the LD data, but the generated LD data are all unreliable and undetermined during the optimization, as a result of the randomization of these methods. The LSOPA can do this work to process the LD data better and ensure the valid transition motion can be generated. The excellent performance of LSOPA will be tested by the experiments in the corresponding section.The human motion is described by a 3D human motion model. The model has some markers to show the limbs of human motion; it is the HD data. When we make the 3D human motion animation and only have the samples of the two irrelevant human motions, it is necessary to use the transition motion to connect the two irrelevant human motions, so that the complete and smooth human motion in 3D is constructed. Meanwhile, the transition motion consists of many poses, and the poses are all the HD data samples of 3D human model, thus how to estimate the valid transition motion is a challenged task. However, the LSOPA can take the advantage of the GPDM to generate the valid transition motion and avoid generating the invalid pose of the transition motion. The proposed method will be discussed in the following sections.


## 2. Dimension Reduction

When we have the sequence of HD data samplesY=[y1,...,yi,...,yN]T∈RN×D,yi∈RD, the corresponding LD data X=[x1,...,xi,...,xN]T∈RN×q,xi∈Rq can be obtained as the following equations from GPDM [8]:(1)pY∣X,β¯,W=WN2πNDKYDexp⁡-12trKY-1YW2YT,(2)pX∣α-=px12πN-1qKxqexp⁡-12trKX-1X2:NX2:NT,(3)KYi,j=kYxi,xj=exp⁡-β12xi-xj2+β2-1δxixj,(4)KXi,j=kXxi,xj=α1exp⁡-α22xi-xj2+α3xiTxj+α4-1δxixj,(5)pW=∏m=1D2κ2πexp⁡-wm22κ2,(6)pα∝∏iαi-1,(7)pβ∝∏iβi-1,(8)X,α¯,β¯,W=arg⁡minX,α¯,β¯,W⁡-ln⁡pX,α¯,β¯,W,Y=arg⁡minX,α¯,β¯,W⁡-ln⁡pY∣X,β¯,WpX∣α-pα¯pβ¯pW,Equations (1)-(7) are used to computing (8), then theX and the other parameters can be got. In (1) and (2), we have the sequences X∈RN×q, Y∈RN×D, respectively,Y denotes the HD data samples of 3D human motion, andX denotes the LD data ofY in the LD space after the dimension reduction. In (3) and (4), KY∈RN×N and KX∈R(N-1)×(N-1) are kernel matrices, respectively, β¯=[β1,β2] and α-=[α1,α2,α3,α4] are their corresponding kernel parameters, and they satisfy the relation of (6) and (7), respectively. Equations (3) and (4) are showing the method of computing the two kernel matrices KY and KX. W=diag(w1,...,wm,...,wD)∈RD×D is a scale diagonal matrix with the preset parameter κ,x1 conforms Gaussian distribution of q dimensions, and X2:N is the sequence X2:N=[x2,x3,...,xN]T∈R(N-1)×q. The mapping from LD data to HD data can be built as follows: (9)y∗=fx∗=μYx∗=YTKY-1kYx1,x∗,kYx2,x∗,…,kYxN,x∗T=YTKY-1kYx∗.The GPDM has a dynamic process. It can predict the LD data in the latent space (also called LD space) and generate the needed HD data of human motion, so that it has better performance than other dimension reduction models. Thus GPDM can be selected to learn the samples of the two different human motions; then the LD space can be built to find the needed LD data of the transition motion, so that corresponding poses can be generated through the mapping of (9).


## 3. Latent Space Optimization Based on Projection Analysis

### 3.1. The LD Data of the Transition Motion in the LD Space

After the dimension reduction, the HD data samples of the two irrelevant human motions can be seen in the LD space. The LD data of two difference sequences can denote the corresponding poses of the two irrelevant human motions. It can be found that there is an obvious distance between the two LD data as Figure1 shows. From the two sets of LD data, we can know the needed transition motion can be generated through the LD space, but it needs to construct an appropriated curve to connect the two sets of LD data in the LD space. Thus, the optimized work will be started.Figure 1
The LD data of the two irrelevant human motions.


### 3.2. Optimization in the LD Space

Assume thatX1=[x11,x21,...,xN11]T∈RN1×q, X2=[x12,x22,...,xN22]T∈RN2×q are, respectively, the LD data of the two irrelevant human motions after dimension reduction, the first motion has N1 frames, and the second motion has N2 frames. The positions of the corresponding LD data can be seen in Figure 2. In Figure 2, the derivations of L can be got as follows:(10)L=xi′-xN11-xi′-xN11Tx12-xN11x12-xN11x12-xN112,(11)A=xi′-xN11Tx12-xN11x12-xN11.From Figure 2, we can see L denotes the distance from the LD data sample xi′∈R3 to its projectionA in (10), and we can also see the vector (B-xN11) is the projection of the vector (xi′-xN11) in the plane ω. Assume the set of bases B∗=[b1,b2,...,bq]∈Rq×q in the plane ω, bi∈R3,i=1,2,...q is the vector from the plane ω; we can get(12)Projωxi′-xN11=B-xN11,(13)xi′-xN11-Projωxi′-xN11=Projcωxi′-xN11.ProjH denotes the projective operation, which means obtaining the projective vector or plane ofH. ProjcH denotes the complement of the projective operation ProjH, which means obtaining the vector perpendicular to projective vector from the operation ProjH. In (12) and (13), the complement of the projection vector is perpendicular to the plane ω; thus the equation can be got from (13) as follows:(14)B∗Txi′-xN11-Projωxi′-xN11=B∗TProjcωxi′-xN11=0.In (14), B∗∈Rq×q; then Projω(xi′-xN11) is a vector of the plane ω, and (15) can deduced from this:(15)Projωxi′-xN11=B∗y~=y1b1+y2b2+…+yqbq.In (15), Projω(xi′-xN11)∈ω can be denoted by the bases bi∈R3,i=1,2,...q and coefficients y~=[y1,y2,...,yq]T∈Rq; then B∗=[b1,b2,...,bq]∈Rq×q. Substituting (15) into (14), the following equation can be deduced:(16)B∗Txi′-xN11-B∗y~=0.Simplify (16), compute the least squares estimator of y~, and get the equation as below:(17)y~=B∗TB∗-1B∗Txi′-xN11.Substitute (12) and (17) into (15); the following equation can be obtained:(18)Projωxi′-xN11=B-xN1=B∗B∗TB∗-1B∗Txi′-xN11.From (15) to (18), we have y~∈Rq, and the bases bi∈Rq,i=1,2,...,q are linearly independent.Figure 2
The analysis of the optimized models.Our task is to find the optimal LD data sequence of the transition motion betweenxN11 and x12; thus we can build the constraint functions to describe position of the needed LD data sequence X′=[x1′,x2′,...,xN′′]T∈RN′×q as follows: (19)xi′-xN11Tx12-xN11x12-xN11=ix12-xN11N′+1,i=1,2,…,N′.Equation (19) denotes confirming the projection distance in the vector (x12-xN11) from each xi′∈Rq,i=1,2,...N′; then, we have(20)xi′-xN11-xi′-xN11Tx12-xN11x12-xN11x12-xN112=lix12-xN11N′+1=L,i=1,2,…,N′.Equation (20) denotes confirming the distance between xi′ and Proj(x12-xN11)xi′; meanwhile, we can get(21)arccos⁡B′TCB′C<θi,i=1,2,…N′.In (21), B′=(B-xN1) is a vector of Projω(xi′-xN11) which is perpendicular to the plane ω.C is a preset vector in the plane ω; it can be seen as the reference of computing the angle of (21). In (19)-(21), the LD data of the transition motion can be described in the LD space and l(i) is the preset values of adjusting the value of L. θ(i) is preset angle which is describing the deviation of the LD data position. Then the projection and corresponding vector can be used to build these constraint functions, so that an object function with constraints can be obtained as follows:(22)argminxi′yi′-yi-1′=argminxi′⁡fxi′-fxi-1′,x0′=xN11,i=1,2,…,N′,s.t.xi′-xN11Tx12-xN11x12-xN11=ix12-xN11N′+1xi′-xN11-xi′-xN11Tx12-xN11x12-xN11x12-xN112=lix12-xN11N′+1,arccos⁡B′TCB′C<θii=1,2,…,N′.The optimized object function of (22) ensures that the frames of the transition motion can be varying regularly and the valid transition motion will be seen in the vision. The solution of (22) can be obtained by the method in [18].


### 3.3. The Procedure of the LSOPA

When the two irrelevant human motion samples are obtained, the two samples are denoted byY1=[y11,y21,...,yN11]T∈RN1×q, Y2=[y12,y22,...,yN22]T∈RN2×q. Then, we have the following.LSOPA (1)
LetY=[Y1T,Y2T]T; use the method called principal component analysis (PCA) to initiate Y and get the initiated LD data X=[X1T,X2T]T. Preset the values of θ(i), l(i), and C. (2)
Presetα¯,β¯,W. Then, compute X,α¯,β¯,W=argminX,α¯,β¯,W⁡-ln⁡pX,α¯,β¯,W,Y, update X, and get α¯, β¯, W. (3)
Computeargminxi′⁡yi-yi-1=argminxi′⁡f(xi′)-f(xi-1′), x0′=xN11,i=1,2,...N′ and the corresponding constraint functions in (22), and get the LD data X′=[x1′,x2′,...,xN′′]T∈RN′×q of the transition motion. (4)
Compute the transition motionyi′=fxi′,i=1,2,...,N′, let Y′=[y1′,y2′,...,yN′′]T, and output the 3D transition motion model. Finally, let Ynew=[Y1T,Y′T,Y2T]T, Xnew=[X1T,X′T,X2T]T, compute the Xu,α¯u,β¯u,Wu=argminX,α¯,β¯,W⁡-ln⁡pXnew,α¯,β¯,W,Ynew, and update Xu, α¯u, β¯u, Wu. End the whole procedure.The method LSOPA can be written as pseudocode in Algorithm1 for the transition motion estimation.Algorithm 1:The brief procedure of LSOPA.
Input:Y1, Y2; Output: Ynew, Xu, α¯u, β¯u, Wu Presetθ(i), l(i), i=1,2,...N′, C, α¯, β¯, W; Y = Y 1 T , Y 2 T T; Use PCA to processY, and get X=X1T,X2TT; X , α ¯ , β ¯ , W = arg ⁡ min X , α ¯ , β ¯ , W ⁡ - ln ⁡ p X , α ¯ , β ¯ , W , Y; For i=1 toN′ arg ⁡ m i n x i ′  y i ′ - y i - 1 ′ = arg ⁡ min x i ′ ⁡ f ( x i ′ ) - f ( x i - 1 ′ ) ,  x 0 ′ = x N 1 1, s . t .  x i ′ - x N 1 1 T ( x 1 2 - x N 1 1 ) x 1 2 - x N 1 1 = i x 1 2 - x N 1 1 ( N ′ + 1 ) ( x i ′ - x N 1 1 ) - x i ′ - x N 1 1 T x 1 2 - x N 1 1 x 1 2 - x N 1 1 ( x 1 2 - x N 1 1 ) 2 = l ( i ) x 1 2 - x N 1 1 N ′ + 1 ; arccos ⁡ B ′ T C ( B ′ C ) < θ i y i ′ = f ( x i ′ ); End For X′=[x1′,x2′,...,xN′′]T; Y ′ = [ y 1 ′ , y 2 ′ , . . . , y N ′ ′ ] T; X n e w = [ X 1 T , X ′ T , X 2 T ] T; Y n e w = [ Y 1 T , Y ′ T , Y 2 T ] T; X u , α ¯ u , β ¯ u , W u = arg ⁡ min X , α ¯ , β ¯ , W ⁡ - ln ⁡ p X n e w , α ¯ , β ¯ , W , Y n e w; End the procedure.


## 3.1. The LD Data of the Transition Motion in the LD Space

After the dimension reduction, the HD data samples of the two irrelevant human motions can be seen in the LD space. The LD data of two difference sequences can denote the corresponding poses of the two irrelevant human motions. It can be found that there is an obvious distance between the two LD data as Figure1 shows. From the two sets of LD data, we can know the needed transition motion can be generated through the LD space, but it needs to construct an appropriated curve to connect the two sets of LD data in the LD space. Thus, the optimized work will be started.Figure 1
The LD data of the two irrelevant human motions.


## 3.2. Optimization in the LD Space

Assume thatX1=[x11,x21,...,xN11]T∈RN1×q, X2=[x12,x22,...,xN22]T∈RN2×q are, respectively, the LD data of the two irrelevant human motions after dimension reduction, the first motion has N1 frames, and the second motion has N2 frames. The positions of the corresponding LD data can be seen in Figure 2. In Figure 2, the derivations of L can be got as follows:(10)L=xi′-xN11-xi′-xN11Tx12-xN11x12-xN11x12-xN112,(11)A=xi′-xN11Tx12-xN11x12-xN11.From Figure 2, we can see L denotes the distance from the LD data sample xi′∈R3 to its projectionA in (10), and we can also see the vector (B-xN11) is the projection of the vector (xi′-xN11) in the plane ω. Assume the set of bases B∗=[b1,b2,...,bq]∈Rq×q in the plane ω, bi∈R3,i=1,2,...q is the vector from the plane ω; we can get(12)Projωxi′-xN11=B-xN11,(13)xi′-xN11-Projωxi′-xN11=Projcωxi′-xN11.ProjH denotes the projective operation, which means obtaining the projective vector or plane ofH. ProjcH denotes the complement of the projective operation ProjH, which means obtaining the vector perpendicular to projective vector from the operation ProjH. In (12) and (13), the complement of the projection vector is perpendicular to the plane ω; thus the equation can be got from (13) as follows:(14)B∗Txi′-xN11-Projωxi′-xN11=B∗TProjcωxi′-xN11=0.In (14), B∗∈Rq×q; then Projω(xi′-xN11) is a vector of the plane ω, and (15) can deduced from this:(15)Projωxi′-xN11=B∗y~=y1b1+y2b2+…+yqbq.In (15), Projω(xi′-xN11)∈ω can be denoted by the bases bi∈R3,i=1,2,...q and coefficients y~=[y1,y2,...,yq]T∈Rq; then B∗=[b1,b2,...,bq]∈Rq×q. Substituting (15) into (14), the following equation can be deduced:(16)B∗Txi′-xN11-B∗y~=0.Simplify (16), compute the least squares estimator of y~, and get the equation as below:(17)y~=B∗TB∗-1B∗Txi′-xN11.Substitute (12) and (17) into (15); the following equation can be obtained:(18)Projωxi′-xN11=B-xN1=B∗B∗TB∗-1B∗Txi′-xN11.From (15) to (18), we have y~∈Rq, and the bases bi∈Rq,i=1,2,...,q are linearly independent.Figure 2
The analysis of the optimized models.Our task is to find the optimal LD data sequence of the transition motion betweenxN11 and x12; thus we can build the constraint functions to describe position of the needed LD data sequence X′=[x1′,x2′,...,xN′′]T∈RN′×q as follows: (19)xi′-xN11Tx12-xN11x12-xN11=ix12-xN11N′+1,i=1,2,…,N′.Equation (19) denotes confirming the projection distance in the vector (x12-xN11) from each xi′∈Rq,i=1,2,...N′; then, we have(20)xi′-xN11-xi′-xN11Tx12-xN11x12-xN11x12-xN112=lix12-xN11N′+1=L,i=1,2,…,N′.Equation (20) denotes confirming the distance between xi′ and Proj(x12-xN11)xi′; meanwhile, we can get(21)arccos⁡B′TCB′C<θi,i=1,2,…N′.In (21), B′=(B-xN1) is a vector of Projω(xi′-xN11) which is perpendicular to the plane ω.C is a preset vector in the plane ω; it can be seen as the reference of computing the angle of (21). In (19)-(21), the LD data of the transition motion can be described in the LD space and l(i) is the preset values of adjusting the value of L. θ(i) is preset angle which is describing the deviation of the LD data position. Then the projection and corresponding vector can be used to build these constraint functions, so that an object function with constraints can be obtained as follows:(22)argminxi′yi′-yi-1′=argminxi′⁡fxi′-fxi-1′,x0′=xN11,i=1,2,…,N′,s.t.xi′-xN11Tx12-xN11x12-xN11=ix12-xN11N′+1xi′-xN11-xi′-xN11Tx12-xN11x12-xN11x12-xN112=lix12-xN11N′+1,arccos⁡B′TCB′C<θii=1,2,…,N′.The optimized object function of (22) ensures that the frames of the transition motion can be varying regularly and the valid transition motion will be seen in the vision. The solution of (22) can be obtained by the method in [18].


## 3.3. The Procedure of the LSOPA

When the two irrelevant human motion samples are obtained, the two samples are denoted byY1=[y11,y21,...,yN11]T∈RN1×q, Y2=[y12,y22,...,yN22]T∈RN2×q. Then, we have the following.LSOPA (1)
LetY=[Y1T,Y2T]T; use the method called principal component analysis (PCA) to initiate Y and get the initiated LD data X=[X1T,X2T]T. Preset the values of θ(i), l(i), and C. (2)
Presetα¯,β¯,W. Then, compute X,α¯,β¯,W=argminX,α¯,β¯,W⁡-ln⁡pX,α¯,β¯,W,Y, update X, and get α¯, β¯, W. (3)
Computeargminxi′⁡yi-yi-1=argminxi′⁡f(xi′)-f(xi-1′), x0′=xN11,i=1,2,...N′ and the corresponding constraint functions in (22), and get the LD data X′=[x1′,x2′,...,xN′′]T∈RN′×q of the transition motion. (4)
Compute the transition motionyi′=fxi′,i=1,2,...,N′, let Y′=[y1′,y2′,...,yN′′]T, and output the 3D transition motion model. Finally, let Ynew=[Y1T,Y′T,Y2T]T, Xnew=[X1T,X′T,X2T]T, compute the Xu,α¯u,β¯u,Wu=argminX,α¯,β¯,W⁡-ln⁡pXnew,α¯,β¯,W,Ynew, and update Xu, α¯u, β¯u, Wu. End the whole procedure.The method LSOPA can be written as pseudocode in Algorithm1 for the transition motion estimation.Algorithm 1:The brief procedure of LSOPA.
Input:Y1, Y2; Output: Ynew, Xu, α¯u, β¯u, Wu Presetθ(i), l(i), i=1,2,...N′, C, α¯, β¯, W; Y = Y 1 T , Y 2 T T; Use PCA to processY, and get X=X1T,X2TT; X , α ¯ , β ¯ , W = arg ⁡ min X , α ¯ , β ¯ , W ⁡ - ln ⁡ p X , α ¯ , β ¯ , W , Y; For i=1 toN′ arg ⁡ m i n x i ′  y i ′ - y i - 1 ′ = arg ⁡ min x i ′ ⁡ f ( x i ′ ) - f ( x i - 1 ′ ) ,  x 0 ′ = x N 1 1, s . t .  x i ′ - x N 1 1 T ( x 1 2 - x N 1 1 ) x 1 2 - x N 1 1 = i x 1 2 - x N 1 1 ( N ′ + 1 ) ( x i ′ - x N 1 1 ) - x i ′ - x N 1 1 T x 1 2 - x N 1 1 x 1 2 - x N 1 1 ( x 1 2 - x N 1 1 ) 2 = l ( i ) x 1 2 - x N 1 1 N ′ + 1 ; arccos ⁡ B ′ T C ( B ′ C ) < θ i y i ′ = f ( x i ′ ); End For X′=[x1′,x2′,...,xN′′]T; Y ′ = [ y 1 ′ , y 2 ′ , . . . , y N ′ ′ ] T; X n e w = [ X 1 T , X ′ T , X 2 T ] T; Y n e w = [ Y 1 T , Y ′ T , Y 2 T ] T; X u , α ¯ u , β ¯ u , W u = arg ⁡ min X , α ¯ , β ¯ , W ⁡ - ln ⁡ p X n e w , α ¯ , β ¯ , W , Y n e w; End the procedure.


## 4. Experiment and Evaluation

We test the proposed method LSOPA in the performance of the vision and error test. We choose the line initialization [8] (LI) and random initialization [17] (RI) as the compared methods. LI means that the LD data of the transition motion is obtained linearly between the LD data of the two different motions. RI means that the LD data of the transition motion is obtained randomly between the LD data of two different motions. The LD data samples (green ones) in the LD space can be seen in Figures 3(a)–3(c), which denotes the transition motion. The tested transition motion is a total of 15 frames and the tested database is the Carnegie Mellon University (CMU) motion capture database which is shortened for CMU database.Figure 3
The LD data samples of the LSOPA, LI, and RI.
(a)
LSOPA (b)
LI (c)
RIThe three methods can estimate the corresponding transition motions, but the transition motions are obviously different. Let us see the effect in the vision from Figures4(a)–4(c). In the estimation of the transition motion between walking and playing golf, we can find that the transition motion generated by the LSOPA is smoothly and naturally in vision. The transition motions generated by the other two methods are invalid and messy; they are abnormal human transition motions obviously. In a word, the transition motions of LI and RI are not like playing the golf. It is demonstrated that the performance of LSOPA is the best in the visual effect among the three methods.Figure 4
The visual evaluation of the methods.
(a)
The transition motion of LSOPA (b)
The transition motion of LI (c)
The transition motion of RIThen, the error and mean error of estimating the transition motion are tested. How to compute the error can be seen in [19], but the scale of markers in the 3D model must be considered. The error can be computed as follows:(23)Er=1Mar∑ma=1MarBxma-Bxma′.In (23), Bxma,Bxma′∈R3, Bxma, and Bxma′ are, respectively, the true position and the estimated position of the marker in the 3D model; both are the joint marker in the 3D model.Mar is the number of the markers in the 3D model.The transition motion includes four transition motions; they are walking and playing golf, walking and dancing, walking and swimming, and walking and playing football, respectively. The contrast of the true data and the estimated data can be seen in Figures5(a)–5(c). The error of each frame in the transition motion generated by LSOPA is the lowest among the three methods, so is the mean error. Generally speaking, the error of some frames will be close, but the error of LSOPA will be kept low and stable on the whole. The tested result can also reveal that the LSOPA has the best performance in the error test.Figure 5
The error of several transition motions.
(a)
The error of the transition motion from walking to playing golf (b)
The error of the transition motion from walking to dancing (c)
The error of the transition motion from walking to swimming (d)
The error of the transition motion from walking to playing football


## 5. Conclusion

The LSOPA is proposed to solve the problem of estimating the human transition motion. The LSOPA is tested in the experiments of the vision and error test, and we can find that the performance of the LSOPA is the best among the three methods. However, the LSOPA still cannot process some complex human transition motion well, and its initialization of optimization cannot be random; thus the LSOPA need to be improved in the future research. Then, the improved method can carry out the unsupervised learning of the two complex irrelevant human motions and estimate their smooth and valid transition motion. The 3D human motion model will also be replaced by other exquisite models [20–22] in the future research.



---

*Source: 6816453-2019-06-02.xml*