Automatic motion capture data denoising via filtered subspace clustering and low rank matrix approximation

被引:25
作者
Liu, Xin [1 ]
Cheung, Yiu-ming [2 ,3 ,4 ]
Peng, Shu-juan [1 ]
Cui, Zhen [1 ,5 ]
Zhong, Bineng [1 ]
Du, Ji-Xiang [1 ]
机构
[1] Huaqiao Univ, Coll Comp Sci & Technol, Xiamen, Peoples R China
[2] Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[3] Hong Kong Baptist Univ, Inst Computat & Theoret Studies, Hong Kong, Hong Kong, Peoples R China
[4] Hong Kong Baptist Univ, Beijing Normal Univ, United Int Coll, Hong Kong, Hong Kong, Peoples R China
[5] Chinese Acad Sci, Key Lab Intelligent Informat Proc, Beijing, Peoples R China
基金
美国国家科学基金会;
关键词
MoCap data denoising; Filtered subspace clustering; Low-rank matrix approximation; Accelerated proximal gradient; Moving average filter; FACTORIZATION; SEGMENTATION; ALGORITHM; RECOVERY;
D O I
10.1016/j.sigpro.2014.06.009
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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. (c) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:350 / 362
页数:13
相关论文
共 30 条
[1]  
[Anonymous], 2010, ICML 10 JUNE 21 24 2
[2]  
[Anonymous], 2008, PROC IEEE C COMPUT V
[3]  
Barbic J, 2004, PROC GRAPH INTERF, P185
[4]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[5]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)
[6]  
Celepcikay, 2013, P IEEE INT C IM PROC
[7]   On rival penalization controlled competitive learning for clustering with automatic cluster number selection [J].
Cheung, YM .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (11) :1583-1588
[8]  
Elhamifar E., 2009, P IEEE INT C COMP VI, P310
[9]   RANDOM SAMPLE CONSENSUS - A PARADIGM FOR MODEL-FITTING WITH APPLICATIONS TO IMAGE-ANALYSIS AND AUTOMATED CARTOGRAPHY [J].
FISCHLER, MA ;
BOLLES, RC .
COMMUNICATIONS OF THE ACM, 1981, 24 (06) :381-395
[10]  
Günter S, 2007, J MACH LEARN RES, V8, P1893