Motion normalization: the preprocess of motion data

In this paper, we present an online algorithm to normalize all motion data in database with a common skeleton length. Our algorithm is very simple and efficient. The input motion stream is processed sequentially while the computation for a single frame at each step requires only the results from the previous step over a neighborhood of nearby backward frames. In contrast to previous motion retargeting approaches, we simplify the constraint condition of retargeting problem, which leads to the simpler solutions. Moreover, we improve Shin et al.'s algorithm [10], which is adopted by a widely used Kovar's footskate cleanup algorithm [6] through adding one case missed by it.