Low-rank completion for motion capture data recovery: Approaches, constraints, and algorithms

Motion capture (MoCap) systems are indispensable tools across fields such as biomechanics, computer animation, human-robot interaction, and clinical gait analysis, owing to their ability to accurately record and analyze human movement in 3D space. Marker-based systems use reflective markers attached to subjects and video recordings to track human movement. The tracking requires markers to be detected in the video, which is not always possible due to occlusions, sensor failures, and limited camera coverage. These issues create gaps in recorded trajectories, compromising data integrity and making the motion difficult to utilize in practical applications. Therefore, a wide range of MoCap data completion techniques has been proposed to reconstruct missing trajectories while preserving the realism and dynamics of human movement. Human motion data exhibits a low-rank property due to the inherent repetitive nature of human movement as well as the correlations between joints and markers, enforced by the skeletal structure and biomechanical constraints. Low-rank completion techniques exploit this property to reconstruct missing marker positions. This paper reviews state-of-the-art low-rank completion methods for MoCap data completion, focusing specifically on optimization-based low-rank methods. These optimization approaches directly address the missing data completion problem through optimization formulations. We examine two main aspects: kinematic priors, which embed anatomical constraints, joint dependencies, and motion smoothness, and low-rank priors, which exploit inter-marker correlations through matrix and tensor formulations. We further evaluate optimization algorithms for solving these completion problems, such as alternating minimization, proximal algorithms, ADMM, and hybrid schemes, as well as the datasets and tools commonly used in the literature.

Authors

Institutions

Publication Details

Journal
Computer Science Review
Published
2026-01-07
DOI
https://doi.org/10.1016/j.cosrev.2025.100878
Citations
1
Primary Topic
Gait Recognition and Analysis
Type
article
Field-Weighted Citation Impact
21.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Low-rank completion for motion capture data recovery: Approaches, constraints, and algorithms

Souad Mohaoui, Andrii Dmytryshyn
1 citations
Computer Science Review
Gait Recognition and Analysis
21.28
article

Low-rank completion for motion capture data recovery: Approaches, constraints, and algorithms

Souad Mohaoui, Andrii Dmytryshyn
article en
1 citations

Abstract

Motion capture (MoCap) systems are indispensable tools across fields such as biomechanics, computer animation, human-robot interaction, and clinical gait analysis, owing to their ability to accurately record and analyze human movement in 3D space. Marker-based systems use reflective markers attached to subjects and video recordings to track human movement. The tracking requires markers to be detected in the video, which is not always possible due to occlusions, sensor failures, and limited camera coverage. These issues create gaps in recorded trajectories, compromising data integrity and making the motion difficult to utilize in practical applications. Therefore, a wide range of MoCap data completion techniques has been proposed to reconstruct missing trajectories while preserving the realism and dynamics of human movement. Human motion data exhibits a low-rank property due to the inherent repetitive nature of human movement as well as the correlations between joints and markers, enforced by the skeletal structure and biomechanical constraints. Low-rank completion techniques exploit this property to reconstruct missing marker positions. This paper reviews state-of-the-art low-rank completion methods for MoCap data completion, focusing specifically on optimization-based low-rank methods. These optimization approaches directly address the missing data completion problem through optimization formulations. We examine two main aspects: kinematic priors, which embed anatomical constraints, joint dependencies, and motion smoothness, and low-rank priors, which exploit inter-marker correlations through matrix and tensor formulations. We further evaluate optimization algorithms for solving these completion problems, such as alternating minimization, proximal algorithms, ADMM, and hybrid schemes, as well as the datasets and tools commonly used in the literature.

Computer Science ReviewVol. 60
Örebro University (SE), Chalmers University of Technology (SE), University of Gothenburg (SE)
Openalex Percentile: Top 3%
Gait Recognition and Analysis
21.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.