TY - JOUR
T1 - Low-latency compression of mocap data using learned spatial decorrelation transform
AU - Hou, Junhui
AU - Chau, Lap Pui
AU - Magnenat-Thalmann, Nadia
AU - He, Ying
N1 - Funding Information:
We would like to thank the anonymous reviewers for their constructive comments. This research, which is carried out at BeingThere Centre, collaboration among IMI of Nanyang Technological University (NTU) Singapore, ETH Zrich, and UNC Chapel Hill, is supported by the Singapore National Research Foundation ( NRF ) under its International Research Centre @ Singapore Funding Initiative and administered by the Interactive Digital Media Programme Office (IDMPO). Ying He is partially supported by MOE2013-T2-2-011 , RG40/12 and RG23/15 ( Ministry of Education of Singapore ).
Publisher Copyright:
© 2016 Elsevier B.V. All rights reserved.
PY - 2016/3
Y1 - 2016/3
N2 - Due to the growing needs of motion capture (mocap) in movie, video games, sports, etc., it is highly desired to compress mocap data for efficient storage and transmission. Unfortunately, the existing compression methods have either high latency or poor compression performance, making them less appealing for time-critical applications and/or network with limited bandwidth. This paper presents two efficient methods to compress mocap data with low latency. The first method processes the data in a frame-by-frame manner so that it is ideal for mocap data streaming. The second one is clip-oriented and provides a flexible trade-off between latency and compression performance. It can achieve higher compression performance while keeping the latency fairly low and controllable. Observing that mocap data exhibits some unique spatial characteristics, we learn an orthogonal transform to reduce the spatial redundancy. We formulate the learning problem as the least square of reconstruction error regularized by orthogonality and sparsity, and solve it via alternating iteration. We also adopt a predictive coding and temporal DCT for temporal decorrelation in the frame- and clip-oriented methods, respectively. Experimental results show that the proposed methods can produce higher compression performance at lower computational cost and latency than the state-of-the-art methods. Moreover, our methods are general and applicable to various types of mocap data.
AB - Due to the growing needs of motion capture (mocap) in movie, video games, sports, etc., it is highly desired to compress mocap data for efficient storage and transmission. Unfortunately, the existing compression methods have either high latency or poor compression performance, making them less appealing for time-critical applications and/or network with limited bandwidth. This paper presents two efficient methods to compress mocap data with low latency. The first method processes the data in a frame-by-frame manner so that it is ideal for mocap data streaming. The second one is clip-oriented and provides a flexible trade-off between latency and compression performance. It can achieve higher compression performance while keeping the latency fairly low and controllable. Observing that mocap data exhibits some unique spatial characteristics, we learn an orthogonal transform to reduce the spatial redundancy. We formulate the learning problem as the least square of reconstruction error regularized by orthogonality and sparsity, and solve it via alternating iteration. We also adopt a predictive coding and temporal DCT for temporal decorrelation in the frame- and clip-oriented methods, respectively. Experimental results show that the proposed methods can produce higher compression performance at lower computational cost and latency than the state-of-the-art methods. Moreover, our methods are general and applicable to various types of mocap data.
KW - Data compression
KW - Low latency
KW - Motion capture
KW - Optimization
KW - Transform coding
UR - http://www.scopus.com/inward/record.url?scp=84962646233&partnerID=8YFLogxK
U2 - 10.1016/j.cagd.2016.02.002
DO - 10.1016/j.cagd.2016.02.002
M3 - Journal article
AN - SCOPUS:84962646233
SN - 0167-8396
VL - 43
SP - 211
EP - 225
JO - Computer Aided Geometric Design
JF - Computer Aided Geometric Design
ER -