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.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:20873 |
| Date | January 2018 |
| Creators | Zhang, Liang, Brunnett, Guido |
| Publisher | Technische Universität Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:report, info:eu-repo/semantics/report, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | urn:nbn:de:bsz:ch1-qucosa-228139, qucosa:20770 |
Page generated in 0.0022 seconds