1 |
Efficient Dynamic Alignment of MotionsZhang, Liang, Brunnett, Guido 21 February 2018 (has links) (PDF)
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.
|
2 |
Efficient Dynamic Alignment of MotionsZhang, Liang, Brunnett, Guido January 2018 (has links)
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.
|
Page generated in 0.111 seconds