CPC G06T 13/40 (2013.01) [G06T 7/70 (2017.01); G06T 2207/10016 (2013.01); G06T 2207/20084 (2013.01)] | 29 Claims |
1. A method for computer animation, comprising:
generating a plurality of candidate pose sequences of two or more candidate poses of a model of an animation character such that each of the two or more candidate poses has a segmentation map that matches a segmentation map of a corresponding character derived from a corresponding frame of a video sequence, wherein a distance between candidate poses is maximized;
determining an optimum pose sequence of the plurality of candidate pose sequences; and
using the optimum pose sequence to generate a corresponding sequence of frames of animation of the animation character.
|