2012
DOI: 10.1002/cav.1471
|View full text |Cite
|
Sign up to set email alerts
|

Optimized keyframe extraction for 3D character animations

Abstract: In this paper, we propose a new method to automatically extract keyframes from animation sequences. Our method can be applied equally to both skeletal and mesh animations. It uses animation saliency computed on the original data to help select the group of keyframes that can reconstruct the input animation with less perception error. For computational efficiency, we perform nonlinear dimension reduction using locally linear embedding and then carry out the optimal search in much lower‐dimensional space. With t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(15 citation statements)
references
References 31 publications
0
15
0
Order By: Relevance
“…Most 3D key-frame extraction methods cited in this paper were developed for specific content and 3D format and only four of them include comparisons with similar methods [18,22,41,51]. In [18], curve simplification, UnS and clustering methods were utilised as reference methods for performance evaluation and comparison of the proposed matrix factorisation methods.…”
Section: Discussionmentioning
confidence: 99%
See 4 more Smart Citations
“…Most 3D key-frame extraction methods cited in this paper were developed for specific content and 3D format and only four of them include comparisons with similar methods [18,22,41,51]. In [18], curve simplification, UnS and clustering methods were utilised as reference methods for performance evaluation and comparison of the proposed matrix factorisation methods.…”
Section: Discussionmentioning
confidence: 99%
“…In [18], curve simplification, UnS and clustering methods were utilised as reference methods for performance evaluation and comparison of the proposed matrix factorisation methods. The authors showed that the method based on matrix factorisation extracts more representative key-frames in comparison with the other three competing methods [22,41,51]. However, the algorithm is very slow with quadratic running time complexity.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations