TY - JOUR
T1 - Automatic motion capture data denoising via filtered subspace clustering and low rank matrix approximation
AU - Liu, Xin
AU - CHEUNG, Yiu Ming
AU - Peng, Shu Juan
AU - Cui, Zhen
AU - Zhong, Bineng
AU - Du, Ji Xiang
N1 - Funding Information:
The work described in this paper was partly supported by the National Science Foundation of China under Grants 61202298 , 61272366 , 61300138 , 61202297 , 61202299 and 61175121 , the National Science Foundation of Fujian Province (No. 2013J06014 , No. 2014J01239 ), and also partially supported by the Faculty Research Grant of Hong Kong Baptist University (No. FRG2/12-13/082 ) and the Strategic Development Fund of HKBU: 03-17-033.
PY - 2014/12
Y1 - 2014/12
N2 - In this paper, we present an automatic Motion Capture (MoCap) data denoising approach via filtered subspace clustering and low rank matrix approximation. Within the proposed approach, we formulate the MoCap data denoising problem as a concatenation of piecewise motion matrix recovery problem. To this end, we first present a filtered subspace clustering approach to separate the noisy MoCap sequence into a group of disjoint piecewise motions, in which the moving trajectories of each piecewise motion always share the similar low dimensional subspace representation. Then, we employ the accelerated proximal gradient (APG) algorithm to find a complete low-rank matrix approximation to each noisy piecewise motion and further apply a moving average filter to smooth the moving trajectories between the connected motions. Finally, the whole noisy MoCap data can be automatically restored by a concatenation of all the recovered piecewise motions sequentially. The proposed approach does not need any physical information about the underling structure of MoCap data or require auxiliary data sets for training priors. The experimental results have shown an improved performance in comparison with the state-of-the-art competing approaches.
AB - In this paper, we present an automatic Motion Capture (MoCap) data denoising approach via filtered subspace clustering and low rank matrix approximation. Within the proposed approach, we formulate the MoCap data denoising problem as a concatenation of piecewise motion matrix recovery problem. To this end, we first present a filtered subspace clustering approach to separate the noisy MoCap sequence into a group of disjoint piecewise motions, in which the moving trajectories of each piecewise motion always share the similar low dimensional subspace representation. Then, we employ the accelerated proximal gradient (APG) algorithm to find a complete low-rank matrix approximation to each noisy piecewise motion and further apply a moving average filter to smooth the moving trajectories between the connected motions. Finally, the whole noisy MoCap data can be automatically restored by a concatenation of all the recovered piecewise motions sequentially. The proposed approach does not need any physical information about the underling structure of MoCap data or require auxiliary data sets for training priors. The experimental results have shown an improved performance in comparison with the state-of-the-art competing approaches.
KW - Accelerated proximal gradient
KW - Filtered subspace clustering
KW - Low-rank matrix approximation
KW - MoCap data denoising
KW - Moving average filter
UR - http://www.scopus.com/inward/record.url?scp=84904017309&partnerID=8YFLogxK
U2 - 10.1016/j.sigpro.2014.06.009
DO - 10.1016/j.sigpro.2014.06.009
M3 - Journal article
AN - SCOPUS:84904017309
SN - 0165-1684
VL - 105
SP - 350
EP - 362
JO - Signal Processing
JF - Signal Processing
ER -