IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v522y2026ics0096300326000482.html

Tucker decomposition with a temporal regularization for gap recovery in 3D motion capture data

Author

Listed:
  • Mohaoui, Souad
  • Dmytryshyn, Andrii

Abstract

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.

Suggested Citation

  • Mohaoui, Souad & Dmytryshyn, Andrii, 2026. "Tucker decomposition with a temporal regularization for gap recovery in 3D motion capture data," Applied Mathematics and Computation, Elsevier, vol. 522(C).
  • Handle: RePEc:eee:apmaco:v:522:y:2026:i:c:s0096300326000482
    DOI: 10.1016/j.amc.2026.129996
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300326000482
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2026.129996?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:522:y:2026:i:c:s0096300326000482. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.