Return to search

Efficient Dynamic Alignment of Motions

We consider the computation of optimal alignments between sub-sequences of given motion clips based on dynamic programming. To avoid redundant computations in multiple alignment queries, we introduced the concept of a guideboard matrix. Using this data structure, the existence inquiry for an alignment is answered in O(1) time and the extraction of the alignment is done in O(n+m) time where n and m denote the numbers of frames in the considered motions.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:20873
Date January 2018
CreatorsZhang, Liang, Brunnett, Guido
PublisherTechnische Universität Chemnitz
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typedoc-type:report, info:eu-repo/semantics/report, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess
Relationurn:nbn:de:bsz:ch1-qucosa-228139, qucosa:20770

Page generated in 0.0022 seconds