To Örebro University

oru.seÖrebro University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
CP decomposition-based algorithms for completion problem of motion capture data
Örebro University, School of Science and Technology. Mathematics Department.ORCID iD: 0009-0001-2751-7881
Örebro University, School of Science and Technology. Mathematics Department, School of Science and Technology, Örebro University, Örebro, Sweden; Department of Mathematical Sciences, Chalmers University of Technology, Gothenburg, Sweden; University of Gothenburg, Gothenburg, Sweden.ORCID iD: 0000-0001-9110-6182
2024 (English)In: Pattern Analysis and Applications, ISSN 1433-7541, E-ISSN 1433-755X, Vol. 27, no 4, article id 133Article in journal (Refereed) Published
Abstract [en]

Motion capture (MoCap) technology is an essential tool for recording and analyzing movements of objects or humans. However, MoCap systems frequently encounter the challenge of missing data, stemming from mismatched markers, occlusion, or equipment limitations. Recovery of these missing data is imperative to maintain the reliability and integrity of MoCap recordings. This paper introduces a novel application of the tensor framework for MoCap data completion. We propose three completion algorithms based on the canonical polyadic (CP) decomposition of tensors. The first algorithm utilizes CP decomposition to capture the low-rank structure of the tensor. However, relying only on low-rank assumptions may be insufficient to deal with complex motion data. Thus, we propose two modified CP decompositions that incorporate additional information, SmoothCP and SparseCP decompositions. SmoothCP integrates piecewise smoothness prior, while SparseCP incorporates sparsity prior, each aiming to improve the accuracy and robustness of MoCap data recovery. To compare and evaluate the merit of the proposed algorithms over other tensor completion methods in terms of several evaluation metrics, we conduct numerical experiments with different MoCap sequences from the CMU motion capture dataset.

Place, publisher, year, edition, pages
Springer, 2024. Vol. 27, no 4, article id 133
Keywords [en]
MoCap data, Missing markers, Gap-filling, Candecomp/parafac (CP) decomposition, Tensor recovery, Smooth CP, Sparse CP
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-116744DOI: 10.1007/s10044-024-01342-4ISI: 001326038500001Scopus ID: 2-s2.0-85206102803OAI: oai:DiVA.org:oru-116744DiVA, id: diva2:1906134
Funder
Örebro UniversityCarl Tryggers foundation , CTS 22:2196Swedish Research Council, 2021-05393Available from: 2024-10-16 Created: 2024-10-16 Last updated: 2025-01-20Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Mohaoui, SouadDmytryshyn, Andrii

Search in DiVA

By author/editor
Mohaoui, SouadDmytryshyn, Andrii
By organisation
School of Science and Technology
In the same journal
Pattern Analysis and Applications
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 45 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf