Tomohiko Mukai
ABSTRACT
This paper presents a new method to approximate animation sequences through a nonlinear analysis of the spatiotemporal data. The main idea is to find a spline curve which best approximates a multivariate animation sequence in a reduced subspace. Our method first eliminates data redundancy among multiple animation channels using principal component analysis (PCA). The reduced sequence of latent variables is then approximated by a nonuniform spline with free knots. To solve the highly-nonlinear multimodal problem of the knot optimization, we introduce a stochastic algorithm called covariance matrix adaptation evolution strategy (CMA-ES). Our method optimizes the control points and the free knots using least-square method and CMA-ES, which guarantees the best approximation for arbitrary animation sequences such as mesh animations and motion capture data. Moreover, our method is applicable to practical production pipeline because both PCA-and CMA-based algorithms are computationally stable, efficient, and quasi manual parameter-free. We demonstrate the capability of the proposed method through comparative experiments with a common approximation technique.
Supplemental Material
- Akhter, I., Simon, T., Khan, S., Matthews, I., and Sheikh, Y. 2012. Bilinear spatiotemporal basis models. ACM Transactions on Graphics 32, 2, 17. Google Scholar
Digital Library
- Alexa, M., and Müller, W. 2000. Representing animations by principal components. Computer Grahics Forum 19, 3, 411--418.Google ScholarCross Ref
- Arikan, O. 2006. Compression of motion capture databases. ACM Transactions on Graphics 25, 3, 890--897. Google ScholarDigital Library
- Cashman, T., and Hormann, K. 2012. A continuous, editable representation for deforming mesh sequences with separate signals for time, pose and shape. Compuer Graphics Forum 31, 2, 735--744. Google ScholarDigital Library
- Gálvez, A., and Iglesias, A. 2011. Efficient particle swarm optimization approach for data fitting with free knot b-splines. Computer-Aided Design 43, 12, 1683--1692. Google ScholarDigital Library
- Gleicher, M. 1998. Retargetting motion to new characters. In Proc. of SIGGRAPH 98, 33--42. Google ScholarDigital Library
- Hansen, N., and Kern, S. 2004. Evaluating the CMA evolution strategy on multimodal test functions. In Proc. of Eighth International Conference on Parallel Problem Solving from Nature, 282--291.Google Scholar
- Hansen, N. 2006. The CMA evolution strategy: A comparing review. In Towards a New Evolutionary Computation. Advances in Estimation of Distribution Algorithms, J. Lozano, P. Larranaga, I. Inza, and E. Bengoetxea, Eds. Springer, 75--102.Google Scholar
- Karni, Z., and Gotsman, C. 2004. Compression of soft-body animation sequences. Computers & Graphics 28, 1, 25--34.Google ScholarCross Ref
- Liu, G., and McMillan, L. 2006. Segment-based human motion compression. In Proc. of ACM SIGGRAPH/Eurographics Symposium on Computer Animation 2006, 127--135. Google ScholarDigital Library
- Tournier, M., Wu, X., Courty, N., Arnaud, E., and Reveret, L. 2009. Motion compression using principal geodesics analysis. Computer Graphics Forum 28, 2, 337--346.Google ScholarCross Ref
- Ülker, E., and Arslan, A. 2009. Automatic knot adjustment using an artificial immune system for b-spline curve approximation. Information Sciences 179, 10, 1483--1494. Google ScholarDigital Library
- Yoshimoto, F., Harada, T., and Yoshimoto, Y. 2003. Data fitting with a spline using a real-coded genetic algorithm. Computer-Aided Design 35, 8, 751--760.Google ScholarCross Ref
Index Terms
- Latent nonuniform splines for animation approximation
Recommendations
Convexity-preserving approximation by univariate cubic splines
A convexity-preserving approximation method is presented. Similar to the cubic spline interpolation, the given approximation function is univariate cubic spline with C 2 continuity. A very simple computing method is described. The approximation order ...
On k-Monotone Approximation by Free Knot Splines
Let $\mathcal{S}_{N,r}$ be the (nonlinear) space of free knot splines of degree r-1 with at most N pieces in [a,b], and let $\mathcal{M}^k$ be the class of all k-monotone functions on (a,b), i.e., those functions f for which the kth divided difference [x0 ,...
Quartic Beta-splines
Quartic Beta-splines have third-degree arc-length or geometric continuity at simple knots and are determined by three β or shape parameters. We present a general explicit formula for quartic Beta-splines, and determine and illustrate the effects of ...
Comments