Learned motion matching
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
In this paper we present a learned alternative to the Motion Matching algorithm which retains the positive properties of Motion Matching but additionally achieves the scalability of neural-network-based generative models. Although neural-network-based generative models for character animation are capable of learning expressive, compact controllers from vast amounts of animation data, methods such as Motion Matching still remain a popular choice in the games industry due to their flexibility, predictability, low preprocessing time, and visual quality - all properties which can sometimes be difficult to achieve with neural-network-based methods. Yet, unlike neural networks, the memory usage of such methods generally scales linearly with the amount of data used, resulting in a constant trade-off between the diversity of animation which can be produced and real world production budgets. In this work we combine the benefits of both approaches and, by breaking down the Motion Matching algorithm into its individual steps, show how learned, scalable alternatives can be used to replace each operation in turn. Our final model has no need to store animation data or additional matching meta-data in memory, meaning it scales as well as existing generative models. At the same time, we preserve the behavior of Motion Matching, retaining the quality, control, and quick iteration time which are so important in the industry.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Product Quantization for Nearest Neighbor Search
Jégou, H., Douze, M., & Schmid, C. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.57 · Cited by 2,956 · cited 1×
“In addition, Büttner [2019] presented a method using neural networks to accelerate the nearest neighbor search of Motion Matching by mapping the high dimensional feature vector into an optimized, smaller, quantized space [Jégou et al. 2011].”
Method
Cited by
Action-Conditioned 3D Human Motion Synthesis with Transformer VAE
Petrovich, M., Black, M. J., & Varol, G. (2021) · 2021 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.01080 · Cited by 493
ExpressGesture: Expressive gesture generation from speech through database matching
Ferstl, Y., Neff, M., & McDonnell, R. (2021) · Computer Animation and Virtual Worlds · doi:10.1002/cav.2016 · Cited by 52
“(7 ) Synthetic preparation and retraction phases are generated to link the gestures in the sequence combining motion matching with neural network controllers, including compression of motion data to a low-dimensional representation, memory usage was reduced significantly by Holden et al. 19 A number of other works hav…”
MethodHuman Motion Control of Quadrupedal Robots using Deep Reinforcement Learning
Kim, S., Sorokin, M., Lee, J., & Ha, S. (2022) · Robotics: Science and Systems XVIII · doi:10.15607/rss.2022.xviii.021 · Cited by 9
Motion2Motion: Cross-topology Motion Transfer with Sparse Correspondence
Chen, L.-H., Zhang, Y., Yin, Z., Dou, Z., Chen, X., Wang, J., Komura, T., & Zhang, L. (2025) · Proceedings of the SIGGRAPH Asia 2025 Conference Papers · doi:10.1145/3757377.3763811 · Cited by 3
“In addition to neural synthesis methods, techniques based on generative motion matching have also shown strong performance on synthesizing high-quality motions [Bergamin et al. 2019; Büttner and Clavet 2015; Holden et al. 2020; Li et al. 2023a].”
Metadata
- Authors
- Holden, D., Kanoun, O., Perepichka, M., & Popa, T.
- Venue
- ACM Transactions on Graphics
- Published
- 2020-08-12
- Volume
- 39
- Issue
- 4
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W3048665613
- Cited by
- 143
- References
- 1
- FWCI
- 10.18
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.