# Sparse Approximation for Nonrigid Structure from Motion

Authors: Yaming Wang; Xiaomeng Yan; Junbao Zheng; Mingfeng Jiang
Journal: Journal of Robotics
 (2015)

---

## Abstract

This paper introduces applying a novel sparse approximation method into solving nonrigid structure from motion problem in trajectory space. Instead of generating a truncated traditional trajectory basis, this method uses an atom dictionary which includes a set of overcomplete bases to estimate the real shape of the deformable object. Yet, it still runs reliably and can get an optimal result. On the other hand, it does not need to consider the size of predefined trajectory bases; that is to say, there is no need to truncate the trajectory basis. The mentioned method is very easy to implement and the only trouble which needs to be solved is anL
1-regularized least squares problem. This paper not only presents a new thought, but also gives out a simple but effective solution for the nonrigid structure from motion problem.


---

## Body

## 1. Introduction

Nonrigid structure from motion (NRSfM) refers to the process of recovering 3D coordinates of a nonrigid object from its 2D projections. This technology plays an important role in computer vision applications [1–4]. One prevalent solution for solving this process was considering the deformable object as a linear combination of shape basis. This method worked well for simple motion containing a single action. However, it would be hard to recover the structure of the object when dealing with complex sequences. For this reason, Akhter et al. [5] introduced a common method that reconstructs the 3D object in trajectory space instead of shape space. This approach did well with long complex motion sequences because these measurement points were not dependent on each other. What is more, since the trajectories of the points of most 3D motion in the real world were some curved lines which were naturally smooth, these trajectories could be modeled with a linear combination of some known curved lines, known as trajectory basis. The appearance of trajectory basis model improved the solutions for recovering nonrigid shape from motion well.Moreover, experiments also proved that the efficiency of the trajectory basis method relied on two factors: the type of the trajectory basis and the number of bases. And in the selection of trajectory basis, it turned out that the discrete cosine transform (DCT) for Markov was more suitable to be defined as a general basis [6, 7]. However, we should know that, though DCT basis has been proved to be better than the others on the whole, the former could not be suitable for every motion sequence. Another thing, the number of the selected trajectory bases was thought-provoking. Selecting a smaller trajectory basis size might lead to big ignorance of much important information of the motion sequences, while a larger basis size might lead to a large number of unknown factors and the system of equations would be ill-posed. And the former situation might get a bad result, and the latter would be a large waste of time or even could not get the solution of the equations [8].(1) Contributions. In general, a solution to 3D point trajectories could be obtained more accurately by reducing the restrictions of the trajectory basis. This paper introduces applying sparse coding algorithms to the NRSfM problem. In this process, a set of overcomplete bases called atonic dictionary was predefined to represent the deformable object with sparse coefficients.An advantage of the sparse coding approach is that it is not restricted to only one trajectory basis function and may be generated by two or more incoherent basis functions. It is very useful to recover the trajectory curves which consist of some different types of bases functions. What is more, since the goal of sparse approximation is to represent trajectory sequences as a sparse combination of all atoms, there is no need to predefine the number of trajectory bases.(2) Related Work. Bregler et al. first proposed to use factorization approaches to recover the nonrigid deformable objects from motion [9]. The main thought of Bregler et al. was to obtain a low-rank shape basis which can satisfy the 2D point projections. They argued that the structure of motion object could be regarded as an approximate linear combination of basis shapes. This shape model was widely used in this field, though it appeared to be very hard because the inherent basis ambiguity of the nonrigid problem must be overcome. To resolve this ambiguity, Torresani et al. [10] introduced a Gaussian prior to constraining the solution by reducing the coefficients. For the same reason, Xiao et al. [11] proposed to add extra “basis constraints” besides the orthonormality constraints. Later, Dai et al. [12] proposed a simple prior-free method to solve the NRSfM problem for the first time in 2010. Although they did not assume any additional prior knowledge except the low-rank constraint, the method recovered the nonrigid shape reliably. The shape based model became more mature. The methods mentioned above are based on shape basis, until Akhter et al. [6] made a great improvement, who introduced trajectories based model for solving NRSfM problem instead of shape basis. This approach, regarding the 3D point trajectories as a model in the domain of the discrete cosine transform (DCT) basis vectors, provided better results on complex shapes. Zhu and Lucey proposed to use a penalty to minimize the size of active trajectory basis [13].


## 2. Problem Formulations

The measured projective trajectories are contained in a2
F
×
P matrix W as follows:(1)
W
=
X
11
⋯
X
1
P
⋮
⋱
⋮
X
F
1
⋯
X
F
P
=
X
Y
∈
R
2
F
×
P
.W is the measurement matrix generated from the 2D coordinates (
X
,
Y
) of feature points, where F indicates the number of motion frames and P is the number of feature points of the deformable object [9]. Then deal with W and let W be a registered measurement matrix connecting the camera center and the projection on the image plane, so that in the trajectory space W can be represented as(2)
W
=
M
S
,
M
=
M
1
⋱
M
F
,
S
=
S
1
⋮
S
F
.In this formula,M is the camera motion (projection) matrix and S indicates the nonrigid shape matrix [10]. Moreover, the shape coordinates of the object can be decomposed into a set of truncation bases and corresponding coefficients:(3)
S
3
F
×
P
=
Θ
3
F
×
3
k
A
3
k
×
P
.MatrixΘ is the predefined trajectory bases, and A indicates the corresponding coefficients.We all know that most of the energy in natural signal concentrates in low-frequency area and discrete cosine transform (DCT) has a huge advantage in the specificity of energy concentration [11]. For the above reason, DCT is used in NRSfM processing so that the loss compression of data can be conducted. What is more, it has been proved that in general DCT basis is a better basis in the whole. So this paper mainly considers the situation in the DCT trajectory space. The discrete cosine transform is generally formulated as follows:(4)
y
k
,
d
=
u
k
∑
n
=
1
N
u
n
,
d
cos
⁡
π
2
N
-
1
k
-
1
2
N
,where(5)
k
=
1
,
…
,
N
;
u
k
=
1
M
;
k
=
1
2
M
;
2
≤
k
≤
M
.In Akhter’s method [6], the rank of matrix Θ was truncated to k. That is to say, they selected 3
k columns from a 3
F
×
3
F matrix and k was far smaller than F. But because of the limitation of bases number in use, it might be widely inaccurate when the scenes were complex.


## 3. Sparse Approximation Method

Traditional trajectory bases approaches of reconstruction mainly involve the use of a certain kind of orthogonal bases, such as the Fourier basis, various DCT bases, and other orthogonal wavelet bases. In these situations, one wishes to represent all the trajectory curves of feature points as a linear combination of a certain waveform. But there is a problem that if the number of trajectory bases was too big, the equations system would be a NP-hard problem. So this paper introduces a new method which uses sparse approximation method to represent the trajectory curves instead of traditional trajectory bases method. And the sparse approximation provides a class of algorithms that learn basis functions only when they capture higher-level features in the input data [14]. Moreover, an overcomplete atom dictionary will be used in this method other than trajectory bases. An overcomplete atom dictionary which contains different kinds of bases functions will help to get a better result.


### 3.1. Atom Dictionary

In reality, wavelets perform poorly on high-frequency sinusoids and, on the contrary, sinusoids perform poorly on impulsive events [15]. So it would not be accurate to recover the trajectory curves just with one certain basis. Dirac function and trigonometric function are two kinds of fundamental orthonormal bases, and most of the real trajectory curves can be represented by these two functions. If Dirac basis and DCT basis are put together in one matrix, this will generate an atom dictionary which performs better than any independent trajectory basis. And the coefficients of the dictionary must be sparse (i.e., the coefficients include many zero items). Each column of this dictionary is called atom, and the concatenation of Dirac basis and DCT basis has turned out to be suitable for most situations [16]. In the paper this dictionary is used in experiments with experimental data instead of trajectory bases.


### 3.2. Sparse Coding

A dictionary is a concatenation of some orthonormal bases. So the expression is not unique, and many combination methods arise. But the goals of these methods are all to get a highly sparse decomposition which contains very few nonzero terms. This puts forward an optimization problem:(6)
α
′
=
argmin
α
⁡
α
0
s
.
t
.
W
=
Π
α
,where Π
=
M
Θ and the symbol ·
0 indicates the l
0 norm which constrains the nonsparse items. It has been turned out to be right that if the isometry constant Δ satisfied the following equations:(7)
1
-
Δ
α
2
2
≤
Π
α
2
2
≤
1
+
Δ
α
2
2
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
Δ
<
1
,then a unique K-sparse solution of the vectorα will be found. But a drawback to (4) is that it may be NP-hard. Fortunately, one can get a convex relaxation on (4) with a l
1 norm as follows:(8)
α
′
=
argmin
α
⁡
α
1
s
.
t
.
W
=
Π
α
.Thel
1 norm is a very common solution to solve sparse estimation problems and it has been turned out to be effective. A variety of different solution packages can be found to solve the l
1 norm problem. This paper will apply l
1-regularized least squares, namely, the feature-sign search algorithm, to achieve the sparse representation of the object motion trajectory. This algorithm is mentioned in [13, 17, 18].


## 3.1. Atom Dictionary

In reality, wavelets perform poorly on high-frequency sinusoids and, on the contrary, sinusoids perform poorly on impulsive events [15]. So it would not be accurate to recover the trajectory curves just with one certain basis. Dirac function and trigonometric function are two kinds of fundamental orthonormal bases, and most of the real trajectory curves can be represented by these two functions. If Dirac basis and DCT basis are put together in one matrix, this will generate an atom dictionary which performs better than any independent trajectory basis. And the coefficients of the dictionary must be sparse (i.e., the coefficients include many zero items). Each column of this dictionary is called atom, and the concatenation of Dirac basis and DCT basis has turned out to be suitable for most situations [16]. In the paper this dictionary is used in experiments with experimental data instead of trajectory bases.


## 3.2. Sparse Coding

A dictionary is a concatenation of some orthonormal bases. So the expression is not unique, and many combination methods arise. But the goals of these methods are all to get a highly sparse decomposition which contains very few nonzero terms. This puts forward an optimization problem:(6)
α
′
=
argmin
α
⁡
α
0
s
.
t
.
W
=
Π
α
,where Π
=
M
Θ and the symbol ·
0 indicates the l
0 norm which constrains the nonsparse items. It has been turned out to be right that if the isometry constant Δ satisfied the following equations:(7)
1
-
Δ
α
2
2
≤
Π
α
2
2
≤
1
+
Δ
α
2
2
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
Δ
<
1
,then a unique K-sparse solution of the vectorα will be found. But a drawback to (4) is that it may be NP-hard. Fortunately, one can get a convex relaxation on (4) with a l
1 norm as follows:(8)
α
′
=
argmin
α
⁡
α
1
s
.
t
.
W
=
Π
α
.Thel
1 norm is a very common solution to solve sparse estimation problems and it has been turned out to be effective. A variety of different solution packages can be found to solve the l
1 norm problem. This paper will apply l
1-regularized least squares, namely, the feature-sign search algorithm, to achieve the sparse representation of the object motion trajectory. This algorithm is mentioned in [13, 17, 18].


## 4. Algorithm Solution

Having mastered the above theories, applications of sparse approximation algorithm in the NRSfM problem will be presented in the following words.The goal of the NRSfM is to estimate the camera motion matrixM and then recover the true nonrigid 3D coordinate matrix S from the measurement matrix W. For this purpose, this paper needs to estimate the matrix M at first. Fortunately, there has been a well solution for this objective. Dai et al. [12] have put forward a prior-free method for shape basis model. And this method could also be used in trajectory space. Having solved the motion matrix M, then an overcomplete atom dictionary can be predefined as the trajectory basis. The sparse approximation algorithm will help to solve the corresponding coefficients. So the 3D shape matrix would be obtained with the trajectory basis and the corresponding coefficients.


### 4.1. Estimate Camera Motion Matrix

One can compute the rank-3K decomposition of a measurement matrix via singular value decomposition (SVD) [18] and obtain the equation as W
=
M
~
A
~. For the reason that there exist any rank-3K matrices G which satisfied the equation that W
=
M
~
A
~
=
M
~
G
G
-
1
A
~
=
M
A, so the decomposition is not unique. In this paper, a semidefinite programming (SDP) of small and fixed size mentioned in [15] is applied to solve the above problem. Dai’s method is also effective in estimating G in trajectory space by trace minimization. The linear equations system can be obtained as follows.min
⁡
trace
(
Q
k
), such that(9)
Q
k
=
G
k
G
k
T
,
Q
k
⪰
0
,
(
M
~
i
⊗
M
~
i
)
1
,
:
-
M
~
i
⊗
M
~
i
4
,
:
M
~
i
⊗
M
~
i
2
,
:
vec
⁡
Q
k
=
0where G
k denotes the kth column-triplet of G, M
~
i denotes the ith double rows of M
~, (
M
~
i
⊗
M
~
i
)
(
j
,
:
) denotes the jth row of (
M
~
i
⊗
M
~
i
), and vec
⁡
(
) denotes the vectorization operator. The above linear system will get a unique solution via a standard SDP. Then G
k can be found by using SVD. Once the G is obtained, one is allowed to compute the camera motion matrix M by the following equation:(10)
M
~
i
G
k
=
θ
i
k
M
i
,
i
=
1
,
…
,
F
.Note that θ
i
k is included in the Θ
3
F
×
3
k. Finally, the motion matrix M is represented as M
=
blkdiag
(
[
M
1
,
M
2
,
…
,
M
F
]
).


### 4.2. Estimate the Coefficients MatrixA

The coefficients matrixA is a sparse matrix; that is to say, matrix A consists of many nonzero items. And from the previous statement, A can be solved by a sparse approximation method. Having known the camera motion matrix M, Π can be obtained from the equation Π
=
M
Θ. Then an alternate strategy can be described as follows:(11)
α
i
′
=
argmin
α
i
⁡
α
i
1
s
.
t
.
w
i
=
Π
α
i
,where W
=
[
w
1
,
w
2
,
…
,
w
i
], i
=
1
,
…
,
P.To simplify the expression, it can be represented by the following optimization problem:(12)
min
⁡
x
⁡
f
x
≡
w
i
-
Π
α
i
2
+
γ
α
i
1
,where γ is the penalty coefficient and it must be a constant.An iterative feature-sign search algorithm, which can solve forα in the Fourier domain, can be used to solve this objective efficiently. The details of the algorithm have been introduced in [17]. The coefficients matrix A can be generated from the vector α
i. At last, the shape matrix S will be obtained via the equation S
=
Θ
A.


## 4.1. Estimate Camera Motion Matrix

One can compute the rank-3K decomposition of a measurement matrix via singular value decomposition (SVD) [18] and obtain the equation as W
=
M
~
A
~. For the reason that there exist any rank-3K matrices G which satisfied the equation that W
=
M
~
A
~
=
M
~
G
G
-
1
A
~
=
M
A, so the decomposition is not unique. In this paper, a semidefinite programming (SDP) of small and fixed size mentioned in [15] is applied to solve the above problem. Dai’s method is also effective in estimating G in trajectory space by trace minimization. The linear equations system can be obtained as follows.min
⁡
trace
(
Q
k
), such that(9)
Q
k
=
G
k
G
k
T
,
Q
k
⪰
0
,
(
M
~
i
⊗
M
~
i
)
1
,
:
-
M
~
i
⊗
M
~
i
4
,
:
M
~
i
⊗
M
~
i
2
,
:
vec
⁡
Q
k
=
0where G
k denotes the kth column-triplet of G, M
~
i denotes the ith double rows of M
~, (
M
~
i
⊗
M
~
i
)
(
j
,
:
) denotes the jth row of (
M
~
i
⊗
M
~
i
), and vec
⁡
(
) denotes the vectorization operator. The above linear system will get a unique solution via a standard SDP. Then G
k can be found by using SVD. Once the G is obtained, one is allowed to compute the camera motion matrix M by the following equation:(10)
M
~
i
G
k
=
θ
i
k
M
i
,
i
=
1
,
…
,
F
.Note that θ
i
k is included in the Θ
3
F
×
3
k. Finally, the motion matrix M is represented as M
=
blkdiag
(
[
M
1
,
M
2
,
…
,
M
F
]
).


## 4.2. Estimate the Coefficients MatrixA

The coefficients matrixA is a sparse matrix; that is to say, matrix A consists of many nonzero items. And from the previous statement, A can be solved by a sparse approximation method. Having known the camera motion matrix M, Π can be obtained from the equation Π
=
M
Θ. Then an alternate strategy can be described as follows:(11)
α
i
′
=
argmin
α
i
⁡
α
i
1
s
.
t
.
w
i
=
Π
α
i
,where W
=
[
w
1
,
w
2
,
…
,
w
i
], i
=
1
,
…
,
P.To simplify the expression, it can be represented by the following optimization problem:(12)
min
⁡
x
⁡
f
x
≡
w
i
-
Π
α
i
2
+
γ
α
i
1
,where γ is the penalty coefficient and it must be a constant.An iterative feature-sign search algorithm, which can solve forα in the Fourier domain, can be used to solve this objective efficiently. The details of the algorithm have been introduced in [17]. The coefficients matrix A can be generated from the vector α
i. At last, the shape matrix S will be obtained via the equation S
=
Θ
A.


## 5. Experiments

The training dataset used in this paper is from CMU Motion Capture dataset, which covers a variety of human actions. The random synthetic data are used only in the condition of algorithm validation and the sparse approximation method performs clearly better than others. So the result will be not mentioned and this paper reports the results on real sequences only. The real scenes tested in this paper mainly include the commonly sequences of “Yoga” (41/307), “drinking” (41/1102), “pickup” (41/357), “shark” (91/240), “Stretch” (41/740), and “walking” (55/260), where(
F
/
P
) denotes the number of points (
P
) and frames (
F
).


### 5.1. Sparse Coefficients Estimations

At first, this paper does one experiment on “Yoga” sequence. A union atom dictionary of DCT and Dirac function is used in this experiment. Having recovered the 3D coordinates of the deformable object, the corresponding coefficients of the atom dictionary are obtained naturally. And the experimental result is shown in Figure1. Figure 1 shows the corresponding coefficients range from the 1st to the 250th atoms.Figure 1
Coefficients distribution from the 1st to the 250th atoms on the “Yoga” sequence (better viewed in color).Coordinate “atom” refers to the basis order of the dictionary generated by trajectory basis functions. That is to say, the “atom” corresponds to the columns of one dictionary matrix. Coordinate “coefficients” refer to the corresponding coefficients of each atom. From the above graph, one can easily find that most of the atom coefficients are zeros. It proves that the assumption is suitable that the coefficients matrix is a sparse matrix. At the same time, the result also verifies the feasibility of the sparse approximation method.


### 5.2. Experimental Result on One Real Sequence

It has been proved that DCT was better than the others in the application of trajectory basis model and it is the most common method. This paper compares the sparse method against the trajectory basis methods in the situation of selecting DCT bases with different size. The atom dictionary used in sparse approximation method is also generated by a union of DCT basis and Dirac basis. This subsection presents the different performances on the “Yoga” motion sequence of these methods and gives the shape reconstruction error on one diagram as shown in Figure2. The calculation formula of the mean 3D error is denoted as follows: (13)
err
⁡
S
=
S
-
S
~
2
,where S indicates the real shape sequence and S
~ indicates the estimated one.Figure 2
Shape estimation error on the “Yoga” motion sequence. From left to right, each column indicates different performances when the sizes of DCT basis are 3, 6, 9, 12, and 13, respectively, and the most right column gives the result of sparse methods (better viewed in color).Clearly, selecting 12 as the size of DCT basis is the best solution and the shape estimation error is the smallest when recovering the object shape with DCT basis model. But when considering with the sparse coding method, the sparse method is obviously better than the trajectory basis methods even in any size of DCT basis. It is very easy to understand that the atom dictionary contains all predefined trajectory bases even those not used in traditional trajectory basis. The difference between these two methods is that the sparse method only sets the coefficients of the unused trajectory bases to zero and these unused trajectory bases may still be used in other trajectory curves. But, in the trajectory basis model, once the trajectory bases were truncated in a fixed size, the trajectory curves could only be represented by these truncated bases.


### 5.3. Estimation Errors

This subsection gives a statistical comparison between the well-size DCT trajectory basis method [19, 20] and the sparse approximation method. The truncated size of the trajectory bases is learned by the previous work done by other researchers and it has been proved to be reliable. By using the obtained data from the “Yoga” sequences, the mean 3D error of each frame is computed with these two methods, respectively. From the above subsection, the best solution of the DCT basis model could be found. So the size of the DCT trajectory basis in this scene is 12 and the penalty coefficient of the sparse method is 0.1. The shape estimation errors of each frame are shown in Figure 3.Figure 3
Estimation errors of each frame on the “Yoga” sequence. The top line denotes the results curve with DCT method when the size of DCT bases is 12, and another line denotes the results curve with sparse coding method (better viewed in color).From Figure3, it is very clear to know that, despite using the traditional DCT trajectory basis method in the best situation, the shape estimation errors of each frame obtained by sparse approximation method are smaller than the estimation errors obtained by DCT basis model. That is to say, the sparse approximation method performs better than the DCT trajectory basis method in dealing with the NRSfM problems in the “Yoga” scene.


### 5.4. Tests on Different Scenes

To verify the effectiveness of the sparse coding method, this paper repeats the experiment in different scenes. The experiment is done with some real sequences which include “Yoga,” “walking,” “pickup,” “shark,” and “drink.” The best size of DCT trajectory bases is obtained from the previous experiments which have been proved to be effective. This experiment applies the best solution of DCT basis model to every scene and compares the results of DCT basis model with the sparse approximation method. From previous works, the best DCT basis size of “Yoga” is 12, “walking” is 8, “pickup” is 12, “shark” is 2, and “drinking” is 10. The penalty coefficient of the sparse approximation method is 0.1. The experimental result is shown in Figure4.Figure 4
Shape estimation error on different scenes (better viewed in color).From Figure4, one can find that the shape estimation errors of every scene obtained by DCT trajectory basis model are higher than the estimation errors obtained by sparse approximation method. That is to say, sparse approximation method is better than DCT trajectory basis method in most of the scenes; even the size of DCT trajectory basis is selected in the best situation. At worst, the former will get a similar result with the latter in the situation that the truncated DCT bases can represent the trajectory curves of the feature points largely. A large number of experiments have been done to prove that the sparse approximation method is a better application in the NRSfM problem.


### 5.5. Sample Shape Reconstruction Results

To verify the effectiveness of the sparse approximation method that this paper mentioned, a lot of experiments have been done. At this subsection of the paper, some experimental results were shown clearly to enhance the persuasion. This subsection gives out the shape reconstruction results of the “Yoga,” “shark,” and “Stretch” sequences using the DCT method and the sparse approximation method, respectively. The truncated size of DCT basis in the “Yoga” experiment is 12, and the penalty coefficient of the sparse method is 0.1. The experimental results are seen in Figure5. The truncated size of DCT basis in the “shark” experiment is 2, and the penalty coefficient of the sparse method is 0.1. The experimental results are seen in Figure 6.Figure 5
3D reconstruction results on the “Yoga” sequence with two methods, respectively. The red dots denote the ground truth coordinates and the blue circles denote the estimation coordinates. The top row is the reconstruction result with sparse approximation and the bottom row is with the DCT trajectory basis method. Both of the results of these two methods are shown with the1
th, 60
th, 120
th, and 180
th frames (better viewed in color).Figure 6
3D reconstruction results on the “shark” sequence with two methods, respectively. The red dots denote the ground truth coordinates and the blue circles denote the estimation coordinates. The top row is the reconstruction result with sparse approximation and the bottom row is with the DCT trajectory basis method. Both of the results of these two methods are shown with the1
th, 60
th, 120
th, and 180
th frames through different visualizations (better viewed in color).To verify the effectiveness of sparse approximation method, this subsection also gives out the experimental result of “Stretch” sequence; Figure7 shows the shape reconstruction result of the “Stretch” sequence with two methods, respectively. The truncated size of DCT basis in the “Stretch” experiment is 12 and the DCT basis method will get the best solution in the DCT basis model situation, and the penalty coefficient of the sparse method is 0.1.Figure 7
3D reconstruction results on the “Stretch” sequence with two methods, respectively. The red dots denote the ground truth coordinates and the blue circles denote the estimation coordinates. The top row is the reconstruction result with sparse approximation and the bottom row is with the DCT trajectory basis method. Both of the results of these two methods are shown with the65
th, 105
th, 145
th, and 185
th frames through different visualizations (better viewed in color).From Figures5, 6, and 7, one can easily find that the reconstruction points with sparse approximation method are more close to the original 3D feature points. The experimental results have shown the advantage of the sparse approximation method. The approach mentioned in this paper is obviously more effective than the traditional DCT trajectory basis methods.


## 5.1. Sparse Coefficients Estimations

At first, this paper does one experiment on “Yoga” sequence. A union atom dictionary of DCT and Dirac function is used in this experiment. Having recovered the 3D coordinates of the deformable object, the corresponding coefficients of the atom dictionary are obtained naturally. And the experimental result is shown in Figure1. Figure 1 shows the corresponding coefficients range from the 1st to the 250th atoms.Figure 1
Coefficients distribution from the 1st to the 250th atoms on the “Yoga” sequence (better viewed in color).Coordinate “atom” refers to the basis order of the dictionary generated by trajectory basis functions. That is to say, the “atom” corresponds to the columns of one dictionary matrix. Coordinate “coefficients” refer to the corresponding coefficients of each atom. From the above graph, one can easily find that most of the atom coefficients are zeros. It proves that the assumption is suitable that the coefficients matrix is a sparse matrix. At the same time, the result also verifies the feasibility of the sparse approximation method.


## 5.2. Experimental Result on One Real Sequence

It has been proved that DCT was better than the others in the application of trajectory basis model and it is the most common method. This paper compares the sparse method against the trajectory basis methods in the situation of selecting DCT bases with different size. The atom dictionary used in sparse approximation method is also generated by a union of DCT basis and Dirac basis. This subsection presents the different performances on the “Yoga” motion sequence of these methods and gives the shape reconstruction error on one diagram as shown in Figure2. The calculation formula of the mean 3D error is denoted as follows: (13)
err
⁡
S
=
S
-
S
~
2
,where S indicates the real shape sequence and S
~ indicates the estimated one.Figure 2
Shape estimation error on the “Yoga” motion sequence. From left to right, each column indicates different performances when the sizes of DCT basis are 3, 6, 9, 12, and 13, respectively, and the most right column gives the result of sparse methods (better viewed in color).Clearly, selecting 12 as the size of DCT basis is the best solution and the shape estimation error is the smallest when recovering the object shape with DCT basis model. But when considering with the sparse coding method, the sparse method is obviously better than the trajectory basis methods even in any size of DCT basis. It is very easy to understand that the atom dictionary contains all predefined trajectory bases even those not used in traditional trajectory basis. The difference between these two methods is that the sparse method only sets the coefficients of the unused trajectory bases to zero and these unused trajectory bases may still be used in other trajectory curves. But, in the trajectory basis model, once the trajectory bases were truncated in a fixed size, the trajectory curves could only be represented by these truncated bases.


## 5.3. Estimation Errors

This subsection gives a statistical comparison between the well-size DCT trajectory basis method [19, 20] and the sparse approximation method. The truncated size of the trajectory bases is learned by the previous work done by other researchers and it has been proved to be reliable. By using the obtained data from the “Yoga” sequences, the mean 3D error of each frame is computed with these two methods, respectively. From the above subsection, the best solution of the DCT basis model could be found. So the size of the DCT trajectory basis in this scene is 12 and the penalty coefficient of the sparse method is 0.1. The shape estimation errors of each frame are shown in Figure 3.Figure 3
Estimation errors of each frame on the “Yoga” sequence. The top line denotes the results curve with DCT method when the size of DCT bases is 12, and another line denotes the results curve with sparse coding method (better viewed in color).From Figure3, it is very clear to know that, despite using the traditional DCT trajectory basis method in the best situation, the shape estimation errors of each frame obtained by sparse approximation method are smaller than the estimation errors obtained by DCT basis model. That is to say, the sparse approximation method performs better than the DCT trajectory basis method in dealing with the NRSfM problems in the “Yoga” scene.


## 5.4. Tests on Different Scenes

To verify the effectiveness of the sparse coding method, this paper repeats the experiment in different scenes. The experiment is done with some real sequences which include “Yoga,” “walking,” “pickup,” “shark,” and “drink.” The best size of DCT trajectory bases is obtained from the previous experiments which have been proved to be effective. This experiment applies the best solution of DCT basis model to every scene and compares the results of DCT basis model with the sparse approximation method. From previous works, the best DCT basis size of “Yoga” is 12, “walking” is 8, “pickup” is 12, “shark” is 2, and “drinking” is 10. The penalty coefficient of the sparse approximation method is 0.1. The experimental result is shown in Figure4.Figure 4
Shape estimation error on different scenes (better viewed in color).From Figure4, one can find that the shape estimation errors of every scene obtained by DCT trajectory basis model are higher than the estimation errors obtained by sparse approximation method. That is to say, sparse approximation method is better than DCT trajectory basis method in most of the scenes; even the size of DCT trajectory basis is selected in the best situation. At worst, the former will get a similar result with the latter in the situation that the truncated DCT bases can represent the trajectory curves of the feature points largely. A large number of experiments have been done to prove that the sparse approximation method is a better application in the NRSfM problem.


## 5.5. Sample Shape Reconstruction Results

To verify the effectiveness of the sparse approximation method that this paper mentioned, a lot of experiments have been done. At this subsection of the paper, some experimental results were shown clearly to enhance the persuasion. This subsection gives out the shape reconstruction results of the “Yoga,” “shark,” and “Stretch” sequences using the DCT method and the sparse approximation method, respectively. The truncated size of DCT basis in the “Yoga” experiment is 12, and the penalty coefficient of the sparse method is 0.1. The experimental results are seen in Figure5. The truncated size of DCT basis in the “shark” experiment is 2, and the penalty coefficient of the sparse method is 0.1. The experimental results are seen in Figure 6.Figure 5
3D reconstruction results on the “Yoga” sequence with two methods, respectively. The red dots denote the ground truth coordinates and the blue circles denote the estimation coordinates. The top row is the reconstruction result with sparse approximation and the bottom row is with the DCT trajectory basis method. Both of the results of these two methods are shown with the1
th, 60
th, 120
th, and 180
th frames (better viewed in color).Figure 6
3D reconstruction results on the “shark” sequence with two methods, respectively. The red dots denote the ground truth coordinates and the blue circles denote the estimation coordinates. The top row is the reconstruction result with sparse approximation and the bottom row is with the DCT trajectory basis method. Both of the results of these two methods are shown with the1
th, 60
th, 120
th, and 180
th frames through different visualizations (better viewed in color).To verify the effectiveness of sparse approximation method, this subsection also gives out the experimental result of “Stretch” sequence; Figure7 shows the shape reconstruction result of the “Stretch” sequence with two methods, respectively. The truncated size of DCT basis in the “Stretch” experiment is 12 and the DCT basis method will get the best solution in the DCT basis model situation, and the penalty coefficient of the sparse method is 0.1.Figure 7
3D reconstruction results on the “Stretch” sequence with two methods, respectively. The red dots denote the ground truth coordinates and the blue circles denote the estimation coordinates. The top row is the reconstruction result with sparse approximation and the bottom row is with the DCT trajectory basis method. Both of the results of these two methods are shown with the65
th, 105
th, 145
th, and 185
th frames through different visualizations (better viewed in color).From Figures5, 6, and 7, one can easily find that the reconstruction points with sparse approximation method are more close to the original 3D feature points. The experimental results have shown the advantage of the sparse approximation method. The approach mentioned in this paper is obviously more effective than the traditional DCT trajectory basis methods.


## 6. Conclusions

This paper introduces a novel sparse approximation method to resolve the NRSfM problem. It is quite easy to understand and is guaranteed to get an optimal solution. It shows that one needs not to consider the size of truncated DCT bases via using the sparse approximation method. In this paper, only the union of DCT and Dirac function is applied into the reconstruction of 3D motion object. It is expected that camera rotation matrix estimation error can be obtained more accurately.In this paper, the present experiments are all in a situation of orthographic camera models. And thanks to recent progress in signal sparse coding, the proposed solution can be easily applied into solving the NRSfM problem. This paper just gives out one thought to solve the size of the trajectory bases. Some other ideas can also be used in this problem. At the same time, obtaining a rotation matrix accurately will help to get a satisfied result.



---

*Source: 435385-2015-10-01.xml*