Tucker decomposition with a temporal regularization for gap recovery in 3D motion capture data
Journal article, 2026

The gap-filling problem in motion capture (MoCap) data poses a significant challenge in marker-based MoCap systems. These gaps occur due to missing markers during motion recording. MoCap sequence, a time series data characterized by high dimensionality and temporal dependencies, requires accurate recovery of missing markers to ensure smooth motion representation. Tensor decomposition is an effective solution that leverages the multi-way structure of MoCap data. This paper proposes two gap-filling algorithms based on Tucker decomposition, namely Tucker and TuckerTNN. Given the high-dimensional nature of MoCap data, traditional smoothness regularization methods, such as gradient-based techniques, are computationally expensive. Therefore, we introduce the temporal nuclear norm in TuckerTNN as an alternative regularization technique, providing a more efficient solution for large-scale datasets. Both models are minimized using the proximal block coordinate descent (Prox-BCD) method. We evaluated the proposed algorithms using motion capture sequences from the publicly available HDM05 dataset. Our results show that Tucker and TuckerTNN consistently outperform existing approaches, such as CP and SparseCP, in accuracy and efficiency, with TuckerTNN offering the best trade-off between the two.

Missing markers

Gap-filling

Proximal BCD algorithm

Tensor recovery

MoCap systems

Tucker decomposition

Author

Souad Mohaoui

Örebro University

Andrii Dmytryshyn

Örebro University

Chalmers, Mathematical Sciences, Applied Mathematics and Statistics

Applied Mathematics and Computation

0096-3003 (ISSN) 1873-5649 (eISSN)

Vol. 522 129996

Subject Categories (SSIF 2025)

Computer Sciences

DOI

10.1016/j.amc.2026.129996

More information

Latest update

2/23/2026