Exploiting temporal stability and low-rank structure for motion capture data refinement

被引:55
|
作者
Feng, Yinfu [1 ]
Xiao, Jun [1 ]
Zhuang, Yueting [1 ]
Yang, Xiaosong [2 ]
Zhang, Jian J. [2 ]
Song, Rong [1 ]
机构
[1] Zhejiang Univ, Sch Comp Sci, Hangzhou 310027, Zhejiang, Peoples R China
[2] Bournemouth Univ, Natl Ctr Comp Animat, Poole BH12 5BB, Dorset, England
关键词
Motion capture data; Data refinement; Matrix completion; Temporal stability; MARKERS;
D O I
10.1016/j.ins.2014.03.013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Inspired by the development of the matrix completion theories and algorithms, a low-rank based motion capture (mocap) data refinement method has been developed, which has achieved encouraging results. However, it does not guarantee a stable outcome if we only consider the low-rank property of the motion data. To solve this problem, we propose to exploit the temporal stability of human motion and convert the mocap data refinement problem into a robust matrix completion problem, where both the low-rank structure and temporal stability properties of the mocap data as well as the noise effect are considered. An efficient optimization method derived from the augmented Lagrange multiplier algorithm is presented to solve the proposed model. Besides, a trust data detection method is also introduced to improve the degree of automation for processing the entire set of the data and boost the performance. Extensive experiments and comparisons with other methods demonstrate the effectiveness of our approaches on both predicting missing data and de-noising. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:777 / 793
页数:17
相关论文
共 50 条
  • [1] Exploiting Temporal Stability and Low-Rank Structure for Localization in Mobile Networks
    Rallapalli, Swati
    Qiu, Lili
    Zhang, Yin
    Chen, Yi-Chao
    MOBICOM 10 & MOBIHOC 10: PROCEEDINGS OF THE 16TH ANNUAL INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING AND THE 11TH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 2010, : 161 - 172
  • [2] LOW-RANK BASED COMPACT REPRESENTATION OF MOTION CAPTURE DATA
    Hou, Junhui
    Chau, Lap-Pui
    He, Ying
    Magnenat-Thalmann, Nadia
    2014 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2014, : 1480 - 1484
  • [3] A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement
    Hu, Wenyu
    Lu, Yao
    Ren, Jin
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2022, 410
  • [4] RESTORING CORRUPTED MOTION CAPTURE DATA VIA JOINTLY LOW-RANK MATRIX COMPLETION
    Hou, Junhui
    Bian, Zhen-Peng
    Chau, Lap-Pui
    Magnenat-Thalmann, Nadia
    He, Ying
    2014 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO (ICME), 2014,
  • [5] A Feature Article Cluster on Exploiting Structure in Data Analytics: Low-Rank and Sparse Structures
    Vaswani, Namrata
    IEEE SIGNAL PROCESSING MAGAZINE, 2018, 35 (04) : 12 - 13
  • [6] Modelless Data Quality Improvement of Streaming Synchrophasor Measurements by Exploiting the Low-Rank Hankel Structure
    Hao, Yingshuai
    Wang, Meng
    Chow, Joe H.
    Farantatos, Evangelos
    Patel, Mahendra
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2018, 33 (06) : 6966 - 6977
  • [7] Exploiting low-rank structure in semidefinite programming by approximate operator splitting
    Souto, Mario
    Garcia, Joaquim D.
    Veiga, Alvaro
    OPTIMIZATION, 2022, 71 (01) : 117 - 144
  • [8] Correction of Simultaneous Bad Measurements by Exploiting the Low-rank Hankel Structure
    Zhang, Shuai
    Wang, Meng
    2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 646 - 650
  • [9] Exploiting Low-Rank Structure from Latent Domains for Domain Generalization
    Xu, Zheng
    Li, Wen
    Niu, Li
    Xu, Dong
    COMPUTER VISION - ECCV 2014, PT III, 2014, 8691 : 628 - 643
  • [10] Detecting and Tracking Community Structure in Temporal Networks: A Low-Rank
    Al-sharoa, Esraa
    Al-khassaweneh, Mahmood
    Aviyente, Selin
    IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2019, 5 (04): : 723 - 738