Optimal and interactive keyframe selection for motion capture

Abstract

Motion capture is increasingly used in games and movies, but often requires editing before it can be used, for many reasons. The motion may need to be adjusted to correctly interact with virtual objects or to fix problems that result from mapping the motion to a character of a different size or, beyond such technical requirements, directors can request stylistic changes. Unfortunately, editing is laborious because of the lowlevel representation of the data. While existing motion editing methods accomplish modest changes, larger edits can require the artist to "re-animate" the motion by manually selecting a subset of the frames as keyframes. In this paper, we automatically find sets of frames to serve as keyframes for editing the motion. We formulate the problem of selecting an optimal set of keyframes as a shortest-path problem, and solve it efficiently using dynamic programming. We create a new simplified animation by interpolating the found keyframes using a naive curve fitting technique. Our algorithm can simplify motion capture to around 10% of the original number of frames while retaining most of its detail. By simplifying animation with our algorithm, we realize a new approach to motion editing and stylization founded on the timetested keyframe interface. We present results that show our algorithm outperforms both research algorithms and a leading commercial tool.

Development and Teaching Application of Interactive Virtual Algorithm Animation of C Language Program

“…First, the knowledge points are sorted in the descending order of their scores, and the question types under the knowledge points are also arranged in descending order of their scores. If there are no questions matching the control parameters in the question bank, the control parameters will be relaxed [ 15 ]. The average difficulty coefficient of the test paper is guaranteed by the difficulty coefficient of each knowledge point.…”

Basketball shooting technology based on acceleration sensor fusion motion capture technology

“…In image processing, the average neighborhood method is the most intuitive, simple, and easy to apply denoising method, and it is widely used in image noise processing [26]. The average filtering method replaces the gray value of pixels in the area with the average value of several pixels in the standard, eliminates the pixels that cannot represent the environmental pixel value, and makes the image smoother [27]. Assuming that the image to be processed is m(a, b), T represents the kernel, the total number of pixels in the kernel is represented by S, and the average filtered image is n(a, b), which can be expressed as:…”