Human motion recovery utilizing truncated schatten p-norm and kinematic constraints

被引:23
作者
Chen, Beijia [1 ]
Sun, Huaijiang [1 ]
Xia, Guiyu [2 ]
Feng, Lei [3 ]
Li, Bin [4 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing 210094, Jiangsu, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Sch Informat & Control, Nanjing 210094, Jiangsu, Peoples R China
[3] JinLing Inst Technol, Sch Comp Engn, Nanjing 210094, Jiangsu, Peoples R China
[4] Sogou Inc, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Motion capture data; Low-rank matrix completion; Human motion recovery; Kinematic constraints; CAPTURE DATA RECOVERY; MATRIX COMPLETION; MISSING MARKERS; REGULARIZATION; REPRESENTATION; MINIMIZATION;
D O I
10.1016/j.ins.2018.02.052
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Human motion capture (mocap) data, which records the movements of joints of a human body, has been widely used in many areas. However, the raw captured data inevitably contains missing data due to the limitations of capture systems. Recently, by exploiting the low-rank prior embedded in mocap data, several approaches have resorted to the low-rank matrix completion (LRMC) to fill in the missing data and obtained encouraging results. In order to solve the resulting rank minimization problem which is known as NP-hard, all existing methods use the convex nuclear norm as the surrogate of rank to pursue the convexity of the objective function. However, the nuclear norm, which ignores physical interpretations of singular values and has over-shrinking problem, obtains less accurate approximation than its nonconvex counterpart. Therefore, this paper presents a nonconvex LRMC based method wherein we exploit the state-of-art nonconvex truncated schatten-p norm to approximate rank. Moreover, we add two significant constraints to the low-rank based model to preserve the spatial-temporal properties and structural characteristics embedded in human motion. We also develop a framework based on alternating direction multiplier method (ADMM) to solve the resulting nonconvex problem. Extensive experiment results demonstrate that the proposed method significantly outperforms the existing state-of-art methods in terms of both recovery error and agreement with human intuition. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:89 / 108
页数:20
相关论文
共 42 条
[1]  
[Anonymous], 2011, Advances in Neural Information Processing Systems
[2]  
[Anonymous], 1999, P ACM S VIRT REAL SO
[3]  
[Anonymous], 2005, Proceedings of the 22Nd International Conference on Machine Learning, ICML'05, DOI 10.1145/1102351.1102441
[4]  
Aristidou Andreas, 2008, 2008 2nd International Conference on Bioinformatics and Biomedical Engineering (ICBBE '08), P1343, DOI 10.1109/ICBBE.2008.665
[5]  
Boyd S., 2011, ALTERNATING DIRECTIO
[6]  
Cabral R. S., 2011, Advances in neural information processing systems, P190
[7]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[8]   Performance animation from low-dimensional control signals [J].
Chai, JX ;
Hodgins, JK .
ACM TRANSACTIONS ON GRAPHICS, 2005, 24 (03) :686-696
[9]   Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion [J].
Dai, Wei ;
Milenkovic, Olgica ;
Kerman, Ely .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 59 (07) :3120-3132
[10]   Compressive Sensing via Nonlocal Low-Rank Regularization [J].
Dong, Weisheng ;
Shi, Guangming ;
Li, Xin ;
Ma, Yi ;
Huang, Feng .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2014, 23 (08) :3618-3632